%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO014+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 : 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:27 PM UTC 2026
% Result : Theorem 4.88s 2.04s
% Output : Refutation 8.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 18
% Syntax : Number of formulae : 158 ( 29 unt; 7 def)
% Number of atoms : 588 ( 11 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 709 ( 279 ~; 305 |; 103 &)
% ( 13 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 8 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 237 ( 0 sgn 203 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,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_04) ).
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(f16,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_15) ).
fof(f17,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_16) ).
fof(f24,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_23) ).
fof(f26,axiom,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
=> ( arboreal(X0)
& arboreal(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_25) ).
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(f28,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_27) ).
fof(f33,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(f39,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_38) ).
fof(f46,conjecture,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f62,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,[],[f5]) ).
fof(f63,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,[],[f62]) ).
fof(f65,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(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,[],[f16]) ).
fof(f79,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ? [X3] :
( root(X3,X2)
& min_precedes(X3,X1,X2) )
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f24]) ).
fof(f86,plain,
! [X0,X1,X2] :
( ( arboreal(X0)
& arboreal(X1) )
| ~ next_subocc(X0,X1,X2) ),
inference(ennf_transformation,[],[f26]) ).
fof(f87,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(f88,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,[],[f28]) ).
fof(f89,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(flattening,[],[f88]) ).
fof(f98,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f99,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f101,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(flattening,[],[f100]) ).
fof(f104,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))],[f65]) ).
fof(f108,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(f109,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,[],[f108]) ).
fof(f110,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,[],[f109]) ).
fof(f111,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| min_precedes(X0,sK6(X0,X1),X1) )
& ( ( ( root(X0,X1)
| min_precedes(sK7(X0,X1),X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X3,sK6(X0,X1)),skolemize(X4,sK7(X0,X1))],[f110]) ).
fof(f112,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f79]) ).
fof(f118,plain,
! [X0,X1,X2] :
( ( root(sK9(X1,X2),X2)
& min_precedes(sK9(X1,X2),X1,X2) )
| ~ min_precedes(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X1,X2))],[f84]) ).
fof(f119,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,[],[f87]) ).
fof(f120,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,[],[f119]) ).
fof(f121,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,[],[f120]) ).
fof(f122,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK10(X0,X1,X2),X2)
& min_precedes(sK10(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,[sK10]),skolemize(X3,sK10(X0,X1,X2))],[f121]) ).
fof(f123,plain,
! [X0,X1] :
( ( occurrence_of(sK11(X0),tptp3)
& next_subocc(X0,sK11(X0),tptp0)
& occurrence_of(sK12(X0),tptp4)
& next_subocc(sK11(X0),sK12(X0),tptp0)
& ( occurrence_of(sK13(X0),tptp2)
| occurrence_of(sK13(X0),tptp1) )
& next_subocc(sK12(X0),sK13(X0),tptp0)
& leaf(sK13(X0),tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12,sK13]),skolemize(X2,sK11(X0)),skolemize(X3,sK12(X0)),skolemize(X4,sK13(X0))],[f99]) ).
fof(f124,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK14,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(sK15,tptp0)
& subactivity_occurrence(sK14,sK15)
& arboreal(sK14)
& ~ leaf_occ(sK14,sK15) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15]),skolemize(X0,sK14),skolemize(X1,sK15)],[f101]) ).
fof(f130,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,[],[f63]) ).
fof(f132,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f134,plain,
! [X2,X0,X1] :
( occurrence_of(sK2(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f146,plain,
! [X0,X1,X5] :
( ~ min_precedes(X0,X5,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f151,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f163,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| min_precedes(sK9(X1,X2),X1,X2) ),
inference(cnf_transformation,[],[f118]) ).
fof(f166,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| arboreal(X1) ),
inference(cnf_transformation,[],[f86]) ).
fof(f169,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f122]) ).
fof(f172,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,[],[f89]) ).
fof(f177,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| leaf(sK13(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f178,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(sK12(X0),sK13(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f179,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK13(X0),tptp1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK13(X0),tptp2)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f180,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(sK11(X0),sK12(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f182,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK11(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f183,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK11(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f188,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f39]) ).
fof(f195,plain,
~ leaf_occ(sK14,sK15),
inference(cnf_transformation,[],[f124]) ).
fof(f196,plain,
arboreal(sK14),
inference(cnf_transformation,[],[f124]) ).
fof(f197,plain,
subactivity_occurrence(sK14,sK15),
inference(cnf_transformation,[],[f124]) ).
fof(f198,plain,
occurrence_of(sK15,tptp0),
inference(cnf_transformation,[],[f124]) ).
fof(f199,plain,
! [X2,X3] :
( ~ next_subocc(sK14,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X3,tptp1)
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f200,plain,
! [X2,X3] :
( ~ next_subocc(sK14,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X3,tptp2)
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f201,plain,
( ~ occurrence_of(sK15,tptp0)
| leaf(sK13(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(resolution,[],[f177,f197]) ).
fof(f202,plain,
( leaf(sK13(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f201,f198]) ).
fof(f203,plain,
( leaf(sK13(sK14),tptp0)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f202,f196]) ).
fof(f204,plain,
leaf(sK13(sK14),tptp0),
inference(forward_subsumption_resolution,[],[f203,f195]) ).
fof(f205,plain,
( ~ occurrence_of(sK15,tptp0)
| occurrence_of(sK11(sK14),tptp3)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(resolution,[],[f183,f197]) ).
fof(f206,plain,
( occurrence_of(sK11(sK14),tptp3)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f205,f198]) ).
fof(f207,plain,
( occurrence_of(sK11(sK14),tptp3)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f206,f196]) ).
fof(f208,plain,
occurrence_of(sK11(sK14),tptp3),
inference(forward_subsumption_resolution,[],[f207,f195]) ).
fof(f209,plain,
( ~ occurrence_of(sK15,tptp0)
| next_subocc(sK14,sK11(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(resolution,[],[f182,f197]) ).
fof(f210,plain,
( next_subocc(sK14,sK11(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f209,f198]) ).
fof(f211,plain,
( next_subocc(sK14,sK11(sK14),tptp0)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f210,f196]) ).
fof(f212,plain,
next_subocc(sK14,sK11(sK14),tptp0),
inference(forward_subsumption_resolution,[],[f211,f195]) ).
fof(f214,plain,
! [X0] :
( ~ occurrence_of(sK11(sK14),tptp3)
| ~ occurrence_of(X0,tptp1)
| ~ min_precedes(sK11(sK14),X0,tptp0)
| ~ leaf(X0,tptp0) ),
inference(resolution,[],[f199,f212]) ).
fof(f215,plain,
! [X0] :
( ~ min_precedes(sK11(sK14),X0,tptp0)
| ~ occurrence_of(X0,tptp1)
| ~ leaf(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f214,f208]) ).
fof(f216,plain,
! [X0] :
( ~ occurrence_of(sK11(sK14),tptp3)
| ~ occurrence_of(X0,tptp2)
| ~ min_precedes(sK11(sK14),X0,tptp0)
| ~ leaf(X0,tptp0) ),
inference(resolution,[],[f200,f212]) ).
fof(f217,plain,
! [X0] :
( ~ min_precedes(sK11(sK14),X0,tptp0)
| ~ occurrence_of(X0,tptp2)
| ~ leaf(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f216,f208]) ).
fof(f218,plain,
( ~ occurrence_of(sK15,tptp0)
| next_subocc(sK11(sK14),sK12(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(resolution,[],[f180,f197]) ).
fof(f219,plain,
( next_subocc(sK11(sK14),sK12(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f218,f198]) ).
fof(f220,plain,
( next_subocc(sK11(sK14),sK12(sK14),tptp0)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f219,f196]) ).
fof(f221,plain,
next_subocc(sK11(sK14),sK12(sK14),tptp0),
inference(forward_subsumption_resolution,[],[f220,f195]) ).
fof(f222,plain,
( ~ occurrence_of(sK15,tptp0)
| next_subocc(sK12(sK14),sK13(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(resolution,[],[f178,f197]) ).
fof(f223,plain,
( next_subocc(sK12(sK14),sK13(sK14),tptp0)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f222,f198]) ).
fof(f224,plain,
( next_subocc(sK12(sK14),sK13(sK14),tptp0)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f223,f196]) ).
fof(f225,plain,
next_subocc(sK12(sK14),sK13(sK14),tptp0),
inference(forward_subsumption_resolution,[],[f224,f195]) ).
fof(f230,plain,
min_precedes(sK12(sK14),sK13(sK14),tptp0),
inference(resolution,[],[f225,f169]) ).
fof(f231,plain,
min_precedes(sK11(sK14),sK12(sK14),tptp0),
inference(resolution,[],[f221,f169]) ).
fof(f248,plain,
( occurrence_of(sK13(sK14),tptp1)
| ~ occurrence_of(sK15,tptp0)
| occurrence_of(sK13(sK14),tptp2)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(resolution,[],[f179,f197]) ).
fof(f249,plain,
( occurrence_of(sK13(sK14),tptp1)
| occurrence_of(sK13(sK14),tptp2)
| ~ arboreal(sK14)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f248,f198]) ).
fof(f250,plain,
( occurrence_of(sK13(sK14),tptp1)
| occurrence_of(sK13(sK14),tptp2)
| leaf_occ(sK14,sK15) ),
inference(forward_subsumption_resolution,[],[f249,f196]) ).
fof(f251,plain,
( occurrence_of(sK13(sK14),tptp1)
| occurrence_of(sK13(sK14),tptp2) ),
inference(forward_subsumption_resolution,[],[f250,f195]) ).
fof(f253,definition,
( spl16_4
<=> occurrence_of(sK13(sK14),tptp2) ),
introduced(definition,[new_symbols(definition,[spl16_4])],[avatar_definition]) ).
fof(f255,plain,
( occurrence_of(sK13(sK14),tptp2)
| ~ spl16_4 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f257,definition,
( spl16_5
<=> occurrence_of(sK13(sK14),tptp1) ),
introduced(definition,[new_symbols(definition,[spl16_5])],[avatar_definition]) ).
fof(f259,plain,
( occurrence_of(sK13(sK14),tptp1)
| ~ spl16_5 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f260,plain,
( spl16_4
| spl16_5 ),
inference(avatar_split_clause,[],[f251,f257,f253]) ).
fof(f278,plain,
~ leaf(sK11(sK14),tptp0),
inference(resolution,[],[f146,f231]) ).
fof(f286,plain,
! [X2,X3,X0,X1,X4] :
( ~ subactivity_occurrence(X3,sK2(X2,X0,X1))
| min_precedes(X1,X3,X4)
| X1 = X3
| ~ occurrence_of(sK2(X2,X0,X1),X4)
| ~ arboreal(X3)
| ~ arboreal(X1)
| ~ min_precedes(X0,X1,X2)
| min_precedes(X3,X1,X4) ),
inference(resolution,[],[f132,f130]) ).
fof(f316,plain,
( ~ atomic(tptp3)
| arboreal(sK11(sK14)) ),
inference(resolution,[],[f151,f208]) ).
fof(f322,plain,
arboreal(sK11(sK14)),
inference(forward_subsumption_resolution,[],[f316,f188]) ).
fof(f384,plain,
arboreal(sK13(sK14)),
inference(resolution,[],[f166,f225]) ).
fof(f553,plain,
! [X0] :
( ~ subactivity_occurrence(sK13(sK14),X0)
| ~ occurrence_of(X0,tptp0)
| subactivity_occurrence(sK12(sK14),X0) ),
inference(resolution,[],[f172,f230]) ).
fof(f555,plain,
! [X0] :
( ~ subactivity_occurrence(sK12(sK14),X0)
| ~ occurrence_of(X0,tptp0)
| subactivity_occurrence(sK11(sK14),X0) ),
inference(resolution,[],[f172,f231]) ).
fof(f561,plain,
! [X0,X1] :
( subactivity_occurrence(sK12(sK14),sK2(X0,X1,sK13(sK14)))
| ~ occurrence_of(sK2(X0,X1,sK13(sK14)),tptp0)
| ~ min_precedes(X1,sK13(sK14),X0) ),
inference(resolution,[],[f553,f132]) ).
fof(f836,plain,
! [X0,X1] :
( ~ occurrence_of(sK2(X0,X1,sK13(sK14)),tptp0)
| ~ min_precedes(X1,sK13(sK14),X0)
| ~ occurrence_of(sK2(X0,X1,sK13(sK14)),tptp0)
| subactivity_occurrence(sK11(sK14),sK2(X0,X1,sK13(sK14))) ),
inference(resolution,[],[f561,f555]) ).
fof(f856,plain,
! [X0,X1] :
( subactivity_occurrence(sK11(sK14),sK2(X0,X1,sK13(sK14)))
| ~ min_precedes(X1,sK13(sK14),X0)
| ~ occurrence_of(sK2(X0,X1,sK13(sK14)),tptp0) ),
inference(duplicate_literal_removal,[],[f836]) ).
fof(f969,plain,
min_precedes(sK9(sK13(sK14),tptp0),sK13(sK14),tptp0),
inference(resolution,[],[f163,f230]) ).
fof(f1168,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,sK13(sK14),X1)
| ~ occurrence_of(sK2(X1,X0,sK13(sK14)),tptp0)
| min_precedes(sK13(sK14),sK11(sK14),X2)
| sK13(sK14) = sK11(sK14)
| ~ occurrence_of(sK2(X1,X0,sK13(sK14)),X2)
| ~ arboreal(sK11(sK14))
| ~ arboreal(sK13(sK14))
| ~ min_precedes(X0,sK13(sK14),X1)
| min_precedes(sK11(sK14),sK13(sK14),X2) ),
inference(resolution,[],[f856,f286]) ).
fof(f1186,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,sK13(sK14),X1)
| ~ occurrence_of(sK2(X1,X0,sK13(sK14)),tptp0)
| min_precedes(sK13(sK14),sK11(sK14),X2)
| sK13(sK14) = sK11(sK14)
| ~ occurrence_of(sK2(X1,X0,sK13(sK14)),X2)
| ~ arboreal(sK11(sK14))
| ~ arboreal(sK13(sK14))
| min_precedes(sK11(sK14),sK13(sK14),X2) ),
inference(duplicate_literal_removal,[],[f1168]) ).
fof(f1190,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,sK13(sK14),X1)
| ~ occurrence_of(sK2(X1,X0,sK13(sK14)),tptp0)
| min_precedes(sK13(sK14),sK11(sK14),X2)
| sK13(sK14) = sK11(sK14)
| ~ occurrence_of(sK2(X1,X0,sK13(sK14)),X2)
| ~ arboreal(sK13(sK14))
| min_precedes(sK11(sK14),sK13(sK14),X2) ),
inference(forward_subsumption_resolution,[],[f1186,f322]) ).
fof(f1192,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,sK13(sK14),X1)
| ~ occurrence_of(sK2(X1,X0,sK13(sK14)),tptp0)
| min_precedes(sK13(sK14),sK11(sK14),X2)
| sK13(sK14) = sK11(sK14)
| ~ occurrence_of(sK2(X1,X0,sK13(sK14)),X2)
| min_precedes(sK11(sK14),sK13(sK14),X2) ),
inference(forward_subsumption_resolution,[],[f1190,f384]) ).
fof(f1194,definition,
( spl16_49
<=> sK13(sK14) = sK11(sK14) ),
introduced(definition,[new_symbols(definition,[spl16_49])],[avatar_definition]) ).
fof(f1196,plain,
( sK13(sK14) = sK11(sK14)
| ~ spl16_49 ),
inference(avatar_component_clause,[],[f1194]) ).
fof(f1198,definition,
( spl16_50
<=> ! [X2,X0,X1] :
( ~ min_precedes(X0,sK13(sK14),X1)
| min_precedes(sK11(sK14),sK13(sK14),X2)
| ~ occurrence_of(sK2(X1,X0,sK13(sK14)),X2)
| min_precedes(sK13(sK14),sK11(sK14),X2)
| ~ occurrence_of(sK2(X1,X0,sK13(sK14)),tptp0) ) ),
introduced(definition,[new_symbols(definition,[spl16_50])],[avatar_definition]) ).
fof(f1199,plain,
( ! [X2,X0,X1] :
( ~ occurrence_of(sK2(X1,X0,sK13(sK14)),tptp0)
| min_precedes(sK11(sK14),sK13(sK14),X2)
| ~ occurrence_of(sK2(X1,X0,sK13(sK14)),X2)
| min_precedes(sK13(sK14),sK11(sK14),X2)
| ~ min_precedes(X0,sK13(sK14),X1) )
| ~ spl16_50 ),
inference(avatar_component_clause,[],[f1198]) ).
fof(f1200,plain,
( spl16_49
| spl16_50 ),
inference(avatar_split_clause,[],[f1192,f1198,f1194]) ).
fof(f1209,plain,
( ~ leaf(sK13(sK14),tptp0)
| ~ spl16_49 ),
inference(superposition,[],[f278,f1196]) ).
fof(f1250,plain,
( $false
| ~ spl16_49 ),
inference(forward_subsumption_resolution,[],[f1209,f204]) ).
fof(f1251,plain,
~ spl16_49,
inference(avatar_contradiction_clause,[],[f1250]) ).
fof(f1259,plain,
( ! [X0,X1] :
( min_precedes(sK11(sK14),sK13(sK14),X0)
| ~ occurrence_of(sK2(tptp0,X1,sK13(sK14)),X0)
| min_precedes(sK13(sK14),sK11(sK14),X0)
| ~ min_precedes(X1,sK13(sK14),tptp0)
| ~ min_precedes(X1,sK13(sK14),tptp0) )
| ~ spl16_50 ),
inference(resolution,[],[f1199,f134]) ).
fof(f1260,plain,
( ! [X0,X1] :
( ~ occurrence_of(sK2(tptp0,X1,sK13(sK14)),X0)
| min_precedes(sK11(sK14),sK13(sK14),X0)
| min_precedes(sK13(sK14),sK11(sK14),X0)
| ~ min_precedes(X1,sK13(sK14),tptp0) )
| ~ spl16_50 ),
inference(duplicate_literal_removal,[],[f1259]) ).
fof(f1261,plain,
( ! [X0] :
( min_precedes(sK11(sK14),sK13(sK14),tptp0)
| min_precedes(sK13(sK14),sK11(sK14),tptp0)
| ~ min_precedes(X0,sK13(sK14),tptp0)
| ~ min_precedes(X0,sK13(sK14),tptp0) )
| ~ spl16_50 ),
inference(resolution,[],[f1260,f134]) ).
fof(f1263,plain,
( ! [X0] :
( min_precedes(sK11(sK14),sK13(sK14),tptp0)
| min_precedes(sK13(sK14),sK11(sK14),tptp0)
| ~ min_precedes(X0,sK13(sK14),tptp0) )
| ~ spl16_50 ),
inference(duplicate_literal_removal,[],[f1261]) ).
fof(f1266,definition,
( spl16_51
<=> ! [X0] : ~ min_precedes(X0,sK13(sK14),tptp0) ),
introduced(definition,[new_symbols(definition,[spl16_51])],[avatar_definition]) ).
fof(f1267,plain,
( ! [X0] : ~ min_precedes(X0,sK13(sK14),tptp0)
| ~ spl16_51 ),
inference(avatar_component_clause,[],[f1266]) ).
fof(f1269,definition,
( spl16_52
<=> min_precedes(sK11(sK14),sK13(sK14),tptp0) ),
introduced(definition,[new_symbols(definition,[spl16_52])],[avatar_definition]) ).
fof(f1271,plain,
( min_precedes(sK11(sK14),sK13(sK14),tptp0)
| ~ spl16_52 ),
inference(avatar_component_clause,[],[f1269]) ).
fof(f1290,definition,
( spl16_56
<=> min_precedes(sK13(sK14),sK11(sK14),tptp0) ),
introduced(definition,[new_symbols(definition,[spl16_56])],[avatar_definition]) ).
fof(f1292,plain,
( min_precedes(sK13(sK14),sK11(sK14),tptp0)
| ~ spl16_56 ),
inference(avatar_component_clause,[],[f1290]) ).
fof(f1293,plain,
( spl16_51
| spl16_56
| spl16_52
| ~ spl16_50 ),
inference(avatar_split_clause,[],[f1263,f1198,f1269,f1290,f1266]) ).
fof(f1299,plain,
( $false
| ~ spl16_51 ),
inference(resolution,[],[f1267,f969]) ).
fof(f1304,plain,
~ spl16_51,
inference(avatar_contradiction_clause,[],[f1299]) ).
fof(f1306,plain,
( ~ occurrence_of(sK13(sK14),tptp2)
| ~ leaf(sK13(sK14),tptp0)
| ~ spl16_52 ),
inference(resolution,[],[f1271,f217]) ).
fof(f1307,plain,
( ~ occurrence_of(sK13(sK14),tptp1)
| ~ leaf(sK13(sK14),tptp0)
| ~ spl16_52 ),
inference(resolution,[],[f1271,f215]) ).
fof(f1314,plain,
( ~ leaf(sK13(sK14),tptp0)
| ~ spl16_5
| ~ spl16_52 ),
inference(forward_subsumption_resolution,[],[f1307,f259]) ).
fof(f1316,plain,
( $false
| ~ spl16_5
| ~ spl16_52 ),
inference(forward_subsumption_resolution,[],[f1314,f204]) ).
fof(f1317,plain,
( ~ spl16_5
| ~ spl16_52 ),
inference(avatar_contradiction_clause,[],[f1316]) ).
fof(f1323,plain,
( ~ leaf(sK13(sK14),tptp0)
| ~ spl16_4
| ~ spl16_52 ),
inference(forward_subsumption_resolution,[],[f1306,f255]) ).
fof(f1325,plain,
( $false
| ~ spl16_4
| ~ spl16_52 ),
inference(forward_subsumption_resolution,[],[f1323,f204]) ).
fof(f1326,plain,
( ~ spl16_4
| ~ spl16_52 ),
inference(avatar_contradiction_clause,[],[f1325]) ).
fof(f1336,plain,
( ~ leaf(sK13(sK14),tptp0)
| ~ spl16_56 ),
inference(resolution,[],[f1292,f146]) ).
fof(f1337,plain,
( $false
| ~ spl16_56 ),
inference(forward_subsumption_resolution,[],[f1336,f204]) ).
fof(f1338,plain,
~ spl16_56,
inference(avatar_contradiction_clause,[],[f1337]) ).
cnf(s3,plain,
( spl16_4
| spl16_5 ),
inference(sat_conversion,[],[f260]) ).
cnf(s51,plain,
( spl16_49
| spl16_50 ),
inference(sat_conversion,[],[f1200]) ).
cnf(s54,plain,
~ spl16_49,
inference(sat_conversion,[],[f1251]) ).
cnf(s59,plain,
( ~ spl16_50
| spl16_51
| spl16_52
| spl16_56 ),
inference(sat_conversion,[],[f1293]) ).
cnf(s62,plain,
~ spl16_51,
inference(sat_conversion,[],[f1304]) ).
cnf(s63,plain,
( ~ spl16_5
| ~ spl16_52 ),
inference(sat_conversion,[],[f1317]) ).
cnf(s66,plain,
( ~ spl16_4
| ~ spl16_52 ),
inference(sat_conversion,[],[f1326]) ).
cnf(s67,plain,
~ spl16_56,
inference(sat_conversion,[],[f1338]) ).
cnf(s69,plain,
( ~ spl16_50
| spl16_52 ),
inference(rat,[],[s59,s67,s62]) ).
cnf(s71,plain,
spl16_50,
inference(rat,[],[s51,s54]) ).
cnf(s72,plain,
spl16_52,
inference(rat,[],[s69,s71]) ).
cnf(s73,plain,
~ spl16_4,
inference(rat,[],[s66,s72]) ).
cnf(s74,plain,
~ spl16_5,
inference(rat,[],[s63,s72]) ).
cnf(s95,plain,
$false,
inference(rat,[],[s3,s74,s73]) ).
fof(f1341,plain,
$false,
inference(avatar_sat_refutation,[],[s95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO014+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 22:25:34 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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
% 4.88/2.04 % (3826144)Detected formulas, will run a generic FOF schedule.
% 4.88/2.04 % (3826153)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=432426295:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.88/2.04 % (3826153)Instruction limit reached!
% 4.88/2.04 % (3826153)------------------------------
% 4.88/2.04 % (3826153)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826153)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826153)Termination reason: Instruction limit
% 4.88/2.04 % (3826153)Termination phase: Saturation
% 4.88/2.04 % (3826153)Time elapsed: 0.040 s
% 4.88/2.04 % (3826153)Peak memory usage: 88 MB
% 4.88/2.04 % (3826153)Instructions burned: 120 (million)
% 4.88/2.04 % (3826150)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=2925262174:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.88/2.04 % (3826152)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=57837453:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.88/2.04 % (3826155)dis-21_1_sil=8000:lcm=predicate:random_seed=1835551025: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.88/2.04 % (3826151)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=3923851577:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.88/2.04 % (3826154)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=269337818:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.88/2.04 % (3826149)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=102131991:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.88/2.04 % (3826152)Refutation not found, incomplete strategy
% 4.88/2.04 % (3826152)------------------------------
% 4.88/2.04 % (3826152)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826152)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826152)Termination reason: Refutation not found, incomplete strategy
% 4.88/2.04 % (3826152)Time elapsed: 0.004 s
% 4.88/2.04 % (3826152)Peak memory usage: 88 MB
% 4.88/2.04 % (3826152)Instructions burned: 5 (million)
% 4.88/2.04 % (3826155)Instruction limit reached!
% 4.88/2.04 % (3826155)------------------------------
% 4.88/2.04 % (3826155)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826155)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826155)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826155)Termination reason: Instruction limit
% 4.88/2.04 % (3826155)Termination phase: Saturation
% 4.88/2.04 % (3826155)Time elapsed: 0.070 s
% 4.88/2.04 % (3826155)Peak memory usage: 88 MB
% 4.88/2.04 % (3826155)Instructions burned: 129 (million)
% 4.88/2.04 % (3826154)Instruction limit reached!
% 4.88/2.04 % (3826154)------------------------------
% 4.88/2.04 % (3826154)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826154)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826154)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826154)Termination reason: Instruction limit
% 4.88/2.04 % (3826154)Termination phase: Saturation
% 4.88/2.04 % (3826154)Time elapsed: 0.099 s
% 4.88/2.04 % (3826154)Peak memory usage: 90 MB
% 4.88/2.04 % (3826154)Instructions burned: 139 (million)
% 4.88/2.04 % (3826157)lrs+10_1_sil=8000:sp=occurrence:random_seed=14695983:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 4.88/2.04 % (3826157)Instruction limit reached!
% 4.88/2.04 % (3826157)------------------------------
% 4.88/2.04 % (3826157)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826157)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826157)Termination reason: Instruction limit
% 4.88/2.04 % (3826157)Termination phase: Saturation
% 4.88/2.04 % (3826157)Time elapsed: 0.094 s
% 4.88/2.04 % (3826157)Peak memory usage: 91 MB
% 4.88/2.04 % (3826157)Instructions burned: 287 (million)
% 4.88/2.04 % (3826164)lrs+10_1_sil=32000:urr=on:br=off:random_seed=750475612:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.88/2.04 % (3826152)------------------------------
% 4.88/2.04 % (3826152)------------------------------
% 4.88/2.04 % (3826165)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1753226362:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.88/2.04 % (3826164)Instruction limit reached!
% 4.88/2.04 % (3826164)------------------------------
% 4.88/2.04 % (3826164)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826164)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826164)Termination reason: Instruction limit
% 4.88/2.04 % (3826164)Termination phase: Saturation
% 4.88/2.04 % (3826164)Time elapsed: 0.085 s
% 4.88/2.04 % (3826164)Peak memory usage: 89 MB
% 4.88/2.04 % (3826164)Instructions burned: 158 (million)
% 4.88/2.04 % (3826167)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=2264138410:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 4.88/2.04 % (3826167)Instruction limit reached!
% 4.88/2.04 % (3826167)------------------------------
% 4.88/2.04 % (3826167)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826167)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826167)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826167)Termination reason: Instruction limit
% 4.88/2.04 % (3826167)Termination phase: Saturation
% 4.88/2.04 % (3826167)Time elapsed: 0.073 s
% 4.88/2.04 % (3826167)Peak memory usage: 89 MB
% 4.88/2.04 % (3826167)Instructions burned: 250 (million)
% 4.88/2.04 % (3826169)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1364983226:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.88/2.04 % (3826169)Refutation not found, incomplete strategy
% 4.88/2.04 % (3826169)------------------------------
% 4.88/2.04 % (3826169)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826169)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826169)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826169)Termination reason: Refutation not found, incomplete strategy
% 4.88/2.04 % (3826169)Time elapsed: 0.034 s
% 4.88/2.04 % (3826169)Peak memory usage: 89 MB
% 4.88/2.04 % (3826169)Instructions burned: 51 (million)
% 4.88/2.04 % (3826172)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2882728821:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 4.88/2.04 % (3826165)Instruction limit reached!
% 4.88/2.04 % (3826165)------------------------------
% 4.88/2.04 % (3826165)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826165)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826165)Termination reason: Instruction limit
% 4.88/2.04 % (3826165)Termination phase: Saturation
% 4.88/2.04 % (3826165)Time elapsed: 0.215 s
% 4.88/2.04 % (3826165)Peak memory usage: 91 MB
% 4.88/2.04 % (3826165)Instructions burned: 325 (million)
% 4.88/2.04 % (3826173)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=998407440:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 4.88/2.04 % (3826173)Instruction limit reached!
% 4.88/2.04 % (3826173)------------------------------
% 4.88/2.04 % (3826173)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826173)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826173)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826173)Termination reason: Instruction limit
% 4.88/2.04 % (3826173)Termination phase: Saturation
% 4.88/2.04 % (3826173)Time elapsed: 0.043 s
% 4.88/2.04 % (3826173)Peak memory usage: 90 MB
% 4.88/2.04 % (3826173)Instructions burned: 114 (million)
% 4.88/2.04 % (3826176)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1463116782:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 4.88/2.04 % (3826169)------------------------------
% 4.88/2.04 % (3826169)------------------------------
% 4.88/2.04 % (3826178)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=40439416:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 4.88/2.04 % (3826176)Instruction limit reached!
% 4.88/2.04 % (3826176)------------------------------
% 4.88/2.04 % (3826176)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826176)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826176)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826176)Termination reason: Instruction limit
% 4.88/2.04 % (3826176)Termination phase: Saturation
% 4.88/2.04 % (3826176)Time elapsed: 0.068 s
% 4.88/2.04 % (3826176)Peak memory usage: 89 MB
% 4.88/2.04 % (3826176)Instructions burned: 128 (million)
% 4.88/2.04 % (3826178)Instruction limit reached!
% 4.88/2.04 % (3826178)------------------------------
% 4.88/2.04 % (3826178)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.88/2.04 % (3826178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.88/2.04 % (3826178)CaDiCaL version: 2.1.3
% 4.88/2.04 % (3826178)Termination reason: Instruction limit
% 4.88/2.04 % (3826178)Termination phase: Saturation
% 4.88/2.04 % (3826178)Time elapsed: 0.040 s
% 4.88/2.04 % (3826178)Peak memory usage: 89 MB
% 4.88/2.04 % (3826178)Instructions burned: 117 (million)
% 4.88/2.04 % (3826149)First to succeed.
% 4.88/2.04 % (3826149)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3826144"
% 4.88/2.04 % (3826181)lrs+10_1_sil=8000:sp=occurrence:random_seed=1154934592:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2991 on theBenchmark for (2991ds/907Mi)
% 4.88/2.04 % (3826183)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3732697913:i=5202:ss=axioms:sgt=16_2990 on theBenchmark for (2990ds/5202Mi)
% 4.88/2.04 % (3826182)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=1353803799:i=437:sd=1:aac=none:ss=included_2991 on theBenchmark for (2991ds/437Mi)
% 4.88/2.04 % (3826150)Also succeeded, but the first one will report.
% 4.88/2.04 % (3826149)Refutation found. Thanks to Tanya!
% 4.88/2.04 % SZS status Theorem for theBenchmark
% 4.88/2.04 % SZS output start Proof for theBenchmark
% See solution above
% 8.98/2.23 % (3826149)------------------------------
% 8.98/2.23 % (3826149)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.98/2.23 % (3826149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.98/2.23 % (3826149)CaDiCaL version: 2.1.3
% 8.98/2.23 % (3826149)Termination reason: Refutation
% 8.98/2.23 % (3826149)Time elapsed: 0.757 s
% 8.98/2.23 % (3826149)Peak memory usage: 129 MB
% 8.98/2.23 % (3826149)Instructions burned: 1109 (million)
% 8.98/2.23 % (3826149)------------------------------
% 8.98/2.23 % (3826149)------------------------------
% 8.98/2.23 % (3826144)Success in time 1.188 s
% 8.98/2.23 % Vampire exiting
%------------------------------------------------------------------------------