%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO012+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:26 PM UTC 2026
% Result : Theorem 3.44s 1.60s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 65 ( 21 unt; 0 def)
% Number of atoms : 211 ( 13 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 230 ( 84 ~; 85 |; 50 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 142 ( 123 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ? [X3] :
( root(X3,X2)
& min_precedes(X3,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_13) ).
fof(f15,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ~ root(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_14) ).
fof(f26,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/sandbox/benchmark/theBenchmark.p',sos_25) ).
fof(f29,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X1,X0)
& arboreal(X2)
& arboreal(X3)
& subactivity_occurrence(X2,X1)
& subactivity_occurrence(X3,X1) )
=> ( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_28) ).
fof(f30,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X0,X1,X2)
& occurrence_of(X3,X2)
& subactivity_occurrence(X1,X3) )
=> subactivity_occurrence(X0,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_29) ).
fof(f39,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& root_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X3,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_38) ).
fof(f47,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> arboreal(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_46) ).
fof(f50,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& min_precedes(X1,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& ! [X4] :
( min_precedes(X1,X4,tptp0)
=> ( X4 = X2
| X4 = X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_49) ).
fof(f63,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& min_precedes(X1,X2,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f64,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& min_precedes(X1,X2,tptp0) ) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ? [X3] :
( root(X3,X2)
& min_precedes(X3,X1,X2) )
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f97,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,[],[f26]) ).
fof(f102,plain,
! [X0,X1,X2,X3] :
( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| ~ subactivity_occurrence(X3,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f103,plain,
! [X0,X1,X2,X3] :
( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| ~ subactivity_occurrence(X3,X1) ),
inference(flattening,[],[f102]) ).
fof(f104,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(ennf_transformation,[],[f30]) ).
fof(f105,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(flattening,[],[f104]) ).
fof(f118,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(ennf_transformation,[],[f39]) ).
fof(f119,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(flattening,[],[f118]) ).
fof(f133,plain,
! [X0,X1,X2] :
( arboreal(X0)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f138,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& min_precedes(X1,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& ! [X4] :
( X4 = X2
| X4 = X3
| ~ min_precedes(X1,X4,tptp0) ) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f139,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& min_precedes(X1,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& ! [X4] :
( X4 = X2
| X4 = X3
| ~ min_precedes(X1,X4,tptp0) ) )
| ~ occurrence_of(X0,tptp0) ),
inference(flattening,[],[f138]) ).
fof(f140,plain,
? [X0] :
( ! [X1,X2] :
( ~ occurrence_of(X1,tptp3)
| ~ root_occ(X1,X0)
| ( ~ occurrence_of(X2,tptp2)
& ~ occurrence_of(X2,tptp1) )
| ~ min_precedes(X1,X2,tptp0) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f64]) ).
fof(f147,plain,
! [X0,X1,X2] :
( ( root(sK4(X1,X2),X2)
& min_precedes(sK4(X1,X2),X1,X2) )
| ~ min_precedes(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X1,X2))],[f82]) ).
fof(f156,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))],[f97]) ).
fof(f167,plain,
! [X0] :
( ( occurrence_of(sK16(X0),tptp3)
& root_occ(sK16(X0),X0)
& occurrence_of(sK17(X0),tptp4)
& min_precedes(sK16(X0),sK17(X0),tptp0)
& ( occurrence_of(sK18(X0),tptp2)
| occurrence_of(sK18(X0),tptp1) )
& min_precedes(sK17(X0),sK18(X0),tptp0)
& ! [X4] :
( sK17(X0) = X4
| sK18(X0) = X4
| ~ min_precedes(sK16(X0),X4,tptp0) ) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17,sK18]),skolemize(X1,sK16(X0)),skolemize(X2,sK17(X0)),skolemize(X3,sK18(X0))],[f139]) ).
fof(f168,plain,
( ! [X1,X2] :
( ~ occurrence_of(X1,tptp3)
| ~ root_occ(X1,sK19)
| ( ~ occurrence_of(X2,tptp2)
& ~ occurrence_of(X2,tptp1) )
| ~ min_precedes(X1,X2,tptp0) )
& occurrence_of(sK19,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19]),skolemize(X0,sK19)],[f140]) ).
fof(f191,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| min_precedes(sK4(X1,X2),X1,X2) ),
inference(cnf_transformation,[],[f147]) ).
fof(f192,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| root(sK4(X1,X2),X2) ),
inference(cnf_transformation,[],[f147]) ).
fof(f193,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| ~ root(X1,X2) ),
inference(cnf_transformation,[],[f83]) ).
fof(f212,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f213,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f214,plain,
! [X2,X0,X1] :
( occurrence_of(sK9(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f219,plain,
! [X2,X3,X0,X1] :
( ~ subactivity_occurrence(X3,X1)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| min_precedes(X2,X3,X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f220,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| subactivity_occurrence(X0,X3)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(cnf_transformation,[],[f105]) ).
fof(f236,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f246,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| arboreal(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f250,plain,
! [X0] :
( min_precedes(sK17(X0),sK18(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f167]) ).
fof(f251,plain,
! [X0] :
( occurrence_of(sK18(X0),tptp1)
| occurrence_of(sK18(X0),tptp2)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f167]) ).
fof(f252,plain,
! [X0] :
( min_precedes(sK16(X0),sK17(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f167]) ).
fof(f254,plain,
! [X0] :
( root_occ(sK16(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f167]) ).
fof(f255,plain,
! [X0] :
( occurrence_of(sK16(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f167]) ).
fof(f268,plain,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f168]) ).
fof(f269,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,sK19)
| ~ occurrence_of(X2,tptp1)
| ~ occurrence_of(X1,tptp3) ),
inference(cnf_transformation,[],[f168]) ).
fof(f270,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,sK19)
| ~ occurrence_of(X2,tptp2)
| ~ occurrence_of(X1,tptp3) ),
inference(cnf_transformation,[],[f168]) ).
fof(f272,plain,
root_occ(sK16(sK19),sK19),
inference(unit_resulting_resolution,[],[f254,f268]) ).
fof(f273,plain,
occurrence_of(sK16(sK19),tptp3),
inference(unit_resulting_resolution,[],[f255,f268]) ).
fof(f277,plain,
min_precedes(sK17(sK19),sK18(sK19),tptp0),
inference(unit_resulting_resolution,[],[f250,f268]) ).
fof(f278,plain,
min_precedes(sK16(sK19),sK17(sK19),tptp0),
inference(unit_resulting_resolution,[],[f252,f268]) ).
fof(f279,plain,
! [X0] : ~ min_precedes(X0,sK16(sK19),tptp0),
inference(unit_resulting_resolution,[],[f236,f272,f268]) ).
fof(f323,plain,
root(sK4(sK18(sK19),tptp0),tptp0),
inference(unit_resulting_resolution,[],[f192,f277]) ).
fof(f325,plain,
min_precedes(sK4(sK18(sK19),tptp0),sK18(sK19),tptp0),
inference(unit_resulting_resolution,[],[f191,f277]) ).
fof(f328,plain,
subactivity_occurrence(sK18(sK19),sK9(tptp0,sK17(sK19),sK18(sK19))),
inference(unit_resulting_resolution,[],[f212,f277]) ).
fof(f330,plain,
subactivity_occurrence(sK17(sK19),sK9(tptp0,sK17(sK19),sK18(sK19))),
inference(unit_resulting_resolution,[],[f213,f277]) ).
fof(f332,plain,
occurrence_of(sK9(tptp0,sK17(sK19),sK18(sK19)),tptp0),
inference(unit_resulting_resolution,[],[f214,f277]) ).
fof(f366,plain,
! [X0] : ~ min_precedes(X0,sK4(sK18(sK19),tptp0),tptp0),
inference(unit_resulting_resolution,[],[f193,f323]) ).
fof(f430,plain,
subactivity_occurrence(sK4(sK18(sK19),tptp0),sK9(tptp0,sK17(sK19),sK18(sK19))),
inference(unit_resulting_resolution,[],[f220,f325,f332,f328]) ).
fof(f433,plain,
subactivity_occurrence(sK16(sK19),sK9(tptp0,sK17(sK19),sK18(sK19))),
inference(unit_resulting_resolution,[],[f220,f278,f332,f330]) ).
fof(f480,plain,
arboreal(sK16(sK19)),
inference(unit_resulting_resolution,[],[f246,f278]) ).
fof(f481,plain,
arboreal(sK4(sK18(sK19),tptp0)),
inference(unit_resulting_resolution,[],[f246,f325]) ).
fof(f842,plain,
sK16(sK19) = sK4(sK18(sK19),tptp0),
inference(unit_resulting_resolution,[],[f219,f480,f481,f366,f279,f433,f332,f430]) ).
fof(f1275,plain,
min_precedes(sK16(sK19),sK18(sK19),tptp0),
inference(superposition,[],[f325,f842]) ).
fof(f2821,plain,
~ occurrence_of(sK18(sK19),tptp2),
inference(unit_resulting_resolution,[],[f270,f273,f272,f1275]) ).
fof(f2822,plain,
~ occurrence_of(sK18(sK19),tptp1),
inference(unit_resulting_resolution,[],[f269,f273,f272,f1275]) ).
fof(f2883,plain,
$false,
inference(unit_resulting_resolution,[],[f251,f268,f2821,f2822]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO012+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/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:22:49 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
% 3.44/1.60 % (3823941)Detected formulas, will run a generic FOF schedule.
% 3.44/1.60 % (3823952)dis-21_1_sil=8000:lcm=predicate:random_seed=41183022: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.44/1.60 % (3823950)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2680129776:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.44/1.60 % (3823949)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=262917026:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.44/1.60 % (3823946)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=3457306841:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.44/1.60 % (3823948)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=631127832:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.44/1.60 % (3823947)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=616938734:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.44/1.60 % (3823951)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=542315388:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.44/1.60 % (3823952)Instruction limit reached!
% 3.44/1.60 % (3823952)------------------------------
% 3.44/1.60 % (3823952)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.60 % (3823952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.60 % (3823952)CaDiCaL version: 2.1.3
% 3.44/1.60 % (3823952)Termination reason: Instruction limit
% 3.44/1.60 % (3823952)Termination phase: Saturation
% 3.44/1.60 % (3823952)Time elapsed: 0.042 s
% 3.44/1.60 % (3823952)Peak memory usage: 89 MB
% 3.44/1.60 % (3823952)Instructions burned: 131 (million)
% 3.44/1.60 % (3823949)Refutation not found, incomplete strategy
% 3.44/1.60 % (3823949)------------------------------
% 3.44/1.60 % (3823949)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.60 % (3823949)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.60 % (3823949)CaDiCaL version: 2.1.3
% 3.44/1.60 % (3823949)Termination reason: Refutation not found, incomplete strategy
% 3.44/1.60 % (3823949)Time elapsed: 0.002 s
% 3.44/1.60 % (3823949)Peak memory usage: 88 MB
% 3.44/1.60 % (3823949)Instructions burned: 2 (million)
% 3.44/1.60 % (3823950)Instruction limit reached!
% 3.44/1.60 % (3823950)------------------------------
% 3.44/1.60 % (3823950)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.60 % (3823950)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.60 % (3823950)CaDiCaL version: 2.1.3
% 3.44/1.60 % (3823950)Termination reason: Instruction limit
% 3.44/1.60 % (3823950)Termination phase: Saturation
% 3.44/1.60 % (3823950)Time elapsed: 0.068 s
% 3.44/1.60 % (3823950)Peak memory usage: 88 MB
% 3.44/1.60 % (3823950)Instructions burned: 119 (million)
% 3.44/1.60 % (3823951)Instruction limit reached!
% 3.44/1.60 % (3823951)------------------------------
% 3.44/1.60 % (3823951)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.60 % (3823951)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.60 % (3823951)CaDiCaL version: 2.1.3
% 3.44/1.60 % (3823951)Termination reason: Instruction limit
% 3.44/1.60 % (3823951)Termination phase: Saturation
% 3.44/1.60 % (3823951)Time elapsed: 0.098 s
% 3.44/1.60 % (3823951)Peak memory usage: 90 MB
% 3.44/1.60 % (3823951)Instructions burned: 140 (million)
% 3.44/1.60 % (3823960)lrs+10_1_sil=8000:sp=occurrence:random_seed=410766479:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.44/1.60 % (3823960)Instruction limit reached!
% 3.44/1.60 % (3823960)------------------------------
% 3.44/1.60 % (3823960)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.60 % (3823960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.60 % (3823960)CaDiCaL version: 2.1.3
% 3.44/1.60 % (3823960)Termination reason: Instruction limit
% 3.44/1.60 % (3823960)Termination phase: Saturation
% 3.44/1.60 % (3823960)Time elapsed: 0.103 s
% 3.44/1.60 % (3823960)Peak memory usage: 92 MB
% 3.44/1.60 % (3823960)Instructions burned: 285 (million)
% 3.44/1.60 % (3823961)lrs+10_1_sil=32000:urr=on:br=off:random_seed=734709027:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.44/1.60 % (3823961)Refutation not found, incomplete strategy
% 3.44/1.60 % (3823961)------------------------------
% 3.44/1.60 % (3823961)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.60 % (3823961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.60 % (3823961)CaDiCaL version: 2.1.3
% 3.44/1.60 % (3823961)Termination reason: Refutation not found, incomplete strategy
% 3.44/1.60 % (3823961)Time elapsed: 0.003 s
% 3.44/1.60 % (3823961)Peak memory usage: 88 MB
% 3.44/1.60 % (3823961)Instructions burned: 3 (million)
% 3.44/1.60 % (3823949)------------------------------
% 3.44/1.60 % (3823949)------------------------------
% 3.44/1.60 % (3823962)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3188238007:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.44/1.60 % (3823964)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1262928429:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 3.44/1.60 % (3823964)First to succeed.
% 3.44/1.60 % (3823964)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3823941"
% 3.44/1.60 % (3823966)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3585512999:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 3.44/1.60 % (3823961)------------------------------
% 3.44/1.60 % (3823961)------------------------------
% 3.44/1.60 % (3823962)Instruction limit reached!
% 3.44/1.60 % (3823962)------------------------------
% 3.44/1.60 % (3823962)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.60 % (3823962)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.60 % (3823962)CaDiCaL version: 2.1.3
% 3.44/1.60 % (3823962)Termination reason: Instruction limit
% 3.44/1.60 % (3823962)Termination phase: Saturation
% 3.44/1.60 % (3823962)Time elapsed: 0.222 s
% 3.44/1.60 % (3823962)Peak memory usage: 92 MB
% 3.44/1.60 % (3823962)Instructions burned: 326 (million)
% 3.44/1.60 % (3823964)Refutation found. Thanks to Tanya!
% 3.44/1.60 % SZS status Theorem for theBenchmark
% 3.44/1.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/1.71 % (3823964)------------------------------
% 0.17/1.71 % (3823964)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.71 % (3823964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.71 % (3823964)CaDiCaL version: 2.1.3
% 0.17/1.71 % (3823964)Termination reason: Refutation
% 0.17/1.71 % (3823964)Time elapsed: 0.059 s
% 0.17/1.71 % (3823964)Peak memory usage: 90 MB
% 0.17/1.71 % (3823964)Instructions burned: 190 (million)
% 0.17/1.71 % (3823964)------------------------------
% 0.17/1.71 % (3823964)------------------------------
% 0.17/1.71 % (3823941)Success in time 0.745 s
% 0.17/1.71 % Vampire exiting
%------------------------------------------------------------------------------