%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO003+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:20 PM UTC 2026
% Result : Theorem 8.78s 2.11s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 19
% Syntax : Number of formulae : 169 ( 40 unt; 5 def)
% Number of atoms : 509 ( 40 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 555 ( 215 ~; 235 |; 87 &)
% ( 10 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 19 ( 17 usr; 6 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 239 ( 0 sgn 210 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ~ ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(f6,axiom,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
=> ( arboreal(X0)
& arboreal(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
fof(f8,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ~ root(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(f11,axiom,
! [X0,X1] :
( root_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10) ).
fof(f12,axiom,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& leaf(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_11) ).
fof(f16,axiom,
! [X0,X1] :
( atocc(X0,X1)
<=> ? [X2] :
( subactivity(X1,X2)
& atomic(X2)
& occurrence_of(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_15) ).
fof(f23,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(f25,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/sandbox2/benchmark/theBenchmark.p',sos_24) ).
fof(f27,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3,X4] :
( subactivity(X3,X0)
& subactivity(X4,X0)
& atocc(X1,X3)
& atocc(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_26) ).
fof(f29,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X1,X0)
& arboreal(X2)
& arboreal(X3)
& subactivity_occurrence(X2,X1)
& subactivity_occurrence(X3,X1) )
=> ( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_28) ).
fof(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/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f43,axiom,
tptp1 != tptp3,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',sos_45) ).
fof(f47,conjecture,
~ ? [X0] : occurrence_of(X0,tptp0),
file('/export/starexec/sandbox2/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(f58,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,[],[f5]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ( arboreal(X0)
& arboreal(X1) )
| ~ next_subocc(X0,X1,X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f75,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f23]) ).
fof(f76,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f75]) ).
fof(f79,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,[],[f25]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ? [X3,X4] :
( subactivity(X3,X0)
& subactivity(X4,X0)
& atocc(X1,X3)
& atocc(X2,X4) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f84,plain,
! [X0,X1,X2,X3] :
( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| ~ subactivity_occurrence(X3,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f85,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,[],[f84]) ).
fof(f90,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(f91,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(f92,plain,
! [X0,X1] :
( ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ root_occ(X0,X1) ),
inference(flattening,[],[f91]) ).
fof(f93,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,[],[f58]) ).
fof(f94,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,[],[f93]) ).
fof(f95,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,[],[f94]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK0(X0,X1,X2),X2)
& min_precedes(sK0(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,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f95]) ).
fof(f99,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,[],[f11]) ).
fof(f100,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,[],[f99]) ).
fof(f101,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ( occurrence_of(X1,sK1(X0,X1))
& subactivity_occurrence(X0,X1)
& root(X0,sK1(X0,X1)) )
| ~ root_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1))],[f100]) ).
fof(f102,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,[],[f12]) ).
fof(f103,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,[],[f102]) ).
fof(f104,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ( occurrence_of(X1,sK2(X0,X1))
& subactivity_occurrence(X0,X1)
& leaf(X0,sK2(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1))],[f103]) ).
fof(f110,plain,
! [X0,X1] :
( ( atocc(X0,X1)
| ! [X2] :
( ~ subactivity(X1,X2)
| ~ atomic(X2)
| ~ occurrence_of(X0,X2) ) )
& ( ? [X2] :
( subactivity(X1,X2)
& atomic(X2)
& occurrence_of(X0,X2) )
| ~ atocc(X0,X1) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f111,plain,
! [X0,X1] :
( ( atocc(X0,X1)
| ! [X2] :
( ~ subactivity(X1,X2)
| ~ atomic(X2)
| ~ occurrence_of(X0,X2) ) )
& ( ? [X3] :
( subactivity(X1,X3)
& atomic(X3)
& occurrence_of(X0,X3) )
| ~ atocc(X0,X1) ) ),
inference(rectify,[],[f110]) ).
fof(f112,plain,
! [X0,X1] :
( ( atocc(X0,X1)
| ! [X2] :
( ~ subactivity(X1,X2)
| ~ atomic(X2)
| ~ occurrence_of(X0,X2) ) )
& ( ( subactivity(X1,sK5(X0,X1))
& atomic(sK5(X0,X1))
& occurrence_of(X0,sK5(X0,X1)) )
| ~ atocc(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1))],[f111]) ).
fof(f115,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK8(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK8(X0,X1,X2))
& subactivity_occurrence(X2,sK8(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X3,sK8(X0,X1,X2))],[f79]) ).
fof(f117,plain,
! [X0,X1,X2] :
( ( subactivity(sK10(X0,X1,X2),X0)
& subactivity(sK11(X0,X1,X2),X0)
& atocc(X1,sK10(X0,X1,X2))
& atocc(X2,sK11(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X3,sK10(X0,X1,X2)),skolemize(X4,sK11(X0,X1,X2))],[f82]) ).
fof(f120,plain,
! [X0] :
( ( occurrence_of(sK14(X0),tptp4)
& root_occ(sK14(X0),X0)
& occurrence_of(sK15(X0),tptp3)
& leaf_occ(sK15(X0),X0)
& next_subocc(sK14(X0),sK15(X0),tptp0) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15]),skolemize(X1,sK14(X0)),skolemize(X2,sK15(X0))],[f90]) ).
fof(f121,plain,
! [X0,X1] :
( ( occurrence_of(sK16(X0),tptp1)
& next_subocc(X0,sK16(X0),tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ root_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16]),skolemize(X2,sK16(X0))],[f92]) ).
fof(f122,plain,
occurrence_of(sK17,tptp0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17]),skolemize(X0,sK17)],[f49]) ).
fof(f127,plain,
! [X2,X0,X1,X4] :
( ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2)
| ~ next_subocc(X0,X1,X2) ),
inference(cnf_transformation,[],[f96]) ).
fof(f128,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f96]) ).
fof(f131,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| arboreal(X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f132,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| arboreal(X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f134,plain,
! [X2,X0,X1] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f61]) ).
fof(f139,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| root(X0,sK1(X0,X1)) ),
inference(cnf_transformation,[],[f101]) ).
fof(f140,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f141,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| occurrence_of(X1,sK1(X0,X1)) ),
inference(cnf_transformation,[],[f101]) ).
fof(f144,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f104]) ).
fof(f154,plain,
! [X0,X1] :
( ~ atocc(X0,X1)
| occurrence_of(X0,sK5(X0,X1)) ),
inference(cnf_transformation,[],[f112]) ).
fof(f166,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f76]) ).
fof(f169,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK8(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f170,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK8(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f171,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| occurrence_of(sK8(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f174,plain,
! [X2,X0,X1] :
( atocc(X2,sK11(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f180,plain,
! [X2,X3,X0,X1] :
( ~ arboreal(X3)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| min_precedes(X2,X3,X0)
| ~ subactivity_occurrence(X2,X1)
| ~ subactivity_occurrence(X3,X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f186,plain,
! [X0] :
( next_subocc(sK14(X0),sK15(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f187,plain,
! [X0] :
( leaf_occ(sK15(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f188,plain,
! [X0] :
( occurrence_of(sK15(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f189,plain,
! [X0] :
( root_occ(sK14(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f200,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f43]) ).
fof(f203,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK16(X0),tptp0)
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f204,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| occurrence_of(sK16(X0),tptp1)
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f205,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f122]) ).
fof(f206,plain,
! [X0] :
( ~ occurrence_of(sK17,X0)
| tptp0 = X0 ),
inference(resolution,[],[f166,f205]) ).
fof(f208,plain,
! [X0] :
( subactivity_occurrence(sK15(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f144,f187]) ).
fof(f209,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| min_precedes(sK14(X0),sK15(X0),tptp0) ),
inference(resolution,[],[f186,f128]) ).
fof(f252,plain,
! [X0] :
( next_subocc(X0,sK16(X0),tptp0)
| ~ root_occ(X0,sK17) ),
inference(resolution,[],[f203,f205]) ).
fof(f253,plain,
! [X0] :
( ~ root_occ(X0,sK17)
| min_precedes(X0,sK16(X0),tptp0) ),
inference(resolution,[],[f252,f128]) ).
fof(f257,plain,
! [X0,X1] :
( ~ occurrence_of(sK15(X0),X1)
| ~ occurrence_of(X0,tptp0)
| tptp3 = X1 ),
inference(resolution,[],[f188,f166]) ).
fof(f294,plain,
( min_precedes(sK14(sK17),sK16(sK14(sK17)),tptp0)
| ~ occurrence_of(sK17,tptp0) ),
inference(resolution,[],[f253,f189]) ).
fof(f295,plain,
min_precedes(sK14(sK17),sK16(sK14(sK17)),tptp0),
inference(forward_subsumption_resolution,[],[f294,f205]) ).
fof(f300,plain,
! [X0] :
( subactivity_occurrence(sK14(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f140,f189]) ).
fof(f313,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| root(sK14(X0),sK1(sK14(X0),X0)) ),
inference(resolution,[],[f139,f189]) ).
fof(f314,plain,
root(sK14(sK17),sK1(sK14(sK17),sK17)),
inference(resolution,[],[f313,f205]) ).
fof(f318,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| arboreal(sK15(X0)) ),
inference(resolution,[],[f131,f186]) ).
fof(f343,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| arboreal(sK14(X0)) ),
inference(resolution,[],[f132,f186]) ).
fof(f345,plain,
arboreal(sK14(sK17)),
inference(resolution,[],[f343,f205]) ).
fof(f347,plain,
! [X2,X0,X1] :
( ~ subactivity_occurrence(sK14(sK17),X2)
| sK14(sK17) = X0
| ~ occurrence_of(X2,X1)
| ~ arboreal(X0)
| min_precedes(X0,sK14(sK17),X1)
| ~ subactivity_occurrence(X0,X2)
| min_precedes(sK14(sK17),X0,X1) ),
inference(resolution,[],[f345,f180]) ).
fof(f351,plain,
occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),tptp0),
inference(resolution,[],[f171,f295]) ).
fof(f352,plain,
! [X0] :
( ~ root_occ(X0,sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| next_subocc(X0,sK16(X0),tptp0) ),
inference(resolution,[],[f351,f203]) ).
fof(f353,plain,
! [X0] :
( ~ root_occ(X0,sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| occurrence_of(sK16(X0),tptp1) ),
inference(resolution,[],[f351,f204]) ).
fof(f354,plain,
min_precedes(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0),
inference(resolution,[],[f351,f209]) ).
fof(f358,plain,
root(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK1(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))),
inference(resolution,[],[f351,f313]) ).
fof(f359,plain,
arboreal(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))),
inference(resolution,[],[f351,f318]) ).
fof(f364,plain,
! [X0] :
( ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),X0)
| tptp0 = X0 ),
inference(resolution,[],[f351,f166]) ).
fof(f449,plain,
! [X2,X0,X1] :
( ~ subactivity_occurrence(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),X2)
| sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))) = X0
| ~ occurrence_of(X2,X1)
| ~ arboreal(X0)
| min_precedes(X0,sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),X1)
| ~ subactivity_occurrence(X0,X2)
| min_precedes(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),X0,X1) ),
inference(resolution,[],[f359,f180]) ).
fof(f470,plain,
( occurrence_of(sK16(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))),tptp1)
| ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),tptp0) ),
inference(resolution,[],[f353,f189]) ).
fof(f471,plain,
occurrence_of(sK16(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))),tptp1),
inference(forward_subsumption_resolution,[],[f470,f351]) ).
fof(f477,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(X0,sK1(sK14(X0),X0)) ),
inference(resolution,[],[f141,f189]) ).
fof(f478,plain,
occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),sK1(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))),
inference(resolution,[],[f477,f351]) ).
fof(f480,plain,
occurrence_of(sK17,sK1(sK14(sK17),sK17)),
inference(resolution,[],[f477,f205]) ).
fof(f484,plain,
tptp0 = sK1(sK14(sK17),sK17),
inference(resolution,[],[f480,f206]) ).
fof(f490,plain,
root(sK14(sK17),tptp0),
inference(superposition,[],[f314,f484]) ).
fof(f497,plain,
! [X0] : ~ min_precedes(X0,sK14(sK17),tptp0),
inference(resolution,[],[f490,f134]) ).
fof(f499,plain,
tptp0 = sK1(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),
inference(resolution,[],[f478,f364]) ).
fof(f505,plain,
root(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0),
inference(superposition,[],[f358,f499]) ).
fof(f508,plain,
! [X0] : ~ min_precedes(X0,sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0),
inference(resolution,[],[f505,f134]) ).
fof(f516,plain,
( next_subocc(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK16(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))),tptp0)
| ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),tptp0) ),
inference(resolution,[],[f352,f189]) ).
fof(f517,plain,
next_subocc(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK16(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))),tptp0),
inference(forward_subsumption_resolution,[],[f516,f351]) ).
fof(f519,plain,
arboreal(sK16(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))))),
inference(resolution,[],[f517,f131]) ).
fof(f597,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(sK14(sK17),X2,X1)
| ~ occurrence_of(sK8(X1,sK14(sK17),X2),X3)
| ~ arboreal(X0)
| min_precedes(X0,sK14(sK17),X3)
| ~ subactivity_occurrence(X0,sK8(X1,sK14(sK17),X2))
| min_precedes(sK14(sK17),X0,X3)
| sK14(sK17) = X0 ),
inference(resolution,[],[f347,f170]) ).
fof(f713,plain,
! [X0,X1] :
( ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),X0)
| ~ arboreal(X1)
| min_precedes(X1,sK14(sK17),X0)
| ~ subactivity_occurrence(X1,sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| min_precedes(sK14(sK17),X1,X0)
| sK14(sK17) = X1 ),
inference(resolution,[],[f597,f295]) ).
fof(f714,plain,
! [X0] :
( ~ arboreal(X0)
| min_precedes(X0,sK14(sK17),tptp0)
| ~ subactivity_occurrence(X0,sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| min_precedes(sK14(sK17),X0,tptp0)
| sK14(sK17) = X0 ),
inference(resolution,[],[f713,f351]) ).
fof(f719,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| ~ arboreal(X0)
| min_precedes(sK14(sK17),X0,tptp0)
| sK14(sK17) = X0 ),
inference(forward_subsumption_resolution,[],[f714,f497]) ).
fof(f724,plain,
( ~ arboreal(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))))
| min_precedes(sK14(sK17),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| sK14(sK17) = sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),tptp0) ),
inference(resolution,[],[f719,f208]) ).
fof(f727,plain,
( ~ arboreal(sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))))
| min_precedes(sK14(sK17),sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| sK14(sK17) = sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),tptp0) ),
inference(resolution,[],[f719,f300]) ).
fof(f728,plain,
( min_precedes(sK14(sK17),sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| sK14(sK17) = sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),tptp0) ),
inference(forward_subsumption_resolution,[],[f727,f343]) ).
fof(f729,plain,
( min_precedes(sK14(sK17),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| sK14(sK17) = sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),tptp0) ),
inference(forward_subsumption_resolution,[],[f724,f318]) ).
fof(f730,plain,
( sK14(sK17) = sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),tptp0) ),
inference(forward_subsumption_resolution,[],[f728,f508]) ).
fof(f731,plain,
( min_precedes(sK14(sK17),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| sK14(sK17) = sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))) ),
inference(forward_subsumption_resolution,[],[f729,f351]) ).
fof(f732,plain,
sK14(sK17) = sK14(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),
inference(forward_subsumption_resolution,[],[f730,f351]) ).
fof(f734,definition,
( spl18_37
<=> sK14(sK17) = sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))) ),
introduced(definition,[new_symbols(definition,[spl18_37])],[avatar_definition]) ).
fof(f735,plain,
( sK14(sK17) = sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| ~ spl18_37 ),
inference(avatar_component_clause,[],[f734]) ).
fof(f737,definition,
( spl18_38
<=> min_precedes(sK14(sK17),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_38])],[avatar_definition]) ).
fof(f738,plain,
( min_precedes(sK14(sK17),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| ~ spl18_38 ),
inference(avatar_component_clause,[],[f737]) ).
fof(f739,plain,
( spl18_37
| spl18_38 ),
inference(avatar_split_clause,[],[f731,f737,f734]) ).
fof(f740,plain,
min_precedes(sK14(sK17),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0),
inference(superposition,[],[f354,f732]) ).
fof(f745,plain,
occurrence_of(sK16(sK14(sK17)),tptp1),
inference(superposition,[],[f471,f732]) ).
fof(f750,plain,
next_subocc(sK14(sK17),sK16(sK14(sK17)),tptp0),
inference(superposition,[],[f517,f732]) ).
fof(f751,plain,
arboreal(sK16(sK14(sK17))),
inference(superposition,[],[f519,f732]) ).
fof(f763,plain,
( next_subocc(sK14(sK17),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),tptp0) ),
inference(superposition,[],[f186,f732]) ).
fof(f766,plain,
next_subocc(sK14(sK17),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0),
inference(forward_subsumption_resolution,[],[f763,f351]) ).
fof(f773,plain,
( min_precedes(sK14(sK17),sK14(sK17),tptp0)
| ~ spl18_37 ),
inference(forward_demodulation,[],[f740,f735]) ).
fof(f775,plain,
( $false
| ~ spl18_37 ),
inference(forward_subsumption_resolution,[],[f773,f497]) ).
fof(f776,plain,
~ spl18_37,
inference(avatar_contradiction_clause,[],[f775]) ).
fof(f1047,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| occurrence_of(X1,sK5(X1,sK11(X2,X0,X1))) ),
inference(resolution,[],[f174,f154]) ).
fof(f1049,plain,
( occurrence_of(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK5(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK11(tptp0,sK14(sK17),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))))))
| ~ spl18_38 ),
inference(resolution,[],[f1047,f738]) ).
fof(f1074,plain,
( ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),tptp0)
| tptp3 = sK5(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK11(tptp0,sK14(sK17),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))))
| ~ spl18_38 ),
inference(resolution,[],[f1049,f257]) ).
fof(f1079,plain,
( tptp3 = sK5(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK11(tptp0,sK14(sK17),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))))
| ~ spl18_38 ),
inference(forward_subsumption_resolution,[],[f1074,f351]) ).
fof(f1080,plain,
( occurrence_of(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp3)
| ~ spl18_38 ),
inference(superposition,[],[f1049,f1079]) ).
fof(f1421,plain,
! [X0,X1] :
( sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))) = X0
| ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),X1)
| ~ arboreal(X0)
| min_precedes(X0,sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),X1)
| ~ subactivity_occurrence(X0,sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| min_precedes(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),X0,X1)
| ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),tptp0) ),
inference(resolution,[],[f449,f208]) ).
fof(f1424,plain,
! [X0,X1] :
( ~ occurrence_of(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))),X1)
| sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))) = X0
| ~ arboreal(X0)
| min_precedes(X0,sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),X1)
| ~ subactivity_occurrence(X0,sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| min_precedes(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),X0,X1) ),
inference(forward_subsumption_resolution,[],[f1421,f351]) ).
fof(f1425,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| ~ arboreal(X0)
| min_precedes(X0,sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))) = X0
| min_precedes(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),X0,tptp0) ),
inference(resolution,[],[f1424,f351]) ).
fof(f1670,plain,
( ~ arboreal(sK16(sK14(sK17)))
| min_precedes(sK16(sK14(sK17)),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| sK16(sK14(sK17)) = sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| min_precedes(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK16(sK14(sK17)),tptp0)
| ~ min_precedes(sK14(sK17),sK16(sK14(sK17)),tptp0) ),
inference(resolution,[],[f1425,f169]) ).
fof(f1675,plain,
( min_precedes(sK16(sK14(sK17)),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| sK16(sK14(sK17)) = sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| min_precedes(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK16(sK14(sK17)),tptp0)
| ~ min_precedes(sK14(sK17),sK16(sK14(sK17)),tptp0) ),
inference(forward_subsumption_resolution,[],[f1670,f751]) ).
fof(f1676,plain,
( min_precedes(sK16(sK14(sK17)),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| sK16(sK14(sK17)) = sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| min_precedes(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK16(sK14(sK17)),tptp0) ),
inference(forward_subsumption_resolution,[],[f1675,f295]) ).
fof(f1678,definition,
( spl18_78
<=> min_precedes(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK16(sK14(sK17)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_78])],[avatar_definition]) ).
fof(f1679,plain,
( min_precedes(sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),sK16(sK14(sK17)),tptp0)
| ~ spl18_78 ),
inference(avatar_component_clause,[],[f1678]) ).
fof(f1681,definition,
( spl18_79
<=> sK16(sK14(sK17)) = sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))) ),
introduced(definition,[new_symbols(definition,[spl18_79])],[avatar_definition]) ).
fof(f1682,plain,
( sK16(sK14(sK17)) = sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17))))
| ~ spl18_79 ),
inference(avatar_component_clause,[],[f1681]) ).
fof(f1684,definition,
( spl18_80
<=> min_precedes(sK16(sK14(sK17)),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_80])],[avatar_definition]) ).
fof(f1685,plain,
( min_precedes(sK16(sK14(sK17)),sK15(sK8(tptp0,sK14(sK17),sK16(sK14(sK17)))),tptp0)
| ~ spl18_80 ),
inference(avatar_component_clause,[],[f1684]) ).
fof(f1686,plain,
( spl18_78
| spl18_79
| spl18_80 ),
inference(avatar_split_clause,[],[f1676,f1684,f1681,f1678]) ).
fof(f1687,plain,
( $false
| ~ spl18_38
| ~ spl18_78 ),
inference(unit_resulting_resolution,[],[f127,f750,f738,f1679]) ).
fof(f1700,plain,
( ~ spl18_38
| ~ spl18_78 ),
inference(avatar_contradiction_clause,[],[f1687]) ).
fof(f1735,plain,
( occurrence_of(sK16(sK14(sK17)),tptp3)
| ~ spl18_38
| ~ spl18_79 ),
inference(superposition,[],[f1080,f1682]) ).
fof(f1780,plain,
( $false
| ~ spl18_38
| ~ spl18_79 ),
inference(unit_resulting_resolution,[],[f166,f200,f745,f1735]) ).
fof(f1792,plain,
( ~ spl18_38
| ~ spl18_79 ),
inference(avatar_contradiction_clause,[],[f1780]) ).
fof(f1795,plain,
( $false
| ~ spl18_80 ),
inference(unit_resulting_resolution,[],[f127,f295,f766,f1685]) ).
fof(f1808,plain,
~ spl18_80,
inference(avatar_contradiction_clause,[],[f1795]) ).
cnf(s49,plain,
( spl18_37
| spl18_38 ),
inference(sat_conversion,[],[f739]) ).
cnf(s50,plain,
~ spl18_37,
inference(sat_conversion,[],[f776]) ).
cnf(s90,plain,
( spl18_78
| spl18_79
| spl18_80 ),
inference(sat_conversion,[],[f1686]) ).
cnf(s91,plain,
( ~ spl18_38
| ~ spl18_78 ),
inference(sat_conversion,[],[f1700]) ).
cnf(s98,plain,
( ~ spl18_38
| ~ spl18_79 ),
inference(sat_conversion,[],[f1792]) ).
cnf(s100,plain,
~ spl18_80,
inference(sat_conversion,[],[f1808]) ).
cnf(s103,plain,
( spl18_78
| spl18_79 ),
inference(rat,[],[s90,s100]) ).
cnf(s107,plain,
spl18_38,
inference(rat,[],[s49,s50]) ).
cnf(s108,plain,
~ spl18_79,
inference(rat,[],[s98,s107]) ).
cnf(s109,plain,
~ spl18_78,
inference(rat,[],[s91,s107]) ).
cnf(s111,plain,
$false,
inference(rat,[],[s103,s108,s109]) ).
fof(f1812,plain,
$false,
inference(avatar_sat_refutation,[],[s111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO003+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n006.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 22:16:11 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.78/2.11 % (3379782)Detected formulas, will run a generic FOF schedule.
% 8.78/2.11 % (3379790)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2861549671:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 8.78/2.11 % (3379790)Refutation not found, incomplete strategy
% 8.78/2.11 % (3379790)------------------------------
% 8.78/2.11 % (3379790)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379790)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379790)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379790)Termination reason: Refutation not found, incomplete strategy
% 8.78/2.11 % (3379790)Time elapsed: 0.0000 s
% 8.78/2.11 % (3379790)Peak memory usage: 86 MB
% 8.78/2.11 % (3379788)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=3250027083:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 8.78/2.11 % (3379789)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=2781284745:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 8.78/2.11 % (3379791)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2753092814:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 8.78/2.11 % (3379787)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=1696828079:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 8.78/2.11 % (3379791)Refutation not found, incomplete strategy
% 8.78/2.11 % (3379791)------------------------------
% 8.78/2.11 % (3379791)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379791)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379791)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379791)Termination reason: Refutation not found, incomplete strategy
% 8.78/2.11 % (3379791)Time elapsed: 0.001 s
% 8.78/2.11 % (3379791)Peak memory usage: 86 MB
% 8.78/2.11 % (3379793)dis-21_1_sil=8000:lcm=predicate:random_seed=2704786527: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)
% 8.78/2.11 % (3379792)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3581723410:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 8.78/2.11 % (3379793)Instruction limit reached!
% 8.78/2.11 % (3379793)------------------------------
% 8.78/2.11 % (3379793)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379793)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379793)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379793)Termination reason: Instruction limit
% 8.78/2.11 % (3379793)Termination phase: Saturation
% 8.78/2.11 % (3379793)Time elapsed: 0.075 s
% 8.78/2.11 % (3379793)Peak memory usage: 89 MB
% 8.78/2.11 % (3379793)Instructions burned: 131 (million)
% 8.78/2.11 % (3379790)------------------------------
% 8.78/2.11 % (3379790)------------------------------
% 8.78/2.11 % (3379792)Instruction limit reached!
% 8.78/2.11 % (3379792)------------------------------
% 8.78/2.11 % (3379792)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379792)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379792)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379792)Termination reason: Instruction limit
% 8.78/2.11 % (3379792)Termination phase: Saturation
% 8.78/2.11 % (3379792)Time elapsed: 0.103 s
% 8.78/2.11 % (3379792)Peak memory usage: 90 MB
% 8.78/2.11 % (3379792)Instructions burned: 140 (million)
% 8.78/2.11 % (3379802)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2839780500:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 8.78/2.11 % (3379802)Refutation not found, incomplete strategy
% 8.78/2.11 % (3379802)------------------------------
% 8.78/2.11 % (3379802)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379802)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379802)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379802)Termination reason: Refutation not found, incomplete strategy
% 8.78/2.11 % (3379802)Time elapsed: 0.001 s
% 8.78/2.11 % (3379802)Peak memory usage: 88 MB
% 8.78/2.11 % (3379801)lrs+10_1_sil=8000:sp=occurrence:random_seed=3755106159:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 8.78/2.11 % (3379791)------------------------------
% 8.78/2.11 % (3379791)------------------------------
% 8.78/2.11 % (3379803)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3351329003:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 8.78/2.11 % (3379802)------------------------------
% 8.78/2.11 % (3379802)------------------------------
% 8.78/2.11 % (3379806)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=709336988:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 8.78/2.11 % (3379801)Instruction limit reached!
% 8.78/2.11 % (3379801)------------------------------
% 8.78/2.11 % (3379801)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379801)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379801)Termination reason: Instruction limit
% 8.78/2.11 % (3379801)Termination phase: Saturation
% 8.78/2.11 % (3379801)Time elapsed: 0.185 s
% 8.78/2.11 % (3379801)Peak memory usage: 91 MB
% 8.78/2.11 % (3379801)Instructions burned: 285 (million)
% 8.78/2.11 % (3379808)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=746889069:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 8.78/2.11 % (3379803)Instruction limit reached!
% 8.78/2.11 % (3379803)------------------------------
% 8.78/2.11 % (3379803)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379803)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379803)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379803)Termination reason: Instruction limit
% 8.78/2.11 % (3379803)Termination phase: Saturation
% 8.78/2.11 % (3379803)Time elapsed: 0.192 s
% 8.78/2.11 % (3379803)Peak memory usage: 91 MB
% 8.78/2.11 % (3379803)Instructions burned: 325 (million)
% 8.78/2.11 % (3379808)Instruction limit reached!
% 8.78/2.11 % (3379808)------------------------------
% 8.78/2.11 % (3379808)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379808)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379808)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379808)Termination reason: Instruction limit
% 8.78/2.11 % (3379808)Termination phase: Saturation
% 8.78/2.11 % (3379808)Time elapsed: 0.084 s
% 8.78/2.11 % (3379808)Peak memory usage: 88 MB
% 8.78/2.11 % (3379808)Instructions burned: 296 (million)
% 8.78/2.11 % (3379806)Instruction limit reached!
% 8.78/2.11 % (3379806)------------------------------
% 8.78/2.11 % (3379806)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379806)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379806)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379806)Termination reason: Instruction limit
% 8.78/2.11 % (3379806)Termination phase: Saturation
% 8.78/2.11 % (3379806)Time elapsed: 0.151 s
% 8.78/2.11 % (3379806)Peak memory usage: 90 MB
% 8.78/2.11 % (3379806)Instructions burned: 248 (million)
% 8.78/2.11 % (3379810)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3851289730:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 8.78/2.11 % (3379812)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1568913389:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 8.78/2.11 % (3379813)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=2775293829:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 8.78/2.11 % (3379813)Instruction limit reached!
% 8.78/2.11 % (3379813)------------------------------
% 8.78/2.11 % (3379813)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379813)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379813)Termination reason: Instruction limit
% 8.78/2.11 % (3379813)Termination phase: Saturation
% 8.78/2.11 % (3379813)Time elapsed: 0.036 s
% 8.78/2.11 % (3379813)Peak memory usage: 89 MB
% 8.78/2.11 % (3379813)Instructions burned: 129 (million)
% 8.78/2.11 % (3379814)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=3258131106:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2993 on theBenchmark for (2993ds/114Mi)
% 8.78/2.11 % (3379814)Refutation not found, incomplete strategy
% 8.78/2.11 % (3379814)------------------------------
% 8.78/2.11 % (3379814)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379814)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379814)Termination reason: Refutation not found, incomplete strategy
% 8.78/2.11 % (3379814)Time elapsed: 0.001 s
% 8.78/2.11 % (3379814)Peak memory usage: 87 MB
% 8.78/2.11 % (3379812)Instruction limit reached!
% 8.78/2.11 % (3379812)------------------------------
% 8.78/2.11 % (3379812)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379812)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379812)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379812)Termination reason: Instruction limit
% 8.78/2.11 % (3379812)Termination phase: Saturation
% 8.78/2.11 % (3379812)Time elapsed: 0.085 s
% 8.78/2.11 % (3379812)Peak memory usage: 90 MB
% 8.78/2.11 % (3379812)Instructions burned: 113 (million)
% 8.78/2.11 % (3379818)lrs+10_1_sil=8000:sp=occurrence:random_seed=1967731834:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 8.78/2.11 % (3379820)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=1128095502:i=437:sd=1:aac=none:ss=included_2991 on theBenchmark for (2991ds/437Mi)
% 8.78/2.11 % (3379820)Refutation not found, incomplete strategy
% 8.78/2.11 % (3379820)------------------------------
% 8.78/2.11 % (3379820)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379820)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379820)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379820)Termination reason: Refutation not found, incomplete strategy
% 8.78/2.11 % (3379820)Time elapsed: 0.004 s
% 8.78/2.11 % (3379820)Peak memory usage: 88 MB
% 8.78/2.11 % (3379820)Instructions burned: 4 (million)
% 8.78/2.11 % (3379788)First to succeed.
% 8.78/2.11 % (3379788)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3379782"
% 8.78/2.11 % (3379814)------------------------------
% 8.78/2.11 % (3379814)------------------------------
% 8.78/2.11 % (3379823)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=979116165:i=5202:ss=axioms:sgt=16_2989 on theBenchmark for (2989ds/5202Mi)
% 8.78/2.11 % (3379820)------------------------------
% 8.78/2.11 % (3379820)------------------------------
% 8.78/2.11 % (3379818)Instruction limit reached!
% 8.78/2.11 % (3379818)------------------------------
% 8.78/2.11 % (3379818)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.78/2.11 % (3379818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.78/2.11 % (3379818)CaDiCaL version: 2.1.3
% 8.78/2.11 % (3379818)Termination reason: Instruction limit
% 8.78/2.11 % (3379818)Termination phase: Saturation
% 8.78/2.11 % (3379818)Time elapsed: 0.306 s
% 8.78/2.11 % (3379818)Peak memory usage: 98 MB
% 8.78/2.11 % (3379818)Instructions burned: 907 (million)
% 8.78/2.11 % (3379788)Refutation found. Thanks to Tanya!
% 8.78/2.11 % SZS status Theorem for theBenchmark
% 8.78/2.11 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/2.30 % (3379788)------------------------------
% 0.17/2.30 % (3379788)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/2.30 % (3379788)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/2.30 % (3379788)CaDiCaL version: 2.1.3
% 0.17/2.30 % (3379788)Termination reason: Refutation
% 0.17/2.30 % (3379788)Time elapsed: 0.840 s
% 0.17/2.30 % (3379788)Peak memory usage: 131 MB
% 0.17/2.30 % (3379788)Instructions burned: 1204 (million)
% 0.17/2.30 % (3379788)------------------------------
% 0.17/2.30 % (3379788)------------------------------
% 0.17/2.30 % (3379782)Success in time 1.255 s
% 0.17/2.30 % Vampire exiting
%------------------------------------------------------------------------------