%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO009+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 : n015.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.74s 1.53s
% Output : Refutation 5.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 25
% Syntax : Number of formulae : 169 ( 24 unt; 11 def)
% Number of atoms : 550 ( 19 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 654 ( 273 ~; 266 |; 87 &)
% ( 19 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 24 ( 22 usr; 12 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 211 ( 0 sgn 181 !; 30 ?)
% 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(f8,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(f9,axiom,
! [X0] :
( legal(X0)
=> arboreal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f15,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ~ root(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_14) ).
fof(f17,axiom,
! [X0,X1] :
( root(X0,X1)
=> legal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_16) ).
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(f23,axiom,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ~ ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
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/sandbox2/benchmark/theBenchmark.p',sos_28) ).
fof(f34,axiom,
! [X0,X1] :
( root_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_33) ).
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,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35) ).
fof(f40,axiom,
atomic(tptp2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_39) ).
fof(f41,axiom,
atomic(tptp1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_40) ).
fof(f49,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)
& leaf_occ(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f50,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)
& leaf_occ(X2,X0) ) ),
inference(negated_conjecture,[status(cth)],[f49]) ).
fof(f53,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f54,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f53]) ).
fof(f61,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f62,plain,
! [X0] :
( arboreal(X0)
| ~ legal(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f70,plain,
! [X0,X1] :
( legal(X0)
| ~ root(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f78,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(f79,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) ) ),
inference(ennf_transformation,[],[f23]) ).
fof(f86,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(f87,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,[],[f86]) ).
fof(f96,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,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X2,X3,tptp0)
& leaf_occ(X3,X0) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f97,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)
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f99,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f61]) ).
fof(f105,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,[],[f78]) ).
fof(f106,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,[],[f105]) ).
fof(f107,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,[],[f106]) ).
fof(f108,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| min_precedes(X0,sK5(X0,X1),X1) )
& ( ( ( root(X0,X1)
| min_precedes(sK6(X0,X1),X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X3,sK5(X0,X1)),skolemize(X4,sK6(X0,X1))],[f107]) ).
fof(f109,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f79]) ).
fof(f110,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(flattening,[],[f109]) ).
fof(f111,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X4] :
( ~ min_precedes(X0,X4,X2)
| ~ min_precedes(X4,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(rectify,[],[f110]) ).
fof(f112,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK7(X0,X1,X2),X2)
& min_precedes(sK7(X0,X1,X2),X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X4] :
( ~ min_precedes(X0,X4,X2)
| ~ min_precedes(X4,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X3,sK7(X0,X1,X2))],[f111]) ).
fof(f120,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) )
| ~ root_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f121,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ? [X3] :
( occurrence_of(X1,X3)
& subactivity_occurrence(X0,X1)
& root(X0,X3) )
| ~ root_occ(X0,X1) ) ),
inference(rectify,[],[f120]) ).
fof(f122,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ( occurrence_of(X1,sK13(X0,X1))
& subactivity_occurrence(X0,X1)
& root(X0,sK13(X0,X1)) )
| ~ root_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X3,sK13(X0,X1))],[f121]) ).
fof(f123,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(f124,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,[],[f123]) ).
fof(f125,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ( occurrence_of(X1,sK14(X0,X1))
& subactivity_occurrence(X0,X1)
& leaf(X0,sK14(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X3,sK14(X0,X1))],[f124]) ).
fof(f126,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),tptp2)
| occurrence_of(sK17(X0),tptp1) )
& 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))],[f96]) ).
fof(f127,plain,
( ! [X1,X2] :
( ~ occurrence_of(X1,tptp3)
| ~ root_occ(X1,sK18)
| ( ~ occurrence_of(X2,tptp2)
& ~ occurrence_of(X2,tptp1) )
| ~ min_precedes(X1,X2,tptp0)
| ~ leaf_occ(X2,sK18) )
& occurrence_of(sK18,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18]),skolemize(X0,sK18)],[f97]) ).
fof(f132,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f54]) ).
fof(f138,plain,
! [X0,X1] :
( ~ atomic(X1)
| arboreal(X0)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f99]) ).
fof(f139,plain,
! [X0] :
( ~ legal(X0)
| arboreal(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f152,plain,
! [X2,X0,X1] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f68]) ).
fof(f154,plain,
! [X0,X1] :
( ~ root(X0,X1)
| legal(X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f159,plain,
! [X0,X1,X5] :
( ~ leaf(X0,X1)
| ~ min_precedes(X0,X5,X1) ),
inference(cnf_transformation,[],[f108]) ).
fof(f164,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f112]) ).
fof(f180,plain,
! [X2,X3,X0,X1] :
( ~ arboreal(X3)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| min_precedes(X2,X3,X0)
| ~ subactivity_occurrence(X2,X1)
| ~ subactivity_occurrence(X3,X1) ),
inference(cnf_transformation,[],[f87]) ).
fof(f186,plain,
! [X0,X1] :
( root(X0,sK13(X0,X1))
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f187,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f188,plain,
! [X0,X1] :
( occurrence_of(X1,sK13(X0,X1))
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f190,plain,
! [X0,X1] :
( leaf(X0,sK14(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f191,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f192,plain,
! [X0,X1] :
( occurrence_of(X1,sK14(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f194,plain,
! [X0] :
( leaf_occ(sK17(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f196,plain,
! [X0] :
( occurrence_of(sK17(X0),tptp1)
| occurrence_of(sK17(X0),tptp2)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f197,plain,
! [X0] :
( next_subocc(sK15(X0),sK16(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f199,plain,
! [X0] :
( root_occ(sK15(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f200,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sK15(X0),tptp3) ),
inference(cnf_transformation,[],[f126]) ).
fof(f204,plain,
atomic(tptp2),
inference(cnf_transformation,[],[f40]) ).
fof(f205,plain,
atomic(tptp1),
inference(cnf_transformation,[],[f41]) ).
fof(f213,plain,
occurrence_of(sK18,tptp0),
inference(cnf_transformation,[],[f127]) ).
fof(f214,plain,
! [X2,X1] :
( ~ occurrence_of(X1,tptp3)
| ~ root_occ(X1,sK18)
| ~ occurrence_of(X2,tptp1)
| ~ min_precedes(X1,X2,tptp0)
| ~ leaf_occ(X2,sK18) ),
inference(cnf_transformation,[],[f127]) ).
fof(f215,plain,
! [X2,X1] :
( ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,sK18)
| ~ occurrence_of(X1,tptp3)
| ~ min_precedes(X1,X2,tptp0)
| ~ leaf_occ(X2,sK18) ),
inference(cnf_transformation,[],[f127]) ).
fof(f216,plain,
! [X0] :
( ~ occurrence_of(sK18,X0)
| tptp0 = X0 ),
inference(resolution,[],[f132,f213]) ).
fof(f221,plain,
! [X0] :
( min_precedes(sK15(X0),sK16(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f197,f164]) ).
fof(f224,plain,
! [X0] :
( ~ occurrence_of(X0,tptp1)
| arboreal(X0) ),
inference(resolution,[],[f205,f138]) ).
fof(f226,plain,
! [X0] :
( arboreal(X0)
| ~ occurrence_of(X0,tptp2) ),
inference(resolution,[],[f204,f138]) ).
fof(f233,plain,
occurrence_of(sK15(sK18),tptp3),
inference(resolution,[],[f200,f213]) ).
fof(f234,plain,
! [X0] :
( ~ root_occ(sK15(sK18),sK18)
| ~ occurrence_of(X0,tptp1)
| ~ min_precedes(sK15(sK18),X0,tptp0)
| ~ leaf_occ(X0,sK18) ),
inference(resolution,[],[f233,f214]) ).
fof(f237,definition,
( spl19_1
<=> ! [X0] :
( ~ occurrence_of(X0,tptp1)
| ~ leaf_occ(X0,sK18)
| ~ min_precedes(sK15(sK18),X0,tptp0) ) ),
introduced(definition,[new_symbols(definition,[spl19_1])],[avatar_definition]) ).
fof(f238,plain,
( ! [X0] :
( ~ leaf_occ(X0,sK18)
| ~ occurrence_of(X0,tptp1)
| ~ min_precedes(sK15(sK18),X0,tptp0) )
| ~ spl19_1 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f240,definition,
( spl19_2
<=> root_occ(sK15(sK18),sK18) ),
introduced(definition,[new_symbols(definition,[spl19_2])],[avatar_definition]) ).
fof(f241,plain,
( ~ root_occ(sK15(sK18),sK18)
| spl19_2 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f242,plain,
( spl19_1
| ~ spl19_2 ),
inference(avatar_split_clause,[],[f234,f240,f237]) ).
fof(f244,plain,
( ~ occurrence_of(sK18,tptp0)
| spl19_2 ),
inference(resolution,[],[f241,f199]) ).
fof(f246,plain,
( $false
| spl19_2 ),
inference(forward_subsumption_resolution,[],[f244,f213]) ).
fof(f247,plain,
spl19_2,
inference(avatar_contradiction_clause,[],[f246]) ).
fof(f248,plain,
( ~ occurrence_of(sK17(sK18),tptp1)
| ~ min_precedes(sK15(sK18),sK17(sK18),tptp0)
| ~ occurrence_of(sK18,tptp0)
| ~ spl19_1 ),
inference(resolution,[],[f238,f194]) ).
fof(f249,plain,
( ~ occurrence_of(sK17(sK18),tptp1)
| ~ min_precedes(sK15(sK18),sK17(sK18),tptp0)
| ~ spl19_1 ),
inference(forward_subsumption_resolution,[],[f248,f213]) ).
fof(f251,definition,
( spl19_3
<=> min_precedes(sK15(sK18),sK17(sK18),tptp0) ),
introduced(definition,[new_symbols(definition,[spl19_3])],[avatar_definition]) ).
fof(f252,plain,
( ~ min_precedes(sK15(sK18),sK17(sK18),tptp0)
| spl19_3 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f254,definition,
( spl19_4
<=> occurrence_of(sK17(sK18),tptp1) ),
introduced(definition,[new_symbols(definition,[spl19_4])],[avatar_definition]) ).
fof(f255,plain,
( ~ occurrence_of(sK17(sK18),tptp1)
| spl19_4 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f256,plain,
( ~ spl19_3
| ~ spl19_4
| ~ spl19_1 ),
inference(avatar_split_clause,[],[f249,f237,f254,f251]) ).
fof(f258,plain,
! [X0] :
( ~ root_occ(X0,sK18)
| tptp0 = sK13(X0,sK18) ),
inference(resolution,[],[f216,f188]) ).
fof(f259,plain,
! [X0] :
( ~ leaf_occ(X0,sK18)
| tptp0 = sK14(X0,sK18) ),
inference(resolution,[],[f216,f192]) ).
fof(f268,definition,
( spl19_5
<=> occurrence_of(sK17(sK18),tptp2) ),
introduced(definition,[new_symbols(definition,[spl19_5])],[avatar_definition]) ).
fof(f269,plain,
( occurrence_of(sK17(sK18),tptp2)
| ~ spl19_5 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f274,plain,
( ! [X0] :
( ~ root_occ(X0,sK18)
| ~ occurrence_of(X0,tptp3)
| ~ min_precedes(X0,sK17(sK18),tptp0)
| ~ leaf_occ(sK17(sK18),sK18) )
| ~ spl19_5 ),
inference(resolution,[],[f269,f215]) ).
fof(f277,definition,
( spl19_7
<=> leaf_occ(sK17(sK18),sK18) ),
introduced(definition,[new_symbols(definition,[spl19_7])],[avatar_definition]) ).
fof(f278,plain,
( ~ leaf_occ(sK17(sK18),sK18)
| spl19_7 ),
inference(avatar_component_clause,[],[f277]) ).
fof(f280,definition,
( spl19_8
<=> ! [X0] :
( ~ root_occ(X0,sK18)
| ~ min_precedes(X0,sK17(sK18),tptp0)
| ~ occurrence_of(X0,tptp3) ) ),
introduced(definition,[new_symbols(definition,[spl19_8])],[avatar_definition]) ).
fof(f281,plain,
( ! [X0] :
( ~ root_occ(X0,sK18)
| ~ min_precedes(X0,sK17(sK18),tptp0)
| ~ occurrence_of(X0,tptp3) )
| ~ spl19_8 ),
inference(avatar_component_clause,[],[f280]) ).
fof(f282,plain,
( ~ spl19_7
| spl19_8
| ~ spl19_5 ),
inference(avatar_split_clause,[],[f274,f268,f280,f277]) ).
fof(f284,plain,
( ~ occurrence_of(sK18,tptp0)
| spl19_7 ),
inference(resolution,[],[f278,f194]) ).
fof(f286,plain,
( $false
| spl19_7 ),
inference(forward_subsumption_resolution,[],[f284,f213]) ).
fof(f287,plain,
spl19_7,
inference(avatar_contradiction_clause,[],[f286]) ).
fof(f295,plain,
( tptp0 = sK13(sK15(sK18),sK18)
| ~ occurrence_of(sK18,tptp0) ),
inference(resolution,[],[f258,f199]) ).
fof(f296,plain,
tptp0 = sK13(sK15(sK18),sK18),
inference(forward_subsumption_resolution,[],[f295,f213]) ).
fof(f297,plain,
( root(sK15(sK18),tptp0)
| ~ root_occ(sK15(sK18),sK18) ),
inference(superposition,[],[f186,f296]) ).
fof(f300,definition,
( spl19_9
<=> root(sK15(sK18),tptp0) ),
introduced(definition,[new_symbols(definition,[spl19_9])],[avatar_definition]) ).
fof(f301,plain,
( root(sK15(sK18),tptp0)
| ~ spl19_9 ),
inference(avatar_component_clause,[],[f300]) ).
fof(f302,plain,
( ~ spl19_2
| spl19_9 ),
inference(avatar_split_clause,[],[f297,f300,f240]) ).
fof(f303,plain,
( ! [X0] : ~ min_precedes(X0,sK15(sK18),tptp0)
| ~ spl19_9 ),
inference(resolution,[],[f301,f152]) ).
fof(f306,plain,
( tptp0 = sK14(sK17(sK18),sK18)
| ~ occurrence_of(sK18,tptp0) ),
inference(resolution,[],[f259,f194]) ).
fof(f307,plain,
tptp0 = sK14(sK17(sK18),sK18),
inference(forward_subsumption_resolution,[],[f306,f213]) ).
fof(f308,plain,
( leaf(sK17(sK18),tptp0)
| ~ leaf_occ(sK17(sK18),sK18) ),
inference(superposition,[],[f190,f307]) ).
fof(f311,definition,
( spl19_10
<=> leaf(sK17(sK18),tptp0) ),
introduced(definition,[new_symbols(definition,[spl19_10])],[avatar_definition]) ).
fof(f312,plain,
( leaf(sK17(sK18),tptp0)
| ~ spl19_10 ),
inference(avatar_component_clause,[],[f311]) ).
fof(f313,plain,
( ~ spl19_7
| spl19_10 ),
inference(avatar_split_clause,[],[f308,f311,f277]) ).
fof(f314,plain,
( ! [X0] : ~ min_precedes(sK17(sK18),X0,tptp0)
| ~ spl19_10 ),
inference(resolution,[],[f312,f159]) ).
fof(f343,plain,
( ~ min_precedes(sK15(sK18),sK17(sK18),tptp0)
| ~ occurrence_of(sK15(sK18),tptp3)
| ~ occurrence_of(sK18,tptp0)
| ~ spl19_8 ),
inference(resolution,[],[f281,f199]) ).
fof(f378,plain,
( root_occ(sK15(sK18),sK18)
| ~ spl19_2 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f385,plain,
( subactivity_occurrence(sK15(sK18),sK18)
| ~ spl19_2 ),
inference(resolution,[],[f378,f187]) ).
fof(f389,plain,
( leaf_occ(sK17(sK18),sK18)
| ~ spl19_7 ),
inference(avatar_component_clause,[],[f277]) ).
fof(f396,plain,
( subactivity_occurrence(sK17(sK18),sK18)
| ~ spl19_7 ),
inference(resolution,[],[f389,f191]) ).
fof(f404,plain,
( legal(sK15(sK18))
| ~ spl19_9 ),
inference(resolution,[],[f154,f301]) ).
fof(f405,plain,
! [X0] :
( arboreal(sK17(X0))
| occurrence_of(sK17(X0),tptp2)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f224,f196]) ).
fof(f406,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| arboreal(sK17(X0)) ),
inference(forward_subsumption_resolution,[],[f405,f226]) ).
fof(f407,plain,
arboreal(sK17(sK18)),
inference(resolution,[],[f406,f213]) ).
fof(f409,plain,
! [X2,X0,X1] :
( ~ arboreal(X0)
| sK17(sK18) = X0
| ~ occurrence_of(X2,X1)
| min_precedes(sK17(sK18),X0,X1)
| min_precedes(X0,sK17(sK18),X1)
| ~ subactivity_occurrence(X0,X2)
| ~ subactivity_occurrence(sK17(sK18),X2) ),
inference(resolution,[],[f407,f180]) ).
fof(f415,plain,
( arboreal(sK15(sK18))
| ~ spl19_9 ),
inference(resolution,[],[f404,f139]) ).
fof(f416,plain,
( ! [X0,X1] :
( sK15(sK18) = sK17(sK18)
| ~ occurrence_of(X0,X1)
| min_precedes(sK17(sK18),sK15(sK18),X1)
| min_precedes(sK15(sK18),sK17(sK18),X1)
| ~ subactivity_occurrence(sK15(sK18),X0)
| ~ subactivity_occurrence(sK17(sK18),X0) )
| ~ spl19_9 ),
inference(resolution,[],[f415,f409]) ).
fof(f420,definition,
( spl19_19
<=> ! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ subactivity_occurrence(sK17(sK18),X0)
| ~ subactivity_occurrence(sK15(sK18),X0)
| min_precedes(sK15(sK18),sK17(sK18),X1)
| min_precedes(sK17(sK18),sK15(sK18),X1) ) ),
introduced(definition,[new_symbols(definition,[spl19_19])],[avatar_definition]) ).
fof(f421,plain,
( ! [X0,X1] :
( ~ subactivity_occurrence(sK17(sK18),X0)
| ~ occurrence_of(X0,X1)
| ~ subactivity_occurrence(sK15(sK18),X0)
| min_precedes(sK15(sK18),sK17(sK18),X1)
| min_precedes(sK17(sK18),sK15(sK18),X1) )
| ~ spl19_19 ),
inference(avatar_component_clause,[],[f420]) ).
fof(f423,definition,
( spl19_20
<=> sK15(sK18) = sK17(sK18) ),
introduced(definition,[new_symbols(definition,[spl19_20])],[avatar_definition]) ).
fof(f424,plain,
( sK15(sK18) = sK17(sK18)
| ~ spl19_20 ),
inference(avatar_component_clause,[],[f423]) ).
fof(f425,plain,
( spl19_19
| spl19_20
| ~ spl19_9 ),
inference(avatar_split_clause,[],[f416,f300,f423,f420]) ).
fof(f426,plain,
( $false
| ~ spl19_2
| spl19_3
| ~ spl19_7
| ~ spl19_9
| ~ spl19_19 ),
inference(unit_resulting_resolution,[],[f421,f213,f396,f385,f303,f252]) ).
fof(f432,plain,
( ~ spl19_2
| spl19_3
| ~ spl19_7
| ~ spl19_9
| ~ spl19_19 ),
inference(avatar_contradiction_clause,[],[f426]) ).
fof(f448,plain,
( min_precedes(sK17(sK18),sK16(sK18),tptp0)
| ~ occurrence_of(sK18,tptp0)
| ~ spl19_20 ),
inference(superposition,[],[f221,f424]) ).
fof(f453,plain,
( ~ occurrence_of(sK18,tptp0)
| ~ spl19_10
| ~ spl19_20 ),
inference(forward_subsumption_resolution,[],[f448,f314]) ).
fof(f454,plain,
( $false
| ~ spl19_10
| ~ spl19_20 ),
inference(forward_subsumption_resolution,[],[f453,f213]) ).
fof(f455,plain,
( ~ spl19_10
| ~ spl19_20 ),
inference(avatar_contradiction_clause,[],[f454]) ).
fof(f457,plain,
( ~ min_precedes(sK15(sK18),sK17(sK18),tptp0)
| ~ occurrence_of(sK18,tptp0)
| ~ spl19_8 ),
inference(forward_subsumption_resolution,[],[f343,f200]) ).
fof(f459,plain,
( ~ min_precedes(sK15(sK18),sK17(sK18),tptp0)
| ~ spl19_8 ),
inference(forward_subsumption_resolution,[],[f457,f213]) ).
fof(f461,plain,
( ~ spl19_3
| ~ spl19_8 ),
inference(avatar_split_clause,[],[f459,f280,f251]) ).
fof(f462,plain,
( occurrence_of(sK17(sK18),tptp2)
| ~ occurrence_of(sK18,tptp0)
| spl19_4 ),
inference(resolution,[],[f255,f196]) ).
fof(f463,plain,
( occurrence_of(sK17(sK18),tptp2)
| spl19_4 ),
inference(forward_subsumption_resolution,[],[f462,f213]) ).
fof(f464,plain,
( spl19_5
| spl19_4 ),
inference(avatar_split_clause,[],[f463,f254,f268]) ).
cnf(s1,plain,
( spl19_1
| ~ spl19_2 ),
inference(sat_conversion,[],[f242]) ).
cnf(s3,plain,
spl19_2,
inference(sat_conversion,[],[f247]) ).
cnf(s4,plain,
( ~ spl19_1
| ~ spl19_3
| ~ spl19_4 ),
inference(sat_conversion,[],[f256]) ).
cnf(s6,plain,
( ~ spl19_5
| ~ spl19_7
| spl19_8 ),
inference(sat_conversion,[],[f282]) ).
cnf(s8,plain,
spl19_7,
inference(sat_conversion,[],[f287]) ).
cnf(s9,plain,
( ~ spl19_2
| spl19_9 ),
inference(sat_conversion,[],[f302]) ).
cnf(s10,plain,
( ~ spl19_7
| spl19_10 ),
inference(sat_conversion,[],[f313]) ).
cnf(s20,plain,
( ~ spl19_9
| spl19_19
| spl19_20 ),
inference(sat_conversion,[],[f425]) ).
cnf(s21,plain,
( ~ spl19_2
| spl19_3
| ~ spl19_7
| ~ spl19_9
| ~ spl19_19 ),
inference(sat_conversion,[],[f432]) ).
cnf(s23,plain,
( ~ spl19_10
| ~ spl19_20 ),
inference(sat_conversion,[],[f455]) ).
cnf(s25,plain,
( ~ spl19_3
| ~ spl19_8 ),
inference(sat_conversion,[],[f461]) ).
cnf(s26,plain,
( spl19_4
| spl19_5 ),
inference(sat_conversion,[],[f464]) ).
cnf(s28,plain,
spl19_10,
inference(rat,[],[s10,s8]) ).
cnf(s29,plain,
~ spl19_20,
inference(rat,[],[s23,s28]) ).
cnf(s30,plain,
( ~ spl19_5
| spl19_8 ),
inference(rat,[],[s6,s8]) ).
cnf(s31,plain,
spl19_9,
inference(rat,[],[s9,s3]) ).
cnf(s32,plain,
spl19_19,
inference(rat,[],[s20,s29,s31]) ).
cnf(s33,plain,
spl19_3,
inference(rat,[],[s21,s32,s3,s8,s31]) ).
cnf(s34,plain,
~ spl19_8,
inference(rat,[],[s25,s33]) ).
cnf(s35,plain,
~ spl19_5,
inference(rat,[],[s30,s34]) ).
cnf(s36,plain,
spl19_4,
inference(rat,[],[s26,s35]) ).
cnf(s39,plain,
~ spl19_1,
inference(rat,[],[s4,s33,s36]) ).
cnf(s41,plain,
$false,
inference(rat,[],[s1,s3,s39]) ).
fof(f465,plain,
$false,
inference(avatar_sat_refutation,[],[s41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO009+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 : n015.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.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 22:22:31 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.40 Running first-order theorem proving
% 0.11/0.40 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
% 4.74/1.53 % (2073183)Detected formulas, will run a generic FOF schedule.
% 4.74/1.53 % (2073189)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=2297506594:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.74/1.53 % (2073194)dis-21_1_sil=8000:lcm=predicate:random_seed=2613236936: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)
% 4.74/1.53 % (2073190)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=1447166456:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.74/1.53 % (2073191)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=147599111:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.74/1.53 % (2073188)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=1837751529:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.74/1.53 % (2073192)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1696144560:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.74/1.53 % (2073193)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=643598017:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.74/1.53 % (2073191)Refutation not found, incomplete strategy
% 4.74/1.53 % (2073191)------------------------------
% 4.74/1.53 % (2073191)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.53 % (2073191)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.53 % (2073191)CaDiCaL version: 2.1.3
% 4.74/1.53 % (2073191)Termination reason: Refutation not found, incomplete strategy
% 4.74/1.53 % (2073191)Time elapsed: 0.001 s
% 4.74/1.53 % (2073191)Peak memory usage: 87 MB
% 4.74/1.53 % (2073192)Instruction limit reached!
% 4.74/1.53 % (2073192)------------------------------
% 4.74/1.53 % (2073192)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.53 % (2073192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.53 % (2073192)CaDiCaL version: 2.1.3
% 4.74/1.53 % (2073192)Termination reason: Instruction limit
% 4.74/1.53 % (2073192)Termination phase: Saturation
% 4.74/1.53 % (2073192)Time elapsed: 0.057 s
% 4.74/1.53 % (2073192)Peak memory usage: 88 MB
% 4.74/1.53 % (2073192)Instructions burned: 119 (million)
% 4.74/1.53 % (2073194)Instruction limit reached!
% 4.74/1.53 % (2073194)------------------------------
% 4.74/1.53 % (2073194)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.53 % (2073194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.53 % (2073194)CaDiCaL version: 2.1.3
% 4.74/1.53 % (2073194)Termination reason: Instruction limit
% 4.74/1.53 % (2073194)Termination phase: Saturation
% 4.74/1.53 % (2073194)Time elapsed: 0.081 s
% 4.74/1.53 % (2073194)Peak memory usage: 89 MB
% 4.74/1.53 % (2073194)Instructions burned: 130 (million)
% 4.74/1.53 % (2073193)Instruction limit reached!
% 4.74/1.53 % (2073193)------------------------------
% 4.74/1.53 % (2073193)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.53 % (2073193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.53 % (2073193)CaDiCaL version: 2.1.3
% 4.74/1.53 % (2073193)Termination reason: Instruction limit
% 4.74/1.53 % (2073193)Termination phase: Saturation
% 4.74/1.53 % (2073193)Time elapsed: 0.100 s
% 4.74/1.53 % (2073193)Peak memory usage: 90 MB
% 4.74/1.53 % (2073193)Instructions burned: 140 (million)
% 4.74/1.53 % (2073202)lrs+10_1_sil=8000:sp=occurrence:random_seed=2387049563:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.74/1.53 % (2073203)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3646561433:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.74/1.53 % (2073203)Refutation not found, incomplete strategy
% 4.74/1.53 % (2073203)------------------------------
% 4.74/1.53 % (2073203)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.53 % (2073203)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.53 % (2073203)CaDiCaL version: 2.1.3
% 4.74/1.53 % (2073203)Termination reason: Refutation not found, incomplete strategy
% 4.74/1.53 % (2073203)Time elapsed: 0.002 s
% 4.74/1.53 % (2073203)Peak memory usage: 88 MB
% 4.74/1.53 % (2073203)Instructions burned: 1 (million)
% 4.74/1.53 % (2073191)------------------------------
% 4.74/1.53 % (2073191)------------------------------
% 4.74/1.53 % (2073204)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2407830100:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.74/1.53 % (2073189)First to succeed.
% 4.74/1.53 % (2073189)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2073183"
% 4.74/1.53 % (2073202)Instruction limit reached!
% 4.74/1.53 % (2073202)------------------------------
% 4.74/1.53 % (2073202)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.53 % (2073202)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.53 % (2073202)CaDiCaL version: 2.1.3
% 4.74/1.53 % (2073202)Termination reason: Instruction limit
% 4.74/1.53 % (2073202)Termination phase: Saturation
% 4.74/1.53 % (2073202)Time elapsed: 0.194 s
% 4.74/1.53 % (2073202)Peak memory usage: 92 MB
% 4.74/1.53 % (2073202)Instructions burned: 286 (million)
% 4.74/1.53 % (2073208)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=3230792702:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 4.74/1.53 % (2073203)------------------------------
% 4.74/1.53 % (2073203)------------------------------
% 4.74/1.53 % (2073204)Instruction limit reached!
% 4.74/1.53 % (2073204)------------------------------
% 4.74/1.53 % (2073204)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.53 % (2073204)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.53 % (2073204)CaDiCaL version: 2.1.3
% 4.74/1.53 % (2073204)Termination reason: Instruction limit
% 4.74/1.53 % (2073204)Termination phase: Saturation
% 4.74/1.53 % (2073204)Time elapsed: 0.220 s
% 4.74/1.53 % (2073204)Peak memory usage: 93 MB
% 4.74/1.53 % (2073204)Instructions burned: 326 (million)
% 4.74/1.53 % (2073189)Refutation found. Thanks to Tanya!
% 4.74/1.53 % SZS status Theorem for theBenchmark
% 4.74/1.53 % SZS output start Proof for theBenchmark
% See solution above
% 5.44/1.73 % (2073189)------------------------------
% 5.44/1.73 % (2073189)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.73 % (2073189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.73 % (2073189)CaDiCaL version: 2.1.3
% 5.44/1.73 % (2073189)Termination reason: Refutation
% 5.44/1.73 % (2073189)Time elapsed: 0.388 s
% 5.44/1.73 % (2073189)Peak memory usage: 130 MB
% 5.44/1.73 % (2073189)Instructions burned: 986 (million)
% 5.44/1.73 % (2073189)------------------------------
% 5.44/1.73 % (2073189)------------------------------
% 5.44/1.73 % (2073183)Success in time 0.68 s
% 5.44/1.73 % Vampire exiting
%------------------------------------------------------------------------------