%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO011+1 : 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 : n019.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.43s 1.35s
% Output : Refutation 3.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 59 ( 9 unt; 3 def)
% Number of atoms : 231 ( 8 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 257 ( 85 ~; 76 |; 83 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 3 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 126 ( 0 sgn 92 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f22,axiom,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ~ ? [X3] : min_precedes(X0,X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(f35,axiom,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& leaf(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(f36,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_35) ).
fof(f49,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(f50,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)],[f49]) ).
fof(f54,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,[],[f50]) ).
fof(f55,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,[],[f36]) ).
fof(f67,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f68,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f84,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(f85,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,[],[f54,f84]) ).
fof(f86,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,[],[f84]) ).
fof(f87,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,[],[f86]) ).
fof(f88,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK1(X0,X1),tptp1)
& subactivity_occurrence(sK1(X0,X1),X0)
& min_precedes(X1,sK1(X0,X1),tptp0)
& occurrence_of(X2,tptp2) )
| ~ sP0(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1))],[f87]) ).
fof(f89,plain,
( ! [X1,X2] :
( ~ leaf_occ(X2,sK2)
| ( occurrence_of(sK3(X1),tptp2)
& subactivity_occurrence(sK3(X1),sK2)
& min_precedes(X1,sK3(X1),tptp0)
& occurrence_of(X2,tptp1) )
| sP0(sK2,X1,X2) )
& occurrence_of(sK2,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X3,sK3(X1))],[f85]) ).
fof(f90,plain,
! [X0] :
( ( occurrence_of(sK4(X0),tptp3)
& root_occ(sK4(X0),X0)
& occurrence_of(sK5(X0),tptp4)
& next_subocc(sK4(X0),sK5(X0),tptp0)
& ( occurrence_of(sK6(X0),tptp1)
| occurrence_of(sK6(X0),tptp2) )
& next_subocc(sK5(X0),sK6(X0),tptp0)
& leaf_occ(sK6(X0),X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X1,sK4(X0)),skolemize(X2,sK5(X0)),skolemize(X3,sK6(X0))],[f55]) ).
fof(f92,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& leaf(X0,X2) )
| ~ leaf_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f93,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ? [X3] :
( occurrence_of(X1,X3)
& subactivity_occurrence(X0,X1)
& leaf(X0,X3) )
| ~ leaf_occ(X0,X1) ) ),
inference(rectify,[],[f92]) ).
fof(f94,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ( occurrence_of(X1,sK8(X0,X1))
& subactivity_occurrence(X0,X1)
& leaf(X0,sK8(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X3,sK8(X0,X1))],[f93]) ).
fof(f97,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) )
| ~ leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f69]) ).
fof(f98,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) )
| ~ leaf(X0,X1) ) ),
inference(flattening,[],[f97]) ).
fof(f99,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X4] : min_precedes(X4,X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(rectify,[],[f98]) ).
fof(f100,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| min_precedes(X0,sK11(X0,X1),X1) )
& ( ( ( root(X0,X1)
| min_precedes(sK12(X0,X1),X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12]),skolemize(X3,sK11(X0,X1)),skolemize(X4,sK12(X0,X1))],[f99]) ).
fof(f109,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| min_precedes(X1,sK1(X0,X1),tptp0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f112,plain,
occurrence_of(sK2,tptp0),
inference(cnf_transformation,[],[f89]) ).
fof(f114,plain,
! [X2,X1] :
( min_precedes(X1,sK3(X1),tptp0)
| sP0(sK2,X1,X2)
| ~ leaf_occ(X2,sK2) ),
inference(cnf_transformation,[],[f89]) ).
fof(f119,plain,
! [X0] :
( leaf_occ(sK6(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f90]) ).
fof(f138,plain,
! [X0,X1] :
( leaf(X0,sK8(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f140,plain,
! [X0,X1] :
( occurrence_of(X1,sK8(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f156,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f68]) ).
fof(f157,plain,
! [X0,X1,X5] :
( ~ min_precedes(X0,X5,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f100]) ).
fof(f229,plain,
! [X0,X1] :
( sP0(sK2,X0,X1)
| ~ leaf(X0,tptp0)
| ~ leaf_occ(X1,sK2) ),
inference(resolution,[],[f157,f114]) ).
fof(f259,definition,
( spl21_10
<=> ! [X1] : ~ leaf_occ(X1,sK2) ),
introduced(definition,[new_symbols(definition,[spl21_10])],[avatar_definition]) ).
fof(f260,plain,
( ! [X1] : ~ leaf_occ(X1,sK2)
| ~ spl21_10 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f277,plain,
( ~ occurrence_of(sK2,tptp0)
| ~ spl21_10 ),
inference(resolution,[],[f260,f119]) ).
fof(f278,plain,
( $false
| ~ spl21_10 ),
inference(forward_subsumption_resolution,[],[f277,f112]) ).
fof(f279,plain,
~ spl21_10,
inference(avatar_contradiction_clause,[],[f278]) ).
fof(f314,plain,
! [X0] :
( ~ occurrence_of(sK2,X0)
| tptp0 = X0 ),
inference(resolution,[],[f156,f112]) ).
fof(f321,plain,
! [X0] :
( ~ leaf_occ(X0,sK2)
| tptp0 = sK8(X0,sK2) ),
inference(resolution,[],[f314,f140]) ).
fof(f329,plain,
! [X0,X1] :
( min_precedes(X0,sK1(sK2,X0),tptp0)
| ~ leaf(X0,tptp0)
| ~ leaf_occ(X1,sK2) ),
inference(resolution,[],[f109,f229]) ).
fof(f346,plain,
! [X0,X1] :
( ~ leaf(X0,tptp0)
| ~ leaf_occ(X1,sK2) ),
inference(forward_subsumption_resolution,[],[f329,f157]) ).
fof(f348,definition,
( spl21_22
<=> ! [X0] : ~ leaf(X0,tptp0) ),
introduced(definition,[new_symbols(definition,[spl21_22])],[avatar_definition]) ).
fof(f349,plain,
( ! [X0] : ~ leaf(X0,tptp0)
| ~ spl21_22 ),
inference(avatar_component_clause,[],[f348]) ).
fof(f350,plain,
( spl21_10
| spl21_22 ),
inference(avatar_split_clause,[],[f346,f348,f259]) ).
fof(f415,plain,
( tptp0 = sK8(sK6(sK2),sK2)
| ~ occurrence_of(sK2,tptp0) ),
inference(resolution,[],[f321,f119]) ).
fof(f416,plain,
tptp0 = sK8(sK6(sK2),sK2),
inference(forward_subsumption_resolution,[],[f415,f112]) ).
fof(f424,plain,
( leaf(sK6(sK2),tptp0)
| ~ leaf_occ(sK6(sK2),sK2) ),
inference(superposition,[],[f138,f416]) ).
fof(f425,plain,
( ~ leaf_occ(sK6(sK2),sK2)
| ~ spl21_22 ),
inference(forward_subsumption_resolution,[],[f424,f349]) ).
fof(f428,plain,
( ~ occurrence_of(sK2,tptp0)
| ~ spl21_22 ),
inference(resolution,[],[f425,f119]) ).
fof(f429,plain,
( $false
| ~ spl21_22 ),
inference(forward_subsumption_resolution,[],[f428,f112]) ).
fof(f430,plain,
~ spl21_22,
inference(avatar_contradiction_clause,[],[f429]) ).
cnf(s12,plain,
~ spl21_10,
inference(sat_conversion,[],[f279]) ).
cnf(s20,plain,
( spl21_10
| spl21_22 ),
inference(sat_conversion,[],[f350]) ).
cnf(s24,plain,
~ spl21_22,
inference(sat_conversion,[],[f430]) ).
cnf(s25,plain,
spl21_10,
inference(rat,[],[s20,s24]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s12,s25]) ).
fof(f431,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO011+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % 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:21:19 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.46/1.26 % (3468530)Detected formulas, will run a generic FOF schedule.
% 2.46/1.26 % (3468540)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3910627277:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.46/1.26 % (3468539)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=67266305:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.46/1.26 % (3468541)dis-21_1_sil=8000:lcm=predicate:random_seed=3232865551: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.46/1.26 % (3468535)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=2910932683:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.46/1.26 % (3468536)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=3971922264:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.46/1.26 % (3468537)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=1714082073:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.46/1.26 % (3468538)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4276604201:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.46/1.26 % (3468538)Refutation not found, incomplete strategy
% 2.46/1.26 % (3468538)------------------------------
% 2.46/1.26 % (3468538)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.46/1.26 % (3468538)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/1.26 % (3468538)CaDiCaL version: 2.1.3
% 2.46/1.26 % (3468538)Termination reason: Refutation not found, incomplete strategy
% 2.46/1.26 % (3468538)Time elapsed: 0.001 s
% 2.46/1.26 % (3468538)Peak memory usage: 87 MB
% 2.46/1.26 % (3468540)Instruction limit reached!
% 2.46/1.26 % (3468540)------------------------------
% 2.46/1.26 % (3468540)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.46/1.26 % (3468540)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/1.26 % (3468540)CaDiCaL version: 2.1.3
% 2.46/1.26 % (3468540)Termination reason: Instruction limit
% 2.46/1.26 % (3468540)Termination phase: Saturation
% 2.46/1.26 % (3468540)Time elapsed: 0.055 s
% 2.46/1.26 % (3468540)Peak memory usage: 90 MB
% 2.46/1.26 % (3468540)Instructions burned: 142 (million)
% 2.46/1.26 % (3468539)Instruction limit reached!
% 2.46/1.26 % (3468539)------------------------------
% 2.46/1.26 % (3468539)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.46/1.26 % (3468539)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/1.26 % (3468539)CaDiCaL version: 2.1.3
% 2.46/1.26 % (3468539)Termination reason: Instruction limit
% 2.46/1.26 % (3468539)Termination phase: Saturation
% 2.46/1.26 % (3468539)Time elapsed: 0.054 s
% 2.46/1.26 % (3468539)Peak memory usage: 88 MB
% 2.46/1.26 % (3468539)Instructions burned: 120 (million)
% 2.46/1.26 % (3468541)Instruction limit reached!
% 2.46/1.26 % (3468541)------------------------------
% 2.46/1.26 % (3468541)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.46/1.26 % (3468541)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/1.26 % (3468541)CaDiCaL version: 2.1.3
% 2.46/1.26 % (3468541)Termination reason: Instruction limit
% 2.46/1.26 % (3468541)Termination phase: Saturation
% 2.46/1.26 % (3468541)Time elapsed: 0.082 s
% 2.46/1.26 % (3468541)Peak memory usage: 90 MB
% 2.46/1.26 % (3468541)Instructions burned: 130 (million)
% 2.46/1.26 % (3468549)lrs+10_1_sil=8000:sp=occurrence:random_seed=3473986243:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.46/1.26 % (3468549)First to succeed.
% 2.46/1.26 % (3468549)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3468530"
% 2.46/1.26 % (3468550)lrs+10_1_sil=32000:urr=on:br=off:random_seed=247430020:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 2.46/1.26 % (3468550)Refutation not found, incomplete strategy
% 2.46/1.26 % (3468550)------------------------------
% 2.46/1.26 % (3468550)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.46/1.26 % (3468550)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/1.26 % (3468550)CaDiCaL version: 2.1.3
% 3.43/1.35 % (3468550)Termination reason: Refutation not found, incomplete strategy
% 3.43/1.35 % (3468550)Time elapsed: 0.003 s
% 3.43/1.35 % (3468550)Peak memory usage: 89 MB
% 3.43/1.35 % (3468550)Instructions burned: 2 (million)
% 3.43/1.35 % (3468551)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3187024867:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.43/1.35 % (3468551)Also succeeded, but the first one will report.
% 3.43/1.35 % (3468538)------------------------------
% 3.43/1.35 % (3468538)------------------------------
% 3.43/1.35 % (3468549)Refutation found. Thanks to Tanya!
% 3.43/1.35 % SZS status Theorem for theBenchmark
% 3.43/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 3.43/1.36 % (3468549)------------------------------
% 3.43/1.36 % (3468549)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.43/1.36 % (3468549)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.43/1.36 % (3468549)CaDiCaL version: 2.1.3
% 3.43/1.36 % (3468549)Termination reason: Refutation
% 3.43/1.36 % (3468549)Time elapsed: 0.005 s
% 3.43/1.36 % (3468549)Peak memory usage: 90 MB
% 3.43/1.36 % (3468549)Instructions burned: 11 (million)
% 3.43/1.36 % (3468549)------------------------------
% 3.43/1.36 % (3468549)------------------------------
% 3.43/1.36 % (3468530)Success in time 0.414 s
% 3.43/1.36 % Vampire exiting
%------------------------------------------------------------------------------