%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO011+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 : n020.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 3.18s 1.33s
% Output : Refutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 88 ( 16 unt; 9 def)
% Number of atoms : 260 ( 7 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 273 ( 101 ~; 89 |; 65 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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 : 124 ( 0 sgn 99 !; 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)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& 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)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& 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)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| ( ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) ) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f92,definition,
! [X0,X1,X2] :
( ( ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,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)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp1) )
| sP0(X0,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,
! [X0,X1,X2] :
( ( ? [X4] :
( occurrence_of(X4,tptp1)
& subactivity_occurrence(X4,X0)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
inference(nnf_transformation,[],[f92]) ).
fof(f121,plain,
! [X0,X1,X2] :
( ( ? [X3] :
( occurrence_of(X3,tptp1)
& subactivity_occurrence(X3,X0)
& min_precedes(X1,X3,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
inference(rectify,[],[f120]) ).
fof(f122,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK18(X0,X1),tptp1)
& subactivity_occurrence(sK18(X0,X1),X0)
& min_precedes(X1,sK18(X0,X1),tptp0)
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18]),skolemize(X3,sK18(X0,X1))],[f121]) ).
fof(f123,plain,
( ! [X1,X2] :
( ~ leaf_occ(X2,sK19)
| ( occurrence_of(sK20(X1),tptp2)
& subactivity_occurrence(sK20(X1),sK19)
& min_precedes(X1,sK20(X1),tptp0)
& occurrence_of(X2,tptp1) )
| sP0(sK19,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,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| occurrence_of(X2,tptp2) ),
inference(cnf_transformation,[],[f122]) ).
fof(f206,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| min_precedes(X1,sK18(X0,X1),tptp0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f209,plain,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f123]) ).
fof(f210,plain,
! [X2,X1] :
( sP0(sK19,X1,X2)
| occurrence_of(X2,tptp1)
| ~ leaf_occ(X2,sK19) ),
inference(cnf_transformation,[],[f123]) ).
fof(f211,plain,
! [X2,X1] :
( sP0(sK19,X1,X2)
| min_precedes(X1,sK20(X1),tptp0)
| ~ leaf_occ(X2,sK19) ),
inference(cnf_transformation,[],[f123]) ).
fof(f214,definition,
! [X0,X1] :
( sQ21_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ21_eqProxy])],[equality_proxy_definition]) ).
fof(f217,plain,
! [X2,X0,X1] :
( sQ21_eqProxy(X1,X2)
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(equality_proxy_replacement,[],[f166,f214]) ).
fof(f224,plain,
~ sQ21_eqProxy(tptp1,tptp2),
inference(equality_proxy_replacement,[],[f204,f214]) ).
fof(f256,plain,
! [X0,X1] :
( occurrence_of(X0,tptp2)
| min_precedes(X1,sK20(X1),tptp0)
| ~ leaf_occ(X0,sK19) ),
inference(resolution,[],[f205,f211]) ).
fof(f264,definition,
( spl22_2
<=> ! [X0] :
( occurrence_of(X0,tptp2)
| ~ leaf_occ(X0,sK19) ) ),
introduced(definition,[new_symbols(definition,[spl22_2])],[avatar_definition]) ).
fof(f265,plain,
( ! [X0] :
( ~ leaf_occ(X0,sK19)
| occurrence_of(X0,tptp2) )
| ~ spl22_2 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f272,definition,
( spl22_4
<=> ! [X1] : min_precedes(X1,sK20(X1),tptp0) ),
introduced(definition,[new_symbols(definition,[spl22_4])],[avatar_definition]) ).
fof(f273,plain,
( ! [X1] : min_precedes(X1,sK20(X1),tptp0)
| ~ spl22_4 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f274,plain,
( spl22_4
| spl22_2 ),
inference(avatar_split_clause,[],[f256,f264,f272]) ).
fof(f277,definition,
( spl22_5
<=> occurrence_of(sK19,tptp0) ),
introduced(definition,[new_symbols(definition,[spl22_5])],[avatar_definition]) ).
fof(f278,plain,
( ~ occurrence_of(sK19,tptp0)
| spl22_5 ),
inference(avatar_component_clause,[],[f277]) ).
fof(f280,definition,
( spl22_6
<=> occurrence_of(sK17(sK19),tptp2) ),
introduced(definition,[new_symbols(definition,[spl22_6])],[avatar_definition]) ).
fof(f281,plain,
( occurrence_of(sK17(sK19),tptp2)
| ~ spl22_6 ),
inference(avatar_component_clause,[],[f280]) ).
fof(f283,plain,
( $false
| spl22_5 ),
inference(resolution,[],[f278,f209]) ).
fof(f284,plain,
spl22_5,
inference(avatar_contradiction_clause,[],[f283]) ).
fof(f317,definition,
( spl22_7
<=> ! [X1] :
( occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,sK19) ) ),
introduced(definition,[new_symbols(definition,[spl22_7])],[avatar_definition]) ).
fof(f318,plain,
( ! [X1] :
( ~ leaf_occ(X1,sK19)
| occurrence_of(X1,tptp1) )
| ~ spl22_7 ),
inference(avatar_component_clause,[],[f317]) ).
fof(f342,definition,
( spl22_13
<=> occurrence_of(sK17(sK19),tptp1) ),
introduced(definition,[new_symbols(definition,[spl22_13])],[avatar_definition]) ).
fof(f343,plain,
( occurrence_of(sK17(sK19),tptp1)
| ~ spl22_13 ),
inference(avatar_component_clause,[],[f342]) ).
fof(f367,plain,
( occurrence_of(sK17(sK19),tptp1)
| ~ occurrence_of(sK19,tptp0)
| ~ spl22_7 ),
inference(resolution,[],[f318,f186]) ).
fof(f368,plain,
( ~ spl22_5
| spl22_13
| ~ spl22_7 ),
inference(avatar_split_clause,[],[f367,f317,f342,f277]) ).
fof(f377,plain,
! [X0] :
( ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(X0,tptp1) ),
inference(resolution,[],[f217,f224]) ).
fof(f386,plain,
! [X2,X0,X1] :
( ~ min_precedes(sK17(X0),X2,X1)
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f165,f186]) ).
fof(f394,plain,
( ~ occurrence_of(sK17(sK19),tptp1)
| ~ spl22_6 ),
inference(resolution,[],[f377,f281]) ).
fof(f395,plain,
( $false
| ~ spl22_6
| ~ spl22_13 ),
inference(resolution,[],[f394,f343]) ).
fof(f396,plain,
( ~ spl22_6
| ~ spl22_13 ),
inference(avatar_contradiction_clause,[],[f395]) ).
fof(f413,plain,
! [X0,X1] :
( min_precedes(X0,sK18(sK19,X0),tptp0)
| occurrence_of(X1,tptp1)
| ~ leaf_occ(X1,sK19) ),
inference(resolution,[],[f206,f210]) ).
fof(f415,definition,
( spl22_18
<=> ! [X0] : min_precedes(X0,sK18(sK19,X0),tptp0) ),
introduced(definition,[new_symbols(definition,[spl22_18])],[avatar_definition]) ).
fof(f416,plain,
( ! [X0] : min_precedes(X0,sK18(sK19,X0),tptp0)
| ~ spl22_18 ),
inference(avatar_component_clause,[],[f415]) ).
fof(f417,plain,
( spl22_7
| spl22_18 ),
inference(avatar_split_clause,[],[f413,f415,f317]) ).
fof(f2141,plain,
( occurrence_of(sK17(sK19),tptp2)
| ~ occurrence_of(sK19,tptp0)
| ~ spl22_2 ),
inference(resolution,[],[f265,f186]) ).
fof(f2142,plain,
( ~ spl22_5
| spl22_6
| ~ spl22_2 ),
inference(avatar_split_clause,[],[f2141,f264,f280,f277]) ).
fof(f2144,plain,
( ! [X0] : occurrence_of(sK9(tptp0,X0,sK18(sK19,X0)),tptp0)
| ~ spl22_18 ),
inference(resolution,[],[f416,f171]) ).
fof(f2166,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl22_18 ),
inference(resolution,[],[f386,f416]) ).
fof(f2168,plain,
( ! [X0] : ~ occurrence_of(X0,tptp0)
| ~ spl22_18 ),
inference(duplicate_literal_removal,[],[f2166]) ).
fof(f2170,plain,
( $false
| ~ spl22_18 ),
inference(resolution,[],[f2168,f2144]) ).
fof(f2173,plain,
~ spl22_18,
inference(avatar_contradiction_clause,[],[f2170]) ).
fof(f2178,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl22_4 ),
inference(resolution,[],[f273,f386]) ).
fof(f2179,plain,
( ! [X0] : ~ occurrence_of(X0,tptp0)
| ~ spl22_4 ),
inference(duplicate_literal_removal,[],[f2178]) ).
fof(f2180,plain,
( $false
| ~ spl22_4 ),
inference(resolution,[],[f2179,f209]) ).
fof(f2181,plain,
~ spl22_4,
inference(avatar_contradiction_clause,[],[f2180]) ).
cnf(s3,plain,
( spl22_2
| spl22_4 ),
inference(sat_conversion,[],[f274]) ).
cnf(s5,plain,
spl22_5,
inference(sat_conversion,[],[f284]) ).
cnf(s16,plain,
( ~ spl22_5
| ~ spl22_7
| spl22_13 ),
inference(sat_conversion,[],[f368]) ).
cnf(s17,plain,
( ~ spl22_6
| ~ spl22_13 ),
inference(sat_conversion,[],[f396]) ).
cnf(s18,plain,
( spl22_7
| spl22_18 ),
inference(sat_conversion,[],[f417]) ).
cnf(s68,plain,
( ~ spl22_2
| ~ spl22_5
| spl22_6 ),
inference(sat_conversion,[],[f2142]) ).
cnf(s73,plain,
~ spl22_18,
inference(sat_conversion,[],[f2173]) ).
cnf(s75,plain,
~ spl22_4,
inference(sat_conversion,[],[f2181]) ).
cnf(s76,plain,
spl22_7,
inference(rat,[],[s18,s73]) ).
cnf(s77,plain,
( ~ spl22_5
| spl22_13 ),
inference(rat,[],[s16,s76]) ).
cnf(s79,plain,
spl22_13,
inference(rat,[],[s77,s5]) ).
cnf(s81,plain,
~ spl22_6,
inference(rat,[],[s17,s79]) ).
cnf(s91,plain,
~ spl22_2,
inference(rat,[],[s68,s5,s81]) ).
cnf(s92,plain,
$false,
inference(rat,[],[s3,s75,s91]) ).
fof(f2182,plain,
$false,
inference(avatar_sat_refutation,[],[s92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO011+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 22:21:49 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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
% 3.18/1.33 % (3823126)Detected formulas, will run a generic FOF schedule.
% 3.18/1.33 % (3823132)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=875521474:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.18/1.33 % (3823137)dis-21_1_sil=8000:lcm=predicate:random_seed=1149999250: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.18/1.33 % (3823135)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3918377586:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.18/1.33 % (3823136)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2564005099:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.18/1.33 % (3823133)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=1937472396:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.18/1.33 % (3823131)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=2085217741:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.18/1.33 % (3823134)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2126643396:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.18/1.33 % (3823134)Refutation not found, incomplete strategy
% 3.18/1.33 % (3823134)------------------------------
% 3.18/1.33 % (3823134)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.33 % (3823134)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.33 % (3823134)CaDiCaL version: 2.1.3
% 3.18/1.33 % (3823134)Termination reason: Refutation not found, incomplete strategy
% 3.18/1.33 % (3823134)Time elapsed: 0.001 s
% 3.18/1.33 % (3823134)Peak memory usage: 87 MB
% 3.18/1.33 % (3823137)First to succeed.
% 3.18/1.33 % (3823137)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3823126"
% 3.18/1.33 % (3823135)Instruction limit reached!
% 3.18/1.33 % (3823135)------------------------------
% 3.18/1.33 % (3823135)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.33 % (3823135)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.33 % (3823135)CaDiCaL version: 2.1.3
% 3.18/1.33 % (3823135)Termination reason: Instruction limit
% 3.18/1.33 % (3823135)Termination phase: Saturation
% 3.18/1.33 % (3823135)Time elapsed: 0.071 s
% 3.18/1.33 % (3823135)Peak memory usage: 88 MB
% 3.18/1.33 % (3823135)Instructions burned: 120 (million)
% 3.18/1.33 % (3823136)Instruction limit reached!
% 3.18/1.33 % (3823136)------------------------------
% 3.18/1.33 % (3823136)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.33 % (3823136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.33 % (3823136)CaDiCaL version: 2.1.3
% 3.18/1.33 % (3823136)Termination reason: Instruction limit
% 3.18/1.33 % (3823136)Termination phase: Saturation
% 3.18/1.33 % (3823136)Time elapsed: 0.099 s
% 3.18/1.33 % (3823136)Peak memory usage: 90 MB
% 3.18/1.33 % (3823136)Instructions burned: 141 (million)
% 3.18/1.33 % (3823145)lrs+10_1_sil=8000:sp=occurrence:random_seed=112735234:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.18/1.33 % (3823134)------------------------------
% 3.18/1.33 % (3823134)------------------------------
% 3.18/1.33 % (3823145)Also succeeded, but the first one will report.
% 3.18/1.33 % (3823146)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3143400156:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.18/1.33 % (3823146)Also succeeded, but the first one will report.
% 3.18/1.33 % (3823137)Refutation found. Thanks to Tanya!
% 3.18/1.33 % SZS status Theorem for theBenchmark
% 3.18/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 3.99/1.53 % (3823137)------------------------------
% 3.99/1.53 % (3823137)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.99/1.53 % (3823137)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.99/1.53 % (3823137)CaDiCaL version: 2.1.3
% 3.99/1.53 % (3823137)Termination reason: Refutation
% 3.99/1.53 % (3823137)Time elapsed: 0.045 s
% 3.99/1.53 % (3823137)Peak memory usage: 90 MB
% 3.99/1.53 % (3823137)Instructions burned: 71 (million)
% 3.99/1.53 % (3823137)------------------------------
% 3.99/1.53 % (3823137)------------------------------
% 3.99/1.53 % (3823126)Success in time 0.477 s
% 3.99/1.53 % Vampire exiting
%------------------------------------------------------------------------------