%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO010+1 : 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 : n003.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:24 PM UTC 2026
% Result : Theorem 4.87s 1.65s
% Output : Refutation 4.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 6 unt; 1 def)
% Number of atoms : 195 ( 8 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 216 ( 67 ~; 67 |; 71 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 116 ( 82 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) ) ) ) ),
file('/export/starexec/sandbox/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)
& min_precedes(X1,X3,tptp0) ) )
& ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( occurrence_of(X4,tptp1)
& 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)
& 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,[],[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(f62,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f63,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f62]) ).
fof(f64,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,
! [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(f85,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,[],[f54,f84]) ).
fof(f86,plain,
! [X1,X2] :
( ( ? [X4] :
( occurrence_of(X4,tptp1)
& min_precedes(X1,X4,tptp0) )
& occurrence_of(X2,tptp2) )
| ~ sP0(X1,X2) ),
inference(nnf_transformation,[],[f84]) ).
fof(f87,plain,
! [X0,X1] :
( ( ? [X2] :
( occurrence_of(X2,tptp1)
& min_precedes(X0,X2,tptp0) )
& occurrence_of(X1,tptp2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f86]) ).
fof(f88,plain,
! [X0,X1] :
( ( occurrence_of(sK1(X0),tptp1)
& min_precedes(X0,sK1(X0),tptp0)
& occurrence_of(X1,tptp2) )
| ~ sP0(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0))],[f87]) ).
fof(f89,plain,
( ! [X1,X2] :
( ~ leaf_occ(X2,sK2)
| ( occurrence_of(sK3(X1),tptp2)
& min_precedes(X1,sK3(X1),tptp0)
& occurrence_of(X2,tptp1) )
| sP0(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(f91,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(f92,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,[],[f91]) ).
fof(f93,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ( occurrence_of(X1,sK7(X0,X1))
& subactivity_occurrence(X0,X1)
& leaf(X0,sK7(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X3,sK7(X0,X1))],[f92]) ).
fof(f96,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,[],[f64]) ).
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(flattening,[],[f96]) ).
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)
| ? [X4] : min_precedes(X4,X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(rectify,[],[f97]) ).
fof(f99,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| min_precedes(X0,sK10(X0,X1),X1) )
& ( ( ( root(X0,X1)
| min_precedes(sK11(X0,X1),X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X3,sK10(X0,X1)),skolemize(X4,sK11(X0,X1))],[f98]) ).
fof(f109,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| min_precedes(X0,sK1(X0),tptp0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f111,plain,
occurrence_of(sK2,tptp0),
inference(cnf_transformation,[],[f89]) ).
fof(f113,plain,
! [X2,X1] :
( ~ leaf_occ(X2,sK2)
| min_precedes(X1,sK3(X1),tptp0)
| sP0(X1,X2) ),
inference(cnf_transformation,[],[f89]) ).
fof(f117,plain,
! [X0] :
( leaf_occ(sK6(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f90]) ).
fof(f131,plain,
! [X0,X1] :
( leaf(X0,sK7(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
fof(f133,plain,
! [X0,X1] :
( occurrence_of(X1,sK7(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
fof(f149,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f63]) ).
fof(f150,plain,
! [X0,X1,X5] :
( ~ min_precedes(X0,X5,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f99]) ).
fof(f184,plain,
! [X0] :
( ~ occurrence_of(sK2,tptp0)
| min_precedes(X0,sK3(X0),tptp0)
| sP0(X0,sK6(sK2)) ),
inference(resolution,[],[f117,f113]) ).
fof(f190,plain,
! [X0] :
( min_precedes(X0,sK3(X0),tptp0)
| sP0(X0,sK6(sK2)) ),
inference(forward_subsumption_resolution,[],[f184,f111]) ).
fof(f239,plain,
! [X0] :
( sP0(X0,sK6(sK2))
| ~ leaf(X0,tptp0) ),
inference(resolution,[],[f190,f150]) ).
fof(f241,plain,
! [X0] :
( ~ leaf(X0,tptp0)
| min_precedes(X0,sK1(X0),tptp0) ),
inference(resolution,[],[f239,f109]) ).
fof(f244,plain,
! [X0] : ~ leaf(X0,tptp0),
inference(forward_subsumption_resolution,[],[f241,f150]) ).
fof(f264,plain,
! [X0] :
( ~ occurrence_of(sK2,X0)
| tptp0 = X0 ),
inference(resolution,[],[f149,f111]) ).
fof(f272,plain,
! [X0] :
( ~ leaf_occ(X0,sK2)
| tptp0 = sK7(X0,sK2) ),
inference(resolution,[],[f264,f133]) ).
fof(f356,plain,
( tptp0 = sK7(sK6(sK2),sK2)
| ~ occurrence_of(sK2,tptp0) ),
inference(resolution,[],[f272,f117]) ).
fof(f357,plain,
tptp0 = sK7(sK6(sK2),sK2),
inference(forward_subsumption_resolution,[],[f356,f111]) ).
fof(f361,plain,
( leaf(sK6(sK2),tptp0)
| ~ leaf_occ(sK6(sK2),sK2) ),
inference(superposition,[],[f131,f357]) ).
fof(f362,plain,
~ leaf_occ(sK6(sK2),sK2),
inference(forward_subsumption_resolution,[],[f361,f244]) ).
fof(f368,plain,
~ occurrence_of(sK2,tptp0),
inference(resolution,[],[f362,f117]) ).
fof(f369,plain,
$false,
inference(forward_subsumption_resolution,[],[f368,f111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO010+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n003.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 22:21:42 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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.23/1.45 % (975439)Detected formulas, will run a generic FOF schedule.
% 3.23/1.45 % (975446)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=3475546943:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.23/1.45 % (975449)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2236337096:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.23/1.45 % (975448)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2003365237:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.23/1.45 % (975445)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=1626129917:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.23/1.45 % (975447)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3929842557:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.23/1.45 % (975444)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=1482462305:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.23/1.45 % (975447)Refutation not found, incomplete strategy
% 3.23/1.45 % (975447)------------------------------
% 3.23/1.45 % (975447)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.23/1.45 % (975447)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.23/1.45 % (975447)CaDiCaL version: 2.1.3
% 3.23/1.45 % (975447)Termination reason: Refutation not found, incomplete strategy
% 3.23/1.45 % (975447)Time elapsed: 0.001 s
% 3.23/1.45 % (975447)Peak memory usage: 87 MB
% 3.23/1.45 % (975450)dis-21_1_sil=8000:lcm=predicate:random_seed=188198801: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.23/1.45 % (975448)Instruction limit reached!
% 3.23/1.45 % (975448)------------------------------
% 3.23/1.45 % (975448)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.23/1.45 % (975448)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.23/1.45 % (975448)CaDiCaL version: 2.1.3
% 3.23/1.45 % (975448)Termination reason: Instruction limit
% 3.23/1.45 % (975448)Termination phase: Saturation
% 3.23/1.45 % (975448)Time elapsed: 0.049 s
% 3.23/1.45 % (975448)Peak memory usage: 88 MB
% 3.23/1.45 % (975448)Instructions burned: 119 (million)
% 3.23/1.45 % (975450)Instruction limit reached!
% 3.23/1.45 % (975450)------------------------------
% 3.23/1.45 % (975450)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.23/1.45 % (975450)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.23/1.45 % (975450)CaDiCaL version: 2.1.3
% 3.23/1.45 % (975450)Termination reason: Instruction limit
% 3.23/1.45 % (975450)Termination phase: Saturation
% 3.23/1.45 % (975450)Time elapsed: 0.082 s
% 3.23/1.45 % (975450)Peak memory usage: 89 MB
% 3.23/1.45 % (975450)Instructions burned: 130 (million)
% 3.23/1.45 % (975449)Instruction limit reached!
% 3.23/1.45 % (975449)------------------------------
% 3.23/1.45 % (975449)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.23/1.45 % (975449)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.23/1.45 % (975449)CaDiCaL version: 2.1.3
% 3.23/1.45 % (975449)Termination reason: Instruction limit
% 3.23/1.45 % (975449)Termination phase: Saturation
% 3.23/1.45 % (975449)Time elapsed: 0.102 s
% 3.23/1.45 % (975449)Peak memory usage: 90 MB
% 3.23/1.45 % (975449)Instructions burned: 139 (million)
% 3.23/1.45 % (975458)lrs+10_1_sil=8000:sp=occurrence:random_seed=724114657:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.23/1.45 % (975458)First to succeed.
% 3.23/1.45 % (975458)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-975439"
% 3.23/1.45 % (975460)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3796065559:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.23/1.45 % (975459)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2634143180:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.23/1.45 % (975459)Refutation not found, incomplete strategy
% 3.23/1.45 % (975459)------------------------------
% 3.23/1.45 % (975459)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.23/1.45 % (975459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.87/1.65 % (975459)CaDiCaL version: 2.1.3
% 4.87/1.65 % (975459)Termination reason: Refutation not found, incomplete strategy
% 4.87/1.65 % (975459)Time elapsed: 0.002 s
% 4.87/1.65 % (975459)Peak memory usage: 89 MB
% 4.87/1.65 % (975459)Instructions burned: 2 (million)
% 4.87/1.65 % (975460)Also succeeded, but the first one will report.
% 4.87/1.65 % (975447)------------------------------
% 4.87/1.65 % (975447)------------------------------
% 4.87/1.65 % (975464)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=696740972:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 4.87/1.65 % (975464)Instruction limit reached!
% 4.87/1.65 % (975464)------------------------------
% 4.87/1.65 % (975464)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.87/1.65 % (975464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.87/1.65 % (975464)CaDiCaL version: 2.1.3
% 4.87/1.65 % (975464)Termination reason: Instruction limit
% 4.87/1.65 % (975464)Termination phase: Saturation
% 4.87/1.65 % (975464)Time elapsed: 0.069 s
% 4.87/1.65 % (975464)Peak memory usage: 90 MB
% 4.87/1.65 % (975464)Instructions burned: 249 (million)
% 4.87/1.65 % (975446)Also succeeded, but the first one will report.
% 4.87/1.65 % (975458)Refutation found. Thanks to Tanya!
% 4.87/1.65 % SZS status Theorem for theBenchmark
% 4.87/1.65 % SZS output start Proof for theBenchmark
% See solution above
% 4.87/1.65 % (975458)------------------------------
% 4.87/1.65 % (975458)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.87/1.65 % (975458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.87/1.65 % (975458)CaDiCaL version: 2.1.3
% 4.87/1.65 % (975458)Termination reason: Refutation
% 4.87/1.65 % (975458)Time elapsed: 0.008 s
% 4.87/1.65 % (975458)Peak memory usage: 89 MB
% 4.87/1.65 % (975458)Instructions burned: 10 (million)
% 4.87/1.65 % (975458)------------------------------
% 4.87/1.65 % (975458)------------------------------
% 4.87/1.65 % (975439)Success in time 0.604 s
% 4.87/1.65 % Vampire exiting
%------------------------------------------------------------------------------