%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PRO004+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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:33 PM UTC 2026
% Result : Theorem 44.85s 6.83s
% Output : Refutation 44.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 51
% Number of leaves : 32
% Syntax : Number of formulae : 346 ( 39 unt; 0 def)
% Number of atoms : 1238 ( 127 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 1513 ( 621 ~; 742 |; 117 &)
% ( 8 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 5 con; 0-3 aty)
% Number of variables : 626 ( 582 !; 44 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ( occurrence_of(X1,X0)
& ~ atomic(X0) )
=> ? [X2] :
( root(X2,X0)
& subactivity_occurrence(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(f2,axiom,
! [X0,X1,X2,X3,X4] :
( ( occurrence_of(X1,X0)
& root_occ(X3,X1)
& leaf_occ(X4,X1)
& subactivity_occurrence(X2,X1)
& min_precedes(X3,X2,X0)
& X2 != X4 )
=> min_precedes(X2,X4,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
fof(f3,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/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f4,axiom,
! [X0,X1] :
( occurrence_of(X1,X0)
=> ( activity(X0)
& activity_occurrence(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
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/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(f7,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
fof(f8,axiom,
! [X0,X1] :
( ( leaf(X0,X1)
& ~ atomic(X1) )
=> ? [X2] :
( occurrence_of(X2,X1)
& leaf_occ(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& leaf_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(f11,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& root_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10) ).
fof(f13,axiom,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
fof(f14,axiom,
! [X0] :
( legal(X0)
=> arboreal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_13) ).
fof(f16,axiom,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ~ ? [X3] : min_precedes(X0,X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_15) ).
fof(f17,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_16) ).
fof(f18,axiom,
! [X0,X1] :
( root(X0,X1)
=> legal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_17) ).
fof(f19,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_18) ).
fof(f20,axiom,
! [X0,X1] :
( root_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_19) ).
fof(f23,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ~ root(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(f24,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ? [X3] :
( root(X3,X2)
& min_precedes(X3,X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_23) ).
fof(f25,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> precedes(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_24) ).
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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',sos_27) ).
fof(f30,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X2,X3)
& root_occ(X0,X2)
& root_occ(X1,X2) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_29) ).
fof(f32,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X0,X1,X3)
& min_precedes(X0,X2,X3)
& precedes(X1,X2) )
=> min_precedes(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_31) ).
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(f35,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(f37,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_36) ).
fof(f39,axiom,
atomic(tptp1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_38) ).
fof(f43,axiom,
tptp1 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_42) ).
fof(f47,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> root_occ(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_46) ).
fof(f48,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_47) ).
fof(f49,conjecture,
~ ? [X0] : occurrence_of(X0,tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f50,negated_conjecture,
~ ~ ? [X0] : occurrence_of(X0,tptp0),
inference(negated_conjecture,[status(cth)],[f49]) ).
fof(f51,plain,
? [X0] : occurrence_of(X0,tptp0),
inference(flattening,[],[f50]) ).
fof(f55,plain,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] : occurrence_of(X0,X1) ),
inference(pure_predicate_removal,[],[f13]) ).
fof(f56,plain,
! [X0,X1] :
( occurrence_of(X1,X0)
=> activity_occurrence(X1) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f58,plain,
! [X0,X1] :
( ? [X2] :
( root(X2,X0)
& subactivity_occurrence(X2,X1) )
| ~ occurrence_of(X1,X0)
| atomic(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f59,plain,
! [X0,X1] :
( ? [X2] :
( root(X2,X0)
& subactivity_occurrence(X2,X1) )
| ~ occurrence_of(X1,X0)
| atomic(X0) ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
! [X0,X1,X2,X3,X4] :
( min_precedes(X2,X4,X0)
| ~ occurrence_of(X1,X0)
| ~ root_occ(X3,X1)
| ~ leaf_occ(X4,X1)
| ~ subactivity_occurrence(X2,X1)
| ~ min_precedes(X3,X2,X0)
| X2 = X4 ),
inference(ennf_transformation,[],[f2]) ).
fof(f61,plain,
! [X0,X1,X2,X3,X4] :
( min_precedes(X2,X4,X0)
| ~ occurrence_of(X1,X0)
| ~ root_occ(X3,X1)
| ~ leaf_occ(X4,X1)
| ~ subactivity_occurrence(X2,X1)
| ~ min_precedes(X3,X2,X0)
| X2 = X4 ),
inference(flattening,[],[f60]) ).
fof(f62,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,[],[f3]) ).
fof(f63,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,[],[f62]) ).
fof(f64,plain,
! [X0,X1] :
( activity_occurrence(X1)
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f65,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(f66,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,[],[f65]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f69,plain,
! [X0,X1] :
( ? [X2] :
( occurrence_of(X2,X1)
& leaf_occ(X0,X2) )
| ~ leaf(X0,X1)
| atomic(X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f70,plain,
! [X0,X1] :
( ? [X2] :
( occurrence_of(X2,X1)
& leaf_occ(X0,X2) )
| ~ leaf(X0,X1)
| atomic(X1) ),
inference(flattening,[],[f69]) ).
fof(f71,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f72,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f71]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f74,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f73]) ).
fof(f75,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(flattening,[],[f75]) ).
fof(f78,plain,
! [X0] :
( ? [X1] : occurrence_of(X0,X1)
| ~ activity_occurrence(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f79,plain,
! [X0] :
( arboreal(X0)
| ~ legal(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f81,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f82,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f83,plain,
! [X0,X1] :
( legal(X0)
| ~ root(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f85,plain,
! [X0,X1,X2] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f23]) ).
fof(f86,plain,
! [X0,X1,X2] :
( ? [X3] :
( root(X3,X2)
& min_precedes(X3,X1,X2) )
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f24]) ).
fof(f87,plain,
! [X0,X1,X2] :
( precedes(X0,X1)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f25]) ).
fof(f89,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(f90,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(f91,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(flattening,[],[f90]) ).
fof(f94,plain,
! [X0,X1,X2,X3] :
( X0 = X1
| ~ occurrence_of(X2,X3)
| ~ root_occ(X0,X2)
| ~ root_occ(X1,X2) ),
inference(ennf_transformation,[],[f30]) ).
fof(f95,plain,
! [X0,X1,X2,X3] :
( X0 = X1
| ~ occurrence_of(X2,X3)
| ~ root_occ(X0,X2)
| ~ root_occ(X1,X2) ),
inference(flattening,[],[f94]) ).
fof(f98,plain,
! [X0,X1,X2,X3] :
( min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X0,X2,X3)
| ~ precedes(X1,X2) ),
inference(ennf_transformation,[],[f32]) ).
fof(f99,plain,
! [X0,X1,X2,X3] :
( min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X0,X2,X3)
| ~ precedes(X1,X2) ),
inference(flattening,[],[f98]) ).
fof(f100,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(f103,plain,
! [X0,X1] :
( root_occ(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f104,plain,
! [X0,X1] :
( root_occ(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f103]) ).
fof(f105,plain,
! [X0,X1] :
( ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f48]) ).
fof(f106,plain,
! [X0,X1] :
( ? [X2] :
( occurrence_of(X2,tptp1)
& next_subocc(X0,X2,tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f105]) ).
fof(f107,plain,
! [X0,X1] :
( ( root(sK0(X0,X1),X0)
& subactivity_occurrence(sK0(X0,X1),X1) )
| ~ occurrence_of(X1,X0)
| atomic(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f59]) ).
fof(f109,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK2(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK2(X0,X1,X2))
& subactivity_occurrence(X2,sK2(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f68]) ).
fof(f110,plain,
! [X0,X1] :
( ( occurrence_of(sK3(X0,X1),X1)
& leaf_occ(X0,sK3(X0,X1)) )
| ~ leaf(X0,X1)
| atomic(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f70]) ).
fof(f111,plain,
! [X0] :
( occurrence_of(X0,sK4(X0))
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f78]) ).
fof(f113,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) )
| ~ leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f81]) ).
fof(f114,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X2] : min_precedes(X2,X0,X1) )
& ! [X3] : ~ min_precedes(X0,X3,X1) )
| ~ leaf(X0,X1) ) ),
inference(flattening,[],[f113]) ).
fof(f115,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| ? [X3] : min_precedes(X0,X3,X1) )
& ( ( ( root(X0,X1)
| ? [X4] : min_precedes(X4,X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(rectify,[],[f114]) ).
fof(f116,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ( ~ root(X0,X1)
& ! [X2] : ~ min_precedes(X2,X0,X1) )
| min_precedes(X0,sK6(X0,X1),X1) )
& ( ( ( root(X0,X1)
| min_precedes(sK7(X0,X1),X0,X1) )
& ! [X5] : ~ min_precedes(X0,X5,X1) )
| ~ leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X3,sK6(X0,X1)),skolemize(X4,sK7(X0,X1))],[f115]) ).
fof(f117,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f82]) ).
fof(f118,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(f119,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,[],[f118]) ).
fof(f120,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ leaf(X0,X2) ) )
& ( ( occurrence_of(X1,sK8(X0,X1))
& subactivity_occurrence(X0,X1)
& leaf(X0,sK8(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X3,sK8(X0,X1))],[f119]) ).
fof(f121,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) )
| ~ root_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f122,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,[],[f121]) ).
fof(f123,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ( occurrence_of(X1,sK9(X0,X1))
& subactivity_occurrence(X0,X1)
& root(X0,sK9(X0,X1)) )
| ~ root_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f122]) ).
fof(f126,plain,
! [X0,X1,X2] :
( ( root(sK10(X1,X2),X2)
& min_precedes(sK10(X1,X2),X1,X2) )
| ~ min_precedes(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X3,sK10(X1,X2))],[f86]) ).
fof(f127,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,[],[f89]) ).
fof(f128,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,[],[f127]) ).
fof(f129,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,[],[f128]) ).
fof(f130,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))],[f129]) ).
fof(f131,plain,
! [X0] :
( ( occurrence_of(sK12(X0),tptp4)
& root_occ(sK12(X0),X0)
& occurrence_of(sK13(X0),tptp3)
& leaf_occ(sK13(X0),X0)
& next_subocc(sK12(X0),sK13(X0),tptp0) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X1,sK12(X0)),skolemize(X2,sK13(X0))],[f100]) ).
fof(f132,plain,
! [X0,X1] :
( ( occurrence_of(sK14(X0),tptp1)
& next_subocc(X0,sK14(X0),tptp0) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X2,sK14(X0))],[f106]) ).
fof(f133,plain,
occurrence_of(sK15,tptp0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15]),skolemize(X0,sK15)],[f51]) ).
fof(f134,plain,
! [X0,X1] :
( subactivity_occurrence(sK0(X0,X1),X1)
| ~ occurrence_of(X1,X0)
| atomic(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f135,plain,
! [X0,X1] :
( root(sK0(X0,X1),X0)
| ~ occurrence_of(X1,X0)
| atomic(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f136,plain,
! [X2,X3,X0,X1,X4] :
( ~ min_precedes(X3,X2,X0)
| ~ occurrence_of(X1,X0)
| ~ root_occ(X3,X1)
| ~ leaf_occ(X4,X1)
| ~ subactivity_occurrence(X2,X1)
| min_precedes(X2,X4,X0)
| X2 = X4 ),
inference(cnf_transformation,[],[f61]) ).
fof(f137,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,[],[f63]) ).
fof(f138,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f139,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,[],[f66]) ).
fof(f141,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f142,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f143,plain,
! [X2,X0,X1] :
( occurrence_of(sK2(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f144,plain,
! [X0,X1] :
( leaf_occ(X0,sK3(X0,X1))
| ~ leaf(X0,X1)
| atomic(X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f145,plain,
! [X0,X1] :
( occurrence_of(sK3(X0,X1),X1)
| ~ leaf(X0,X1)
| atomic(X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f146,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f72]) ).
fof(f147,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f148,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f151,plain,
! [X0] :
( occurrence_of(X0,sK4(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f152,plain,
! [X0] :
( ~ legal(X0)
| arboreal(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f155,plain,
! [X0,X1,X5] :
( ~ min_precedes(X0,X5,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f116]) ).
fof(f156,plain,
! [X0,X1] :
( min_precedes(sK7(X0,X1),X0,X1)
| root(X0,X1)
| ~ leaf(X0,X1) ),
inference(cnf_transformation,[],[f116]) ).
fof(f160,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f161,plain,
! [X0,X1] :
( ~ root(X0,X1)
| legal(X0) ),
inference(cnf_transformation,[],[f83]) ).
fof(f162,plain,
! [X0,X1] :
( leaf(X0,sK8(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f120]) ).
fof(f163,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f120]) ).
fof(f164,plain,
! [X0,X1] :
( occurrence_of(X1,sK8(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f120]) ).
fof(f166,plain,
! [X0,X1] :
( root(X0,sK9(X0,X1))
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f168,plain,
! [X0,X1] :
( occurrence_of(X1,sK9(X0,X1))
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f169,plain,
! [X2,X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2)
| root_occ(X0,X1)
| ~ root(X0,X2) ),
inference(cnf_transformation,[],[f123]) ).
fof(f174,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| ~ root(X1,X2) ),
inference(cnf_transformation,[],[f85]) ).
fof(f175,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| min_precedes(sK10(X1,X2),X1,X2) ),
inference(cnf_transformation,[],[f126]) ).
fof(f176,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| root(sK10(X1,X2),X2) ),
inference(cnf_transformation,[],[f126]) ).
fof(f177,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| precedes(X0,X1) ),
inference(cnf_transformation,[],[f87]) ).
fof(f180,plain,
! [X2,X0,X1,X4] :
( ~ next_subocc(X0,X1,X2)
| ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) ),
inference(cnf_transformation,[],[f130]) ).
fof(f181,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f130]) ).
fof(f184,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,[],[f91]) ).
fof(f186,plain,
! [X2,X3,X0,X1] :
( ~ root_occ(X1,X2)
| ~ occurrence_of(X2,X3)
| ~ root_occ(X0,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f95]) ).
fof(f188,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X0,X2,X3)
| ~ min_precedes(X0,X1,X3)
| min_precedes(X1,X2,X3)
| ~ precedes(X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f189,plain,
! [X0] :
( next_subocc(sK12(X0),sK13(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f190,plain,
! [X0] :
( leaf_occ(sK13(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f191,plain,
! [X0] :
( occurrence_of(sK13(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f192,plain,
! [X0] :
( root_occ(sK12(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f194,plain,
~ atomic(tptp0),
inference(cnf_transformation,[],[f35]) ).
fof(f196,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f37]) ).
fof(f198,plain,
atomic(tptp1),
inference(cnf_transformation,[],[f39]) ).
fof(f202,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f43]) ).
fof(f206,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| root_occ(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f104]) ).
fof(f207,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK14(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f132]) ).
fof(f208,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK14(X0),tptp1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f132]) ).
fof(f209,plain,
occurrence_of(sK15,tptp0),
inference(cnf_transformation,[],[f133]) ).
fof(f217,plain,
! [X0] :
( subactivity_occurrence(sK13(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f190,f163]) ).
fof(f218,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ atomic(tptp3)
| arboreal(sK13(X0)) ),
inference(resolution,[],[f191,f160]) ).
fof(f221,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| arboreal(sK13(X0)) ),
inference(forward_subsumption_resolution,[],[f218,f196]) ).
fof(f228,plain,
arboreal(sK13(sK15)),
inference(resolution,[],[f221,f209]) ).
fof(f241,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK4(X0) = X1
| ~ activity_occurrence(X0) ),
inference(resolution,[],[f146,f151]) ).
fof(f246,plain,
! [X0] :
( ~ occurrence_of(sK15,X0)
| tptp0 = X0 ),
inference(resolution,[],[f146,f209]) ).
fof(f247,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK4(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f241,f138]) ).
fof(f250,plain,
! [X0] :
( ~ leaf_occ(X0,sK15)
| tptp0 = sK8(X0,sK15) ),
inference(resolution,[],[f246,f164]) ).
fof(f251,plain,
! [X0] :
( ~ root_occ(X0,sK15)
| tptp0 = sK9(X0,sK15) ),
inference(resolution,[],[f246,f168]) ).
fof(f254,plain,
! [X0] :
( min_precedes(sK12(X0),sK13(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f189,f181]) ).
fof(f257,plain,
( tptp0 = sK8(sK13(sK15),sK15)
| ~ occurrence_of(sK15,tptp0) ),
inference(resolution,[],[f250,f190]) ).
fof(f258,plain,
tptp0 = sK8(sK13(sK15),sK15),
inference(forward_subsumption_resolution,[],[f257,f209]) ).
fof(f262,plain,
( ~ leaf_occ(sK13(sK15),sK15)
| leaf(sK13(sK15),tptp0) ),
inference(superposition,[],[f162,f258]) ).
fof(f264,plain,
! [X0,X1] :
( legal(sK0(X1,X0))
| atomic(X1)
| ~ occurrence_of(X0,X1) ),
inference(resolution,[],[f135,f161]) ).
fof(f265,plain,
( tptp0 = sK9(sK12(sK15),sK15)
| ~ occurrence_of(sK15,tptp0) ),
inference(resolution,[],[f251,f192]) ).
fof(f266,plain,
tptp0 = sK9(sK12(sK15),sK15),
inference(forward_subsumption_resolution,[],[f265,f209]) ).
fof(f270,plain,
( ~ root_occ(sK12(sK15),sK15)
| root(sK12(sK15),tptp0) ),
inference(superposition,[],[f166,f266]) ).
fof(f273,plain,
( leaf(sK13(sK15),tptp0)
| ~ occurrence_of(sK15,tptp0) ),
inference(resolution,[],[f262,f190]) ).
fof(f274,plain,
leaf(sK13(sK15),tptp0),
inference(forward_subsumption_resolution,[],[f273,f209]) ).
fof(f283,plain,
! [X0,X1] :
( subactivity_occurrence(X0,sK3(X0,X1))
| atomic(X1)
| ~ leaf(X0,X1) ),
inference(resolution,[],[f144,f163]) ).
fof(f284,plain,
( root(sK12(sK15),tptp0)
| ~ occurrence_of(sK15,tptp0) ),
inference(resolution,[],[f270,f192]) ).
fof(f285,plain,
root(sK12(sK15),tptp0),
inference(forward_subsumption_resolution,[],[f284,f209]) ).
fof(f286,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK3(X0,X1),X2)
| atomic(X1)
| ~ leaf(X0,X1)
| X1 = X2 ),
inference(resolution,[],[f145,f146]) ).
fof(f298,plain,
legal(sK12(sK15)),
inference(resolution,[],[f285,f161]) ).
fof(f299,plain,
arboreal(sK12(sK15)),
inference(resolution,[],[f298,f152]) ).
fof(f306,plain,
! [X0,X1] :
( min_precedes(sK10(X0,X1),X0,X1)
| ~ leaf(X0,X1)
| root(X0,X1) ),
inference(resolution,[],[f156,f175]) ).
fof(f307,plain,
! [X0,X1] :
( root(sK10(X0,X1),X1)
| ~ leaf(X0,X1)
| root(X0,X1) ),
inference(resolution,[],[f156,f176]) ).
fof(f329,plain,
! [X2,X0,X1] :
( ~ root(sK0(X2,X0),X1)
| root_occ(sK0(X2,X0),X0)
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2)
| atomic(X2) ),
inference(resolution,[],[f169,f134]) ).
fof(f334,plain,
! [X0,X1] :
( ~ min_precedes(sK12(X1),X0,tptp0)
| ~ min_precedes(X0,sK13(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(resolution,[],[f180,f189]) ).
fof(f340,plain,
! [X2,X0,X1] :
( ~ root_occ(X2,X0)
| ~ occurrence_of(X0,X1)
| sK12(X0) = X2
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f186,f192]) ).
fof(f359,plain,
! [X0,X1] :
( root_occ(sK0(X1,X0),X0)
| ~ occurrence_of(X0,tptp0)
| ~ arboreal(sK0(X1,X0))
| leaf_occ(sK0(X1,X0),X0)
| ~ occurrence_of(X0,X1)
| atomic(X1) ),
inference(resolution,[],[f206,f134]) ).
fof(f360,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK2(X0,X1,X2),tptp0)
| root_occ(X2,sK2(X0,X1,X2))
| ~ arboreal(X2)
| leaf_occ(X2,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f206,f141]) ).
fof(f361,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK2(X0,X1,X2),tptp0)
| root_occ(X1,sK2(X0,X1,X2))
| ~ arboreal(X1)
| leaf_occ(X1,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f206,f142]) ).
fof(f398,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK2(X0,X1,X2),tptp0)
| next_subocc(X1,sK14(X1),tptp0)
| ~ arboreal(X1)
| leaf_occ(X1,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f207,f142]) ).
fof(f399,plain,
! [X2,X0,X1] :
( min_precedes(X2,sK13(X0),X1)
| ~ subactivity_occurrence(X2,X0)
| sK13(X0) = X2
| ~ arboreal(X2)
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f137,f190]) ).
fof(f400,plain,
! [X2,X3,X0,X1] :
( ~ subactivity_occurrence(X3,sK3(X0,X1))
| ~ occurrence_of(sK3(X0,X1),X2)
| X0 = X3
| ~ arboreal(X3)
| min_precedes(X3,X0,X2)
| ~ leaf(X0,X1)
| atomic(X1) ),
inference(resolution,[],[f137,f144]) ).
fof(f414,plain,
! [X2,X3,X0,X1] :
( min_precedes(sK0(X0,X1),X2,X3)
| min_precedes(X2,sK0(X0,X1),X3)
| ~ occurrence_of(X1,X3)
| ~ arboreal(X2)
| ~ arboreal(sK0(X0,X1))
| ~ subactivity_occurrence(X2,X1)
| sK0(X0,X1) = X2
| ~ occurrence_of(X1,X0)
| atomic(X0) ),
inference(resolution,[],[f139,f134]) ).
fof(f503,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| tptp3 = sK4(sK13(X0)) ),
inference(resolution,[],[f247,f191]) ).
fof(f533,plain,
! [X2,X0,X1] :
( ~ root_occ(sK12(X0),X1)
| ~ occurrence_of(X1,tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ leaf_occ(X2,X1)
| ~ subactivity_occurrence(sK13(X0),X1)
| min_precedes(sK13(X0),X2,tptp0)
| sK13(X0) = X2 ),
inference(resolution,[],[f254,f136]) ).
fof(f535,plain,
! [X0,X1] :
( ~ root_occ(sK13(X0),X1)
| ~ occurrence_of(X1,tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f254,f148]) ).
fof(f536,plain,
! [X0] :
( ~ leaf(sK12(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f254,f155]) ).
fof(f538,plain,
! [X0] :
( ~ root(sK13(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f254,f174]) ).
fof(f539,plain,
! [X0] :
( min_precedes(sK10(sK13(X0),tptp0),sK13(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f254,f175]) ).
fof(f540,plain,
! [X0] :
( root(sK10(sK13(X0),tptp0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f254,f176]) ).
fof(f542,plain,
! [X0,X1] :
( ~ subactivity_occurrence(sK13(X0),X1)
| subactivity_occurrence(sK12(X0),X1)
| ~ occurrence_of(X1,tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f254,f184]) ).
fof(f543,plain,
! [X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ min_precedes(sK12(X0),X1,tptp0)
| min_precedes(X1,sK13(X0),tptp0)
| ~ precedes(X1,sK13(X0)) ),
inference(resolution,[],[f254,f188]) ).
fof(f548,plain,
! [X0,X1] :
( ~ min_precedes(sK12(X0),X1,tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ precedes(X1,sK13(X0)) ),
inference(forward_subsumption_resolution,[],[f543,f334]) ).
fof(f556,plain,
! [X0,X1] :
( arboreal(sK0(X0,X1))
| ~ occurrence_of(X1,X0)
| atomic(X0) ),
inference(resolution,[],[f264,f152]) ).
fof(f628,plain,
! [X0,X1] :
( legal(sK10(X0,X1))
| root(X0,X1)
| ~ leaf(X0,X1) ),
inference(resolution,[],[f307,f161]) ).
fof(f673,plain,
! [X2,X0,X1] :
( ~ leaf_occ(sK10(X0,X1),X2)
| root(X0,X1)
| ~ occurrence_of(X2,X1)
| ~ leaf(X0,X1) ),
inference(resolution,[],[f306,f147]) ).
fof(f681,plain,
! [X2,X0,X1] :
( subactivity_occurrence(sK10(X0,X1),X2)
| root(X0,X1)
| ~ leaf(X0,X1)
| ~ occurrence_of(X2,X1)
| ~ subactivity_occurrence(X0,X2) ),
inference(resolution,[],[f306,f184]) ).
fof(f716,plain,
! [X2,X0,X1] :
( ~ leaf_occ(X2,sK3(X1,X0))
| ~ leaf(X1,X0)
| sK8(X2,sK3(X1,X0)) = X0
| atomic(X0) ),
inference(resolution,[],[f286,f164]) ).
fof(f840,plain,
! [X0,X1] :
( root_occ(sK0(X0,X1),X1)
| ~ occurrence_of(X1,X0)
| ~ occurrence_of(X1,X0)
| atomic(X0)
| ~ occurrence_of(X1,X0)
| atomic(X0) ),
inference(resolution,[],[f329,f135]) ).
fof(f842,plain,
! [X0,X1] :
( root_occ(sK0(X0,X1),X1)
| ~ occurrence_of(X1,X0)
| atomic(X0) ),
inference(duplicate_literal_removal,[],[f840]) ).
fof(f972,plain,
! [X2,X0,X1] :
( ~ leaf(X0,X2)
| sK13(X1) = X0
| ~ arboreal(X0)
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(resolution,[],[f399,f155]) ).
fof(f1048,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ arboreal(sK0(X1,X0))
| leaf_occ(sK0(X1,X0),X0)
| ~ occurrence_of(X0,X1)
| atomic(X1)
| ~ occurrence_of(X0,X2)
| sK12(X0) = sK0(X1,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f359,f340]) ).
fof(f1053,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ arboreal(sK0(X1,X0))
| leaf_occ(sK0(X1,X0),X0)
| ~ occurrence_of(X0,X1)
| atomic(X1)
| ~ occurrence_of(X0,X2)
| sK12(X0) = sK0(X1,X0) ),
inference(duplicate_literal_removal,[],[f1048]) ).
fof(f1058,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK0(X1,X0),X0)
| ~ occurrence_of(X0,X1)
| atomic(X1)
| ~ occurrence_of(X0,X2)
| sK12(X0) = sK0(X1,X0) ),
inference(forward_subsumption_resolution,[],[f1053,f556]) ).
fof(f1143,plain,
! [X0,X1] :
( next_subocc(X0,sK14(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,sK2(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f398,f143]) ).
fof(f1144,plain,
! [X0,X1] :
( leaf_occ(X0,sK2(tptp0,X0,X1))
| ~ arboreal(X0)
| next_subocc(X0,sK14(X0),tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f1143]) ).
fof(f1150,plain,
! [X0,X1] :
( root_occ(X0,sK2(tptp0,X1,X0))
| ~ arboreal(X0)
| leaf_occ(X0,sK2(tptp0,X1,X0))
| ~ min_precedes(X1,X0,tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(resolution,[],[f360,f143]) ).
fof(f1151,plain,
! [X0,X1] :
( root_occ(X0,sK2(tptp0,X1,X0))
| ~ arboreal(X0)
| leaf_occ(X0,sK2(tptp0,X1,X0))
| ~ min_precedes(X1,X0,tptp0) ),
inference(duplicate_literal_removal,[],[f1150]) ).
fof(f1167,plain,
! [X0,X1] :
( root_occ(X0,sK2(tptp0,X0,X1))
| ~ arboreal(X0)
| leaf_occ(X0,sK2(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f361,f143]) ).
fof(f1168,plain,
! [X0,X1] :
( root_occ(X0,sK2(tptp0,X0,X1))
| ~ arboreal(X0)
| leaf_occ(X0,sK2(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f1167]) ).
fof(f1304,plain,
! [X2,X3,X0,X1,X4] :
( min_precedes(sK0(X1,X2),X0,X3)
| ~ occurrence_of(X2,X3)
| ~ arboreal(X0)
| ~ arboreal(sK0(X1,X2))
| ~ subactivity_occurrence(X0,X2)
| sK0(X1,X2) = X0
| ~ occurrence_of(X2,X1)
| atomic(X1)
| ~ occurrence_of(X4,X3)
| ~ root_occ(sK0(X1,X2),X4) ),
inference(resolution,[],[f414,f148]) ).
fof(f1332,plain,
! [X2,X3,X0,X1,X4] :
( ~ root_occ(sK0(X1,X2),X4)
| ~ occurrence_of(X2,X3)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X2)
| sK0(X1,X2) = X0
| ~ occurrence_of(X2,X1)
| atomic(X1)
| ~ occurrence_of(X4,X3)
| min_precedes(sK0(X1,X2),X0,X3) ),
inference(forward_subsumption_resolution,[],[f1304,f556]) ).
fof(f1462,plain,
! [X0,X1] :
( ~ min_precedes(X0,X1,tptp0)
| tptp3 = sK4(sK13(sK2(tptp0,X0,X1))) ),
inference(resolution,[],[f503,f143]) ).
fof(f1539,plain,
! [X0] :
( legal(sK10(sK13(X0),tptp0))
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f540,f161]) ).
fof(f1601,plain,
! [X0,X1] :
( arboreal(sK10(X0,X1))
| ~ leaf(X0,X1)
| root(X0,X1) ),
inference(resolution,[],[f628,f152]) ).
fof(f1692,plain,
! [X0] :
( precedes(sK10(sK13(X0),tptp0),sK13(X0))
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f539,f177]) ).
fof(f1693,plain,
! [X0,X1] :
( subactivity_occurrence(sK10(sK13(X0),tptp0),X1)
| ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(sK13(X0),X1) ),
inference(resolution,[],[f539,f184]) ).
fof(f2224,plain,
! [X2,X0,X1] :
( root(X0,X1)
| ~ leaf(X0,X1)
| ~ occurrence_of(X2,X1)
| ~ subactivity_occurrence(X0,X2)
| ~ occurrence_of(X2,tptp0)
| next_subocc(sK10(X0,X1),sK14(sK10(X0,X1)),tptp0)
| ~ arboreal(sK10(X0,X1))
| leaf_occ(sK10(X0,X1),X2) ),
inference(resolution,[],[f681,f207]) ).
fof(f2225,plain,
! [X2,X0,X1] :
( root(X0,X1)
| ~ leaf(X0,X1)
| ~ occurrence_of(X2,X1)
| ~ subactivity_occurrence(X0,X2)
| ~ occurrence_of(X2,tptp0)
| occurrence_of(sK14(sK10(X0,X1)),tptp1)
| ~ arboreal(sK10(X0,X1))
| leaf_occ(sK10(X0,X1),X2) ),
inference(resolution,[],[f681,f208]) ).
fof(f2234,plain,
! [X2,X0,X1] :
( root(X0,X1)
| ~ leaf(X0,X1)
| ~ occurrence_of(X2,X1)
| ~ subactivity_occurrence(X0,X2)
| ~ occurrence_of(X2,tptp0)
| occurrence_of(sK14(sK10(X0,X1)),tptp1)
| leaf_occ(sK10(X0,X1),X2) ),
inference(forward_subsumption_resolution,[],[f2225,f1601]) ).
fof(f2235,plain,
! [X2,X0,X1] :
( root(X0,X1)
| ~ leaf(X0,X1)
| ~ occurrence_of(X2,X1)
| ~ subactivity_occurrence(X0,X2)
| ~ occurrence_of(X2,tptp0)
| next_subocc(sK10(X0,X1),sK14(sK10(X0,X1)),tptp0)
| leaf_occ(sK10(X0,X1),X2) ),
inference(forward_subsumption_resolution,[],[f2224,f1601]) ).
fof(f2238,plain,
! [X2,X0,X1] :
( ~ leaf(X0,X1)
| root(X0,X1)
| ~ occurrence_of(X2,X1)
| ~ subactivity_occurrence(X0,X2)
| ~ occurrence_of(X2,tptp0)
| occurrence_of(sK14(sK10(X0,X1)),tptp1) ),
inference(forward_subsumption_resolution,[],[f2234,f673]) ).
fof(f2239,plain,
! [X2,X0,X1] :
( ~ leaf(X0,X1)
| root(X0,X1)
| ~ occurrence_of(X2,X1)
| ~ subactivity_occurrence(X0,X2)
| ~ occurrence_of(X2,tptp0)
| next_subocc(sK10(X0,X1),sK14(sK10(X0,X1)),tptp0) ),
inference(forward_subsumption_resolution,[],[f2235,f673]) ).
fof(f2394,plain,
! [X0] :
( sK13(X0) = sK13(sK15)
| ~ arboreal(sK13(sK15))
| ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK13(sK15),X0) ),
inference(resolution,[],[f972,f274]) ).
fof(f2397,plain,
! [X0] :
( sK13(X0) = sK13(sK15)
| ~ arboreal(sK13(sK15))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK13(sK15),X0) ),
inference(duplicate_literal_removal,[],[f2394]) ).
fof(f2399,plain,
! [X0] :
( ~ subactivity_occurrence(sK13(sK15),X0)
| ~ occurrence_of(X0,tptp0)
| sK13(X0) = sK13(sK15) ),
inference(forward_subsumption_resolution,[],[f2397,f228]) ).
fof(f2404,plain,
! [X0] :
( ~ occurrence_of(sK3(sK13(sK15),X0),tptp0)
| sK13(sK15) = sK13(sK3(sK13(sK15),X0))
| atomic(X0)
| ~ leaf(sK13(sK15),X0) ),
inference(resolution,[],[f2399,f283]) ).
fof(f2505,plain,
! [X0,X1] :
( ~ arboreal(sK13(X0))
| leaf_occ(sK13(X0),sK2(tptp0,sK13(X0),X1))
| ~ min_precedes(sK13(X0),X1,tptp0)
| ~ occurrence_of(sK2(tptp0,sK13(X0),X1),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f1168,f535]) ).
fof(f2507,plain,
! [X0,X1] :
( ~ arboreal(sK13(X0))
| ~ min_precedes(sK13(X0),X1,tptp0)
| ~ occurrence_of(sK2(tptp0,sK13(X0),X1),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f2505,f147]) ).
fof(f2513,plain,
! [X0,X1] :
( ~ arboreal(sK13(X0))
| ~ min_precedes(sK13(X0),X1,tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f2507,f143]) ).
fof(f2516,plain,
! [X0,X1] :
( ~ min_precedes(sK13(X0),X1,tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f2513,f221]) ).
fof(f2857,plain,
( sK13(sK15) = sK13(sK3(sK13(sK15),tptp0))
| atomic(tptp0)
| ~ leaf(sK13(sK15),tptp0)
| ~ leaf(sK13(sK15),tptp0)
| atomic(tptp0) ),
inference(resolution,[],[f2404,f145]) ).
fof(f2858,plain,
( sK13(sK15) = sK13(sK3(sK13(sK15),tptp0))
| atomic(tptp0)
| ~ leaf(sK13(sK15),tptp0) ),
inference(duplicate_literal_removal,[],[f2857]) ).
fof(f2859,plain,
( sK13(sK15) = sK13(sK3(sK13(sK15),tptp0))
| ~ leaf(sK13(sK15),tptp0) ),
inference(forward_subsumption_resolution,[],[f2858,f194]) ).
fof(f2861,plain,
sK13(sK15) = sK13(sK3(sK13(sK15),tptp0)),
inference(forward_subsumption_resolution,[],[f2859,f274]) ).
fof(f2888,plain,
( subactivity_occurrence(sK13(sK15),sK3(sK13(sK15),tptp0))
| ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0) ),
inference(superposition,[],[f217,f2861]) ).
fof(f2893,plain,
! [X0] :
( ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ root_occ(sK13(sK15),X0) ),
inference(superposition,[],[f535,f2861]) ).
fof(f2895,plain,
( ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0)
| ~ root(sK13(sK15),tptp0) ),
inference(superposition,[],[f538,f2861]) ).
fof(f2917,plain,
( ~ root(sK13(sK15),tptp0)
| ~ leaf(sK13(sK15),tptp0)
| atomic(tptp0) ),
inference(resolution,[],[f2895,f145]) ).
fof(f2918,plain,
( ~ root(sK13(sK15),tptp0)
| atomic(tptp0) ),
inference(forward_subsumption_resolution,[],[f2917,f274]) ).
fof(f2919,plain,
~ root(sK13(sK15),tptp0),
inference(forward_subsumption_resolution,[],[f2918,f194]) ).
fof(f2957,plain,
! [X0,X1] :
( ~ occurrence_of(sK15,X1)
| ~ occurrence_of(sK15,X0)
| atomic(X0)
| leaf_occ(sK0(X0,sK15),sK15)
| sK12(sK15) = sK0(X0,sK15) ),
inference(resolution,[],[f1058,f209]) ).
fof(f3137,plain,
( ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0)
| subactivity_occurrence(sK12(sK15),sK3(sK13(sK15),tptp0))
| ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0)
| ~ occurrence_of(sK15,tptp0) ),
inference(resolution,[],[f2888,f542]) ).
fof(f3155,plain,
( ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0)
| subactivity_occurrence(sK12(sK15),sK3(sK13(sK15),tptp0))
| ~ occurrence_of(sK15,tptp0) ),
inference(duplicate_literal_removal,[],[f3137]) ).
fof(f3158,plain,
( subactivity_occurrence(sK12(sK15),sK3(sK13(sK15),tptp0))
| ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0) ),
inference(forward_subsumption_resolution,[],[f3155,f209]) ).
fof(f3161,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ root_occ(sK13(sK15),X0)
| ~ leaf(sK13(sK15),tptp0)
| atomic(tptp0) ),
inference(resolution,[],[f2893,f145]) ).
fof(f3162,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ root_occ(sK13(sK15),X0)
| atomic(tptp0) ),
inference(forward_subsumption_resolution,[],[f3161,f274]) ).
fof(f3163,plain,
! [X0] :
( ~ root_occ(sK13(sK15),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f3162,f194]) ).
fof(f3173,plain,
! [X0] :
( ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0)
| ~ occurrence_of(sK3(sK13(sK15),tptp0),X0)
| sK13(sK15) = sK12(sK15)
| ~ arboreal(sK12(sK15))
| min_precedes(sK12(sK15),sK13(sK15),X0)
| ~ leaf(sK13(sK15),tptp0)
| atomic(tptp0) ),
inference(resolution,[],[f3158,f400]) ).
fof(f3180,plain,
( ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0)
| ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0)
| occurrence_of(sK14(sK12(sK15)),tptp1)
| ~ arboreal(sK12(sK15))
| leaf_occ(sK12(sK15),sK3(sK13(sK15),tptp0)) ),
inference(resolution,[],[f3158,f208]) ).
fof(f3187,plain,
( ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0)
| occurrence_of(sK14(sK12(sK15)),tptp1)
| ~ arboreal(sK12(sK15))
| leaf_occ(sK12(sK15),sK3(sK13(sK15),tptp0)) ),
inference(duplicate_literal_removal,[],[f3180]) ).
fof(f3193,plain,
( leaf_occ(sK12(sK15),sK3(sK13(sK15),tptp0))
| occurrence_of(sK14(sK12(sK15)),tptp1)
| ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0) ),
inference(forward_subsumption_resolution,[],[f3187,f299]) ).
fof(f3197,plain,
! [X0] :
( ~ occurrence_of(sK3(sK13(sK15),tptp0),X0)
| sK13(sK15) = sK12(sK15)
| ~ arboreal(sK12(sK15))
| min_precedes(sK12(sK15),sK13(sK15),X0)
| ~ leaf(sK13(sK15),tptp0)
| atomic(tptp0) ),
inference(forward_subsumption_resolution,[],[f3173,f145]) ).
fof(f3201,plain,
! [X0] :
( ~ occurrence_of(sK3(sK13(sK15),tptp0),X0)
| sK13(sK15) = sK12(sK15)
| min_precedes(sK12(sK15),sK13(sK15),X0)
| ~ leaf(sK13(sK15),tptp0)
| atomic(tptp0) ),
inference(forward_subsumption_resolution,[],[f3197,f299]) ).
fof(f3205,plain,
! [X0] :
( ~ occurrence_of(sK3(sK13(sK15),tptp0),X0)
| sK13(sK15) = sK12(sK15)
| min_precedes(sK12(sK15),sK13(sK15),X0)
| atomic(tptp0) ),
inference(forward_subsumption_resolution,[],[f3201,f274]) ).
fof(f3206,plain,
! [X0] :
( ~ occurrence_of(sK3(sK13(sK15),tptp0),X0)
| sK13(sK15) = sK12(sK15)
| min_precedes(sK12(sK15),sK13(sK15),X0) ),
inference(forward_subsumption_resolution,[],[f3205,f194]) ).
fof(f3547,plain,
! [X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ leaf_occ(X1,X0)
| ~ subactivity_occurrence(sK13(X0),X0)
| min_precedes(sK13(X0),X1,tptp0)
| sK13(X0) = X1
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f533,f192]) ).
fof(f3551,plain,
! [X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ leaf_occ(X1,X0)
| ~ subactivity_occurrence(sK13(X0),X0)
| min_precedes(sK13(X0),X1,tptp0)
| sK13(X0) = X1 ),
inference(duplicate_literal_removal,[],[f3547]) ).
fof(f3555,plain,
! [X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ leaf_occ(X1,X0)
| min_precedes(sK13(X0),X1,tptp0)
| sK13(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f3551,f217]) ).
fof(f3558,plain,
! [X0,X1] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,tptp0)
| sK13(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f3555,f2516]) ).
fof(f3641,plain,
( sK13(sK15) = sK12(sK15)
| min_precedes(sK12(sK15),sK13(sK15),tptp0)
| ~ leaf(sK13(sK15),tptp0)
| atomic(tptp0) ),
inference(resolution,[],[f3206,f145]) ).
fof(f3647,plain,
( sK13(sK15) = sK12(sK15)
| min_precedes(sK12(sK15),sK13(sK15),tptp0)
| atomic(tptp0) ),
inference(forward_subsumption_resolution,[],[f3641,f274]) ).
fof(f3648,plain,
( min_precedes(sK12(sK15),sK13(sK15),tptp0)
| sK13(sK15) = sK12(sK15) ),
inference(forward_subsumption_resolution,[],[f3647,f194]) ).
fof(f3667,plain,
! [X0] :
( ~ leaf_occ(sK12(sK15),X0)
| ~ occurrence_of(X0,tptp0)
| sK13(sK15) = sK12(sK15) ),
inference(resolution,[],[f3648,f147]) ).
fof(f3801,plain,
! [X0] :
( ~ occurrence_of(sK2(tptp0,sK12(sK15),X0),tptp0)
| sK13(sK15) = sK12(sK15)
| ~ arboreal(sK12(sK15))
| next_subocc(sK12(sK15),sK14(sK12(sK15)),tptp0)
| ~ min_precedes(sK12(sK15),X0,tptp0) ),
inference(resolution,[],[f3667,f1144]) ).
fof(f3804,plain,
! [X0] :
( sK13(sK15) = sK12(sK15)
| ~ arboreal(sK12(sK15))
| next_subocc(sK12(sK15),sK14(sK12(sK15)),tptp0)
| ~ min_precedes(sK12(sK15),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f3801,f143]) ).
fof(f3808,plain,
! [X0] :
( ~ min_precedes(sK12(sK15),X0,tptp0)
| next_subocc(sK12(sK15),sK14(sK12(sK15)),tptp0)
| sK13(sK15) = sK12(sK15) ),
inference(forward_subsumption_resolution,[],[f3804,f299]) ).
fof(f4362,plain,
( next_subocc(sK12(sK15),sK14(sK12(sK15)),tptp0)
| sK13(sK15) = sK12(sK15)
| sK13(sK15) = sK12(sK15) ),
inference(resolution,[],[f3808,f3648]) ).
fof(f4379,plain,
( next_subocc(sK12(sK15),sK14(sK12(sK15)),tptp0)
| sK13(sK15) = sK12(sK15) ),
inference(duplicate_literal_removal,[],[f4362]) ).
fof(f4416,plain,
( min_precedes(sK12(sK15),sK14(sK12(sK15)),tptp0)
| sK13(sK15) = sK12(sK15) ),
inference(resolution,[],[f4379,f181]) ).
fof(f4480,plain,
! [X2,X3,X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ arboreal(X2)
| ~ subactivity_occurrence(X2,X0)
| sK0(X3,X0) = X2
| ~ occurrence_of(X0,X3)
| atomic(X3)
| ~ occurrence_of(X0,X1)
| min_precedes(sK0(X3,X0),X2,X1)
| ~ occurrence_of(X0,X3)
| atomic(X3) ),
inference(resolution,[],[f1332,f842]) ).
fof(f4486,plain,
! [X2,X3,X0,X1] :
( min_precedes(sK0(X3,X0),X2,X1)
| ~ arboreal(X2)
| ~ subactivity_occurrence(X2,X0)
| sK0(X3,X0) = X2
| ~ occurrence_of(X0,X3)
| atomic(X3)
| ~ occurrence_of(X0,X1) ),
inference(duplicate_literal_removal,[],[f4480]) ).
fof(f5681,plain,
( occurrence_of(sK14(sK12(sK15)),tptp1)
| ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0)
| ~ leaf(sK13(sK15),tptp0)
| tptp0 = sK8(sK12(sK15),sK3(sK13(sK15),tptp0))
| atomic(tptp0) ),
inference(resolution,[],[f3193,f716]) ).
fof(f5701,plain,
( occurrence_of(sK14(sK12(sK15)),tptp1)
| ~ leaf(sK13(sK15),tptp0)
| tptp0 = sK8(sK12(sK15),sK3(sK13(sK15),tptp0))
| atomic(tptp0) ),
inference(forward_subsumption_resolution,[],[f5681,f145]) ).
fof(f5702,plain,
( occurrence_of(sK14(sK12(sK15)),tptp1)
| tptp0 = sK8(sK12(sK15),sK3(sK13(sK15),tptp0))
| atomic(tptp0) ),
inference(forward_subsumption_resolution,[],[f5701,f274]) ).
fof(f5703,plain,
( occurrence_of(sK14(sK12(sK15)),tptp1)
| tptp0 = sK8(sK12(sK15),sK3(sK13(sK15),tptp0)) ),
inference(forward_subsumption_resolution,[],[f5702,f194]) ).
fof(f5722,plain,
( tptp0 = sK8(sK12(sK15),sK3(sK13(sK15),tptp0))
| tptp1 = sK4(sK14(sK12(sK15))) ),
inference(resolution,[],[f5703,f247]) ).
fof(f5801,plain,
( ~ leaf_occ(sK12(sK15),sK3(sK13(sK15),tptp0))
| leaf(sK12(sK15),tptp0)
| tptp1 = sK4(sK14(sK12(sK15))) ),
inference(superposition,[],[f162,f5722]) ).
fof(f5811,plain,
! [X0] :
( leaf_occ(sK0(X0,sK15),sK15)
| atomic(X0)
| ~ occurrence_of(sK15,X0)
| sK12(sK15) = sK0(X0,sK15) ),
inference(resolution,[],[f2957,f209]) ).
fof(f5891,plain,
( leaf(sK12(sK15),tptp0)
| tptp1 = sK4(sK14(sK12(sK15)))
| occurrence_of(sK14(sK12(sK15)),tptp1)
| ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0) ),
inference(resolution,[],[f5801,f3193]) ).
fof(f5892,plain,
( ~ occurrence_of(sK3(sK13(sK15),tptp0),tptp0)
| tptp1 = sK4(sK14(sK12(sK15)))
| leaf(sK12(sK15),tptp0) ),
inference(forward_subsumption_resolution,[],[f5891,f247]) ).
fof(f5895,plain,
( tptp1 = sK4(sK14(sK12(sK15)))
| leaf(sK12(sK15),tptp0)
| ~ leaf(sK13(sK15),tptp0)
| atomic(tptp0) ),
inference(resolution,[],[f5892,f145]) ).
fof(f5896,plain,
( tptp1 = sK4(sK14(sK12(sK15)))
| leaf(sK12(sK15),tptp0)
| atomic(tptp0) ),
inference(forward_subsumption_resolution,[],[f5895,f274]) ).
fof(f5897,plain,
( leaf(sK12(sK15),tptp0)
| tptp1 = sK4(sK14(sK12(sK15))) ),
inference(forward_subsumption_resolution,[],[f5896,f194]) ).
fof(f5900,plain,
( tptp1 = sK4(sK14(sK12(sK15)))
| ~ occurrence_of(sK15,tptp0) ),
inference(resolution,[],[f5897,f536]) ).
fof(f5911,plain,
tptp1 = sK4(sK14(sK12(sK15))),
inference(forward_subsumption_resolution,[],[f5900,f209]) ).
fof(f5929,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| arboreal(sK10(sK13(X0),tptp0)) ),
inference(resolution,[],[f1539,f152]) ).
fof(f6415,plain,
! [X0] :
( ~ occurrence_of(sK15,tptp0)
| sK13(sK15) = sK0(X0,sK15)
| atomic(X0)
| ~ occurrence_of(sK15,X0)
| sK12(sK15) = sK0(X0,sK15) ),
inference(resolution,[],[f3558,f5811]) ).
fof(f6441,plain,
! [X0] :
( ~ occurrence_of(sK15,X0)
| atomic(X0)
| sK13(sK15) = sK0(X0,sK15)
| sK12(sK15) = sK0(X0,sK15) ),
inference(forward_subsumption_resolution,[],[f6415,f209]) ).
fof(f6680,plain,
( tptp3 = sK4(sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))))
| sK13(sK15) = sK12(sK15) ),
inference(resolution,[],[f1462,f4416]) ).
fof(f7578,plain,
( atomic(tptp0)
| sK13(sK15) = sK0(tptp0,sK15)
| sK12(sK15) = sK0(tptp0,sK15) ),
inference(resolution,[],[f6441,f209]) ).
fof(f7583,plain,
( sK13(sK15) = sK0(tptp0,sK15)
| sK12(sK15) = sK0(tptp0,sK15) ),
inference(forward_subsumption_resolution,[],[f7578,f194]) ).
fof(f7631,plain,
( root_occ(sK13(sK15),sK15)
| ~ occurrence_of(sK15,tptp0)
| atomic(tptp0)
| sK12(sK15) = sK0(tptp0,sK15) ),
inference(superposition,[],[f842,f7583]) ).
fof(f7679,plain,
( ~ occurrence_of(sK15,tptp0)
| atomic(tptp0)
| sK12(sK15) = sK0(tptp0,sK15) ),
inference(forward_subsumption_resolution,[],[f7631,f3163]) ).
fof(f7690,plain,
( atomic(tptp0)
| sK12(sK15) = sK0(tptp0,sK15) ),
inference(forward_subsumption_resolution,[],[f7679,f209]) ).
fof(f7697,plain,
sK12(sK15) = sK0(tptp0,sK15),
inference(forward_subsumption_resolution,[],[f7690,f194]) ).
fof(f11115,plain,
! [X0] :
( root(sK13(sK15),tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK13(sK15),X0)
| ~ occurrence_of(X0,tptp0)
| occurrence_of(sK14(sK10(sK13(sK15),tptp0)),tptp1) ),
inference(resolution,[],[f2238,f274]) ).
fof(f11121,plain,
! [X0] :
( root(sK13(sK15),tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK13(sK15),X0)
| occurrence_of(sK14(sK10(sK13(sK15),tptp0)),tptp1) ),
inference(duplicate_literal_removal,[],[f11115]) ).
fof(f11127,plain,
! [X0] :
( ~ subactivity_occurrence(sK13(sK15),X0)
| ~ occurrence_of(X0,tptp0)
| occurrence_of(sK14(sK10(sK13(sK15),tptp0)),tptp1) ),
inference(forward_subsumption_resolution,[],[f11121,f2919]) ).
fof(f11157,plain,
( ~ occurrence_of(sK15,tptp0)
| occurrence_of(sK14(sK10(sK13(sK15),tptp0)),tptp1)
| ~ occurrence_of(sK15,tptp0) ),
inference(resolution,[],[f11127,f217]) ).
fof(f11168,plain,
( ~ occurrence_of(sK15,tptp0)
| occurrence_of(sK14(sK10(sK13(sK15),tptp0)),tptp1) ),
inference(duplicate_literal_removal,[],[f11157]) ).
fof(f11169,plain,
occurrence_of(sK14(sK10(sK13(sK15),tptp0)),tptp1),
inference(forward_subsumption_resolution,[],[f11168,f209]) ).
fof(f11180,plain,
( ~ atomic(tptp1)
| arboreal(sK14(sK10(sK13(sK15),tptp0))) ),
inference(resolution,[],[f11169,f160]) ).
fof(f11185,plain,
arboreal(sK14(sK10(sK13(sK15),tptp0))),
inference(forward_subsumption_resolution,[],[f11180,f198]) ).
fof(f13975,plain,
! [X0] :
( root(sK13(sK15),tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK13(sK15),X0)
| ~ occurrence_of(X0,tptp0)
| next_subocc(sK10(sK13(sK15),tptp0),sK14(sK10(sK13(sK15),tptp0)),tptp0) ),
inference(resolution,[],[f2239,f274]) ).
fof(f13981,plain,
! [X0] :
( root(sK13(sK15),tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK13(sK15),X0)
| next_subocc(sK10(sK13(sK15),tptp0),sK14(sK10(sK13(sK15),tptp0)),tptp0) ),
inference(duplicate_literal_removal,[],[f13975]) ).
fof(f13988,plain,
! [X0] :
( ~ subactivity_occurrence(sK13(sK15),X0)
| ~ occurrence_of(X0,tptp0)
| next_subocc(sK10(sK13(sK15),tptp0),sK14(sK10(sK13(sK15),tptp0)),tptp0) ),
inference(forward_subsumption_resolution,[],[f13981,f2919]) ).
fof(f13989,plain,
( ~ occurrence_of(sK15,tptp0)
| next_subocc(sK10(sK13(sK15),tptp0),sK14(sK10(sK13(sK15),tptp0)),tptp0)
| ~ occurrence_of(sK15,tptp0) ),
inference(resolution,[],[f13988,f217]) ).
fof(f14000,plain,
( ~ occurrence_of(sK15,tptp0)
| next_subocc(sK10(sK13(sK15),tptp0),sK14(sK10(sK13(sK15),tptp0)),tptp0) ),
inference(duplicate_literal_removal,[],[f13989]) ).
fof(f14001,plain,
next_subocc(sK10(sK13(sK15),tptp0),sK14(sK10(sK13(sK15),tptp0)),tptp0),
inference(forward_subsumption_resolution,[],[f14000,f209]) ).
fof(f14024,plain,
! [X0] :
( ~ min_precedes(X0,sK14(sK10(sK13(sK15),tptp0)),tptp0)
| ~ min_precedes(sK10(sK13(sK15),tptp0),X0,tptp0) ),
inference(resolution,[],[f14001,f180]) ).
fof(f14025,plain,
min_precedes(sK10(sK13(sK15),tptp0),sK14(sK10(sK13(sK15),tptp0)),tptp0),
inference(resolution,[],[f14001,f181]) ).
fof(f14066,plain,
! [X0] :
( ~ root_occ(sK14(sK10(sK13(sK15),tptp0)),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f14025,f148]) ).
fof(f14072,plain,
precedes(sK10(sK13(sK15),tptp0),sK14(sK10(sK13(sK15),tptp0))),
inference(resolution,[],[f14025,f177]) ).
fof(f14074,plain,
! [X0] :
( ~ min_precedes(sK10(sK13(sK15),tptp0),X0,tptp0)
| min_precedes(X0,sK14(sK10(sK13(sK15),tptp0)),tptp0)
| ~ precedes(X0,sK14(sK10(sK13(sK15),tptp0))) ),
inference(resolution,[],[f14025,f188]) ).
fof(f14089,plain,
! [X0] :
( ~ precedes(X0,sK14(sK10(sK13(sK15),tptp0)))
| ~ min_precedes(sK10(sK13(sK15),tptp0),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f14074,f14024]) ).
fof(f15039,plain,
! [X0,X1] :
( min_precedes(sK12(sK15),X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK15)
| sK12(sK15) = X0
| ~ occurrence_of(sK15,tptp0)
| atomic(tptp0)
| ~ occurrence_of(sK15,X1) ),
inference(superposition,[],[f4486,f7697]) ).
fof(f15051,plain,
! [X0,X1] :
( min_precedes(sK12(sK15),X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK15)
| sK12(sK15) = X0
| atomic(tptp0)
| ~ occurrence_of(sK15,X1) ),
inference(forward_subsumption_resolution,[],[f15039,f209]) ).
fof(f15058,plain,
! [X0,X1] :
( min_precedes(sK12(sK15),X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK15)
| sK12(sK15) = X0
| ~ occurrence_of(sK15,X1) ),
inference(forward_subsumption_resolution,[],[f15051,f194]) ).
fof(f15358,plain,
~ min_precedes(sK10(sK13(sK15),tptp0),sK10(sK13(sK15),tptp0),tptp0),
inference(resolution,[],[f14089,f14072]) ).
fof(f16077,plain,
! [X0] :
( ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK15)
| sK12(sK15) = X0
| ~ occurrence_of(sK15,tptp0)
| ~ occurrence_of(sK15,tptp0)
| ~ precedes(X0,sK13(sK15)) ),
inference(resolution,[],[f15058,f548]) ).
fof(f16146,plain,
! [X0] :
( ~ arboreal(X0)
| ~ subactivity_occurrence(X0,sK15)
| sK12(sK15) = X0
| ~ occurrence_of(sK15,tptp0)
| ~ precedes(X0,sK13(sK15)) ),
inference(duplicate_literal_removal,[],[f16077]) ).
fof(f16158,plain,
! [X0] :
( ~ precedes(X0,sK13(sK15))
| ~ subactivity_occurrence(X0,sK15)
| sK12(sK15) = X0
| ~ arboreal(X0) ),
inference(forward_subsumption_resolution,[],[f16146,f209]) ).
fof(f16174,plain,
( ~ subactivity_occurrence(sK10(sK13(sK15),tptp0),sK15)
| sK12(sK15) = sK10(sK13(sK15),tptp0)
| ~ arboreal(sK10(sK13(sK15),tptp0))
| ~ occurrence_of(sK15,tptp0) ),
inference(resolution,[],[f16158,f1692]) ).
fof(f16183,plain,
( ~ subactivity_occurrence(sK10(sK13(sK15),tptp0),sK15)
| sK12(sK15) = sK10(sK13(sK15),tptp0)
| ~ occurrence_of(sK15,tptp0) ),
inference(forward_subsumption_resolution,[],[f16174,f5929]) ).
fof(f16188,plain,
( ~ subactivity_occurrence(sK10(sK13(sK15),tptp0),sK15)
| sK12(sK15) = sK10(sK13(sK15),tptp0) ),
inference(forward_subsumption_resolution,[],[f16183,f209]) ).
fof(f16194,plain,
( sK12(sK15) = sK10(sK13(sK15),tptp0)
| ~ occurrence_of(sK15,tptp0)
| ~ occurrence_of(sK15,tptp0)
| ~ subactivity_occurrence(sK13(sK15),sK15) ),
inference(resolution,[],[f16188,f1693]) ).
fof(f16196,plain,
( sK12(sK15) = sK10(sK13(sK15),tptp0)
| ~ occurrence_of(sK15,tptp0)
| ~ subactivity_occurrence(sK13(sK15),sK15) ),
inference(duplicate_literal_removal,[],[f16194]) ).
fof(f16198,plain,
( sK12(sK15) = sK10(sK13(sK15),tptp0)
| ~ occurrence_of(sK15,tptp0) ),
inference(forward_subsumption_resolution,[],[f16196,f217]) ).
fof(f16203,plain,
sK12(sK15) = sK10(sK13(sK15),tptp0),
inference(forward_subsumption_resolution,[],[f16198,f209]) ).
fof(f16279,plain,
arboreal(sK14(sK12(sK15))),
inference(superposition,[],[f11185,f16203]) ).
fof(f16286,plain,
min_precedes(sK12(sK15),sK14(sK12(sK15)),tptp0),
inference(superposition,[],[f14025,f16203]) ).
fof(f16290,plain,
! [X0] :
( ~ root_occ(sK14(sK12(sK15)),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[],[f14066,f16203]) ).
fof(f16320,plain,
~ min_precedes(sK12(sK15),sK12(sK15),tptp0),
inference(superposition,[],[f15358,f16203]) ).
fof(f16339,plain,
( min_precedes(sK12(sK15),sK13(sK15),tptp0)
| ~ leaf(sK13(sK15),tptp0)
| root(sK13(sK15),tptp0) ),
inference(superposition,[],[f306,f16203]) ).
fof(f16379,plain,
( min_precedes(sK12(sK15),sK13(sK15),tptp0)
| root(sK13(sK15),tptp0) ),
inference(forward_subsumption_resolution,[],[f16339,f274]) ).
fof(f16386,plain,
min_precedes(sK12(sK15),sK13(sK15),tptp0),
inference(forward_subsumption_resolution,[],[f16379,f2919]) ).
fof(f17639,plain,
! [X0] :
( ~ occurrence_of(sK2(tptp0,X0,sK14(sK12(sK15))),tptp0)
| ~ arboreal(sK14(sK12(sK15)))
| leaf_occ(sK14(sK12(sK15)),sK2(tptp0,X0,sK14(sK12(sK15))))
| ~ min_precedes(X0,sK14(sK12(sK15)),tptp0) ),
inference(resolution,[],[f16290,f1151]) ).
fof(f17643,plain,
! [X0] :
( ~ arboreal(sK14(sK12(sK15)))
| leaf_occ(sK14(sK12(sK15)),sK2(tptp0,X0,sK14(sK12(sK15))))
| ~ min_precedes(X0,sK14(sK12(sK15)),tptp0) ),
inference(forward_subsumption_resolution,[],[f17639,f143]) ).
fof(f17645,plain,
! [X0] :
( leaf_occ(sK14(sK12(sK15)),sK2(tptp0,X0,sK14(sK12(sK15))))
| ~ min_precedes(X0,sK14(sK12(sK15)),tptp0) ),
inference(forward_subsumption_resolution,[],[f17643,f16279]) ).
fof(f21712,plain,
! [X0] :
( ~ min_precedes(X0,sK14(sK12(sK15)),tptp0)
| ~ occurrence_of(sK2(tptp0,X0,sK14(sK12(sK15))),tptp0)
| sK14(sK12(sK15)) = sK13(sK2(tptp0,X0,sK14(sK12(sK15)))) ),
inference(resolution,[],[f17645,f3558]) ).
fof(f21723,plain,
! [X0] :
( ~ min_precedes(X0,sK14(sK12(sK15)),tptp0)
| sK14(sK12(sK15)) = sK13(sK2(tptp0,X0,sK14(sK12(sK15)))) ),
inference(forward_subsumption_resolution,[],[f21712,f143]) ).
fof(f23159,plain,
sK14(sK12(sK15)) = sK13(sK2(tptp0,sK12(sK15),sK14(sK12(sK15)))),
inference(resolution,[],[f21723,f16286]) ).
fof(f23310,plain,
( tptp3 = sK4(sK14(sK12(sK15)))
| sK13(sK15) = sK12(sK15) ),
inference(superposition,[],[f6680,f23159]) ).
fof(f23403,plain,
( tptp3 = tptp1
| sK13(sK15) = sK12(sK15) ),
inference(forward_demodulation,[],[f23310,f5911]) ).
fof(f23405,plain,
sK13(sK15) = sK12(sK15),
inference(forward_subsumption_resolution,[],[f23403,f202]) ).
fof(f23862,plain,
min_precedes(sK12(sK15),sK12(sK15),tptp0),
inference(superposition,[],[f16386,f23405]) ).
fof(f24038,plain,
$false,
inference(forward_subsumption_resolution,[],[f23862,f16320]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO004+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n006.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 22:16:25 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.58/2.91 % (3380222)Will run a generic schedule for satisfiability detection.
% 16.58/2.91 % (3380229)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=452845100:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 16.58/2.91 % (3380228)% WARNING: option uhcvi not known.
% 16.58/2.91 % (3380231)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1205630224:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 16.58/2.91 % (3380227)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4136416251_2999 on theBenchmark for (2999ds/0Mi)
% 16.58/2.91 % (3380228)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3158601170:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 16.58/2.91 % (3380230)dis+10_1_sil=32000:sp=arity:random_seed=3766618766:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 16.58/2.91 % (3380232)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3283517714:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 16.58/2.91 % (3380233)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=763806706:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 16.58/2.91 % Detected minimum model sizes of [4]
% 16.58/2.91 % Detected maximum model sizes of [max]
% 16.58/2.91 % TRYING [4]
% 16.58/2.91 % TRYING [5]
% 16.58/2.91 % TRYING [6]
% 16.58/2.91 % (3380230)Instruction limit reached!
% 16.58/2.91 % (3380230)------------------------------
% 16.58/2.91 % (3380230)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.58/2.91 % (3380230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.58/2.91 % (3380230)CaDiCaL version: 2.1.3
% 16.58/2.91 % (3380230)Termination reason: Instruction limit
% 16.58/2.91 % (3380230)Termination phase: Saturation
% 16.58/2.91 % (3380230)Time elapsed: 0.072 s
% 16.58/2.91 % (3380230)Peak memory usage: 12 MB
% 16.58/2.91 % (3380230)Instructions burned: 104 (million)
% 16.58/2.91 % (3380231)Instruction limit reached!
% 16.58/2.91 % (3380231)------------------------------
% 16.58/2.91 % (3380231)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.58/2.91 % (3380231)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.58/2.91 % (3380231)CaDiCaL version: 2.1.3
% 16.58/2.91 % (3380231)Termination reason: Instruction limit
% 16.58/2.91 % (3380231)Termination phase: Saturation
% 16.58/2.91 % (3380231)Time elapsed: 0.074 s
% 16.58/2.91 % (3380231)Peak memory usage: 12 MB
% 16.58/2.91 % (3380231)Instructions burned: 117 (million)
% 16.58/2.91 % TRYING [7]
% 16.58/2.91 % (3380232)Instruction limit reached!
% 16.58/2.91 % (3380232)------------------------------
% 16.58/2.91 % (3380232)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.58/2.91 % (3380232)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.58/2.91 % (3380232)CaDiCaL version: 2.1.3
% 16.58/2.91 % (3380232)Termination reason: Instruction limit
% 16.58/2.91 % (3380232)Termination phase: Saturation
% 16.58/2.91 % (3380232)Time elapsed: 0.088 s
% 16.58/2.91 % (3380232)Peak memory usage: 13 MB
% 16.58/2.91 % (3380232)Instructions burned: 132 (million)
% 16.58/2.91 % (3380242)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2905193184:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 16.58/2.91 % (3380241)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=286334006:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 16.58/2.91 % Detected minimum model sizes of [4]
% 16.58/2.91 % Detected maximum model sizes of [max]
% 16.58/2.91 % TRYING [4]
% 16.58/2.91 % TRYING [5]
% 16.58/2.91 % (3380243)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3543382912:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 16.58/2.91 % (3380233)Instruction limit reached!
% 16.58/2.91 % (3380233)------------------------------
% 16.58/2.91 % (3380233)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.58/2.91 % (3380233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.58/2.91 % (3380233)CaDiCaL version: 2.1.3
% 16.58/2.91 % (3380233)Termination reason: Instruction limit
% 16.58/2.91 % (3380233)Termination phase: Saturation
% 16.58/2.91 % (3380233)Time elapsed: 0.119 s
% 16.58/2.91 % (3380233)Peak memory usage: 14 MB
% 16.58/2.91 % (3380233)Instructions burned: 160 (million)
% 16.58/2.91 % TRYING [6]
% 16.58/2.91 % (3380247)ott-21_1_sil=16000:fs=off:random_seed=305663755:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 16.58/2.91 % (3380242)Instruction limit reached!
% 16.58/2.91 % (3380242)------------------------------
% 42.31/6.40 % (3380242)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.31/6.40 % (3380242)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.31/6.40 % (3380242)CaDiCaL version: 2.1.3
% 42.31/6.40 % (3380242)Termination reason: Instruction limit
% 42.31/6.40 % (3380242)Termination phase: Saturation
% 42.31/6.40 % (3380242)Time elapsed: 0.087 s
% 42.31/6.40 % (3380242)Peak memory usage: 13 MB
% 42.31/6.40 % (3380242)Instructions burned: 132 (million)
% 42.31/6.40 % TRYING [7]
% 42.31/6.40 % (3380249)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2386576430:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 42.31/6.40 % TRYING [8]
% 42.31/6.40 % (3380247)Instruction limit reached!
% 42.31/6.40 % (3380247)------------------------------
% 42.31/6.40 % (3380247)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.31/6.40 % (3380247)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.31/6.40 % (3380247)CaDiCaL version: 2.1.3
% 42.31/6.40 % (3380247)Termination reason: Instruction limit
% 42.31/6.40 % (3380247)Termination phase: Saturation
% 42.31/6.40 % (3380247)Time elapsed: 0.096 s
% 42.31/6.40 % (3380247)Peak memory usage: 13 MB
% 42.31/6.40 % (3380247)Instructions burned: 180 (million)
% 42.31/6.40 % (3380251)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1133846867:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 42.31/6.40 % Detected minimum model sizes of [4]
% 42.31/6.40 % Detected maximum model sizes of [max]
% 42.31/6.40 % TRYING [4]
% 42.31/6.40 % TRYING [5]
% 42.31/6.40 % TRYING [6]
% 42.31/6.40 % TRYING [8]
% 42.31/6.40 % (3380241)Instruction limit reached!
% 42.31/6.40 % (3380241)------------------------------
% 42.31/6.40 % (3380241)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.31/6.40 % (3380241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.31/6.40 % (3380241)CaDiCaL version: 2.1.3
% 42.31/6.40 % (3380241)Termination reason: Instruction limit
% 42.31/6.40 % (3380241)Termination phase: Finite model building constraint generation
% 42.31/6.40 % (3380241)Time elapsed: 0.307 s
% 42.31/6.40 % (3380241)Peak memory usage: 26 MB
% 42.31/6.40 % (3380241)Instructions burned: 716 (million)
% 42.31/6.40 % (3380253)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1698349549:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 42.31/6.40 % TRYING [7]
% 42.31/6.40 % TRYING [9]
% 42.31/6.40 % (3380243)Instruction limit reached!
% 42.31/6.40 % (3380243)------------------------------
% 42.31/6.40 % (3380243)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.31/6.40 % (3380243)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.31/6.40 % (3380243)CaDiCaL version: 2.1.3
% 42.31/6.40 % (3380243)Termination reason: Instruction limit
% 42.31/6.40 % (3380243)Termination phase: Saturation
% 42.31/6.40 % (3380243)Time elapsed: 0.402 s
% 42.31/6.40 % (3380243)Peak memory usage: 18 MB
% 42.31/6.40 % (3380243)Instructions burned: 685 (million)
% 42.31/6.40 % (3380255)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3955778849:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 42.31/6.40 % (3380249)Instruction limit reached!
% 42.31/6.40 % (3380249)------------------------------
% 42.31/6.40 % (3380249)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.31/6.40 % (3380249)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.31/6.40 % (3380249)CaDiCaL version: 2.1.3
% 42.31/6.40 % (3380249)Termination reason: Instruction limit
% 42.31/6.40 % (3380249)Termination phase: Saturation
% 42.31/6.40 % (3380249)Time elapsed: 0.338 s
% 42.31/6.40 % (3380249)Peak memory usage: 14 MB
% 42.31/6.40 % (3380249)Instructions burned: 479 (million)
% 42.31/6.40 % (3380257)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=4080823046:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 42.31/6.40 % TRYING [14]
% 42.31/6.40 % (3380251)Instruction limit reached!
% 42.31/6.40 % (3380251)------------------------------
% 42.31/6.40 % (3380251)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.31/6.40 % (3380251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.31/6.40 % (3380251)CaDiCaL version: 2.1.3
% 42.31/6.40 % (3380251)Termination reason: Instruction limit
% 42.31/6.40 % (3380251)Termination phase: Finite model building SAT solving
% 42.31/6.40 % (3380251)Time elapsed: 0.337 s
% 42.31/6.40 % (3380251)Peak memory usage: 21 MB
% 42.31/6.40 % (3380251)Instructions burned: 868 (million)
% 44.85/6.83 % (3380259)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1948616964:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 44.85/6.83 % (3380255)Instruction limit reached!
% 44.85/6.83 % (3380255)------------------------------
% 44.85/6.83 % (3380255)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.83 % (3380255)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.83 % (3380255)CaDiCaL version: 2.1.3
% 44.85/6.83 % (3380255)Termination reason: Instruction limit
% 44.85/6.83 % (3380255)Termination phase: Finite model building constraint generation
% 44.85/6.83 % (3380255)Time elapsed: 0.337 s
% 44.85/6.83 % (3380255)Peak memory usage: 76 MB
% 44.85/6.83 % (3380255)Instructions burned: 890 (million)
% 44.85/6.83 % (3380261)fmb+10_1_sil=64000:random_seed=3938323554:i=22061:nm=2:gsp=on_2990 on theBenchmark for (2990ds/22061Mi)
% 44.85/6.83 % Detected minimum model sizes of [4]
% 44.85/6.83 % Detected maximum model sizes of [max]
% 44.85/6.83 % TRYING [4]
% 44.85/6.83 % TRYING [5]
% 44.85/6.83 % TRYING [10]
% 44.85/6.83 % TRYING [6]
% 44.85/6.83 % (3380257)Instruction limit reached!
% 44.85/6.83 % (3380257)------------------------------
% 44.85/6.83 % (3380257)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.83 % (3380257)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.83 % (3380257)CaDiCaL version: 2.1.3
% 44.85/6.83 % (3380257)Termination reason: Instruction limit
% 44.85/6.83 % (3380257)Termination phase: Saturation
% 44.85/6.83 % (3380257)Time elapsed: 0.417 s
% 44.85/6.83 % (3380257)Peak memory usage: 21 MB
% 44.85/6.83 % (3380257)Instructions burned: 693 (million)
% 44.85/6.83 % (3380263)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=4274222404:i=9515:nm=5_2989 on theBenchmark for (2989ds/9515Mi)
% 44.85/6.83 % Detected minimum model sizes of [4]
% 44.85/6.83 % Detected maximum model sizes of [max]
% 44.85/6.83 % TRYING [20]
% 44.85/6.83 % TRYING [7]
% 44.85/6.83 % (3380253)Instruction limit reached!
% 44.85/6.83 % (3380253)------------------------------
% 44.85/6.83 % (3380253)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.83 % (3380253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.83 % (3380253)CaDiCaL version: 2.1.3
% 44.85/6.83 % (3380253)Termination reason: Instruction limit
% 44.85/6.83 % (3380253)Termination phase: Saturation
% 44.85/6.83 % (3380253)Time elapsed: 0.675 s
% 44.85/6.83 % (3380253)Peak memory usage: 24 MB
% 44.85/6.83 % (3380253)Instructions burned: 1179 (million)
% 44.85/6.83 % (3380265)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2018426719:fmbsr=1.7:i=920_2988 on theBenchmark for (2988ds/920Mi)
% 44.85/6.83 % Detected minimum model sizes of [4]
% 44.85/6.83 % Detected maximum model sizes of [max]
% 44.85/6.83 % TRYING [8]
% 44.85/6.83 % (3380259)Instruction limit reached!
% 44.85/6.83 % (3380259)------------------------------
% 44.85/6.83 % (3380259)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.83 % (3380259)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.83 % (3380259)CaDiCaL version: 2.1.3
% 44.85/6.83 % (3380259)Termination reason: Instruction limit
% 44.85/6.83 % (3380259)Termination phase: Saturation
% 44.85/6.83 % (3380259)Time elapsed: 0.512 s
% 44.85/6.83 % (3380259)Peak memory usage: 17 MB
% 44.85/6.83 % (3380259)Instructions burned: 879 (million)
% 44.85/6.83 % (3380267)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=222753785:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 44.85/6.83 % TRYING [8]
% 44.85/6.83 % TRYING [9]
% 44.85/6.83 % (3380265)Instruction limit reached!
% 44.85/6.83 % (3380265)------------------------------
% 44.85/6.83 % (3380265)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.83 % (3380265)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.83 % (3380265)CaDiCaL version: 2.1.3
% 44.85/6.83 % (3380265)Termination reason: Instruction limit
% 44.85/6.83 % (3380265)Termination phase: Finite model building constraint generation
% 44.85/6.83 % (3380265)Time elapsed: 0.411 s
% 44.85/6.83 % (3380265)Peak memory usage: 39 MB
% 44.85/6.83 % (3380265)Instructions burned: 920 (million)
% 44.85/6.83 % (3380269)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2996230267:i=1472:ins=7:fdi=8:gsp=on_2984 on theBenchmark for (2984ds/1472Mi)
% 44.85/6.83 % TRYING [11]
% 44.85/6.83 % TRYING [9]
% 44.85/6.83 % (3380269)Instruction limit reached!
% 44.85/6.83 % (3380269)------------------------------
% 44.85/6.83 % (3380269)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.83 % (3380269)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.83 % (3380269)CaDiCaL version: 2.1.3
% 44.85/6.83 % (3380269)Termination reason: Instruction limit
% 44.85/6.83 % (3380269)Termination phase: Saturation
% 44.85/6.83 % (3380269)Time elapsed: 0.890 s
% 44.85/6.83 % (3380269)Peak memory usage: 27 MB
% 44.85/6.83 % (3380269)Instructions burned: 1473 (million)
% 44.85/6.83 % (3380271)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2285569423:i=6324_2975 on theBenchmark for (2975ds/6324Mi)
% 44.85/6.83 % Detected minimum model sizes of [4]
% 44.85/6.83 % Detected maximum model sizes of [max]
% 44.85/6.83 % TRYING [77]
% 44.85/6.83 % TRYING [10]
% 44.85/6.83 % TRYING [12]
% 44.85/6.83 % (3380267)Instruction limit reached!
% 44.85/6.83 % (3380267)------------------------------
% 44.85/6.83 % (3380267)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.83 % (3380267)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.83 % (3380267)CaDiCaL version: 2.1.3
% 44.85/6.83 % (3380267)Termination reason: Instruction limit
% 44.85/6.83 % (3380267)Termination phase: Saturation
% 44.85/6.83 % (3380267)Time elapsed: 2.812 s
% 44.85/6.83 % (3380267)Peak memory usage: 23 MB
% 44.85/6.83 % (3380267)Instructions burned: 5133 (million)
% 44.85/6.83 % (3380273)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=4268755715:fmbsr=2.30978:i=2174_2959 on theBenchmark for (2959ds/2174Mi)
% 44.85/6.83 % Detected minimum model sizes of [4]
% 44.85/6.83 % Detected maximum model sizes of [max]
% 44.85/6.83 % TRYING [16]
% 44.85/6.83 % TRYING [11]
% 44.85/6.83 % (3380271)Instruction limit reached!
% 44.85/6.83 % (3380271)------------------------------
% 44.85/6.83 % (3380271)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.83 % (3380271)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.83 % (3380271)CaDiCaL version: 2.1.3
% 44.85/6.83 % (3380271)Termination reason: Instruction limit
% 44.85/6.83 % (3380271)Termination phase: Finite model building constraint generation
% 44.85/6.83 % (3380271)Time elapsed: 2.261 s
% 44.85/6.83 % (3380271)Peak memory usage: 416 MB
% 44.85/6.83 % (3380271)Instructions burned: 6326 (million)
% 44.85/6.83 % (3380275)ott-2_1_sil=16000:newcnf=on:random_seed=2266859456:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2951 on theBenchmark for (2951ds/869Mi)
% 44.85/6.83 % (3380273)Instruction limit reached!
% 44.85/6.83 % (3380273)------------------------------
% 44.85/6.83 % (3380273)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.83 % (3380273)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.83 % (3380273)CaDiCaL version: 2.1.3
% 44.85/6.83 % (3380273)Termination reason: Instruction limit
% 44.85/6.83 % (3380273)Termination phase: Finite model building constraint generation
% 44.85/6.83 % (3380273)Time elapsed: 0.995 s
% 44.85/6.83 % (3380273)Peak memory usage: 193 MB
% 44.85/6.83 % (3380273)Instructions burned: 2176 (million)
% 44.85/6.83 % (3380277)ott+10_1_sil=32000:tgt=ground:random_seed=2051315347:i=5114:av=off_2949 on theBenchmark for (2949ds/5114Mi)
% 44.85/6.83 % (3380275)Instruction limit reached!
% 44.85/6.83 % (3380275)------------------------------
% 44.85/6.83 % (3380275)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.83 % (3380275)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.83 % (3380275)CaDiCaL version: 2.1.3
% 44.85/6.83 % (3380275)Termination reason: Instruction limit
% 44.85/6.83 % (3380275)Termination phase: Saturation
% 44.85/6.83 % (3380275)Time elapsed: 0.471 s
% 44.85/6.83 % (3380275)Peak memory usage: 15 MB
% 44.85/6.83 % (3380275)Instructions burned: 871 (million)
% 44.85/6.83 % (3380279)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2288609174:i=54282_2946 on theBenchmark for (2946ds/54282Mi)
% 44.85/6.83 % Detected minimum model sizes of [4]
% 44.85/6.83 % Detected maximum model sizes of [max]
% 44.85/6.83 % TRYING [4]
% 44.85/6.83 % TRYING [5]
% 44.85/6.83 % TRYING [6]
% 44.85/6.83 % TRYING [7]
% 44.85/6.83 % TRYING [8]
% 44.85/6.83 % TRYING [9]
% 44.85/6.83 % (3380263)Instruction limit reached!
% 44.85/6.83 % (3380263)------------------------------
% 44.85/6.83 % (3380263)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.83 % (3380263)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.83 % (3380263)CaDiCaL version: 2.1.3
% 44.85/6.83 % (3380263)Termination reason: Instruction limit
% 44.85/6.83 % (3380263)Termination phase: Finite model building constraint generation
% 44.85/6.83 % (3380263)Time elapsed: 4.940 s
% 44.85/6.83 % (3380263)Peak memory usage: 772 MB
% 44.85/6.83 % (3380263)Instructions burned: 9517 (million)
% 44.85/6.83 % (3380281)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=4184100184:i=3512:aac=none_2939 on theBenchmark for (2939ds/3512Mi)
% 44.85/6.83 % TRYING [12]
% 44.85/6.83 % TRYING [10]
% 44.85/6.83 % (3380277) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3380222-3380277"...
% 44.85/6.83 % (3380277)...printing done.
% 44.85/6.83 % (3380277)Refutation found. Thanks to Tanya!
% 44.85/6.83 % SZS status Theorem for theBenchmark
% 44.85/6.83 % SZS output start Proof for theBenchmark
% See solution above
% 44.85/6.84 % (3380277)------------------------------
% 44.85/6.84 % (3380277)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 44.85/6.84 % (3380277)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 44.85/6.84 % (3380277)CaDiCaL version: 2.1.3
% 44.85/6.84 % (3380277)Termination reason: Refutation
% 44.85/6.84 % (3380277)Time elapsed: 1.317 s
% 44.85/6.84 % (3380277)Peak memory usage: 24 MB
% 44.85/6.84 % (3380277)Instructions burned: 2137 (million)
% 44.85/6.84 % (3380222)Success in time 6.407 s
% 44.85/6.84 % Vampire exiting
%------------------------------------------------------------------------------