%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO003+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:21 PM UTC 2026
% Result : Theorem 11.04s 2.58s
% Output : Refutation 12.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 22
% Syntax : Number of formulae : 165 ( 32 unt; 6 def)
% Number of atoms : 499 ( 31 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 560 ( 226 ~; 228 |; 83 &)
% ( 14 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 18 ( 16 usr; 7 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 255 ( 0 sgn 223 !; 32 ?)
% 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(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(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(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(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(f23,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ~ root(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_22) ).
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(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(f46,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& root_occ(X0,X1) )
=> ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_45) ).
fof(f47,conjecture,
~ ? [X0] : occurrence_of(X0,tptp0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f48,negated_conjecture,
~ ~ ? [X0] : occurrence_of(X0,tptp0),
inference(negated_conjecture,[status(cth)],[f47]) ).
fof(f49,plain,
? [X0] : occurrence_of(X0,tptp0),
inference(flattening,[],[f48]) ).
fof(f57,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(f58,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,[],[f57]) ).
fof(f60,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(f63,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f64,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f63]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(flattening,[],[f67]) ).
fof(f72,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(f73,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f23]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ( arboreal(X0)
& arboreal(X1) )
| ~ next_subocc(X0,X1,X2) ),
inference(ennf_transformation,[],[f26]) ).
fof(f80,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(f91,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(f92,plain,
! [X0,X1] :
( ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ root_occ(X0,X1) ),
inference(ennf_transformation,[],[f46]) ).
fof(f93,plain,
! [X0,X1] :
( ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ root_occ(X0,X1) ),
inference(flattening,[],[f92]) ).
fof(f96,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))],[f60]) ).
fof(f102,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,[],[f72]) ).
fof(f103,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,[],[f102]) ).
fof(f104,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,[],[f103]) ).
fof(f105,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))],[f104]) ).
fof(f106,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f73]) ).
fof(f107,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(f108,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,[],[f107]) ).
fof(f109,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))],[f108]) ).
fof(f110,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(f111,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,[],[f110]) ).
fof(f112,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))],[f111]) ).
fof(f116,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,[],[f80]) ).
fof(f117,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,[],[f116]) ).
fof(f118,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,[],[f117]) ).
fof(f119,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))],[f118]) ).
fof(f120,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))],[f91]) ).
fof(f121,plain,
! [X0,X1] :
( ( occurrence_of(sK14(X0),tptp1)
& next_subocc(X0,sK14(X0),tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ root_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X2,sK14(X0))],[f93]) ).
fof(f122,plain,
occurrence_of(sK15,tptp0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15]),skolemize(X0,sK15)],[f49]) ).
fof(f129,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,[],[f58]) ).
fof(f132,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f96]) ).
fof(f134,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| occurrence_of(sK2(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f96]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f64]) ).
fof(f139,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(cnf_transformation,[],[f68]) ).
fof(f149,plain,
! [X0,X1,X5] :
( ~ leaf(X0,X1)
| ~ min_precedes(X0,X5,X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f154,plain,
! [X0,X1] :
( ~ atomic(X1)
| arboreal(X0)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f106]) ).
fof(f156,plain,
! [X0,X1] :
( leaf(X0,sK8(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f157,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f158,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| occurrence_of(X1,sK8(X0,X1)) ),
inference(cnf_transformation,[],[f109]) ).
fof(f160,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| root(X0,sK9(X0,X1)) ),
inference(cnf_transformation,[],[f112]) ).
fof(f161,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
fof(f162,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| occurrence_of(X1,sK9(X0,X1)) ),
inference(cnf_transformation,[],[f112]) ).
fof(f168,plain,
! [X2,X0,X1] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f76]) ).
fof(f172,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| arboreal(X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f173,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| arboreal(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f174,plain,
! [X2,X0,X1,X4] :
( ~ next_subocc(X0,X1,X2)
| ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) ),
inference(cnf_transformation,[],[f119]) ).
fof(f175,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f119]) ).
fof(f183,plain,
! [X0] :
( next_subocc(sK12(X0),sK13(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f184,plain,
! [X0] :
( leaf_occ(sK13(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f185,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sK13(X0),tptp3) ),
inference(cnf_transformation,[],[f120]) ).
fof(f186,plain,
! [X0] :
( root_occ(sK12(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f193,plain,
atomic(tptp1),
inference(cnf_transformation,[],[f39]) ).
fof(f197,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f43]) ).
fof(f200,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK14(X0),tptp0)
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f201,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| occurrence_of(sK14(X0),tptp1)
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f202,plain,
occurrence_of(sK15,tptp0),
inference(cnf_transformation,[],[f122]) ).
fof(f205,plain,
! [X0] :
( subactivity_occurrence(sK13(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f157,f184]) ).
fof(f233,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(X0,sK8(sK13(X0),X0)) ),
inference(resolution,[],[f158,f184]) ).
fof(f255,plain,
! [X0] :
( next_subocc(X0,sK14(X0),tptp0)
| ~ root_occ(X0,sK15) ),
inference(resolution,[],[f200,f202]) ).
fof(f256,plain,
! [X0] :
( ~ root_occ(X0,sK15)
| min_precedes(X0,sK14(X0),tptp0) ),
inference(resolution,[],[f255,f175]) ).
fof(f257,plain,
! [X0] :
( ~ root_occ(X0,sK15)
| occurrence_of(sK14(X0),tptp1) ),
inference(resolution,[],[f201,f202]) ).
fof(f258,plain,
( occurrence_of(sK14(sK12(sK15)),tptp1)
| ~ occurrence_of(sK15,tptp0) ),
inference(resolution,[],[f257,f186]) ).
fof(f259,plain,
occurrence_of(sK14(sK12(sK15)),tptp1),
inference(forward_subsumption_resolution,[],[f258,f202]) ).
fof(f261,plain,
! [X0] :
( ~ occurrence_of(sK14(sK12(sK15)),X0)
| tptp1 = X0 ),
inference(resolution,[],[f259,f137]) ).
fof(f263,plain,
( min_precedes(sK12(sK15),sK14(sK12(sK15)),tptp0)
| ~ occurrence_of(sK15,tptp0) ),
inference(resolution,[],[f256,f186]) ).
fof(f264,plain,
min_precedes(sK12(sK15),sK14(sK12(sK15)),tptp0),
inference(forward_subsumption_resolution,[],[f263,f202]) ).
fof(f265,plain,
! [X0] :
( ~ root_occ(sK14(sK12(sK15)),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f264,f139]) ).
fof(f271,plain,
! [X0] :
( subactivity_occurrence(sK12(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f161,f186]) ).
fof(f275,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| ~ min_precedes(sK12(X1),X0,tptp0)
| ~ min_precedes(X0,sK13(X1),tptp0) ),
inference(resolution,[],[f174,f183]) ).
fof(f279,plain,
! [X0] :
( ~ occurrence_of(X0,tptp1)
| arboreal(X0) ),
inference(resolution,[],[f193,f154]) ).
fof(f298,plain,
occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0),
inference(resolution,[],[f134,f264]) ).
fof(f299,plain,
occurrence_of(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp3),
inference(resolution,[],[f298,f185]) ).
fof(f305,plain,
occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),sK8(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))),
inference(resolution,[],[f298,f233]) ).
fof(f307,plain,
! [X0] :
( ~ min_precedes(X0,sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0)
| ~ min_precedes(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),X0,tptp0) ),
inference(resolution,[],[f298,f275]) ).
fof(f311,plain,
! [X0] :
( ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),X0)
| tptp0 = X0 ),
inference(resolution,[],[f298,f137]) ).
fof(f347,plain,
tptp0 = sK8(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),
inference(resolution,[],[f305,f311]) ).
fof(f421,plain,
( leaf(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0)
| ~ leaf_occ(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))) ),
inference(superposition,[],[f156,f347]) ).
fof(f423,definition,
( spl16_18
<=> leaf_occ(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))) ),
introduced(definition,[new_symbols(definition,[spl16_18])],[avatar_definition]) ).
fof(f424,plain,
( ~ leaf_occ(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| spl16_18 ),
inference(avatar_component_clause,[],[f423]) ).
fof(f426,definition,
( spl16_19
<=> leaf(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0) ),
introduced(definition,[new_symbols(definition,[spl16_19])],[avatar_definition]) ).
fof(f427,plain,
( leaf(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0)
| ~ spl16_19 ),
inference(avatar_component_clause,[],[f426]) ).
fof(f428,plain,
( ~ spl16_18
| spl16_19 ),
inference(avatar_split_clause,[],[f421,f426,f423]) ).
fof(f430,plain,
( ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0)
| spl16_18 ),
inference(resolution,[],[f424,f184]) ).
fof(f432,plain,
( $false
| spl16_18 ),
inference(forward_subsumption_resolution,[],[f430,f298]) ).
fof(f433,plain,
spl16_18,
inference(avatar_contradiction_clause,[],[f432]) ).
fof(f435,plain,
( ! [X0] : ~ min_precedes(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),X0,tptp0)
| ~ spl16_19 ),
inference(resolution,[],[f427,f149]) ).
fof(f436,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| arboreal(sK13(X0)) ),
inference(resolution,[],[f172,f183]) ).
fof(f452,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| arboreal(sK12(X0)) ),
inference(resolution,[],[f173,f183]) ).
fof(f519,plain,
arboreal(sK14(sK12(sK15))),
inference(resolution,[],[f279,f259]) ).
fof(f522,plain,
! [X2,X0,X1] :
( ~ subactivity_occurrence(sK14(sK12(sK15)),X2)
| sK14(sK12(sK15)) = X0
| ~ occurrence_of(X2,X1)
| ~ arboreal(X0)
| min_precedes(X0,sK14(sK12(sK15)),X1)
| ~ subactivity_occurrence(X0,X2)
| min_precedes(sK14(sK12(sK15)),X0,X1) ),
inference(resolution,[],[f519,f129]) ).
fof(f530,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X2,sK14(sK12(sK15)),X1)
| ~ occurrence_of(sK2(X1,X2,sK14(sK12(sK15))),X3)
| ~ arboreal(X0)
| min_precedes(X0,sK14(sK12(sK15)),X3)
| ~ subactivity_occurrence(X0,sK2(X1,X2,sK14(sK12(sK15))))
| min_precedes(sK14(sK12(sK15)),X0,X3)
| sK14(sK12(sK15)) = X0 ),
inference(resolution,[],[f522,f132]) ).
fof(f562,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| root(sK12(X0),sK9(sK12(X0),X0)) ),
inference(resolution,[],[f160,f186]) ).
fof(f563,plain,
root(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK9(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))),
inference(resolution,[],[f562,f298]) ).
fof(f641,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(X0,sK9(sK12(X0),X0)) ),
inference(resolution,[],[f162,f186]) ).
fof(f642,plain,
occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),sK9(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))),
inference(resolution,[],[f641,f298]) ).
fof(f666,plain,
tptp0 = sK9(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),
inference(resolution,[],[f642,f311]) ).
fof(f676,plain,
root(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0),
inference(superposition,[],[f563,f666]) ).
fof(f680,plain,
! [X0] : ~ min_precedes(X0,sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0),
inference(resolution,[],[f676,f168]) ).
fof(f771,plain,
! [X0,X1] :
( ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),X0)
| ~ arboreal(X1)
| min_precedes(X1,sK14(sK12(sK15)),X0)
| ~ subactivity_occurrence(X1,sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| min_precedes(sK14(sK12(sK15)),X1,X0)
| sK14(sK12(sK15)) = X1 ),
inference(resolution,[],[f530,f264]) ).
fof(f772,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| min_precedes(X0,sK14(sK12(sK15)),tptp0)
| ~ arboreal(X0)
| min_precedes(sK14(sK12(sK15)),X0,tptp0)
| sK14(sK12(sK15)) = X0 ),
inference(resolution,[],[f771,f298]) ).
fof(f779,plain,
( min_precedes(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK14(sK12(sK15)),tptp0)
| ~ arboreal(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))))
| min_precedes(sK14(sK12(sK15)),sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0)
| sK14(sK12(sK15)) = sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0) ),
inference(resolution,[],[f772,f205]) ).
fof(f783,plain,
( min_precedes(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK14(sK12(sK15)),tptp0)
| ~ arboreal(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))))
| min_precedes(sK14(sK12(sK15)),sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0)
| sK14(sK12(sK15)) = sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0) ),
inference(resolution,[],[f772,f271]) ).
fof(f785,plain,
( min_precedes(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK14(sK12(sK15)),tptp0)
| min_precedes(sK14(sK12(sK15)),sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0)
| sK14(sK12(sK15)) = sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0) ),
inference(forward_subsumption_resolution,[],[f783,f452]) ).
fof(f786,plain,
( min_precedes(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK14(sK12(sK15)),tptp0)
| min_precedes(sK14(sK12(sK15)),sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0)
| sK14(sK12(sK15)) = sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0) ),
inference(forward_subsumption_resolution,[],[f779,f436]) ).
fof(f787,plain,
( min_precedes(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK14(sK12(sK15)),tptp0)
| sK14(sK12(sK15)) = sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0) ),
inference(forward_subsumption_resolution,[],[f785,f680]) ).
fof(f788,plain,
( min_precedes(sK14(sK12(sK15)),sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0)
| sK14(sK12(sK15)) = sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0)
| ~ spl16_19 ),
inference(forward_subsumption_resolution,[],[f786,f435]) ).
fof(f789,plain,
( min_precedes(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK14(sK12(sK15)),tptp0)
| sK14(sK12(sK15)) = sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))) ),
inference(forward_subsumption_resolution,[],[f787,f298]) ).
fof(f790,plain,
( min_precedes(sK14(sK12(sK15)),sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0)
| sK14(sK12(sK15)) = sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ spl16_19 ),
inference(forward_subsumption_resolution,[],[f788,f298]) ).
fof(f792,definition,
( spl16_28
<=> sK14(sK12(sK15)) = sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))) ),
introduced(definition,[new_symbols(definition,[spl16_28])],[avatar_definition]) ).
fof(f793,plain,
( sK14(sK12(sK15)) = sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ spl16_28 ),
inference(avatar_component_clause,[],[f792]) ).
fof(f795,definition,
( spl16_29
<=> min_precedes(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK14(sK12(sK15)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl16_29])],[avatar_definition]) ).
fof(f796,plain,
( min_precedes(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK14(sK12(sK15)),tptp0)
| ~ spl16_29 ),
inference(avatar_component_clause,[],[f795]) ).
fof(f797,plain,
( spl16_28
| spl16_29 ),
inference(avatar_split_clause,[],[f789,f795,f792]) ).
fof(f799,definition,
( spl16_30
<=> sK14(sK12(sK15)) = sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))) ),
introduced(definition,[new_symbols(definition,[spl16_30])],[avatar_definition]) ).
fof(f800,plain,
( sK14(sK12(sK15)) = sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ spl16_30 ),
inference(avatar_component_clause,[],[f799]) ).
fof(f802,definition,
( spl16_31
<=> min_precedes(sK14(sK12(sK15)),sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0) ),
introduced(definition,[new_symbols(definition,[spl16_31])],[avatar_definition]) ).
fof(f803,plain,
( min_precedes(sK14(sK12(sK15)),sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),tptp0)
| ~ spl16_31 ),
inference(avatar_component_clause,[],[f802]) ).
fof(f804,plain,
( spl16_30
| spl16_31
| ~ spl16_19 ),
inference(avatar_split_clause,[],[f790,f426,f802,f799]) ).
fof(f836,plain,
( root_occ(sK14(sK12(sK15)),sK2(tptp0,sK12(sK15),sK14(sK12(sK15))))
| ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0)
| ~ spl16_28 ),
inference(superposition,[],[f186,f793]) ).
fof(f837,plain,
( ~ occurrence_of(sK2(tptp0,sK12(sK15),sK14(sK12(sK15))),tptp0)
| ~ spl16_28 ),
inference(forward_subsumption_resolution,[],[f836,f265]) ).
fof(f843,plain,
( $false
| ~ spl16_28 ),
inference(forward_subsumption_resolution,[],[f837,f298]) ).
fof(f844,plain,
~ spl16_28,
inference(avatar_contradiction_clause,[],[f843]) ).
fof(f848,plain,
( occurrence_of(sK14(sK12(sK15)),tptp3)
| ~ spl16_30 ),
inference(superposition,[],[f299,f800]) ).
fof(f903,plain,
( tptp3 = tptp1
| ~ spl16_30 ),
inference(resolution,[],[f848,f261]) ).
fof(f910,plain,
( $false
| ~ spl16_30 ),
inference(forward_subsumption_resolution,[],[f903,f197]) ).
fof(f911,plain,
~ spl16_30,
inference(avatar_contradiction_clause,[],[f910]) ).
fof(f914,plain,
( ~ min_precedes(sK12(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),sK14(sK12(sK15)),tptp0)
| ~ spl16_31 ),
inference(resolution,[],[f803,f307]) ).
fof(f922,plain,
( $false
| ~ spl16_29
| ~ spl16_31 ),
inference(forward_subsumption_resolution,[],[f914,f796]) ).
fof(f923,plain,
( ~ spl16_29
| ~ spl16_31 ),
inference(avatar_contradiction_clause,[],[f922]) ).
cnf(s17,plain,
( ~ spl16_18
| spl16_19 ),
inference(sat_conversion,[],[f428]) ).
cnf(s19,plain,
spl16_18,
inference(sat_conversion,[],[f433]) ).
cnf(s33,plain,
( spl16_28
| spl16_29 ),
inference(sat_conversion,[],[f797]) ).
cnf(s34,plain,
( ~ spl16_19
| spl16_30
| spl16_31 ),
inference(sat_conversion,[],[f804]) ).
cnf(s35,plain,
~ spl16_28,
inference(sat_conversion,[],[f844]) ).
cnf(s42,plain,
~ spl16_30,
inference(sat_conversion,[],[f911]) ).
cnf(s45,plain,
( ~ spl16_29
| ~ spl16_31 ),
inference(sat_conversion,[],[f923]) ).
cnf(s46,plain,
( ~ spl16_19
| spl16_31 ),
inference(rat,[],[s34,s42]) ).
cnf(s47,plain,
spl16_29,
inference(rat,[],[s33,s35]) ).
cnf(s48,plain,
~ spl16_31,
inference(rat,[],[s45,s47]) ).
cnf(s49,plain,
~ spl16_19,
inference(rat,[],[s46,s48]) ).
cnf(s52,plain,
$false,
inference(rat,[],[s17,s49,s19]) ).
fof(f924,plain,
$false,
inference(avatar_sat_refutation,[],[s52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO003+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.12/0.38 % Computer : n020.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 22:17:04 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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
% 11.04/2.58 % (3817745)Detected formulas, will run a generic FOF schedule.
% 11.04/2.58 % (3817854)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2876878403:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 11.04/2.58 % (3817854)Refutation not found, incomplete strategy
% 11.04/2.58 % (3817854)------------------------------
% 11.04/2.58 % (3817854)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817854)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817854)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817854)Termination reason: Refutation not found, incomplete strategy
% 11.04/2.58 % (3817854)Time elapsed: 0.0000 s
% 11.04/2.58 % (3817854)Peak memory usage: 86 MB
% 11.04/2.58 % (3817852)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=1499498750:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 11.04/2.58 % (3817853)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=69307536:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 11.04/2.58 % (3817851)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=1452344016:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 11.04/2.58 % (3817857)dis-21_1_sil=8000:lcm=predicate:random_seed=2282581319: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)
% 11.04/2.58 % (3817856)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=226344253:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 11.04/2.58 % (3817855)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3565015787:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 11.04/2.58 % (3817855)Refutation not found, incomplete strategy
% 11.04/2.58 % (3817855)------------------------------
% 11.04/2.58 % (3817855)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817855)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817855)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817855)Termination reason: Refutation not found, incomplete strategy
% 11.04/2.58 % (3817855)Time elapsed: 0.001 s
% 11.04/2.58 % (3817855)Peak memory usage: 86 MB
% 11.04/2.58 % (3817857)Instruction limit reached!
% 11.04/2.58 % (3817857)------------------------------
% 11.04/2.58 % (3817857)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817857)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817857)Termination reason: Instruction limit
% 11.04/2.58 % (3817857)Termination phase: Saturation
% 11.04/2.58 % (3817857)Time elapsed: 0.092 s
% 11.04/2.58 % (3817857)Peak memory usage: 89 MB
% 11.04/2.58 % (3817857)Instructions burned: 129 (million)
% 11.04/2.58 % (3817856)Instruction limit reached!
% 11.04/2.58 % (3817856)------------------------------
% 11.04/2.58 % (3817856)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817856)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817856)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817856)Termination reason: Instruction limit
% 11.04/2.58 % (3817856)Termination phase: Saturation
% 11.04/2.58 % (3817856)Time elapsed: 0.131 s
% 11.04/2.58 % (3817856)Peak memory usage: 89 MB
% 11.04/2.58 % (3817856)Instructions burned: 139 (million)
% 11.04/2.58 % (3817854)------------------------------
% 11.04/2.58 % (3817854)------------------------------
% 11.04/2.58 % (3817892)lrs+10_1_sil=8000:sp=occurrence:random_seed=1563842308:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 11.04/2.58 % (3817895)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3992719252:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 11.04/2.58 % (3817855)------------------------------
% 11.04/2.58 % (3817855)------------------------------
% 11.04/2.58 % (3817894)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1513910978:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 11.04/2.58 % (3817894)Refutation not found, incomplete strategy
% 11.04/2.58 % (3817894)------------------------------
% 11.04/2.58 % (3817894)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817894)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817894)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817894)Termination reason: Refutation not found, incomplete strategy
% 11.04/2.58 % (3817894)Time elapsed: 0.002 s
% 11.04/2.58 % (3817894)Peak memory usage: 88 MB
% 11.04/2.58 % (3817895)Instruction limit reached!
% 11.04/2.58 % (3817895)------------------------------
% 11.04/2.58 % (3817895)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817895)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817895)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817895)Termination reason: Instruction limit
% 11.04/2.58 % (3817895)Termination phase: Saturation
% 11.04/2.58 % (3817895)Time elapsed: 0.128 s
% 11.04/2.58 % (3817895)Peak memory usage: 90 MB
% 11.04/2.58 % (3817895)Instructions burned: 327 (million)
% 11.04/2.58 % (3817892)Instruction limit reached!
% 11.04/2.58 % (3817892)------------------------------
% 11.04/2.58 % (3817892)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817892)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817892)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817892)Termination reason: Instruction limit
% 11.04/2.58 % (3817892)Termination phase: Saturation
% 11.04/2.58 % (3817892)Time elapsed: 0.296 s
% 11.04/2.58 % (3817892)Peak memory usage: 91 MB
% 11.04/2.58 % (3817892)Instructions burned: 285 (million)
% 11.04/2.58 % (3817907)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=104191145:s2a=on:i=248:s2at=1.23:gtg=position_2994 on theBenchmark for (2994ds/248Mi)
% 11.04/2.58 % (3817912)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1849719656:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 11.04/2.58 % (3817894)------------------------------
% 11.04/2.58 % (3817894)------------------------------
% 11.04/2.58 % (3817907)Instruction limit reached!
% 11.04/2.58 % (3817907)------------------------------
% 11.04/2.58 % (3817907)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817907)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817907)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817907)Termination reason: Instruction limit
% 11.04/2.58 % (3817907)Termination phase: Saturation
% 11.04/2.58 % (3817907)Time elapsed: 0.181 s
% 11.04/2.58 % (3817907)Peak memory usage: 90 MB
% 11.04/2.58 % (3817907)Instructions burned: 248 (million)
% 11.04/2.58 % (3817914)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2980483096:i=2350_2991 on theBenchmark for (2991ds/2350Mi)
% 11.04/2.58 % (3817917)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3825507241:cts=off:i=113:fsr=off:ss=included:sgt=4_2990 on theBenchmark for (2990ds/113Mi)
% 11.04/2.58 % (3817912)Instruction limit reached!
% 11.04/2.58 % (3817912)------------------------------
% 11.04/2.58 % (3817912)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817912)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817912)Termination reason: Instruction limit
% 11.04/2.58 % (3817912)Termination phase: Saturation
% 11.04/2.58 % (3817912)Time elapsed: 0.273 s
% 11.04/2.58 % (3817912)Peak memory usage: 89 MB
% 11.04/2.58 % (3817912)Instructions burned: 295 (million)
% 11.04/2.58 % (3817852)First to succeed.
% 11.04/2.58 % (3817852)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3817745"
% 11.04/2.58 % (3817919)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1704833407:i=127:av=off:fsr=off:sup=off_2989 on theBenchmark for (2989ds/127Mi)
% 11.04/2.58 % (3817917)Instruction limit reached!
% 11.04/2.58 % (3817917)------------------------------
% 11.04/2.58 % (3817917)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817917)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817917)Termination reason: Instruction limit
% 11.04/2.58 % (3817917)Termination phase: Saturation
% 11.04/2.58 % (3817917)Time elapsed: 0.097 s
% 11.04/2.58 % (3817917)Peak memory usage: 90 MB
% 11.04/2.58 % (3817917)Instructions burned: 114 (million)
% 11.04/2.58 % (3817919)Instruction limit reached!
% 11.04/2.58 % (3817919)------------------------------
% 11.04/2.58 % (3817919)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817919)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817919)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817919)Termination reason: Instruction limit
% 11.04/2.58 % (3817919)Termination phase: Saturation
% 11.04/2.58 % (3817919)Time elapsed: 0.110 s
% 11.04/2.58 % (3817919)Peak memory usage: 89 MB
% 11.04/2.58 % (3817919)Instructions burned: 128 (million)
% 11.04/2.58 % (3817928)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=76091207:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2987 on theBenchmark for (2987ds/114Mi)
% 11.04/2.58 % (3817928)Refutation not found, incomplete strategy
% 11.04/2.58 % (3817928)------------------------------
% 11.04/2.58 % (3817928)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817928)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817928)Termination reason: Refutation not found, incomplete strategy
% 11.04/2.58 % (3817928)Time elapsed: 0.001 s
% 11.04/2.58 % (3817928)Peak memory usage: 87 MB
% 11.04/2.58 % (3817931)lrs+10_1_sil=8000:sp=occurrence:random_seed=1013294609:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2986 on theBenchmark for (2986ds/907Mi)
% 11.04/2.58 % (3817932)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=2479236158:i=437:sd=1:aac=none:ss=included_2985 on theBenchmark for (2985ds/437Mi)
% 11.04/2.58 % (3817932)Refutation not found, incomplete strategy
% 11.04/2.58 % (3817932)------------------------------
% 11.04/2.58 % (3817932)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.58 % (3817932)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.58 % (3817932)CaDiCaL version: 2.1.3
% 11.04/2.58 % (3817932)Termination reason: Refutation not found, incomplete strategy
% 11.04/2.58 % (3817932)Time elapsed: 0.004 s
% 11.04/2.58 % (3817932)Peak memory usage: 88 MB
% 11.04/2.58 % (3817932)Instructions burned: 3 (million)
% 11.04/2.58 % (3817851)Also succeeded, but the first one will report.
% 11.04/2.58 % (3817852)Refutation found. Thanks to Tanya!
% 11.04/2.58 % SZS status Theorem for theBenchmark
% 11.04/2.58 % SZS output start Proof for theBenchmark
% See solution above
% 12.65/2.79 % (3817852)------------------------------
% 12.65/2.79 % (3817852)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.65/2.79 % (3817852)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.65/2.79 % (3817852)CaDiCaL version: 2.1.3
% 12.65/2.79 % (3817852)Termination reason: Refutation
% 12.65/2.79 % (3817852)Time elapsed: 1.125 s
% 12.65/2.79 % (3817852)Peak memory usage: 131 MB
% 12.65/2.79 % (3817852)Instructions burned: 1105 (million)
% 12.65/2.79 % (3817852)------------------------------
% 12.65/2.79 % (3817852)------------------------------
% 12.65/2.79 % (3817745)Success in time 1.724 s
% 12.65/2.79 % Vampire exiting
%------------------------------------------------------------------------------