%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO016+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:28 PM UTC 2026
% Result : Theorem 3.57s 1.48s
% Output : Refutation 4.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 88 ( 35 unt; 1 def)
% Number of atoms : 383 ( 10 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 453 ( 158 ~; 155 |; 122 &)
% ( 5 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 196 ( 159 !; 37 ?)
% 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(f10,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& leaf_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_09) ).
fof(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(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(f29,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X2,X3)
& ~ atomic(X3)
& leaf_occ(X0,X2)
& leaf_occ(X1,X2) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_28) ).
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,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X3,X4,tptp0)
& leaf_occ(X4,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(f35,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_34) ).
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,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X2,X3,tptp0)
& leaf_occ(X3,X1)
& ( occurrence_of(X3,tptp1)
=> ~ ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) ) )
& ( occurrence_of(X3,tptp2)
=> ~ ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,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,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X2,X3,tptp0)
& leaf_occ(X3,X1)
& ( occurrence_of(X3,tptp1)
=> ~ ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) ) )
& ( occurrence_of(X3,tptp2)
=> ~ ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f51,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,X1)
| ( ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) )
& occurrence_of(X3,tptp1) )
| ( ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) )
& occurrence_of(X3,tptp2) ) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f52,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,X1)
| ( ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) )
& occurrence_of(X3,tptp1) )
| ( ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) )
& occurrence_of(X3,tptp2) ) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(flattening,[],[f51]) ).
fof(f53,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,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X3,X4,tptp0)
& leaf_occ(X4,X1) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f54,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,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X3,X4,tptp0)
& leaf_occ(X4,X1) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f53]) ).
fof(f55,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(f56,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(flattening,[],[f55]) ).
fof(f58,plain,
! [X0,X1,X2,X3] :
( X0 = X1
| ~ occurrence_of(X2,X3)
| atomic(X3)
| ~ leaf_occ(X0,X2)
| ~ leaf_occ(X1,X2) ),
inference(ennf_transformation,[],[f29]) ).
fof(f59,plain,
! [X0,X1,X2,X3] :
( X0 = X1
| ~ occurrence_of(X2,X3)
| atomic(X3)
| ~ leaf_occ(X0,X2)
| ~ leaf_occ(X1,X2) ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f60]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ( arboreal(X0)
& arboreal(X1) )
| ~ next_subocc(X0,X1,X2) ),
inference(ennf_transformation,[],[f26]) ).
fof(f67,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f68,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(f69,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,[],[f68]) ).
fof(f70,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(f71,definition,
! [X2,X3] :
( ( ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) )
& occurrence_of(X3,tptp2) )
| ~ sP0(X2,X3) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f72,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,X1)
| ( ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) )
& occurrence_of(X3,tptp1) )
| sP0(X2,X3) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(definition_folding,[],[f52,f71]) ).
fof(f76,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK2,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,sK3)
| ( occurrence_of(sK4(X2),tptp2)
& min_precedes(X2,sK4(X2),tptp0)
& occurrence_of(X3,tptp1) )
| sP0(X2,X3) )
& occurrence_of(sK3,tptp0)
& subactivity_occurrence(sK2,sK3)
& arboreal(sK2)
& ~ leaf_occ(sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X4,sK4(X2))],[f72]) ).
fof(f77,plain,
! [X0,X1] :
( ( occurrence_of(sK5(X0,X1),tptp3)
& next_subocc(X0,sK5(X0,X1),tptp0)
& occurrence_of(sK6(X0,X1),tptp4)
& next_subocc(sK5(X0,X1),sK6(X0,X1),tptp0)
& ( occurrence_of(sK7(X0,X1),tptp1)
| occurrence_of(sK7(X0,X1),tptp2) )
& next_subocc(sK6(X0,X1),sK7(X0,X1),tptp0)
& leaf_occ(sK7(X0,X1),X1) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X2,sK5(X0,X1)),skolemize(X3,sK6(X0,X1)),skolemize(X4,sK7(X0,X1))],[f54]) ).
fof(f79,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(f80,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,[],[f79]) ).
fof(f81,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ( occurrence_of(X1,sK9(X0,X1))
& subactivity_occurrence(X0,X1)
& leaf(X0,sK9(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f80]) ).
fof(f83,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f67]) ).
fof(f84,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,[],[f70]) ).
fof(f85,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,[],[f84]) ).
fof(f86,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,[],[f85]) ).
fof(f87,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))],[f86]) ).
fof(f91,plain,
~ leaf_occ(sK2,sK3),
inference(cnf_transformation,[],[f76]) ).
fof(f92,plain,
arboreal(sK2),
inference(cnf_transformation,[],[f76]) ).
fof(f93,plain,
subactivity_occurrence(sK2,sK3),
inference(cnf_transformation,[],[f76]) ).
fof(f94,plain,
occurrence_of(sK3,tptp0),
inference(cnf_transformation,[],[f76]) ).
fof(f101,plain,
~ atomic(tptp0),
inference(cnf_transformation,[],[f35]) ).
fof(f102,plain,
! [X0,X1] :
( leaf_occ(sK7(X0,X1),X1)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f103,plain,
! [X0,X1] :
( next_subocc(sK6(X0,X1),sK7(X0,X1),tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f105,plain,
! [X0,X1] :
( next_subocc(sK5(X0,X1),sK6(X0,X1),tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f107,plain,
! [X0,X1] :
( next_subocc(X0,sK5(X0,X1),tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f108,plain,
! [X0,X1] :
( occurrence_of(sK5(X0,X1),tptp3)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f112,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f39]) ).
fof(f116,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,[],[f56]) ).
fof(f122,plain,
! [X2,X3,X0,X1] :
( ~ leaf_occ(X1,X2)
| ~ occurrence_of(X2,X3)
| atomic(X3)
| ~ leaf_occ(X0,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f59]) ).
fof(f124,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f81]) ).
fof(f127,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f131,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| arboreal(X1) ),
inference(cnf_transformation,[],[f66]) ).
fof(f132,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| arboreal(X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f134,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f83]) ).
fof(f135,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,[],[f69]) ).
fof(f136,plain,
! [X2,X0,X1,X4] :
( ~ next_subocc(X0,X1,X2)
| ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) ),
inference(cnf_transformation,[],[f87]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f87]) ).
fof(f150,plain,
leaf_occ(sK7(sK2,sK3),sK3),
inference(unit_resulting_resolution,[],[f102,f92,f91,f93,f94]) ).
fof(f153,plain,
! [X0] : ~ min_precedes(sK7(sK2,sK3),X0,tptp0),
inference(unit_resulting_resolution,[],[f127,f94,f150]) ).
fof(f156,plain,
subactivity_occurrence(sK7(sK2,sK3),sK3),
inference(unit_resulting_resolution,[],[f124,f150]) ).
fof(f163,plain,
next_subocc(sK6(sK2,sK3),sK7(sK2,sK3),tptp0),
inference(unit_resulting_resolution,[],[f103,f92,f91,f93,f94]) ).
fof(f171,plain,
min_precedes(sK6(sK2,sK3),sK7(sK2,sK3),tptp0),
inference(unit_resulting_resolution,[],[f137,f163]) ).
fof(f172,plain,
arboreal(sK6(sK2,sK3)),
inference(unit_resulting_resolution,[],[f132,f163]) ).
fof(f173,plain,
arboreal(sK7(sK2,sK3)),
inference(unit_resulting_resolution,[],[f131,f163]) ).
fof(f197,plain,
subactivity_occurrence(sK6(sK2,sK3),sK3),
inference(unit_resulting_resolution,[],[f116,f94,f156,f171]) ).
fof(f201,plain,
~ leaf_occ(sK6(sK2,sK3),sK3),
inference(unit_resulting_resolution,[],[f127,f94,f171]) ).
fof(f214,plain,
leaf_occ(sK7(sK6(sK2,sK3),sK3),sK3),
inference(unit_resulting_resolution,[],[f102,f94,f172,f197,f201]) ).
fof(f215,plain,
next_subocc(sK6(sK6(sK2,sK3),sK3),sK7(sK6(sK2,sK3),sK3),tptp0),
inference(unit_resulting_resolution,[],[f103,f94,f172,f197,f201]) ).
fof(f216,plain,
next_subocc(sK5(sK6(sK2,sK3),sK3),sK6(sK6(sK2,sK3),sK3),tptp0),
inference(unit_resulting_resolution,[],[f105,f94,f172,f197,f201]) ).
fof(f218,plain,
next_subocc(sK6(sK2,sK3),sK5(sK6(sK2,sK3),sK3),tptp0),
inference(unit_resulting_resolution,[],[f107,f94,f172,f197,f201]) ).
fof(f219,plain,
occurrence_of(sK5(sK6(sK2,sK3),sK3),tptp3),
inference(unit_resulting_resolution,[],[f108,f94,f172,f197,f201]) ).
fof(f241,plain,
sK7(sK2,sK3) = sK7(sK6(sK2,sK3),sK3),
inference(unit_resulting_resolution,[],[f122,f101,f94,f150,f214]) ).
fof(f272,plain,
arboreal(sK5(sK6(sK2,sK3),sK3)),
inference(unit_resulting_resolution,[],[f134,f112,f219]) ).
fof(f375,plain,
min_precedes(sK6(sK2,sK3),sK5(sK6(sK2,sK3),sK3),tptp0),
inference(unit_resulting_resolution,[],[f137,f218]) ).
fof(f432,plain,
min_precedes(sK6(sK6(sK2,sK3),sK3),sK7(sK6(sK2,sK3),sK3),tptp0),
inference(unit_resulting_resolution,[],[f137,f215]) ).
fof(f436,plain,
min_precedes(sK6(sK6(sK2,sK3),sK3),sK7(sK2,sK3),tptp0),
inference(forward_demodulation,[],[f432,f241]) ).
fof(f439,plain,
min_precedes(sK5(sK6(sK2,sK3),sK3),sK6(sK6(sK2,sK3),sK3),tptp0),
inference(unit_resulting_resolution,[],[f137,f216]) ).
fof(f502,plain,
~ min_precedes(sK5(sK6(sK2,sK3),sK3),sK7(sK2,sK3),tptp0),
inference(unit_resulting_resolution,[],[f136,f163,f375]) ).
fof(f506,plain,
subactivity_occurrence(sK6(sK6(sK2,sK3),sK3),sK3),
inference(unit_resulting_resolution,[],[f116,f94,f156,f436]) ).
fof(f624,plain,
subactivity_occurrence(sK5(sK6(sK2,sK3),sK3),sK3),
inference(unit_resulting_resolution,[],[f116,f94,f506,f439]) ).
fof(f628,plain,
~ leaf_occ(sK5(sK6(sK2,sK3),sK3),sK3),
inference(unit_resulting_resolution,[],[f127,f94,f439]) ).
fof(f724,plain,
sK7(sK2,sK3) = sK5(sK6(sK2,sK3),sK3),
inference(unit_resulting_resolution,[],[f135,f94,f173,f156,f624,f272,f153,f502]) ).
fof(f749,plain,
~ leaf_occ(sK7(sK2,sK3),sK3),
inference(superposition,[],[f628,f724]) ).
fof(f763,plain,
$false,
inference(forward_subsumption_resolution,[],[f749,f150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO016+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.11/0.38 % Computer : n020.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:23:20 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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
% 3.57/1.48 % (3824803)Detected formulas, will run a generic FOF schedule.
% 3.57/1.48 % (3824808)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=3134512775:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.57/1.48 % (3824809)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=3378505719:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.57/1.48 % (3824813)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=708419744:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.57/1.48 % (3824812)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1869662737:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.57/1.48 % (3824811)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3977029815:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.57/1.48 % (3824810)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=1386798674:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.57/1.48 % (3824814)dis-21_1_sil=8000:lcm=predicate:random_seed=2804550699: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)
% 3.57/1.48 % (3824811)Instruction limit reached!
% 3.57/1.48 % (3824811)------------------------------
% 3.57/1.48 % (3824811)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.48 % (3824811)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.48 % (3824811)CaDiCaL version: 2.1.3
% 3.57/1.48 % (3824811)Termination reason: Instruction limit
% 3.57/1.48 % (3824811)Termination phase: Saturation
% 3.57/1.48 % (3824811)Time elapsed: 0.057 s
% 3.57/1.48 % (3824811)Peak memory usage: 88 MB
% 3.57/1.48 % (3824811)Instructions burned: 110 (million)
% 3.57/1.48 % (3824812)Instruction limit reached!
% 3.57/1.48 % (3824812)------------------------------
% 3.57/1.48 % (3824812)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.48 % (3824812)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.48 % (3824812)CaDiCaL version: 2.1.3
% 3.57/1.48 % (3824812)Termination reason: Instruction limit
% 3.57/1.48 % (3824812)Termination phase: Saturation
% 3.57/1.48 % (3824812)Time elapsed: 0.069 s
% 3.57/1.48 % (3824812)Peak memory usage: 88 MB
% 3.57/1.48 % (3824812)Instructions burned: 120 (million)
% 3.57/1.48 % (3824814)Instruction limit reached!
% 3.57/1.48 % (3824814)------------------------------
% 3.57/1.48 % (3824814)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.48 % (3824814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.48 % (3824814)CaDiCaL version: 2.1.3
% 3.57/1.48 % (3824814)Termination reason: Instruction limit
% 3.57/1.48 % (3824814)Termination phase: Saturation
% 3.57/1.48 % (3824814)Time elapsed: 0.073 s
% 3.57/1.48 % (3824814)Peak memory usage: 89 MB
% 3.57/1.48 % (3824814)Instructions burned: 130 (million)
% 3.57/1.48 % (3824813)Instruction limit reached!
% 3.57/1.48 % (3824813)------------------------------
% 3.57/1.48 % (3824813)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.48 % (3824813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.48 % (3824813)CaDiCaL version: 2.1.3
% 3.57/1.48 % (3824813)Termination reason: Instruction limit
% 3.57/1.48 % (3824813)Termination phase: Saturation
% 3.57/1.48 % (3824813)Time elapsed: 0.097 s
% 3.57/1.48 % (3824813)Peak memory usage: 90 MB
% 3.57/1.48 % (3824813)Instructions burned: 140 (million)
% 3.57/1.48 % (3824822)lrs+10_1_sil=8000:sp=occurrence:random_seed=1522170127:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.57/1.48 % (3824823)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2619692479:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.57/1.48 % (3824824)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3567380606:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.57/1.48 % (3824823)First to succeed.
% 3.57/1.48 % (3824823)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3824803"
% 3.57/1.48 % (3824825)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=1275188816:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.57/1.48 % (3824822)Instruction limit reached!
% 3.57/1.48 % (3824822)------------------------------
% 3.57/1.48 % (3824822)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.48 % (3824822)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.48 % (3824822)CaDiCaL version: 2.1.3
% 3.57/1.48 % (3824822)Termination reason: Instruction limit
% 3.57/1.48 % (3824822)Termination phase: Saturation
% 3.57/1.48 % (3824822)Time elapsed: 0.163 s
% 3.57/1.48 % (3824822)Peak memory usage: 90 MB
% 3.57/1.48 % (3824822)Instructions burned: 286 (million)
% 3.57/1.48 % (3824825)Instruction limit reached!
% 3.57/1.48 % (3824825)------------------------------
% 3.57/1.48 % (3824825)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.48 % (3824825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.48 % (3824825)CaDiCaL version: 2.1.3
% 3.57/1.48 % (3824825)Termination reason: Instruction limit
% 3.57/1.48 % (3824825)Termination phase: Saturation
% 3.57/1.48 % (3824825)Time elapsed: 0.137 s
% 3.57/1.48 % (3824825)Peak memory usage: 90 MB
% 3.57/1.48 % (3824825)Instructions burned: 248 (million)
% 3.57/1.48 % (3824824)Instruction limit reached!
% 3.57/1.48 % (3824824)------------------------------
% 3.57/1.48 % (3824824)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.48 % (3824824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.48 % (3824824)CaDiCaL version: 2.1.3
% 3.57/1.48 % (3824824)Termination reason: Instruction limit
% 3.57/1.48 % (3824824)Termination phase: Saturation
% 3.57/1.48 % (3824824)Time elapsed: 0.216 s
% 3.57/1.48 % (3824824)Peak memory usage: 91 MB
% 3.57/1.48 % (3824824)Instructions burned: 325 (million)
% 3.57/1.48 % (3824823)Refutation found. Thanks to Tanya!
% 3.57/1.48 % SZS status Theorem for theBenchmark
% 3.57/1.48 % SZS output start Proof for theBenchmark
% See solution above
% 4.98/1.68 % (3824823)------------------------------
% 4.98/1.68 % (3824823)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/1.68 % (3824823)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/1.68 % (3824823)CaDiCaL version: 2.1.3
% 4.98/1.68 % (3824823)Termination reason: Refutation
% 4.98/1.68 % (3824823)Time elapsed: 0.032 s
% 4.98/1.68 % (3824823)Peak memory usage: 89 MB
% 4.98/1.68 % (3824823)Instructions burned: 53 (million)
% 4.98/1.68 % (3824823)------------------------------
% 4.98/1.68 % (3824823)------------------------------
% 4.98/1.68 % (3824803)Success in time 0.622 s
% 4.98/1.68 % Vampire exiting
%------------------------------------------------------------------------------