%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO014+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 : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:30:27 PM UTC 2026
% Result : Theorem 2.73s 1.32s
% Output : Refutation 3.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 16
% Syntax : Number of formulae : 131 ( 22 unt; 8 def)
% Number of atoms : 463 ( 12 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 544 ( 212 ~; 230 |; 84 &)
% ( 10 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 9 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 167 ( 0 sgn 142 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X0,X1,X3)
& min_precedes(X1,X2,X3) )
=> min_precedes(X0,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
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(f19,axiom,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_18) ).
fof(f20,axiom,
! [X0,X1] :
( subactivity_occurrence(X0,X1)
=> ( activity_occurrence(X0)
& activity_occurrence(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_19) ).
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(f33,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f46,conjecture,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f50,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(ennf_transformation,[],[f1]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(flattening,[],[f50]) ).
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(f71,plain,
! [X0] :
( ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) )
| ~ activity_occurrence(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f72,plain,
! [X0,X1] :
( ( activity_occurrence(X0)
& activity_occurrence(X1) )
| ~ subactivity_occurrence(X0,X1) ),
inference(ennf_transformation,[],[f20]) ).
fof(f77,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f23]) ).
fof(f78,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f77]) ).
fof(f81,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(f92,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f93,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& next_subocc(X3,X4,tptp0)
& leaf(X4,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f92]) ).
fof(f94,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f95,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f96,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(f97,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,[],[f96]) ).
fof(f98,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,[],[f97]) ).
fof(f99,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))],[f98]) ).
fof(f111,plain,
! [X0] :
( ( activity(sK5(X0))
& occurrence_of(X0,sK5(X0)) )
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X1,sK5(X0))],[f71]) ).
fof(f113,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK7(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK7(X0,X1,X2))
& subactivity_occurrence(X2,sK7(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X3,sK7(X0,X1,X2))],[f81]) ).
fof(f118,plain,
! [X0,X1] :
( ( occurrence_of(sK13(X0),tptp3)
& next_subocc(X0,sK13(X0),tptp0)
& occurrence_of(sK14(X0),tptp4)
& next_subocc(sK13(X0),sK14(X0),tptp0)
& ( occurrence_of(sK15(X0),tptp2)
| occurrence_of(sK15(X0),tptp1) )
& next_subocc(sK14(X0),sK15(X0),tptp0)
& leaf(sK15(X0),tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14,sK15]),skolemize(X2,sK13(X0)),skolemize(X3,sK14(X0)),skolemize(X4,sK15(X0))],[f93]) ).
fof(f119,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK16,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(sK17,tptp0)
& subactivity_occurrence(sK16,sK17)
& arboreal(sK16)
& ~ leaf_occ(sK16,sK17) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17]),skolemize(X0,sK16),skolemize(X1,sK17)],[f95]) ).
fof(f120,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X0,X1,X3)
| min_precedes(X0,X2,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(cnf_transformation,[],[f51]) ).
fof(f125,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f153,plain,
! [X0] :
( occurrence_of(X0,sK5(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f156,plain,
! [X0,X1] :
( activity_occurrence(X0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f72]) ).
fof(f159,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X1)
| X1 = X2
| ~ occurrence_of(X0,X2) ),
inference(cnf_transformation,[],[f78]) ).
fof(f162,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK7(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f179,plain,
! [X0,X1] :
( ~ occurrence_of(X1,tptp0)
| leaf(sK15(X0),tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f180,plain,
! [X0,X1] :
( next_subocc(sK14(X0),sK15(X0),tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f181,plain,
! [X0,X1] :
( occurrence_of(sK15(X0),tptp1)
| occurrence_of(sK15(X0),tptp2)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f182,plain,
! [X0,X1] :
( next_subocc(sK13(X0),sK14(X0),tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f184,plain,
! [X0,X1] :
( next_subocc(X0,sK13(X0),tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f185,plain,
! [X0,X1] :
( occurrence_of(sK13(X0),tptp3)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f198,plain,
~ leaf_occ(sK16,sK17),
inference(cnf_transformation,[],[f119]) ).
fof(f199,plain,
arboreal(sK16),
inference(cnf_transformation,[],[f119]) ).
fof(f200,plain,
subactivity_occurrence(sK16,sK17),
inference(cnf_transformation,[],[f119]) ).
fof(f201,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f119]) ).
fof(f202,plain,
! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X3,tptp1)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f119]) ).
fof(f203,plain,
! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X3,tptp2)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f119]) ).
fof(f353,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK17)
| leaf(sK15(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,sK17) ),
inference(resolution,[],[f179,f201]) ).
fof(f365,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(X1,X0)
| ~ arboreal(X1)
| leaf_occ(X1,X0)
| tptp3 = X2
| ~ occurrence_of(sK13(X1),X2) ),
inference(resolution,[],[f185,f159]) ).
fof(f373,plain,
! [X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(X1,X0)
| ~ arboreal(X1)
| leaf_occ(X1,X0)
| min_precedes(X1,sK13(X1),tptp0) ),
inference(resolution,[],[f184,f125]) ).
fof(f379,plain,
! [X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(X1,X0)
| ~ arboreal(X1)
| leaf_occ(X1,X0)
| min_precedes(sK14(X1),sK15(X1),tptp0) ),
inference(resolution,[],[f180,f125]) ).
fof(f383,plain,
! [X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(X1,X0)
| ~ arboreal(X1)
| leaf_occ(X1,X0)
| min_precedes(sK13(X1),sK14(X1),tptp0) ),
inference(resolution,[],[f182,f125]) ).
fof(f396,plain,
( leaf(sK15(sK16),tptp0)
| ~ arboreal(sK16)
| leaf_occ(sK16,sK17) ),
inference(resolution,[],[f353,f200]) ).
fof(f400,plain,
( leaf(sK15(sK16),tptp0)
| leaf_occ(sK16,sK17) ),
inference(forward_subsumption_resolution,[],[f396,f199]) ).
fof(f401,plain,
leaf(sK15(sK16),tptp0),
inference(forward_subsumption_resolution,[],[f400,f198]) ).
fof(f402,plain,
! [X0] :
( ~ next_subocc(sK16,X0,tptp0)
| ~ occurrence_of(sK15(sK16),tptp2)
| ~ min_precedes(X0,sK15(sK16),tptp0)
| ~ occurrence_of(X0,tptp3) ),
inference(resolution,[],[f401,f203]) ).
fof(f403,plain,
! [X0] :
( ~ next_subocc(sK16,X0,tptp0)
| ~ occurrence_of(sK15(sK16),tptp1)
| ~ min_precedes(X0,sK15(sK16),tptp0)
| ~ occurrence_of(X0,tptp3) ),
inference(resolution,[],[f401,f202]) ).
fof(f425,definition,
( spl18_18
<=> occurrence_of(sK15(sK16),tptp1) ),
introduced(definition,[new_symbols(definition,[spl18_18])],[avatar_definition]) ).
fof(f427,plain,
( ~ occurrence_of(sK15(sK16),tptp1)
| spl18_18 ),
inference(avatar_component_clause,[],[f425]) ).
fof(f429,definition,
( spl18_19
<=> ! [X0] :
( ~ next_subocc(sK16,X0,tptp0)
| ~ occurrence_of(X0,tptp3)
| ~ min_precedes(X0,sK15(sK16),tptp0) ) ),
introduced(definition,[new_symbols(definition,[spl18_19])],[avatar_definition]) ).
fof(f430,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp3)
| ~ next_subocc(sK16,X0,tptp0)
| ~ min_precedes(X0,sK15(sK16),tptp0) )
| ~ spl18_19 ),
inference(avatar_component_clause,[],[f429]) ).
fof(f431,plain,
( ~ spl18_18
| spl18_19 ),
inference(avatar_split_clause,[],[f403,f429,f425]) ).
fof(f433,definition,
( spl18_20
<=> occurrence_of(sK15(sK16),tptp2) ),
introduced(definition,[new_symbols(definition,[spl18_20])],[avatar_definition]) ).
fof(f436,plain,
( ~ spl18_20
| spl18_19 ),
inference(avatar_split_clause,[],[f402,f429,f433]) ).
fof(f458,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK17)
| ~ arboreal(X0)
| leaf_occ(X0,sK17)
| min_precedes(X0,sK13(X0),tptp0) ),
inference(resolution,[],[f373,f201]) ).
fof(f462,definition,
( spl18_21
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK16,X0)
| ~ subactivity_occurrence(sK16,X0) ) ),
introduced(definition,[new_symbols(definition,[spl18_21])],[avatar_definition]) ).
fof(f463,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK16,X0)
| leaf_occ(sK16,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl18_21 ),
inference(avatar_component_clause,[],[f462]) ).
fof(f469,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK17)
| ~ arboreal(X0)
| leaf_occ(X0,sK17)
| min_precedes(sK14(X0),sK15(X0),tptp0) ),
inference(resolution,[],[f379,f201]) ).
fof(f472,plain,
! [X0] :
( ~ subactivity_occurrence(X0,sK17)
| ~ arboreal(X0)
| leaf_occ(X0,sK17)
| min_precedes(sK13(X0),sK14(X0),tptp0) ),
inference(resolution,[],[f383,f201]) ).
fof(f487,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,sK17)
| ~ arboreal(X0)
| leaf_occ(X0,sK17)
| tptp3 = X1
| ~ occurrence_of(sK13(X0),X1) ),
inference(resolution,[],[f365,f201]) ).
fof(f567,plain,
( ~ arboreal(sK16)
| leaf_occ(sK16,sK17)
| min_precedes(sK16,sK13(sK16),tptp0) ),
inference(resolution,[],[f458,f200]) ).
fof(f571,plain,
( leaf_occ(sK16,sK17)
| min_precedes(sK16,sK13(sK16),tptp0) ),
inference(forward_subsumption_resolution,[],[f567,f199]) ).
fof(f572,plain,
min_precedes(sK16,sK13(sK16),tptp0),
inference(forward_subsumption_resolution,[],[f571,f198]) ).
fof(f575,plain,
( ~ arboreal(sK16)
| leaf_occ(sK16,sK17)
| min_precedes(sK14(sK16),sK15(sK16),tptp0) ),
inference(resolution,[],[f469,f200]) ).
fof(f579,plain,
( leaf_occ(sK16,sK17)
| min_precedes(sK14(sK16),sK15(sK16),tptp0) ),
inference(forward_subsumption_resolution,[],[f575,f199]) ).
fof(f580,plain,
min_precedes(sK14(sK16),sK15(sK16),tptp0),
inference(forward_subsumption_resolution,[],[f579,f198]) ).
fof(f588,plain,
( ~ arboreal(sK16)
| leaf_occ(sK16,sK17)
| min_precedes(sK13(sK16),sK14(sK16),tptp0) ),
inference(resolution,[],[f472,f200]) ).
fof(f592,plain,
( leaf_occ(sK16,sK17)
| min_precedes(sK13(sK16),sK14(sK16),tptp0) ),
inference(forward_subsumption_resolution,[],[f588,f199]) ).
fof(f593,plain,
min_precedes(sK13(sK16),sK14(sK16),tptp0),
inference(forward_subsumption_resolution,[],[f592,f198]) ).
fof(f602,plain,
! [X0] :
( ~ arboreal(sK16)
| leaf_occ(sK16,sK17)
| tptp3 = X0
| ~ occurrence_of(sK13(sK16),X0) ),
inference(resolution,[],[f487,f200]) ).
fof(f606,plain,
! [X0] :
( leaf_occ(sK16,sK17)
| tptp3 = X0
| ~ occurrence_of(sK13(sK16),X0) ),
inference(forward_subsumption_resolution,[],[f602,f199]) ).
fof(f607,plain,
! [X0] :
( ~ occurrence_of(sK13(sK16),X0)
| tptp3 = X0 ),
inference(forward_subsumption_resolution,[],[f606,f198]) ).
fof(f650,definition,
( spl18_37
<=> next_subocc(sK16,sK13(sK16),tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_37])],[avatar_definition]) ).
fof(f651,plain,
( ~ next_subocc(sK16,sK13(sK16),tptp0)
| spl18_37 ),
inference(avatar_component_clause,[],[f650]) ).
fof(f861,plain,
! [X0] :
( ~ min_precedes(sK14(sK16),X0,tptp0)
| min_precedes(sK13(sK16),X0,tptp0) ),
inference(resolution,[],[f593,f120]) ).
fof(f1047,plain,
( tptp3 = sK5(sK13(sK16))
| ~ activity_occurrence(sK13(sK16)) ),
inference(resolution,[],[f607,f153]) ).
fof(f1050,definition,
( spl18_80
<=> activity_occurrence(sK13(sK16)) ),
introduced(definition,[new_symbols(definition,[spl18_80])],[avatar_definition]) ).
fof(f1051,plain,
( activity_occurrence(sK13(sK16))
| ~ spl18_80 ),
inference(avatar_component_clause,[],[f1050]) ).
fof(f1052,plain,
( ~ activity_occurrence(sK13(sK16))
| spl18_80 ),
inference(avatar_component_clause,[],[f1050]) ).
fof(f1054,definition,
( spl18_81
<=> tptp3 = sK5(sK13(sK16)) ),
introduced(definition,[new_symbols(definition,[spl18_81])],[avatar_definition]) ).
fof(f1056,plain,
( tptp3 = sK5(sK13(sK16))
| ~ spl18_81 ),
inference(avatar_component_clause,[],[f1054]) ).
fof(f1057,plain,
( ~ spl18_80
| spl18_81 ),
inference(avatar_split_clause,[],[f1047,f1054,f1050]) ).
fof(f1059,plain,
( ! [X0] : ~ subactivity_occurrence(sK13(sK16),X0)
| spl18_80 ),
inference(resolution,[],[f1052,f156]) ).
fof(f1121,plain,
( ! [X0,X1] : ~ min_precedes(X0,sK13(sK16),X1)
| spl18_80 ),
inference(resolution,[],[f1059,f162]) ).
fof(f1210,plain,
( $false
| spl18_80 ),
inference(resolution,[],[f1121,f572]) ).
fof(f1211,plain,
spl18_80,
inference(avatar_contradiction_clause,[],[f1210]) ).
fof(f1219,plain,
( occurrence_of(sK13(sK16),tptp3)
| ~ activity_occurrence(sK13(sK16))
| ~ spl18_81 ),
inference(superposition,[],[f153,f1056]) ).
fof(f1222,plain,
( occurrence_of(sK13(sK16),tptp3)
| ~ spl18_80
| ~ spl18_81 ),
inference(forward_subsumption_resolution,[],[f1219,f1051]) ).
fof(f1225,plain,
( ~ next_subocc(sK16,sK13(sK16),tptp0)
| ~ min_precedes(sK13(sK16),sK15(sK16),tptp0)
| ~ spl18_19
| ~ spl18_80
| ~ spl18_81 ),
inference(resolution,[],[f1222,f430]) ).
fof(f1594,plain,
( ! [X0] :
( occurrence_of(sK15(sK16),tptp2)
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0)
| ~ arboreal(sK16)
| leaf_occ(sK16,X0) )
| spl18_18 ),
inference(resolution,[],[f427,f181]) ).
fof(f1648,plain,
( ! [X0] :
( occurrence_of(sK15(sK16),tptp2)
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0)
| leaf_occ(sK16,X0) )
| spl18_18 ),
inference(forward_subsumption_resolution,[],[f1594,f199]) ).
fof(f1650,plain,
( spl18_21
| spl18_20
| spl18_18 ),
inference(avatar_split_clause,[],[f1648,f425,f433,f462]) ).
fof(f1833,plain,
( leaf_occ(sK16,sK17)
| ~ occurrence_of(sK17,tptp0)
| ~ spl18_21 ),
inference(resolution,[],[f463,f200]) ).
fof(f1837,plain,
( ~ occurrence_of(sK17,tptp0)
| ~ spl18_21 ),
inference(forward_subsumption_resolution,[],[f1833,f198]) ).
fof(f1838,plain,
( $false
| ~ spl18_21 ),
inference(forward_subsumption_resolution,[],[f1837,f201]) ).
fof(f1839,plain,
~ spl18_21,
inference(avatar_contradiction_clause,[],[f1838]) ).
fof(f2241,plain,
min_precedes(sK13(sK16),sK15(sK16),tptp0),
inference(resolution,[],[f861,f580]) ).
fof(f2246,definition,
( spl18_164
<=> min_precedes(sK13(sK16),sK15(sK16),tptp0) ),
introduced(definition,[new_symbols(definition,[spl18_164])],[avatar_definition]) ).
fof(f2249,plain,
( ~ spl18_164
| ~ spl18_37
| ~ spl18_19
| ~ spl18_80
| ~ spl18_81 ),
inference(avatar_split_clause,[],[f1225,f1054,f1050,f429,f650,f2246]) ).
fof(f2250,plain,
spl18_164,
inference(avatar_split_clause,[],[f2241,f2246]) ).
fof(f2251,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0)
| ~ arboreal(sK16)
| leaf_occ(sK16,X0) )
| spl18_37 ),
inference(resolution,[],[f651,f184]) ).
fof(f2252,plain,
( ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0)
| leaf_occ(sK16,X0) )
| spl18_37 ),
inference(forward_subsumption_resolution,[],[f2251,f199]) ).
fof(f2253,plain,
( spl18_21
| spl18_37 ),
inference(avatar_split_clause,[],[f2252,f650,f462]) ).
cnf(s12,plain,
( ~ spl18_18
| spl18_19 ),
inference(sat_conversion,[],[f431]) ).
cnf(s13,plain,
( spl18_19
| ~ spl18_20 ),
inference(sat_conversion,[],[f436]) ).
cnf(s65,plain,
( ~ spl18_80
| spl18_81 ),
inference(sat_conversion,[],[f1057]) ).
cnf(s77,plain,
spl18_80,
inference(sat_conversion,[],[f1211]) ).
cnf(s128,plain,
( spl18_18
| spl18_20
| spl18_21 ),
inference(sat_conversion,[],[f1650]) ).
cnf(s145,plain,
~ spl18_21,
inference(sat_conversion,[],[f1839]) ).
cnf(s199,plain,
( ~ spl18_19
| ~ spl18_37
| ~ spl18_80
| ~ spl18_81
| ~ spl18_164 ),
inference(sat_conversion,[],[f2249]) ).
cnf(s200,plain,
spl18_164,
inference(sat_conversion,[],[f2250]) ).
cnf(s201,plain,
( spl18_21
| spl18_37 ),
inference(sat_conversion,[],[f2253]) ).
cnf(s202,plain,
( ~ spl18_19
| ~ spl18_37
| ~ spl18_80
| ~ spl18_81 ),
inference(rat,[],[s199,s200]) ).
cnf(s204,plain,
spl18_37,
inference(rat,[],[s201,s145]) ).
cnf(s210,plain,
( spl18_18
| spl18_20 ),
inference(rat,[],[s128,s145]) ).
cnf(s232,plain,
spl18_81,
inference(rat,[],[s65,s77]) ).
cnf(s233,plain,
~ spl18_19,
inference(rat,[],[s202,s77,s204,s232]) ).
cnf(s250,plain,
~ spl18_20,
inference(rat,[],[s13,s233]) ).
cnf(s252,plain,
spl18_18,
inference(rat,[],[s210,s250]) ).
cnf(s257,plain,
$false,
inference(rat,[],[s12,s233,s252]) ).
fof(f2254,plain,
$false,
inference(avatar_sat_refutation,[],[s257]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO014+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n004.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 22:22:07 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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
% 2.73/1.32 % (3939560)Detected formulas, will run a generic FOF schedule.
% 2.73/1.32 % (3939565)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=1626502211:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.73/1.32 % (3939566)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=3339317252:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.73/1.32 % (3939570)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=44052624:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.73/1.32 % (3939568)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1415766411:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.73/1.32 % (3939567)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=171810946:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.73/1.32 % (3939569)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3385805715:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.73/1.32 % (3939568)Refutation not found, incomplete strategy
% 2.73/1.32 % (3939568)------------------------------
% 2.73/1.32 % (3939568)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.73/1.32 % (3939568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.73/1.32 % (3939568)CaDiCaL version: 2.1.3
% 2.73/1.32 % (3939568)Termination reason: Refutation not found, incomplete strategy
% 2.73/1.32 % (3939568)Time elapsed: 0.004 s
% 2.73/1.32 % (3939568)Peak memory usage: 88 MB
% 2.73/1.32 % (3939568)Instructions burned: 5 (million)
% 2.73/1.32 % (3939571)dis-21_1_sil=8000:lcm=predicate:random_seed=2138760267: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.73/1.32 % (3939570)First to succeed.
% 2.73/1.32 % (3939570)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3939560"
% 2.73/1.32 % (3939569)Instruction limit reached!
% 2.73/1.32 % (3939569)------------------------------
% 2.73/1.32 % (3939569)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.73/1.32 % (3939569)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.73/1.32 % (3939569)CaDiCaL version: 2.1.3
% 2.73/1.32 % (3939569)Termination reason: Instruction limit
% 2.73/1.32 % (3939569)Termination phase: Saturation
% 2.73/1.32 % (3939569)Time elapsed: 0.073 s
% 2.73/1.32 % (3939569)Peak memory usage: 88 MB
% 2.73/1.32 % (3939569)Instructions burned: 119 (million)
% 2.73/1.32 % (3939571)Instruction limit reached!
% 2.73/1.32 % (3939571)------------------------------
% 2.73/1.32 % (3939571)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.73/1.32 % (3939571)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.73/1.32 % (3939571)CaDiCaL version: 2.1.3
% 2.73/1.32 % (3939571)Termination reason: Instruction limit
% 2.73/1.32 % (3939571)Termination phase: Saturation
% 2.73/1.32 % (3939571)Time elapsed: 0.070 s
% 2.73/1.32 % (3939571)Peak memory usage: 89 MB
% 2.73/1.32 % (3939571)Instructions burned: 130 (million)
% 2.73/1.32 % (3939579)lrs+10_1_sil=8000:sp=occurrence:random_seed=3650665069:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.73/1.32 % (3939580)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2313075593:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.73/1.32 % (3939580)Also succeeded, but the first one will report.
% 2.73/1.32 % (3939568)------------------------------
% 2.73/1.32 % (3939568)------------------------------
% 2.73/1.32 % (3939570)Refutation found. Thanks to Tanya!
% 2.73/1.32 % SZS status Theorem for theBenchmark
% 2.73/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 3.93/1.51 % (3939570)------------------------------
% 3.93/1.51 % (3939570)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.51 % (3939570)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.51 % (3939570)CaDiCaL version: 2.1.3
% 3.93/1.51 % (3939570)Termination reason: Refutation
% 3.93/1.51 % (3939570)Time elapsed: 0.067 s
% 3.93/1.51 % (3939570)Peak memory usage: 90 MB
% 3.93/1.51 % (3939570)Instructions burned: 87 (million)
% 3.93/1.51 % (3939570)------------------------------
% 3.93/1.51 % (3939570)------------------------------
% 3.93/1.51 % (3939560)Success in time 0.47 s
% 3.93/1.51 % Vampire exiting
%------------------------------------------------------------------------------