%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO004+4 : 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 : n011.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:21 PM UTC 2026
% Result : Theorem 7.43s 1.95s
% Output : Refutation 9.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 23
% Syntax : Number of formulae : 145 ( 22 unt; 6 def)
% Number of atoms : 487 ( 18 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 596 ( 254 ~; 246 |; 73 &)
% ( 12 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 7 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 223 ( 0 sgn 199 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X1,X0)
& subactivity_occurrence(X2,X1)
& leaf_occ(X3,X1)
& arboreal(X2)
& ~ min_precedes(X2,X3,X0) )
=> X3 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(f7,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_06) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& leaf_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_09) ).
fof(f11,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_10) ).
fof(f14,axiom,
! [X0] :
( legal(X0)
=> arboreal(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_13) ).
fof(f17,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_16) ).
fof(f18,axiom,
! [X0,X1] :
( root(X0,X1)
=> legal(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_17) ).
fof(f19,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_18) ).
fof(f20,axiom,
! [X0,X1] :
( root_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_19) ).
fof(f27,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/sandbox/benchmark/theBenchmark.p',sos_26) ).
fof(f33,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( occurrence_of(X1,tptp4)
& root_occ(X1,X0)
& occurrence_of(X2,tptp3)
& leaf_occ(X2,X0)
& next_subocc(X1,X2,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(f39,axiom,
atomic(tptp1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_38) ).
fof(f43,axiom,
tptp1 != tptp3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_42) ).
fof(f47,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> root_occ(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_46) ).
fof(f48,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_47) ).
fof(f49,conjecture,
~ ? [X0] : occurrence_of(X0,tptp0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f50,negated_conjecture,
~ ~ ? [X0] : occurrence_of(X0,tptp0),
inference(negated_conjecture,[status(cth)],[f49]) ).
fof(f51,plain,
? [X0] : occurrence_of(X0,tptp0),
inference(flattening,[],[f50]) ).
fof(f56,plain,
! [X0,X1,X2,X3] :
( X3 = X2
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| ~ leaf_occ(X3,X1)
| ~ arboreal(X2)
| min_precedes(X2,X3,X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f57,plain,
! [X0,X1,X2,X3] :
( X3 = X2
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| ~ leaf_occ(X3,X1)
| ~ arboreal(X2)
| min_precedes(X2,X3,X0) ),
inference(flattening,[],[f56]) ).
fof(f62,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,[],[f7]) ).
fof(f65,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f66,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(flattening,[],[f69]) ).
fof(f73,plain,
! [X0] :
( arboreal(X0)
| ~ legal(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f75,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f76,plain,
! [X0,X1] :
( legal(X0)
| ~ root(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f82,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,[],[f27]) ).
fof(f93,plain,
! [X0] :
( ? [X1,X2] :
( occurrence_of(X1,tptp4)
& root_occ(X1,X0)
& occurrence_of(X2,tptp3)
& leaf_occ(X2,X0)
& next_subocc(X1,X2,tptp0) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f33]) ).
fof(f96,plain,
! [X0,X1] :
( root_occ(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f97,plain,
! [X0,X1] :
( root_occ(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f96]) ).
fof(f98,plain,
! [X0,X1] :
( ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f48]) ).
fof(f99,plain,
! [X0,X1] :
( ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f98]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK2(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK2(X0,X1,X2))
& subactivity_occurrence(X2,sK2(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f62]) ).
fof(f112,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f75]) ).
fof(f113,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,[],[f19]) ).
fof(f114,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,[],[f113]) ).
fof(f115,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))],[f114]) ).
fof(f116,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,[],[f20]) ).
fof(f117,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,[],[f116]) ).
fof(f118,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ( occurrence_of(X1,sK9(X0,X1))
& subactivity_occurrence(X0,X1)
& root(X0,sK9(X0,X1)) )
| ~ root_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f117]) ).
fof(f122,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,[],[f82]) ).
fof(f123,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,[],[f122]) ).
fof(f124,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,[],[f123]) ).
fof(f125,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK11(X0,X1,X2),X2)
& min_precedes(sK11(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,[sK11]),skolemize(X3,sK11(X0,X1,X2))],[f124]) ).
fof(f126,plain,
! [X0] :
( ( occurrence_of(sK12(X0),tptp4)
& root_occ(sK12(X0),X0)
& occurrence_of(sK13(X0),tptp3)
& leaf_occ(sK13(X0),X0)
& next_subocc(sK12(X0),sK13(X0),tptp0) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X1,sK12(X0)),skolemize(X2,sK13(X0))],[f93]) ).
fof(f127,plain,
! [X0,X1] :
( ( occurrence_of(sK14(X0),tptp1)
& next_subocc(X0,sK14(X0),tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X2,sK14(X0))],[f99]) ).
fof(f128,plain,
occurrence_of(sK15,tptp0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15]),skolemize(X0,sK15)],[f51]) ).
fof(f132,plain,
! [X2,X3,X0,X1] :
( ~ arboreal(X2)
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| ~ leaf_occ(X3,X1)
| X2 = X3
| min_precedes(X2,X3,X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f138,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f140,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| occurrence_of(sK2(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f143,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f66]) ).
fof(f144,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f68]) ).
fof(f145,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f150,plain,
! [X0] :
( ~ legal(X0)
| arboreal(X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f160,plain,
! [X0,X1] :
( ~ atomic(X1)
| arboreal(X0)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
fof(f161,plain,
! [X0,X1] :
( ~ root(X0,X1)
| legal(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f163,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f166,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| root(X0,sK9(X0,X1)) ),
inference(cnf_transformation,[],[f118]) ).
fof(f167,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f181,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f125]) ).
fof(f189,plain,
! [X0] :
( next_subocc(sK12(X0),sK13(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f190,plain,
! [X0] :
( leaf_occ(sK13(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f191,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sK13(X0),tptp3) ),
inference(cnf_transformation,[],[f126]) ).
fof(f192,plain,
! [X0] :
( root_occ(sK12(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f199,plain,
atomic(tptp1),
inference(cnf_transformation,[],[f39]) ).
fof(f203,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f43]) ).
fof(f207,plain,
! [X0,X1] :
( ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| root_occ(X0,X1)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f208,plain,
! [X0,X1] :
( ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| next_subocc(X0,sK14(X0),tptp0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f209,plain,
! [X0,X1] :
( ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK14(X0),tptp1)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f210,plain,
occurrence_of(sK15,tptp0),
inference(cnf_transformation,[],[f128]) ).
fof(f214,plain,
! [X0] :
( subactivity_occurrence(sK12(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f167,f192]) ).
fof(f223,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| min_precedes(sK12(X0),sK13(X0),tptp0) ),
inference(resolution,[],[f189,f181]) ).
fof(f224,plain,
min_precedes(sK12(sK15),sK13(sK15),tptp0),
inference(resolution,[],[f223,f210]) ).
fof(f226,plain,
! [X0] :
( ~ leaf_occ(sK12(sK15),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f224,f144]) ).
fof(f285,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| root(sK12(X0),sK9(sK12(X0),X0)) ),
inference(resolution,[],[f166,f192]) ).
fof(f286,plain,
root(sK12(sK15),sK9(sK12(sK15),sK15)),
inference(resolution,[],[f285,f210]) ).
fof(f287,plain,
legal(sK12(sK15)),
inference(resolution,[],[f286,f161]) ).
fof(f289,plain,
! [X0] :
( ~ occurrence_of(X0,tptp1)
| arboreal(X0) ),
inference(resolution,[],[f199,f160]) ).
fof(f361,plain,
arboreal(sK12(sK15)),
inference(resolution,[],[f287,f150]) ).
fof(f364,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK12(sK15),X0)
| occurrence_of(sK14(sK12(sK15)),tptp1)
| leaf_occ(sK12(sK15),X0) ),
inference(resolution,[],[f361,f209]) ).
fof(f365,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK12(sK15),X0)
| next_subocc(sK12(sK15),sK14(sK12(sK15)),tptp0)
| leaf_occ(sK12(sK15),X0) ),
inference(resolution,[],[f361,f208]) ).
fof(f367,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK12(sK15),X0)
| next_subocc(sK12(sK15),sK14(sK12(sK15)),tptp0) ),
inference(forward_subsumption_resolution,[],[f365,f226]) ).
fof(f368,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK12(sK15),X0)
| occurrence_of(sK14(sK12(sK15)),tptp1) ),
inference(forward_subsumption_resolution,[],[f364,f226]) ).
fof(f370,definition,
( spl16_15
<=> next_subocc(sK12(sK15),sK14(sK12(sK15)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl16_15])],[avatar_definition]) ).
fof(f371,plain,
( next_subocc(sK12(sK15),sK14(sK12(sK15)),tptp0)
| ~ spl16_15 ),
inference(avatar_component_clause,[],[f370]) ).
fof(f373,definition,
( spl16_16
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK12(sK15),X0) ) ),
introduced(definition,[new_symbols(definition,[spl16_16])],[avatar_definition]) ).
fof(f374,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK12(sK15),X0) )
| ~ spl16_16 ),
inference(avatar_component_clause,[],[f373]) ).
fof(f375,plain,
( spl16_15
| spl16_16 ),
inference(avatar_split_clause,[],[f367,f373,f370]) ).
fof(f377,definition,
( spl16_17
<=> occurrence_of(sK14(sK12(sK15)),tptp1) ),
introduced(definition,[new_symbols(definition,[spl16_17])],[avatar_definition]) ).
fof(f378,plain,
( occurrence_of(sK14(sK12(sK15)),tptp1)
| ~ spl16_17 ),
inference(avatar_component_clause,[],[f377]) ).
fof(f379,plain,
( spl16_17
| spl16_16 ),
inference(avatar_split_clause,[],[f368,f373,f377]) ).
fof(f381,plain,
( ~ subactivity_occurrence(sK12(sK15),sK15)
| ~ spl16_16 ),
inference(resolution,[],[f374,f210]) ).
fof(f383,plain,
( ~ occurrence_of(sK15,tptp0)
| ~ spl16_16 ),
inference(resolution,[],[f381,f214]) ).
fof(f385,plain,
( $false
| ~ spl16_16 ),
inference(forward_subsumption_resolution,[],[f383,f210]) ).
fof(f386,plain,
~ spl16_16,
inference(avatar_contradiction_clause,[],[f385]) ).
fof(f388,plain,
( ! [X0] :
( ~ occurrence_of(sK14(sK12(sK15)),X0)
| tptp1 = X0 )
| ~ spl16_17 ),
inference(resolution,[],[f378,f143]) ).
fof(f390,plain,
( min_precedes(sK12(sK15),sK14(sK12(sK15)),tptp0)
| ~ spl16_15 ),
inference(resolution,[],[f371,f181]) ).
fof(f392,plain,
( occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0)
| ~ spl16_15 ),
inference(resolution,[],[f390,f140]) ).
fof(f393,plain,
( ! [X0] :
( ~ root_occ(sK14(sK12(sK15)),X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl16_15 ),
inference(resolution,[],[f390,f145]) ).
fof(f395,plain,
( occurrence_of(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp3)
| ~ spl16_15 ),
inference(resolution,[],[f392,f191]) ).
fof(f576,plain,
( arboreal(sK14(sK12(sK15)))
| ~ spl16_17 ),
inference(resolution,[],[f289,f378]) ).
fof(f579,plain,
( ! [X2,X0,X1] :
( ~ leaf_occ(X2,X0)
| ~ subactivity_occurrence(sK14(sK12(sK15)),X0)
| ~ occurrence_of(X0,X1)
| sK14(sK12(sK15)) = X2
| min_precedes(sK14(sK12(sK15)),X2,X1) )
| ~ spl16_17 ),
inference(resolution,[],[f576,f132]) ).
fof(f582,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK14(sK12(sK15)),X0)
| root_occ(sK14(sK12(sK15)),X0)
| leaf_occ(sK14(sK12(sK15)),X0) )
| ~ spl16_17 ),
inference(resolution,[],[f576,f207]) ).
fof(f583,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK14(sK12(sK15)),X0)
| leaf_occ(sK14(sK12(sK15)),X0) )
| ~ spl16_15
| ~ spl16_17 ),
inference(forward_subsumption_resolution,[],[f582,f393]) ).
fof(f588,definition,
( spl16_29
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK14(sK12(sK15)),X0)
| ~ subactivity_occurrence(sK14(sK12(sK15)),X0) ) ),
introduced(definition,[new_symbols(definition,[spl16_29])],[avatar_definition]) ).
fof(f589,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK14(sK12(sK15)),X0)
| leaf_occ(sK14(sK12(sK15)),X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl16_29 ),
inference(avatar_component_clause,[],[f588]) ).
fof(f595,plain,
( spl16_29
| ~ spl16_15
| ~ spl16_17 ),
inference(avatar_split_clause,[],[f583,f377,f370,f588]) ).
fof(f596,plain,
( ! [X0,X1] :
( ~ occurrence_of(sK2(X0,X1,sK14(sK12(sK15))),tptp0)
| leaf_occ(sK14(sK12(sK15)),sK2(X0,X1,sK14(sK12(sK15))))
| ~ min_precedes(X1,sK14(sK12(sK15)),X0) )
| ~ spl16_29 ),
inference(resolution,[],[f589,f138]) ).
fof(f598,plain,
( ! [X0,X1] :
( ~ subactivity_occurrence(sK14(sK12(sK15)),X0)
| ~ occurrence_of(X0,X1)
| sK13(X0) = sK14(sK12(sK15))
| min_precedes(sK14(sK12(sK15)),sK13(X0),X1)
| ~ occurrence_of(X0,tptp0) )
| ~ spl16_17 ),
inference(resolution,[],[f579,f190]) ).
fof(f601,plain,
( leaf_occ(sK14(sK12(sK15)),sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ min_precedes(sK12(sK15),sK14(sK12(sK15)),tptp0)
| ~ spl16_15
| ~ spl16_29 ),
inference(resolution,[],[f596,f392]) ).
fof(f602,plain,
( leaf_occ(sK14(sK12(sK15)),sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ spl16_15
| ~ spl16_29 ),
inference(forward_subsumption_resolution,[],[f601,f390]) ).
fof(f608,plain,
( subactivity_occurrence(sK14(sK12(sK15)),sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ spl16_15
| ~ spl16_29 ),
inference(resolution,[],[f602,f163]) ).
fof(f637,plain,
( ! [X0] :
( ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),X0)
| sK14(sK12(sK15)) = sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| min_precedes(sK14(sK12(sK15)),sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),X0)
| ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0) )
| ~ spl16_15
| ~ spl16_17
| ~ spl16_29 ),
inference(resolution,[],[f608,f598]) ).
fof(f643,plain,
( ! [X0] :
( ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),X0)
| sK14(sK12(sK15)) = sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| min_precedes(sK14(sK12(sK15)),sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),X0) )
| ~ spl16_15
| ~ spl16_17
| ~ spl16_29 ),
inference(forward_subsumption_resolution,[],[f637,f392]) ).
fof(f646,definition,
( spl16_32
<=> sK14(sK12(sK15)) = sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))) ),
introduced(definition,[new_symbols(definition,[spl16_32])],[avatar_definition]) ).
fof(f647,plain,
( sK14(sK12(sK15)) = sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ spl16_32 ),
inference(avatar_component_clause,[],[f646]) ).
fof(f649,definition,
( spl16_33
<=> ! [X0] :
( ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),X0)
| min_precedes(sK14(sK12(sK15)),sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),X0) ) ),
introduced(definition,[new_symbols(definition,[spl16_33])],[avatar_definition]) ).
fof(f650,plain,
( ! [X0] :
( ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),X0)
| min_precedes(sK14(sK12(sK15)),sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),X0) )
| ~ spl16_33 ),
inference(avatar_component_clause,[],[f649]) ).
fof(f651,plain,
( spl16_32
| spl16_33
| ~ spl16_15
| ~ spl16_17
| ~ spl16_29 ),
inference(avatar_split_clause,[],[f643,f588,f377,f370,f649,f646]) ).
fof(f652,plain,
( occurrence_of(sK14(sK12(sK15)),tptp3)
| ~ spl16_15
| ~ spl16_32 ),
inference(superposition,[],[f395,f647]) ).
fof(f667,plain,
( tptp3 = tptp1
| ~ spl16_15
| ~ spl16_17
| ~ spl16_32 ),
inference(resolution,[],[f652,f388]) ).
fof(f674,plain,
( $false
| ~ spl16_15
| ~ spl16_17
| ~ spl16_32 ),
inference(forward_subsumption_resolution,[],[f667,f203]) ).
fof(f675,plain,
( ~ spl16_15
| ~ spl16_17
| ~ spl16_32 ),
inference(avatar_contradiction_clause,[],[f674]) ).
fof(f678,plain,
( min_precedes(sK14(sK12(sK15)),sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0)
| ~ spl16_15
| ~ spl16_33 ),
inference(resolution,[],[f650,f392]) ).
fof(f683,plain,
( $false
| ~ spl16_15
| ~ spl16_29
| ~ spl16_33 ),
inference(unit_resulting_resolution,[],[f144,f392,f602,f678]) ).
fof(f689,plain,
( ~ spl16_15
| ~ spl16_29
| ~ spl16_33 ),
inference(avatar_contradiction_clause,[],[f683]) ).
cnf(s13,plain,
( spl16_15
| spl16_16 ),
inference(sat_conversion,[],[f375]) ).
cnf(s14,plain,
( spl16_16
| spl16_17 ),
inference(sat_conversion,[],[f379]) ).
cnf(s16,plain,
~ spl16_16,
inference(sat_conversion,[],[f386]) ).
cnf(s36,plain,
( ~ spl16_15
| ~ spl16_17
| spl16_29 ),
inference(sat_conversion,[],[f595]) ).
cnf(s43,plain,
( ~ spl16_15
| ~ spl16_17
| ~ spl16_29
| spl16_32
| spl16_33 ),
inference(sat_conversion,[],[f651]) ).
cnf(s47,plain,
( ~ spl16_15
| ~ spl16_17
| ~ spl16_32 ),
inference(sat_conversion,[],[f675]) ).
cnf(s48,plain,
( ~ spl16_15
| ~ spl16_29
| ~ spl16_33 ),
inference(sat_conversion,[],[f689]) ).
cnf(s50,plain,
spl16_17,
inference(rat,[],[s14,s16]) ).
cnf(s51,plain,
spl16_15,
inference(rat,[],[s13,s16]) ).
cnf(s52,plain,
~ spl16_32,
inference(rat,[],[s47,s50,s51]) ).
cnf(s53,plain,
spl16_29,
inference(rat,[],[s36,s50,s51]) ).
cnf(s56,plain,
~ spl16_33,
inference(rat,[],[s48,s51,s53]) ).
cnf(s57,plain,
$false,
inference(rat,[],[s43,s51,s52,s50,s56,s53]) ).
fof(f690,plain,
$false,
inference(avatar_sat_refutation,[],[s57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO004+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.38 % Computer : n011.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8046.5625MB
% 0.14/0.38 % OS : Linux 6.8.0-71-generic
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Sun Sep 27 22:16:45 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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
% 7.43/1.95 % (2815998)Detected formulas, will run a generic FOF schedule.
% 7.43/1.95 % (2816046)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=2589311455:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 7.43/1.95 % (2816048)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2342791627:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 7.43/1.95 % (2816045)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=1233100937:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 7.43/1.95 % (2816051)dis-21_1_sil=8000:lcm=predicate:random_seed=3662952517: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)
% 7.43/1.95 % (2816049)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4020132600:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 7.43/1.95 % (2816044)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=2896523367:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 7.43/1.95 % (2816050)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2522696520:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 7.43/1.95 % (2816048)Refutation not found, incomplete strategy
% 7.43/1.95 % (2816048)------------------------------
% 7.43/1.95 % (2816048)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816048)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816048)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816048)Termination reason: Refutation not found, incomplete strategy
% 7.43/1.95 % (2816048)Time elapsed: 0.001 s
% 7.43/1.95 % (2816048)Peak memory usage: 86 MB
% 7.43/1.95 % (2816049)Instruction limit reached!
% 7.43/1.95 % (2816049)------------------------------
% 7.43/1.95 % (2816049)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816049)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816049)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816049)Termination reason: Instruction limit
% 7.43/1.95 % (2816049)Termination phase: Saturation
% 7.43/1.95 % (2816049)Time elapsed: 0.061 s
% 7.43/1.95 % (2816049)Peak memory usage: 88 MB
% 7.43/1.95 % (2816049)Instructions burned: 119 (million)
% 7.43/1.95 % (2816051)Instruction limit reached!
% 7.43/1.95 % (2816051)------------------------------
% 7.43/1.95 % (2816051)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816051)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816051)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816051)Termination reason: Instruction limit
% 7.43/1.95 % (2816051)Termination phase: Saturation
% 7.43/1.95 % (2816051)Time elapsed: 0.067 s
% 7.43/1.95 % (2816051)Peak memory usage: 88 MB
% 7.43/1.95 % (2816051)Instructions burned: 129 (million)
% 7.43/1.95 % (2816050)Instruction limit reached!
% 7.43/1.95 % (2816050)------------------------------
% 7.43/1.95 % (2816050)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816050)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816050)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816050)Termination reason: Instruction limit
% 7.43/1.95 % (2816050)Termination phase: Saturation
% 7.43/1.95 % (2816050)Time elapsed: 0.123 s
% 7.43/1.95 % (2816050)Peak memory usage: 90 MB
% 7.43/1.95 % (2816050)Instructions burned: 140 (million)
% 7.43/1.95 % (2816114)lrs+10_1_sil=32000:urr=on:br=off:random_seed=755023219:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 7.43/1.95 % (2816114)Refutation not found, incomplete strategy
% 7.43/1.95 % (2816114)------------------------------
% 7.43/1.95 % (2816114)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816114)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816114)Termination reason: Refutation not found, incomplete strategy
% 7.43/1.95 % (2816114)Time elapsed: 0.001 s
% 7.43/1.95 % (2816114)Peak memory usage: 89 MB
% 7.43/1.95 % (2816113)lrs+10_1_sil=8000:sp=occurrence:random_seed=329103017:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 7.43/1.95 % (2816048)------------------------------
% 7.43/1.95 % (2816048)------------------------------
% 7.43/1.95 % (2816121)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3185913686:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 7.43/1.95 % (2816114)------------------------------
% 7.43/1.95 % (2816114)------------------------------
% 7.43/1.95 % (2816113)Instruction limit reached!
% 7.43/1.95 % (2816113)------------------------------
% 7.43/1.95 % (2816113)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816113)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816113)Termination reason: Instruction limit
% 7.43/1.95 % (2816113)Termination phase: Saturation
% 7.43/1.95 % (2816113)Time elapsed: 0.183 s
% 7.43/1.95 % (2816113)Peak memory usage: 91 MB
% 7.43/1.95 % (2816113)Instructions burned: 286 (million)
% 7.43/1.95 % (2816124)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=2552041115:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 7.43/1.95 % (2816121)Instruction limit reached!
% 7.43/1.95 % (2816121)------------------------------
% 7.43/1.95 % (2816121)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816121)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816121)Termination reason: Instruction limit
% 7.43/1.95 % (2816121)Termination phase: Saturation
% 7.43/1.95 % (2816121)Time elapsed: 0.208 s
% 7.43/1.95 % (2816121)Peak memory usage: 90 MB
% 7.43/1.95 % (2816121)Instructions burned: 325 (million)
% 7.43/1.95 % (2816131)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2274094104:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2994 on theBenchmark for (2994ds/294Mi)
% 7.43/1.95 % (2816124)Instruction limit reached!
% 7.43/1.95 % (2816124)------------------------------
% 7.43/1.95 % (2816124)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816124)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816124)Termination reason: Instruction limit
% 7.43/1.95 % (2816124)Termination phase: Saturation
% 7.43/1.95 % (2816124)Time elapsed: 0.145 s
% 7.43/1.95 % (2816124)Peak memory usage: 89 MB
% 7.43/1.95 % (2816124)Instructions burned: 249 (million)
% 7.43/1.95 % (2816140)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1970021783:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 7.43/1.95 % (2816142)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3408654038:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 7.43/1.95 % (2816131)Instruction limit reached!
% 7.43/1.95 % (2816131)------------------------------
% 7.43/1.95 % (2816131)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816131)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816131)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816131)Termination reason: Instruction limit
% 7.43/1.95 % (2816131)Termination phase: Saturation
% 7.43/1.95 % (2816131)Time elapsed: 0.160 s
% 7.43/1.95 % (2816131)Peak memory usage: 89 MB
% 7.43/1.95 % (2816131)Instructions burned: 295 (million)
% 7.43/1.95 % (2816045)First to succeed.
% 7.43/1.95 % (2816045)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2815998"
% 7.43/1.95 % (2816144)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=4100899223:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 7.43/1.95 % (2816142)Instruction limit reached!
% 7.43/1.95 % (2816142)------------------------------
% 7.43/1.95 % (2816142)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816142)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816142)Termination reason: Instruction limit
% 7.43/1.95 % (2816142)Termination phase: Saturation
% 7.43/1.95 % (2816142)Time elapsed: 0.108 s
% 7.43/1.95 % (2816142)Peak memory usage: 90 MB
% 7.43/1.95 % (2816142)Instructions burned: 113 (million)
% 7.43/1.95 % (2816044)Also succeeded, but the first one will report.
% 7.43/1.95 % (2816144)Instruction limit reached!
% 7.43/1.95 % (2816144)------------------------------
% 7.43/1.95 % (2816144)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816144)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816144)Termination reason: Instruction limit
% 7.43/1.95 % (2816144)Termination phase: Saturation
% 7.43/1.95 % (2816144)Time elapsed: 0.099 s
% 7.43/1.95 % (2816144)Peak memory usage: 89 MB
% 7.43/1.95 % (2816144)Instructions burned: 127 (million)
% 7.43/1.95 % (2816155)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=851232872:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2991 on theBenchmark for (2991ds/114Mi)
% 7.43/1.95 % (2816155)Refutation not found, incomplete strategy
% 7.43/1.95 % (2816155)------------------------------
% 7.43/1.95 % (2816155)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.43/1.95 % (2816155)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.43/1.95 % (2816155)CaDiCaL version: 2.1.3
% 7.43/1.95 % (2816155)Termination reason: Refutation not found, incomplete strategy
% 7.43/1.95 % (2816155)Time elapsed: 0.002 s
% 7.43/1.95 % (2816155)Peak memory usage: 87 MB
% 7.43/1.95 % (2816157)lrs+10_1_sil=8000:sp=occurrence:random_seed=3184549261:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2990 on theBenchmark for (2990ds/907Mi)
% 7.43/1.95 % (2816045)Refutation found. Thanks to Tanya!
% 7.43/1.95 % SZS status Theorem for theBenchmark
% 7.43/1.95 % SZS output start Proof for theBenchmark
% See solution above
% 9.62/2.25 % (2816045)------------------------------
% 9.62/2.25 % (2816045)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.62/2.25 % (2816045)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.62/2.25 % (2816045)CaDiCaL version: 2.1.3
% 9.62/2.25 % (2816045)Termination reason: Refutation
% 9.62/2.25 % (2816045)Time elapsed: 0.717 s
% 9.62/2.25 % (2816045)Peak memory usage: 129 MB
% 9.62/2.25 % (2816045)Instructions burned: 1035 (million)
% 9.62/2.25 % (2816045)------------------------------
% 9.62/2.25 % (2816045)------------------------------
% 9.62/2.25 % (2815998)Success in time 1.306 s
% 9.62/2.25 % Vampire exiting
%------------------------------------------------------------------------------