%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO016+3 : 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 : n018.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 2.89s 1.33s
% Output : Refutation 4.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 85 ( 32 unt; 1 def)
% Number of atoms : 350 ( 10 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 405 ( 140 ~; 132 |; 115 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 197 ( 161 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
fof(f23,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_22) ).
fof(f26,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_25) ).
fof(f30,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_29) ).
fof(f38,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_37) ).
fof(f41,axiom,
! [X0,X1,X2,X3] :
( ( next_subocc(X1,X0,X3)
& next_subocc(X2,X0,X3) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_40) ).
fof(f44,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X1,X0)
& subactivity_occurrence(X2,X1)
& leaf_occ(X3,X1)
& arboreal(X2)
& ~ min_precedes(X2,X3,X0) )
=> X3 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_43) ).
fof(f45,axiom,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
=> ( arboreal(X0)
& arboreal(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_44) ).
fof(f50,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_49) ).
fof(f56,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_55) ).
fof(f63,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(f64,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)],[f63]) ).
fof(f66,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,[],[f64]) ).
fof(f67,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,[],[f66]) ).
fof(f68,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,[],[f50]) ).
fof(f69,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,[],[f68]) ).
fof(f71,plain,
! [X0,X1,X2,X3] :
( X3 = X2
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| ~ leaf_occ(X3,X1)
| ~ arboreal(X2)
| min_precedes(X2,X3,X0) ),
inference(ennf_transformation,[],[f44]) ).
fof(f72,plain,
! [X0,X1,X2,X3] :
( X3 = X2
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| ~ leaf_occ(X3,X1)
| ~ arboreal(X2)
| min_precedes(X2,X3,X0) ),
inference(flattening,[],[f71]) ).
fof(f75,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ( arboreal(X0)
& arboreal(X1) )
| ~ next_subocc(X0,X1,X2) ),
inference(ennf_transformation,[],[f45]) ).
fof(f77,plain,
! [X0,X1,X2,X3] :
( X1 = X2
| ~ next_subocc(X1,X0,X3)
| ~ next_subocc(X2,X0,X3) ),
inference(ennf_transformation,[],[f41]) ).
fof(f78,plain,
! [X0,X1,X2,X3] :
( X1 = X2
| ~ next_subocc(X1,X0,X3)
| ~ next_subocc(X2,X0,X3) ),
inference(flattening,[],[f77]) ).
fof(f81,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,[],[f23]) ).
fof(f84,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,[],[f30]) ).
fof(f85,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(flattening,[],[f84]) ).
fof(f86,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,[],[f26]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f88,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f87]) ).
fof(f91,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(f92,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,[],[f67,f91]) ).
fof(f96,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))],[f92]) ).
fof(f97,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))],[f69]) ).
fof(f98,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f75]) ).
fof(f99,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,[],[f81]) ).
fof(f100,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,[],[f99]) ).
fof(f101,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,[],[f100]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK8(X0,X1,X2),X2)
& min_precedes(sK8(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,[sK8]),skolemize(X3,sK8(X0,X1,X2))],[f101]) ).
fof(f103,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK9(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK9(X0,X1,X2))
& subactivity_occurrence(X2,sK9(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1,X2))],[f86]) ).
fof(f107,plain,
~ leaf_occ(sK2,sK3),
inference(cnf_transformation,[],[f96]) ).
fof(f108,plain,
arboreal(sK2),
inference(cnf_transformation,[],[f96]) ).
fof(f109,plain,
subactivity_occurrence(sK2,sK3),
inference(cnf_transformation,[],[f96]) ).
fof(f110,plain,
occurrence_of(sK3,tptp0),
inference(cnf_transformation,[],[f96]) ).
fof(f118,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,[],[f97]) ).
fof(f119,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,[],[f97]) ).
fof(f121,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,[],[f97]) ).
fof(f123,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,[],[f97]) ).
fof(f124,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,[],[f97]) ).
fof(f128,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f56]) ).
fof(f135,plain,
! [X2,X3,X0,X1] :
( ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X0)
| ~ subactivity_occurrence(X2,X1)
| X2 = X3
| ~ arboreal(X2)
| min_precedes(X2,X3,X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f138,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f139,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| arboreal(X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f141,plain,
! [X2,X3,X0,X1] :
( ~ next_subocc(X2,X0,X3)
| ~ next_subocc(X1,X0,X3)
| X1 = X2 ),
inference(cnf_transformation,[],[f78]) ).
fof(f143,plain,
! [X2,X0,X1,X4] :
( ~ next_subocc(X0,X1,X2)
| ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) ),
inference(cnf_transformation,[],[f102]) ).
fof(f144,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f102]) ).
fof(f148,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,[],[f85]) ).
fof(f149,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f150,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f151,plain,
! [X2,X0,X1] :
( occurrence_of(sK9(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f152,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f168,plain,
leaf_occ(sK7(sK2,sK3),sK3),
inference(unit_resulting_resolution,[],[f118,f108,f107,f109,f110]) ).
fof(f171,plain,
! [X0] : ~ min_precedes(sK7(sK2,sK3),X0,tptp0),
inference(unit_resulting_resolution,[],[f152,f110,f168]) ).
fof(f173,plain,
occurrence_of(sK5(sK2,sK3),tptp3),
inference(unit_resulting_resolution,[],[f124,f108,f107,f109,f110]) ).
fof(f174,plain,
arboreal(sK5(sK2,sK3)),
inference(unit_resulting_resolution,[],[f138,f128,f173]) ).
fof(f178,plain,
next_subocc(sK6(sK2,sK3),sK7(sK2,sK3),tptp0),
inference(unit_resulting_resolution,[],[f119,f108,f107,f109,f110]) ).
fof(f184,plain,
next_subocc(sK5(sK2,sK3),sK6(sK2,sK3),tptp0),
inference(unit_resulting_resolution,[],[f121,f108,f107,f109,f110]) ).
fof(f198,plain,
arboreal(sK7(sK2,sK3)),
inference(unit_resulting_resolution,[],[f139,f178]) ).
fof(f202,plain,
min_precedes(sK6(sK2,sK3),sK7(sK2,sK3),tptp0),
inference(unit_resulting_resolution,[],[f144,f178]) ).
fof(f208,plain,
min_precedes(sK5(sK2,sK3),sK6(sK2,sK3),tptp0),
inference(unit_resulting_resolution,[],[f144,f184]) ).
fof(f214,plain,
subactivity_occurrence(sK7(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),
inference(unit_resulting_resolution,[],[f149,f202]) ).
fof(f215,plain,
subactivity_occurrence(sK6(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),
inference(unit_resulting_resolution,[],[f150,f202]) ).
fof(f216,plain,
occurrence_of(sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3)),tptp0),
inference(unit_resulting_resolution,[],[f151,f202]) ).
fof(f259,plain,
~ leaf_occ(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),
inference(unit_resulting_resolution,[],[f152,f208,f216]) ).
fof(f274,plain,
subactivity_occurrence(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),
inference(unit_resulting_resolution,[],[f148,f208,f216,f215]) ).
fof(f351,plain,
leaf_occ(sK7(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),
inference(unit_resulting_resolution,[],[f118,f174,f216,f259,f274]) ).
fof(f352,plain,
next_subocc(sK6(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),sK7(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),tptp0),
inference(unit_resulting_resolution,[],[f119,f174,f216,f259,f274]) ).
fof(f353,plain,
next_subocc(sK5(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),sK6(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),tptp0),
inference(unit_resulting_resolution,[],[f121,f174,f216,f259,f274]) ).
fof(f355,plain,
next_subocc(sK5(sK2,sK3),sK5(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),tptp0),
inference(unit_resulting_resolution,[],[f123,f174,f216,f259,f274]) ).
fof(f487,plain,
min_precedes(sK5(sK2,sK3),sK5(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),tptp0),
inference(unit_resulting_resolution,[],[f144,f355]) ).
fof(f550,plain,
sK7(sK2,sK3) = sK7(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),
inference(unit_resulting_resolution,[],[f135,f198,f216,f214,f171,f351]) ).
fof(f650,plain,
min_precedes(sK5(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),sK6(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),tptp0),
inference(unit_resulting_resolution,[],[f144,f353]) ).
fof(f718,plain,
next_subocc(sK6(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),sK7(sK2,sK3),tptp0),
inference(superposition,[],[f352,f550]) ).
fof(f1027,plain,
~ next_subocc(sK5(sK2,sK3),sK6(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),tptp0),
inference(unit_resulting_resolution,[],[f143,f487,f650]) ).
fof(f1155,plain,
sK6(sK2,sK3) = sK6(sK5(sK2,sK3),sK9(tptp0,sK6(sK2,sK3),sK7(sK2,sK3))),
inference(unit_resulting_resolution,[],[f141,f178,f718]) ).
fof(f1553,plain,
~ next_subocc(sK5(sK2,sK3),sK6(sK2,sK3),tptp0),
inference(superposition,[],[f1027,f1155]) ).
fof(f1559,plain,
$false,
inference(forward_subsumption_resolution,[],[f1553,f184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO016+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 22:24:54 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.89/1.33 % (2792699)Detected formulas, will run a generic FOF schedule.
% 2.89/1.33 % (2792710)dis-21_1_sil=8000:lcm=predicate:random_seed=37616658: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)
% 2.89/1.33 % (2792709)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3000570436:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.89/1.33 % (2792708)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2431697699:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.89/1.33 % (2792704)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=1630025091:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.89/1.33 % (2792707)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=281484824:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.89/1.33 % (2792706)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=299871787:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.89/1.33 % (2792705)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=3792539904:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.89/1.33 % (2792710)Instruction limit reached!
% 2.89/1.33 % (2792710)------------------------------
% 2.89/1.33 % (2792710)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.89/1.33 % (2792710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.89/1.33 % (2792710)CaDiCaL version: 2.1.3
% 2.89/1.33 % (2792710)Termination reason: Instruction limit
% 2.89/1.33 % (2792710)Termination phase: Saturation
% 2.89/1.33 % (2792710)Time elapsed: 0.041 s
% 2.89/1.33 % (2792710)Peak memory usage: 89 MB
% 2.89/1.33 % (2792710)Instructions burned: 130 (million)
% 2.89/1.33 % (2792707)Instruction limit reached!
% 2.89/1.33 % (2792707)------------------------------
% 2.89/1.33 % (2792707)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.89/1.33 % (2792707)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.89/1.33 % (2792707)CaDiCaL version: 2.1.3
% 2.89/1.33 % (2792707)Termination reason: Instruction limit
% 2.89/1.33 % (2792707)Termination phase: Saturation
% 2.89/1.33 % (2792707)Time elapsed: 0.055 s
% 2.89/1.33 % (2792707)Peak memory usage: 88 MB
% 2.89/1.33 % (2792707)Instructions burned: 110 (million)
% 2.89/1.33 % (2792709)Instruction limit reached!
% 2.89/1.33 % (2792709)------------------------------
% 2.89/1.33 % (2792709)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.89/1.33 % (2792709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.89/1.33 % (2792709)CaDiCaL version: 2.1.3
% 2.89/1.33 % (2792709)Termination reason: Instruction limit
% 2.89/1.33 % (2792709)Termination phase: Saturation
% 2.89/1.33 % (2792709)Time elapsed: 0.062 s
% 2.89/1.33 % (2792709)Peak memory usage: 89 MB
% 2.89/1.33 % (2792709)Instructions burned: 139 (million)
% 2.89/1.33 % (2792708)Instruction limit reached!
% 2.89/1.33 % (2792708)------------------------------
% 2.89/1.33 % (2792708)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.89/1.33 % (2792708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.89/1.33 % (2792708)CaDiCaL version: 2.1.3
% 2.89/1.33 % (2792708)Termination reason: Instruction limit
% 2.89/1.33 % (2792708)Termination phase: Saturation
% 2.89/1.33 % (2792708)Time elapsed: 0.066 s
% 2.89/1.33 % (2792708)Peak memory usage: 88 MB
% 2.89/1.33 % (2792708)Instructions burned: 119 (million)
% 2.89/1.33 % (2792719)lrs+10_1_sil=32000:urr=on:br=off:random_seed=473478581:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.89/1.33 % (2792718)lrs+10_1_sil=8000:sp=occurrence:random_seed=1476571939:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.89/1.33 % (2792721)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=976768427:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 2.89/1.33 % (2792719)First to succeed.
% 2.89/1.33 % (2792720)lrs+1011_1_sil=32000:sp=occurrence:random_seed=303320834:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.89/1.33 % (2792719)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2792699"
% 2.89/1.33 % (2792721)Instruction limit reached!
% 2.89/1.33 % (2792721)------------------------------
% 2.89/1.33 % (2792721)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.89/1.33 % (2792721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.89/1.33 % (2792721)CaDiCaL version: 2.1.3
% 2.89/1.33 % (2792721)Termination reason: Instruction limit
% 2.89/1.33 % (2792721)Termination phase: Saturation
% 2.89/1.33 % (2792721)Time elapsed: 0.132 s
% 2.89/1.33 % (2792721)Peak memory usage: 89 MB
% 2.89/1.33 % (2792721)Instructions burned: 248 (million)
% 2.89/1.33 % (2792718)Instruction limit reached!
% 2.89/1.33 % (2792718)------------------------------
% 2.89/1.33 % (2792718)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.89/1.33 % (2792718)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.89/1.33 % (2792718)CaDiCaL version: 2.1.3
% 2.89/1.33 % (2792718)Termination reason: Instruction limit
% 2.89/1.33 % (2792718)Termination phase: Saturation
% 2.89/1.33 % (2792718)Time elapsed: 0.172 s
% 2.89/1.33 % (2792718)Peak memory usage: 91 MB
% 2.89/1.33 % (2792718)Instructions burned: 286 (million)
% 2.89/1.33 % (2792719)Refutation found. Thanks to Tanya!
% 2.89/1.33 % SZS status Theorem for theBenchmark
% 2.89/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 4.10/1.52 % (2792719)------------------------------
% 4.10/1.52 % (2792719)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.10/1.52 % (2792719)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.10/1.52 % (2792719)CaDiCaL version: 2.1.3
% 4.10/1.52 % (2792719)Termination reason: Refutation
% 4.10/1.52 % (2792719)Time elapsed: 0.039 s
% 4.10/1.52 % (2792719)Peak memory usage: 90 MB
% 4.10/1.52 % (2792719)Instructions burned: 131 (million)
% 4.10/1.52 % (2792719)------------------------------
% 4.10/1.52 % (2792719)------------------------------
% 4.10/1.52 % (2792699)Success in time 0.49 s
% 4.10/1.52 % Vampire exiting
%------------------------------------------------------------------------------