%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC122+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:02:33 PM UTC 2026
% Result : Theorem 3.96s 1.71s
% Output : Refutation 5.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of formulae : 92 ( 19 unt; 7 def)
% Number of atoms : 331 ( 46 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 401 ( 162 ~; 156 |; 57 &)
% ( 11 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn 65 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ( nil != X2
& nil = X3 )
| ( neq(X0,nil)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ( nil != X2
& nil = X3 )
| ( neq(X0,nil)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ( nil = X2
| nil != X3 )
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ( nil = X2
| nil != X3 )
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f243,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f244,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X3,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f243]) ).
fof(f245,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ( ssList(sK12(X0,X1))
& app(sK12(X0,X1),X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X3,sK12(X0,X1))],[f244]) ).
fof(f246,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f247,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f246]) ).
fof(f248,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK13(X0,X1))
& ssList(sK14(X0,X1))
& app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14]),skolemize(X4,sK13(X0,X1)),skolemize(X5,sK14(X0,X1))],[f247]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& neq(sK54,nil)
& ( nil = sK55
| nil != sK56 )
& ( ~ neq(sK53,nil)
| ~ segmentP(sK54,sK53) )
& ( ~ neq(sK56,nil)
| ( neq(sK55,nil)
& rearsegP(sK56,sK55) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f312,plain,
! [X0,X1] :
( ~ rearsegP(X0,X1)
| app(sK12(X0,X1),X1) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f313,plain,
! [X0,X1] :
( ssList(sK12(X0,X1))
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f318,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f401,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f482,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ~ neq(sK56,nil)
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( ~ neq(sK56,nil)
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( ~ neq(sK53,nil)
| ~ segmentP(sK54,sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f512,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f318]) ).
fof(f542,definition,
( spl57_1
<=> rearsegP(sK56,sK55) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f544,plain,
( rearsegP(sK56,sK55)
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f542]) ).
fof(f546,definition,
( spl57_2
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f549,plain,
( spl57_1
| ~ spl57_2 ),
inference(avatar_split_clause,[],[f500,f546,f542]) ).
fof(f551,definition,
( spl57_3
<=> neq(sK55,nil) ),
introduced(definition,[new_symbols(definition,[spl57_3])],[avatar_definition]) ).
fof(f553,plain,
( neq(sK55,nil)
| ~ spl57_3 ),
inference(avatar_component_clause,[],[f551]) ).
fof(f554,plain,
( spl57_3
| ~ spl57_2 ),
inference(avatar_split_clause,[],[f501,f546,f551]) ).
fof(f556,definition,
( spl57_4
<=> segmentP(sK54,sK53) ),
introduced(definition,[new_symbols(definition,[spl57_4])],[avatar_definition]) ).
fof(f558,plain,
( ~ segmentP(sK54,sK53)
| spl57_4 ),
inference(avatar_component_clause,[],[f556]) ).
fof(f560,definition,
( spl57_5
<=> neq(sK53,nil) ),
introduced(definition,[new_symbols(definition,[spl57_5])],[avatar_definition]) ).
fof(f562,plain,
( ~ neq(sK53,nil)
| spl57_5 ),
inference(avatar_component_clause,[],[f560]) ).
fof(f563,plain,
( ~ spl57_4
| ~ spl57_5 ),
inference(avatar_split_clause,[],[f502,f560,f556]) ).
fof(f574,definition,
( spl57_8
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl57_8])],[avatar_definition]) ).
fof(f575,plain,
( ssList(nil)
| ~ spl57_8 ),
inference(avatar_component_clause,[],[f574]) ).
fof(f607,plain,
spl57_8,
inference(avatar_split_clause,[],[f389,f574]) ).
fof(f609,plain,
neq(sK56,nil),
inference(superposition,[],[f504,f506]) ).
fof(f611,plain,
spl57_2,
inference(avatar_split_clause,[],[f609,f546]) ).
fof(f612,plain,
( ~ neq(sK55,nil)
| spl57_5 ),
inference(forward_demodulation,[],[f562,f505]) ).
fof(f613,plain,
( $false
| ~ spl57_3
| spl57_5 ),
inference(forward_subsumption_resolution,[],[f612,f553]) ).
fof(f614,plain,
( ~ spl57_3
| spl57_5 ),
inference(avatar_contradiction_clause,[],[f613]) ).
fof(f615,plain,
( ~ segmentP(sK54,sK55)
| spl57_4 ),
inference(forward_demodulation,[],[f558,f505]) ).
fof(f617,plain,
( ~ segmentP(sK56,sK55)
| spl57_4 ),
inference(forward_demodulation,[],[f615,f506]) ).
fof(f863,plain,
( sK56 = app(sK12(sK56,sK55),sK55)
| ~ ssList(sK55)
| ~ ssList(sK56)
| ~ spl57_1 ),
inference(resolution,[],[f312,f544]) ).
fof(f868,plain,
( sK56 = app(sK12(sK56,sK55),sK55)
| ~ ssList(sK56)
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f863,f498]) ).
fof(f872,plain,
( sK56 = app(sK12(sK56,sK55),sK55)
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f868,f499]) ).
fof(f880,definition,
( spl57_20
<=> ssList(sK12(sK56,sK55)) ),
introduced(definition,[new_symbols(definition,[spl57_20])],[avatar_definition]) ).
fof(f881,plain,
( ssList(sK12(sK56,sK55))
| ~ spl57_20 ),
inference(avatar_component_clause,[],[f880]) ).
fof(f882,plain,
( ~ ssList(sK12(sK56,sK55))
| spl57_20 ),
inference(avatar_component_clause,[],[f880]) ).
fof(f897,plain,
( ~ rearsegP(sK56,sK55)
| ~ ssList(sK55)
| ~ ssList(sK56)
| spl57_20 ),
inference(resolution,[],[f882,f313]) ).
fof(f898,plain,
( ~ ssList(sK55)
| ~ ssList(sK56)
| ~ spl57_1
| spl57_20 ),
inference(forward_subsumption_resolution,[],[f897,f544]) ).
fof(f899,plain,
( ~ ssList(sK56)
| ~ spl57_1
| spl57_20 ),
inference(forward_subsumption_resolution,[],[f898,f498]) ).
fof(f900,plain,
( $false
| ~ spl57_1
| spl57_20 ),
inference(forward_subsumption_resolution,[],[f899,f499]) ).
fof(f901,plain,
( ~ spl57_1
| spl57_20 ),
inference(avatar_contradiction_clause,[],[f900]) ).
fof(f1737,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X1)
| segmentP(app(X0,X1),X1)
| ~ ssList(app(X0,X1)) ),
inference(superposition,[],[f512,f482]) ).
fof(f1738,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X1)
| segmentP(app(X0,X1),X1) ),
inference(duplicate_literal_removal,[],[f1737]) ).
fof(f1747,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X1)
| segmentP(app(X0,X1),X1) ),
inference(forward_subsumption_resolution,[],[f1738,f401]) ).
fof(f1754,plain,
( ! [X0,X1] :
( segmentP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl57_8 ),
inference(forward_subsumption_resolution,[],[f1747,f575]) ).
fof(f2283,plain,
( segmentP(sK56,sK55)
| ~ ssList(sK55)
| ~ ssList(sK12(sK56,sK55))
| ~ spl57_1
| ~ spl57_8 ),
inference(superposition,[],[f1754,f872]) ).
fof(f2298,plain,
( ~ ssList(sK55)
| ~ ssList(sK12(sK56,sK55))
| ~ spl57_1
| spl57_4
| ~ spl57_8 ),
inference(forward_subsumption_resolution,[],[f2283,f617]) ).
fof(f2307,plain,
( ~ ssList(sK12(sK56,sK55))
| ~ spl57_1
| spl57_4
| ~ spl57_8 ),
inference(forward_subsumption_resolution,[],[f2298,f498]) ).
fof(f2314,plain,
( $false
| ~ spl57_1
| spl57_4
| ~ spl57_8
| ~ spl57_20 ),
inference(forward_subsumption_resolution,[],[f2307,f881]) ).
fof(f2315,plain,
( ~ spl57_1
| spl57_4
| ~ spl57_8
| ~ spl57_20 ),
inference(avatar_contradiction_clause,[],[f2314]) ).
cnf(s1,plain,
( spl57_1
| ~ spl57_2 ),
inference(sat_conversion,[],[f549]) ).
cnf(s2,plain,
( ~ spl57_2
| spl57_3 ),
inference(sat_conversion,[],[f554]) ).
cnf(s3,plain,
( ~ spl57_4
| ~ spl57_5 ),
inference(sat_conversion,[],[f563]) ).
cnf(s13,plain,
spl57_8,
inference(sat_conversion,[],[f607]) ).
cnf(s14,plain,
spl57_2,
inference(sat_conversion,[],[f611]) ).
cnf(s15,plain,
( ~ spl57_3
| spl57_5 ),
inference(sat_conversion,[],[f614]) ).
cnf(s22,plain,
( ~ spl57_1
| spl57_20 ),
inference(sat_conversion,[],[f901]) ).
cnf(s71,plain,
( ~ spl57_1
| spl57_4
| ~ spl57_8
| ~ spl57_20 ),
inference(sat_conversion,[],[f2315]) ).
cnf(s76,plain,
spl57_3,
inference(rat,[],[s2,s14]) ).
cnf(s77,plain,
spl57_5,
inference(rat,[],[s15,s76]) ).
cnf(s78,plain,
~ spl57_4,
inference(rat,[],[s3,s77]) ).
cnf(s80,plain,
spl57_1,
inference(rat,[],[s1,s14]) ).
cnf(s81,plain,
~ spl57_20,
inference(rat,[],[s71,s78,s13,s80]) ).
cnf(s83,plain,
$false,
inference(rat,[],[s22,s81,s80]) ).
fof(f2316,plain,
$false,
inference(avatar_sat_refutation,[],[s83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC122+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n009.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 28 07:59:45 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.96/1.71 % (2874745)Detected formulas, will run a generic FOF schedule.
% 3.96/1.71 % (2874750)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2437656383:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.96/1.71 % (2874752)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3576659223:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.96/1.71 % (2874751)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2705954252:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.96/1.71 % (2874753)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4058101271:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.96/1.71 % (2874754)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3607530311:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.96/1.71 % (2874755)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=611185091:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.96/1.71 % (2874756)dis-21_1_sil=8000:lcm=predicate:random_seed=1780003614:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.96/1.71 % (2874755)First to succeed.
% 3.96/1.71 % (2874755)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2874745"
% 3.96/1.71 % (2874754)Instruction limit reached!
% 3.96/1.71 % (2874754)------------------------------
% 3.96/1.71 % (2874754)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.96/1.71 % (2874754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.96/1.71 % (2874754)CaDiCaL version: 2.1.3
% 3.96/1.71 % (2874754)Termination reason: Instruction limit
% 3.96/1.71 % (2874754)Termination phase: Saturation
% 3.96/1.71 % (2874754)Time elapsed: 0.093 s
% 3.96/1.71 % (2874754)Peak memory usage: 88 MB
% 3.96/1.71 % (2874754)Instructions burned: 119 (million)
% 3.96/1.71 % (2874753)Instruction limit reached!
% 3.96/1.71 % (2874753)------------------------------
% 3.96/1.71 % (2874753)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.96/1.71 % (2874753)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.96/1.71 % (2874753)CaDiCaL version: 2.1.3
% 3.96/1.71 % (2874753)Termination reason: Instruction limit
% 3.96/1.71 % (2874753)Termination phase: Saturation
% 3.96/1.71 % (2874753)Time elapsed: 0.105 s
% 3.96/1.71 % (2874753)Peak memory usage: 89 MB
% 3.96/1.71 % (2874753)Instructions burned: 109 (million)
% 3.96/1.71 % (2874756)Instruction limit reached!
% 3.96/1.71 % (2874756)------------------------------
% 3.96/1.71 % (2874756)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.96/1.71 % (2874756)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.96/1.71 % (2874756)CaDiCaL version: 2.1.3
% 3.96/1.71 % (2874756)Termination reason: Instruction limit
% 3.96/1.71 % (2874756)Termination phase: Saturation
% 3.96/1.71 % (2874756)Time elapsed: 0.121 s
% 3.96/1.71 % (2874756)Peak memory usage: 90 MB
% 3.96/1.71 % (2874756)Instructions burned: 129 (million)
% 3.96/1.71 % (2874764)lrs+10_1_sil=8000:sp=occurrence:random_seed=414486998:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 3.96/1.71 % (2874765)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2410503975:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 3.96/1.71 % (2874766)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3712376541:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 3.96/1.71 % (2874755)Refutation found. Thanks to Tanya!
% 3.96/1.71 % SZS status Theorem for theBenchmark
% 3.96/1.71 % SZS output start Proof for theBenchmark
% See solution above
% 5.96/1.93 % (2874755)------------------------------
% 5.96/1.93 % (2874755)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.96/1.93 % (2874755)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.96/1.93 % (2874755)CaDiCaL version: 2.1.3
% 5.96/1.93 % (2874755)Termination reason: Refutation
% 5.96/1.93 % (2874755)Time elapsed: 0.074 s
% 5.96/1.93 % (2874755)Peak memory usage: 91 MB
% 5.96/1.93 % (2874755)Instructions burned: 73 (million)
% 5.96/1.93 % (2874755)------------------------------
% 5.96/1.93 % (2874755)------------------------------
% 5.96/1.93 % (2874745)Success in time 0.733 s
% 5.96/1.93 % Vampire exiting
%------------------------------------------------------------------------------