%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO010+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 12:30:25 PM UTC 2026
% Result : Theorem 2.31s 1.17s
% Output : Refutation 2.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 88 ( 16 unt; 9 def)
% Number of atoms : 248 ( 7 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 261 ( 101 ~; 89 |; 53 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 8 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 118 ( 0 sgn 93 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& leaf_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(f23,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(f25,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_24) ).
fof(f33,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f45,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_44) ).
fof(f46,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f74,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f73]) ).
fof(f75,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f23]) ).
fof(f76,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f75]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f90,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& next_subocc(X1,X2,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f33]) ).
fof(f91,plain,
? [X0] :
( ! [X1,X2] :
( ~ leaf_occ(X2,X0)
| ( ? [X3] :
( occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| ( ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) ) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f92,definition,
! [X1,X2] :
( ( ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X1,X2) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f93,plain,
? [X0] :
( ! [X1,X2] :
( ~ leaf_occ(X2,X0)
| ( ? [X3] :
( occurrence_of(X3,tptp2)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| sP0(X1,X2) )
& occurrence_of(X0,tptp0) ),
inference(definition_folding,[],[f91,f92]) ).
fof(f114,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK9(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK9(X0,X1,X2))
& subactivity_occurrence(X2,sK9(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1,X2))],[f79]) ).
fof(f119,plain,
! [X0] :
( ( occurrence_of(sK15(X0),tptp3)
& root_occ(sK15(X0),X0)
& occurrence_of(sK16(X0),tptp4)
& next_subocc(sK15(X0),sK16(X0),tptp0)
& ( occurrence_of(sK17(X0),tptp1)
| occurrence_of(sK17(X0),tptp2) )
& next_subocc(sK16(X0),sK17(X0),tptp0)
& leaf_occ(sK17(X0),X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16,sK17]),skolemize(X1,sK15(X0)),skolemize(X2,sK16(X0)),skolemize(X3,sK17(X0))],[f90]) ).
fof(f120,plain,
! [X1,X2] :
( ( ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X1,X2) ),
inference(nnf_transformation,[],[f92]) ).
fof(f121,plain,
! [X0,X1] :
( ( ? [X2] :
( occurrence_of(X2,tptp1)
& min_precedes(X0,X2,tptp0) )
& occurrence_of(X1,tptp2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f120]) ).
fof(f122,plain,
! [X0,X1] :
( ( occurrence_of(sK18(X0),tptp1)
& min_precedes(X0,sK18(X0),tptp0)
& occurrence_of(X1,tptp2) )
| ~ sP0(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18]),skolemize(X2,sK18(X0))],[f121]) ).
fof(f123,plain,
( ! [X1,X2] :
( ~ leaf_occ(X2,sK19)
| ( occurrence_of(sK20(X1),tptp2)
& min_precedes(X1,sK20(X1),tptp0)
& occurrence_of(X2,tptp1) )
| sP0(X1,X2) )
& occurrence_of(sK19,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20]),skolemize(X0,sK19),skolemize(X3,sK20(X1))],[f93]) ).
fof(f165,plain,
! [X2,X3,X0,X1] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ~ min_precedes(X1,X3,X2) ),
inference(cnf_transformation,[],[f74]) ).
fof(f166,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(cnf_transformation,[],[f76]) ).
fof(f171,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| occurrence_of(sK9(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f186,plain,
! [X0] :
( leaf_occ(sK17(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f204,plain,
tptp1 != tptp2,
inference(cnf_transformation,[],[f45]) ).
fof(f205,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| occurrence_of(X1,tptp2) ),
inference(cnf_transformation,[],[f122]) ).
fof(f206,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| min_precedes(X0,sK18(X0),tptp0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f208,plain,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f123]) ).
fof(f209,plain,
! [X2,X1] :
( sP0(X1,X2)
| occurrence_of(X2,tptp1)
| ~ leaf_occ(X2,sK19) ),
inference(cnf_transformation,[],[f123]) ).
fof(f210,plain,
! [X2,X1] :
( sP0(X1,X2)
| min_precedes(X1,sK20(X1),tptp0)
| ~ leaf_occ(X2,sK19) ),
inference(cnf_transformation,[],[f123]) ).
fof(f212,definition,
! [X0,X1] :
( sQ21_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ21_eqProxy])],[equality_proxy_definition]) ).
fof(f215,plain,
! [X2,X0,X1] :
( sQ21_eqProxy(X1,X2)
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(equality_proxy_replacement,[],[f166,f212]) ).
fof(f222,plain,
~ sQ21_eqProxy(tptp1,tptp2),
inference(equality_proxy_replacement,[],[f204,f212]) ).
fof(f233,plain,
! [X0,X1] :
( occurrence_of(X0,tptp2)
| min_precedes(X1,sK20(X1),tptp0)
| ~ leaf_occ(X0,sK19) ),
inference(resolution,[],[f205,f210]) ).
fof(f240,definition,
( spl22_2
<=> ! [X0] :
( occurrence_of(X0,tptp2)
| ~ leaf_occ(X0,sK19) ) ),
introduced(definition,[new_symbols(definition,[spl22_2])],[avatar_definition]) ).
fof(f241,plain,
( ! [X0] :
( ~ leaf_occ(X0,sK19)
| occurrence_of(X0,tptp2) )
| ~ spl22_2 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f244,definition,
( spl22_3
<=> ! [X1] : min_precedes(X1,sK20(X1),tptp0) ),
introduced(definition,[new_symbols(definition,[spl22_3])],[avatar_definition]) ).
fof(f245,plain,
( ! [X1] : min_precedes(X1,sK20(X1),tptp0)
| ~ spl22_3 ),
inference(avatar_component_clause,[],[f244]) ).
fof(f246,plain,
( spl22_3
| spl22_2 ),
inference(avatar_split_clause,[],[f233,f240,f244]) ).
fof(f265,plain,
( ~ occurrence_of(sK19,tptp0)
| occurrence_of(sK17(sK19),tptp2)
| ~ spl22_2 ),
inference(resolution,[],[f186,f241]) ).
fof(f267,definition,
( spl22_4
<=> occurrence_of(sK17(sK19),tptp2) ),
introduced(definition,[new_symbols(definition,[spl22_4])],[avatar_definition]) ).
fof(f268,plain,
( occurrence_of(sK17(sK19),tptp2)
| ~ spl22_4 ),
inference(avatar_component_clause,[],[f267]) ).
fof(f270,definition,
( spl22_5
<=> occurrence_of(sK19,tptp0) ),
introduced(definition,[new_symbols(definition,[spl22_5])],[avatar_definition]) ).
fof(f271,plain,
( ~ occurrence_of(sK19,tptp0)
| spl22_5 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f272,plain,
( spl22_4
| ~ spl22_5
| ~ spl22_2 ),
inference(avatar_split_clause,[],[f265,f240,f270,f267]) ).
fof(f273,plain,
( $false
| spl22_5 ),
inference(resolution,[],[f271,f208]) ).
fof(f274,plain,
spl22_5,
inference(avatar_contradiction_clause,[],[f273]) ).
fof(f282,definition,
( spl22_6
<=> ! [X1] :
( occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,sK19) ) ),
introduced(definition,[new_symbols(definition,[spl22_6])],[avatar_definition]) ).
fof(f283,plain,
( ! [X1] :
( ~ leaf_occ(X1,sK19)
| occurrence_of(X1,tptp1) )
| ~ spl22_6 ),
inference(avatar_component_clause,[],[f282]) ).
fof(f301,plain,
( occurrence_of(sK17(sK19),tptp1)
| ~ occurrence_of(sK19,tptp0)
| ~ spl22_6 ),
inference(resolution,[],[f283,f186]) ).
fof(f303,definition,
( spl22_11
<=> occurrence_of(sK17(sK19),tptp1) ),
introduced(definition,[new_symbols(definition,[spl22_11])],[avatar_definition]) ).
fof(f304,plain,
( occurrence_of(sK17(sK19),tptp1)
| ~ spl22_11 ),
inference(avatar_component_clause,[],[f303]) ).
fof(f305,plain,
( ~ spl22_5
| spl22_11
| ~ spl22_6 ),
inference(avatar_split_clause,[],[f301,f282,f303,f270]) ).
fof(f329,plain,
! [X0,X1] :
( min_precedes(X0,sK18(X0),tptp0)
| occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,sK19) ),
inference(resolution,[],[f206,f209]) ).
fof(f331,definition,
( spl22_12
<=> ! [X0] : min_precedes(X0,sK18(X0),tptp0) ),
introduced(definition,[new_symbols(definition,[spl22_12])],[avatar_definition]) ).
fof(f332,plain,
( ! [X0] : min_precedes(X0,sK18(X0),tptp0)
| ~ spl22_12 ),
inference(avatar_component_clause,[],[f331]) ).
fof(f333,plain,
( spl22_6
| spl22_12 ),
inference(avatar_split_clause,[],[f329,f331,f282]) ).
fof(f355,plain,
! [X0] :
( ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(X0,tptp1) ),
inference(resolution,[],[f215,f222]) ).
fof(f364,plain,
! [X2,X0,X1] :
( ~ min_precedes(sK17(X0),X2,X1)
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f165,f186]) ).
fof(f372,plain,
( ~ occurrence_of(sK17(sK19),tptp1)
| ~ spl22_4 ),
inference(resolution,[],[f355,f268]) ).
fof(f373,plain,
( $false
| ~ spl22_4
| ~ spl22_11 ),
inference(resolution,[],[f372,f304]) ).
fof(f374,plain,
( ~ spl22_4
| ~ spl22_11 ),
inference(avatar_contradiction_clause,[],[f373]) ).
fof(f1187,plain,
( ! [X0] : occurrence_of(sK9(tptp0,X0,sK18(X0)),tptp0)
| ~ spl22_12 ),
inference(resolution,[],[f332,f171]) ).
fof(f1499,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl22_12 ),
inference(resolution,[],[f364,f332]) ).
fof(f1505,plain,
( ! [X0] : ~ occurrence_of(X0,tptp0)
| ~ spl22_12 ),
inference(duplicate_literal_removal,[],[f1499]) ).
fof(f1506,plain,
( $false
| ~ spl22_12 ),
inference(resolution,[],[f1505,f1187]) ).
fof(f1523,plain,
~ spl22_12,
inference(avatar_contradiction_clause,[],[f1506]) ).
fof(f1527,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl22_3 ),
inference(resolution,[],[f245,f364]) ).
fof(f1528,plain,
( ! [X0] : ~ occurrence_of(X0,tptp0)
| ~ spl22_3 ),
inference(duplicate_literal_removal,[],[f1527]) ).
fof(f1536,plain,
( $false
| ~ spl22_3 ),
inference(resolution,[],[f1528,f208]) ).
fof(f1537,plain,
~ spl22_3,
inference(avatar_contradiction_clause,[],[f1536]) ).
cnf(s2,plain,
( spl22_2
| spl22_3 ),
inference(sat_conversion,[],[f246]) ).
cnf(s3,plain,
( ~ spl22_2
| spl22_4
| ~ spl22_5 ),
inference(sat_conversion,[],[f272]) ).
cnf(s4,plain,
spl22_5,
inference(sat_conversion,[],[f274]) ).
cnf(s9,plain,
( ~ spl22_5
| ~ spl22_6
| spl22_11 ),
inference(sat_conversion,[],[f305]) ).
cnf(s10,plain,
( spl22_6
| spl22_12 ),
inference(sat_conversion,[],[f333]) ).
cnf(s13,plain,
( ~ spl22_4
| ~ spl22_11 ),
inference(sat_conversion,[],[f374]) ).
cnf(s82,plain,
~ spl22_12,
inference(sat_conversion,[],[f1523]) ).
cnf(s83,plain,
~ spl22_3,
inference(sat_conversion,[],[f1537]) ).
cnf(s91,plain,
spl22_6,
inference(rat,[],[s10,s82]) ).
cnf(s92,plain,
( ~ spl22_5
| spl22_11 ),
inference(rat,[],[s9,s91]) ).
cnf(s93,plain,
spl22_11,
inference(rat,[],[s92,s4]) ).
cnf(s95,plain,
~ spl22_4,
inference(rat,[],[s13,s93]) ).
cnf(s100,plain,
~ spl22_2,
inference(rat,[],[s3,s4,s95]) ).
cnf(s101,plain,
$false,
inference(rat,[],[s2,s83,s100]) ).
fof(f1545,plain,
$false,
inference(avatar_sat_refutation,[],[s101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO010+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n006.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 22:19:40 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.31/1.17 % (3382525)Detected formulas, will run a generic FOF schedule.
% 2.31/1.17 % (3382536)dis-21_1_sil=8000:lcm=predicate:random_seed=4123574733: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.31/1.17 % (3382536)First to succeed.
% 2.31/1.17 % (3382536)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3382525"
% 2.31/1.17 % (3382530)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=480519328:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.31/1.17 % (3382535)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2365834445:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.31/1.17 % (3382532)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=1385851856:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.31/1.17 % (3382534)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3911065814:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.31/1.17 % (3382533)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3614002563:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.31/1.17 % (3382531)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=1968274606:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.31/1.17 % (3382533)Refutation not found, incomplete strategy
% 2.31/1.17 % (3382533)------------------------------
% 2.31/1.17 % (3382533)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.31/1.17 % (3382533)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.31/1.17 % (3382533)CaDiCaL version: 2.1.3
% 2.31/1.17 % (3382533)Termination reason: Refutation not found, incomplete strategy
% 2.31/1.17 % (3382533)Time elapsed: 0.001 s
% 2.31/1.17 % (3382533)Peak memory usage: 87 MB
% 2.31/1.17 % (3382534)Instruction limit reached!
% 2.31/1.17 % (3382534)------------------------------
% 2.31/1.17 % (3382534)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.31/1.17 % (3382534)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.31/1.17 % (3382534)CaDiCaL version: 2.1.3
% 2.31/1.17 % (3382534)Termination reason: Instruction limit
% 2.31/1.17 % (3382534)Termination phase: Saturation
% 2.31/1.17 % (3382534)Time elapsed: 0.071 s
% 2.31/1.17 % (3382534)Peak memory usage: 88 MB
% 2.31/1.17 % (3382534)Instructions burned: 120 (million)
% 2.31/1.17 % (3382535)Instruction limit reached!
% 2.31/1.17 % (3382535)------------------------------
% 2.31/1.17 % (3382535)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.31/1.17 % (3382535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.31/1.17 % (3382535)CaDiCaL version: 2.1.3
% 2.31/1.17 % (3382535)Termination reason: Instruction limit
% 2.31/1.17 % (3382535)Termination phase: Saturation
% 2.31/1.17 % (3382535)Time elapsed: 0.100 s
% 2.31/1.17 % (3382535)Peak memory usage: 90 MB
% 2.31/1.17 % (3382535)Instructions burned: 139 (million)
% 2.31/1.17 % (3382536)Refutation found. Thanks to Tanya!
% 2.31/1.17 % SZS status Theorem for theBenchmark
% 2.31/1.17 % SZS output start Proof for theBenchmark
% See solution above
% 2.77/1.36 % (3382536)------------------------------
% 2.77/1.36 % (3382536)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.77/1.36 % (3382536)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.77/1.36 % (3382536)CaDiCaL version: 2.1.3
% 2.77/1.36 % (3382536)Termination reason: Refutation
% 2.77/1.36 % (3382536)Time elapsed: 0.015 s
% 2.77/1.36 % (3382536)Peak memory usage: 89 MB
% 2.77/1.36 % (3382536)Instructions burned: 38 (million)
% 2.77/1.36 % (3382536)------------------------------
% 2.77/1.36 % (3382536)------------------------------
% 2.77/1.36 % (3382525)Success in time 0.309 s
% 2.77/1.36 % Vampire exiting
%------------------------------------------------------------------------------