%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC124+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 : n026.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 2.28s 1.17s
% Output : Refutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 12
% Syntax : Number of formulae : 85 ( 18 unt; 6 def)
% Number of atoms : 331 ( 67 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 401 ( 155 ~; 153 |; 66 &)
% ( 10 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 7 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 70 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
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(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
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(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ totalorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& leq(X7,X5) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( neq(X0,nil)
& segmentP(X1,X0) ) ) ) ) ) ),
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)
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ totalorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& leq(X7,X5) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( neq(X0,nil)
& segmentP(X1,X0) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
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(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ? [X4] :
( app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5) ) ) ) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) )
& 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)
& ? [X4] :
( app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5) ) ) ) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
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(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& neq(sK54,nil)
& sK56 = app(sK55,sK57)
& totalorderedP(sK55)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK57
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK55
| ~ leq(X7,X5) ) ) ) )
& ssList(sK57)
& ( nil = sK56
| nil != sK55 )
& ( ~ neq(sK53,nil)
| ~ segmentP(sK54,sK53) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57)],[f222]) ).
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(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
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(f403,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ~ neq(sK53,nil)
| ~ segmentP(sK54,sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( nil = sK56
| nil != sK55 ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
ssList(sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK56 = app(sK55,sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f514,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(f544,definition,
( spl58_1
<=> segmentP(sK54,sK53) ),
introduced(definition,[new_symbols(definition,[spl58_1])],[avatar_definition]) ).
fof(f546,plain,
( ~ segmentP(sK54,sK53)
| spl58_1 ),
inference(avatar_component_clause,[],[f544]) ).
fof(f548,definition,
( spl58_2
<=> neq(sK53,nil) ),
introduced(definition,[new_symbols(definition,[spl58_2])],[avatar_definition]) ).
fof(f550,plain,
( ~ neq(sK53,nil)
| spl58_2 ),
inference(avatar_component_clause,[],[f548]) ).
fof(f551,plain,
( ~ spl58_1
| ~ spl58_2 ),
inference(avatar_split_clause,[],[f500,f548,f544]) ).
fof(f553,definition,
( spl58_3
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl58_3])],[avatar_definition]) ).
fof(f554,plain,
( nil = sK55
| ~ spl58_3 ),
inference(avatar_component_clause,[],[f553]) ).
fof(f555,plain,
( nil != sK55
| spl58_3 ),
inference(avatar_component_clause,[],[f553]) ).
fof(f557,definition,
( spl58_4
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl58_4])],[avatar_definition]) ).
fof(f559,plain,
( nil = sK56
| ~ spl58_4 ),
inference(avatar_component_clause,[],[f557]) ).
fof(f560,plain,
( ~ spl58_3
| spl58_4 ),
inference(avatar_split_clause,[],[f501,f557,f553]) ).
fof(f562,definition,
( spl58_5
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl58_5])],[avatar_definition]) ).
fof(f563,plain,
( ssList(nil)
| ~ spl58_5 ),
inference(avatar_component_clause,[],[f562]) ).
fof(f595,plain,
spl58_5,
inference(avatar_split_clause,[],[f389,f562]) ).
fof(f598,plain,
( ~ segmentP(sK54,sK55)
| spl58_1 ),
inference(forward_demodulation,[],[f546,f507]) ).
fof(f599,plain,
sK54 = app(sK55,sK57),
inference(forward_demodulation,[],[f505,f508]) ).
fof(f1082,definition,
( spl58_25
<=> nil = sK54 ),
introduced(definition,[new_symbols(definition,[spl58_25])],[avatar_definition]) ).
fof(f1083,plain,
( nil = sK54
| ~ spl58_25 ),
inference(avatar_component_clause,[],[f1082]) ).
fof(f1116,plain,
( nil = sK54
| ~ spl58_4 ),
inference(superposition,[],[f508,f559]) ).
fof(f1118,plain,
( spl58_25
| ~ spl58_4 ),
inference(avatar_split_clause,[],[f1116,f557,f1082]) ).
fof(f1128,plain,
( ~ neq(sK55,nil)
| spl58_2 ),
inference(forward_demodulation,[],[f550,f507]) ).
fof(f1130,plain,
( ~ neq(nil,nil)
| spl58_2
| ~ spl58_3 ),
inference(forward_demodulation,[],[f1128,f554]) ).
fof(f1177,plain,
( neq(nil,nil)
| ~ spl58_25 ),
inference(superposition,[],[f506,f1083]) ).
fof(f1198,plain,
( $false
| spl58_2
| ~ spl58_3
| ~ spl58_25 ),
inference(forward_subsumption_resolution,[],[f1177,f1130]) ).
fof(f1199,plain,
( spl58_2
| ~ spl58_3
| ~ spl58_25 ),
inference(avatar_contradiction_clause,[],[f1198]) ).
fof(f1218,plain,
( nil = sK55
| ~ ssList(nil)
| ~ ssList(sK55)
| spl58_2 ),
inference(resolution,[],[f1128,f387]) ).
fof(f1221,plain,
( ~ ssList(nil)
| ~ ssList(sK55)
| spl58_2
| spl58_3 ),
inference(forward_subsumption_resolution,[],[f1218,f555]) ).
fof(f1231,plain,
( ~ ssList(sK55)
| spl58_2
| spl58_3
| ~ spl58_5 ),
inference(forward_subsumption_resolution,[],[f1221,f563]) ).
fof(f1232,plain,
( $false
| spl58_2
| spl58_3
| ~ spl58_5 ),
inference(forward_subsumption_resolution,[],[f1231,f498]) ).
fof(f1233,plain,
( spl58_2
| spl58_3
| ~ spl58_5 ),
inference(avatar_contradiction_clause,[],[f1232]) ).
fof(f1873,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f514,f403]) ).
fof(f1881,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f1873]) ).
fof(f1892,plain,
! [X0,X1] :
( ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(forward_subsumption_resolution,[],[f1881,f401]) ).
fof(f1900,plain,
( ! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl58_5 ),
inference(forward_subsumption_resolution,[],[f1892,f563]) ).
fof(f2774,plain,
( segmentP(sK54,sK55)
| ~ ssList(sK55)
| ~ ssList(sK57)
| ~ spl58_5 ),
inference(superposition,[],[f1900,f599]) ).
fof(f2790,plain,
( ~ ssList(sK55)
| ~ ssList(sK57)
| spl58_1
| ~ spl58_5 ),
inference(forward_subsumption_resolution,[],[f2774,f598]) ).
fof(f2802,plain,
( ~ ssList(sK57)
| spl58_1
| ~ spl58_5 ),
inference(forward_subsumption_resolution,[],[f2790,f498]) ).
fof(f2813,plain,
( $false
| spl58_1
| ~ spl58_5 ),
inference(forward_subsumption_resolution,[],[f2802,f502]) ).
fof(f2814,plain,
( spl58_1
| ~ spl58_5 ),
inference(avatar_contradiction_clause,[],[f2813]) ).
cnf(s1,plain,
( ~ spl58_1
| ~ spl58_2 ),
inference(sat_conversion,[],[f551]) ).
cnf(s2,plain,
( ~ spl58_3
| spl58_4 ),
inference(sat_conversion,[],[f560]) ).
cnf(s11,plain,
spl58_5,
inference(sat_conversion,[],[f595]) ).
cnf(s29,plain,
( ~ spl58_4
| spl58_25 ),
inference(sat_conversion,[],[f1118]) ).
cnf(s35,plain,
( spl58_2
| ~ spl58_3
| ~ spl58_25 ),
inference(sat_conversion,[],[f1199]) ).
cnf(s42,plain,
( spl58_2
| spl58_3
| ~ spl58_5 ),
inference(sat_conversion,[],[f1233]) ).
cnf(s112,plain,
( spl58_1
| ~ spl58_5 ),
inference(sat_conversion,[],[f2814]) ).
cnf(s119,plain,
spl58_1,
inference(rat,[],[s112,s11]) ).
cnf(s125,plain,
~ spl58_2,
inference(rat,[],[s1,s119]) ).
cnf(s126,plain,
spl58_3,
inference(rat,[],[s42,s11,s125]) ).
cnf(s127,plain,
~ spl58_25,
inference(rat,[],[s35,s125,s126]) ).
cnf(s129,plain,
spl58_4,
inference(rat,[],[s2,s126]) ).
cnf(s130,plain,
$false,
inference(rat,[],[s29,s127,s129]) ).
fof(f2816,plain,
$false,
inference(avatar_sat_refutation,[],[s130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC124+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n026.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 08:05:26 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 2.28/1.17 % (3684981)Detected formulas, will run a generic FOF schedule.
% 2.28/1.17 % (3684991)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3971071161:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.28/1.17 % (3684988)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=2551004547:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.28/1.17 % (3684989)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4171733073:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.28/1.17 % (3684990)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3514482988:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.28/1.17 % (3684987)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=848260881:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.28/1.17 % (3684986)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=2364343265:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.28/1.17 % (3684992)dis-21_1_sil=8000:lcm=predicate:random_seed=2175984625: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)
% 2.28/1.17 % (3684991)First to succeed.
% 2.28/1.17 % (3684991)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3684981"
% 2.28/1.17 % (3684990)Also succeeded, but the first one will report.
% 2.28/1.17 % (3684989)Instruction limit reached!
% 2.28/1.17 % (3684989)------------------------------
% 2.28/1.17 % (3684989)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.28/1.17 % (3684989)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.28/1.17 % (3684989)CaDiCaL version: 2.1.3
% 2.28/1.17 % (3684989)Termination reason: Instruction limit
% 2.28/1.17 % (3684989)Termination phase: Saturation
% 2.28/1.17 % (3684989)Time elapsed: 0.068 s
% 2.28/1.17 % (3684989)Peak memory usage: 89 MB
% 2.28/1.17 % (3684989)Instructions burned: 110 (million)
% 2.28/1.17 % (3684992)Instruction limit reached!
% 2.28/1.17 % (3684992)------------------------------
% 2.28/1.17 % (3684992)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.28/1.17 % (3684992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.28/1.17 % (3684992)CaDiCaL version: 2.1.3
% 2.28/1.17 % (3684992)Termination reason: Instruction limit
% 2.28/1.17 % (3684992)Termination phase: Saturation
% 2.28/1.17 % (3684992)Time elapsed: 0.074 s
% 2.28/1.17 % (3684992)Peak memory usage: 90 MB
% 2.28/1.17 % (3684992)Instructions burned: 130 (million)
% 2.28/1.17 % (3684991)Refutation found. Thanks to Tanya!
% 2.28/1.17 % SZS status Theorem for theBenchmark
% 2.28/1.17 % SZS output start Proof for theBenchmark
% See solution above
% 2.79/1.37 % (3684991)------------------------------
% 2.79/1.37 % (3684991)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.79/1.37 % (3684991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.37 % (3684991)CaDiCaL version: 2.1.3
% 2.79/1.37 % (3684991)Termination reason: Refutation
% 2.79/1.37 % (3684991)Time elapsed: 0.032 s
% 2.79/1.37 % (3684991)Peak memory usage: 91 MB
% 2.79/1.37 % (3684991)Instructions burned: 85 (million)
% 2.79/1.37 % (3684991)------------------------------
% 2.79/1.37 % (3684991)------------------------------
% 2.79/1.37 % (3684981)Success in time 0.317 s
% 2.79/1.37 % Vampire exiting
%------------------------------------------------------------------------------