%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PRO017+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n017.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 : Fri Sep 25 02:31:39 PM UTC 2026
% Result : Theorem 10.52s 7.32s
% Output : CNFRefutation 10.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 9
% Syntax : Number of formulae : 118 ( 28 unt; 0 def)
% Number of atoms : 456 ( 29 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 570 ( 232 ~; 234 |; 90 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 231 ( 0 sgn 200 !; 31 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X1,X2,X3)
& min_precedes(X0,X1,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)
<=> ( ~ ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(f7,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> precedes(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
fof(f9,axiom,
! [X0,X1] :
( precedes(X0,X1)
<=> ( legal(X1)
& earlier(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f10,axiom,
! [X0,X1] :
( earlier(X0,X1)
=> ~ earlier(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(f15,axiom,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ~ ? [X3] : min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_14) ).
fof(f22,axiom,
! [X0,X1,X2] :
( ( leaf_occ(X1,X0)
& occurrence_of(X0,X2) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(f33,axiom,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3,X4] :
( ! [X5] :
( min_precedes(X2,X5,tptp0)
=> ( X5 = X4
| X5 = X3 ) )
& min_precedes(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f46,conjecture,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3] :
( leaf(X3,tptp0)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3] :
( leaf(X3,tptp0)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f48,plain,
! [X0,X1] :
( precedes(X0,X1)
=> ( legal(X1)
& earlier(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f50,plain,
! [X0,X1,X2,X3] :
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3)
| min_precedes(X0,X2,X3) ),
inference(ennf_transformation,[],[f1]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3)
| min_precedes(X0,X2,X3) ),
inference(flattening,[],[f50]) ).
fof(f58,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ~ min_precedes(X0,X1,X2)
| precedes(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f62,plain,
! [X0,X1] :
( ~ precedes(X0,X1)
| ( legal(X1)
& earlier(X0,X1) ) ),
inference(ennf_transformation,[],[f48]) ).
fof(f63,plain,
! [X0,X1] :
( ~ earlier(X0,X1)
| ~ earlier(X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f67,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ! [X3] : ~ min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f75,plain,
! [X0,X1,X2] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ! [X3] : ~ min_precedes(X1,X3,X2) ),
inference(ennf_transformation,[],[f22]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ! [X3] : ~ min_precedes(X1,X3,X2) ),
inference(flattening,[],[f75]) ).
fof(f92,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ? [X2,X3,X4] :
( ! [X5] :
( ~ min_precedes(X2,X5,tptp0)
| X5 = X4
| X5 = X3 )
& min_precedes(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f93,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ? [X2,X3,X4] :
( ! [X5] :
( ~ min_precedes(X2,X5,tptp0)
| X5 = X4
| X5 = X3 )
& min_precedes(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(flattening,[],[f92]) ).
fof(f94,plain,
? [X0,X1] :
( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0)
& ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ) ),
inference(ennf_transformation,[],[f47]) ).
fof(f95,plain,
? [X0,X1] :
( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0)
& ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ) ),
inference(flattening,[],[f94]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ( ~ next_subocc(X0,X1,X2)
| ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) ) )
& ( ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2)
| next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f58]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ( ~ next_subocc(X0,X1,X2)
| ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) ) )
& ( ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2)
| next_subocc(X0,X1,X2) ) ),
inference(flattening,[],[f96]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ( ~ next_subocc(X0,X1,X2)
| ( ! [X4] :
( ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) )
& min_precedes(X0,X1,X2) ) )
& ( ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2)
| next_subocc(X0,X1,X2) ) ),
inference(rectify,[],[f97]) ).
fof(f99,plain,
! [X0,X1,X2] :
( ( ~ next_subocc(X0,X1,X2)
| ( ! [X4] :
( ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) )
& min_precedes(X0,X1,X2) ) )
& ( ( min_precedes(sK0(X0,X1,X2),X1,X2)
& min_precedes(X0,sK0(X0,X1,X2),X2) )
| ~ min_precedes(X0,X1,X2)
| next_subocc(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f98]) ).
fof(f104,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X3] : ~ min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) )
& ( ? [X3] : min_precedes(X0,X3,X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f67]) ).
fof(f105,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X3] : ~ min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) )
& ( ? [X3] : min_precedes(X0,X3,X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(flattening,[],[f104]) ).
fof(f106,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X5] : ~ min_precedes(X0,X5,X1)
& ( ? [X4] : min_precedes(X4,X0,X1)
| root(X0,X1) ) ) )
& ( ? [X3] : min_precedes(X0,X3,X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(rectify,[],[f105]) ).
fof(f107,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X5] : ~ min_precedes(X0,X5,X1)
& ( min_precedes(sK3(X0,X1),X0,X1)
| root(X0,X1) ) ) )
& ( min_precedes(X0,sK2(X0,X1),X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X3,sK2(X0,X1)),skolemize(X4,sK3(X0,X1))],[f106]) ).
fof(f118,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ( ! [X5] :
( ~ min_precedes(sK13(X0),X5,tptp0)
| sK15(X0) = X5
| sK14(X0) = X5 )
& min_precedes(sK14(X0),sK15(X0),tptp0)
& ( occurrence_of(sK15(X0),tptp1)
| occurrence_of(sK15(X0),tptp2) )
& min_precedes(sK13(X0),sK14(X0),tptp0)
& occurrence_of(sK14(X0),tptp4)
& next_subocc(X0,sK13(X0),tptp0)
& occurrence_of(sK13(X0),tptp3) ) ),
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,
( ~ leaf_occ(sK16,sK17)
& arboreal(sK16)
& subactivity_occurrence(sK16,sK17)
& occurrence_of(sK17,tptp0)
& ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ) ),
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(X1,X2,X3)
| ~ min_precedes(X0,X1,X3)
| min_precedes(X0,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(f130,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| precedes(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f133,plain,
! [X0,X1] :
( ~ precedes(X0,X1)
| earlier(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
fof(f134,plain,
! [X0,X1] :
( ~ earlier(X0,X1)
| ~ earlier(X1,X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f145,plain,
! [X2,X0,X1] :
( min_precedes(X0,sK2(X0,X1),X1)
| ~ min_precedes(X2,X0,X1)
| leaf(X0,X1) ),
inference(cnf_transformation,[],[f107]) ).
fof(f158,plain,
! [X2,X3,X0,X1] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ~ min_precedes(X1,X3,X2) ),
inference(cnf_transformation,[],[f76]) ).
fof(f179,plain,
! [X0,X1,X5] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ min_precedes(sK13(X0),X5,tptp0)
| sK15(X0) = X5
| sK14(X0) = X5 ),
inference(cnf_transformation,[],[f118]) ).
fof(f180,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK14(X0),sK15(X0),tptp0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f181,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK15(X0),tptp1)
| occurrence_of(sK15(X0),tptp2) ),
inference(cnf_transformation,[],[f118]) ).
fof(f182,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK13(X0),sK14(X0),tptp0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f184,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK13(X0),tptp0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f185,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK13(X0),tptp3) ),
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)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp1)
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f119]) ).
fof(f203,plain,
! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp2)
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f119]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( min_precedes(X0,X3,X2)
| ~ min_precedes(X1,X3,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f120]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( min_precedes(X0,X1,X2)
| ~ next_subocc(X0,X1,X2) ),
inference(cnf_transformation,[],[f125]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( precedes(X0,X1)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f130]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( earlier(X0,X1)
| ~ precedes(X0,X1) ),
inference(cnf_transformation,[],[f133]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( ~ earlier(X1,X0)
| ~ earlier(X0,X1) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i,X2: $i] :
( leaf(X1,X2)
| min_precedes(X1,sK2(X1,X2),X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f145]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ leaf_occ(X0,X3)
| ~ occurrence_of(X3,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f158]) ).
tcf(c_108,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| occurrence_of(sK13(X0),tptp3)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_109,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| next_subocc(X0,sK13(X0),tptp0)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f184]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| min_precedes(sK13(X0),sK14(X0),tptp0)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f182]) ).
tcf(c_112,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| occurrence_of(sK15(X0),tptp1)
| occurrence_of(sK15(X0),tptp2)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f181]) ).
tcf(c_113,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| min_precedes(sK14(X0),sK15(X0),tptp0)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f180]) ).
tcf(c_114,plain,
! [X0: $i,X1: $i,X2: $i] :
( leaf_occ(X0,X2)
| ( sK15(X0) = X1 )
| ( sK14(X0) = X1 )
| ~ arboreal(X0)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X0,X2)
| ~ min_precedes(sK13(X0),X1,tptp0) ),
inference(cnf_transformation,[],[f179]) ).
tcf(c_127,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ leaf(X1,tptp0)
| ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X0,tptp3)
| ~ next_subocc(sK16,X0,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(cnf_transformation,[],[f203]) ).
tcf(c_128,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ leaf(X1,tptp0)
| ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X0,tptp3)
| ~ next_subocc(sK16,X0,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(cnf_transformation,[],[f202]) ).
tcf(c_129,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f201]) ).
tcf(c_130,negated_conjecture,
subactivity_occurrence(sK16,sK17),
inference(cnf_transformation,[],[f200]) ).
tcf(c_131,negated_conjecture,
arboreal(sK16),
inference(cnf_transformation,[],[f199]) ).
tcf(c_132,negated_conjecture,
~ leaf_occ(sK16,sK17),
inference(cnf_transformation,[],[f198]) ).
tcf(c_1056,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( earlier(X1,X3)
| ~ min_precedes(X0,X2,X4)
| ( X2 != X3 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_59,c_61]) ).
tcf(c_1057,plain,
! [X0: $i,X1: $i,X2: $i] :
( earlier(X0,X1)
| ~ min_precedes(X0,X1,X2) ),
inference(unflattening,[status(thm)],[c_1056]) ).
tcf(c_6064,negated_conjecture,
~ leaf_occ(sK16,sK17),
inference(demodulation,[status(thm)],[c_132]) ).
tcf(c_6065,negated_conjecture,
arboreal(sK16),
inference(demodulation,[status(thm)],[c_131]) ).
tcf(c_6066,negated_conjecture,
subactivity_occurrence(sK16,sK17),
inference(demodulation,[status(thm)],[c_130]) ).
tcf(c_6067,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(demodulation,[status(thm)],[c_129]) ).
tcf(c_6068,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ leaf(X1,tptp0)
| ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X0,tptp3)
| ~ next_subocc(sK16,X0,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(demodulation,[status(thm)],[c_128]) ).
tcf(c_6069,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ leaf(X1,tptp0)
| ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X0,tptp3)
| ~ next_subocc(sK16,X0,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(demodulation,[status(thm)],[c_127]) ).
tcf(c_9533,plain,
( occurrence_of(sK13(sK16),tptp3)
| ~ arboreal(sK16)
| ~ subactivity_occurrence(sK16,sK17)
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_108,c_6064]) ).
tcf(c_9545,plain,
occurrence_of(sK13(sK16),tptp3),
inference(forward_subsumption_resolution,[status(thm)],[c_9533,c_6065,c_6066,c_6067]) ).
tcf(c_9759,plain,
( next_subocc(sK16,sK13(sK16),tptp0)
| ~ arboreal(sK16)
| ~ subactivity_occurrence(sK16,sK17)
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_109,c_6064]) ).
tcf(c_9764,plain,
next_subocc(sK16,sK13(sK16),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_9759,c_6065,c_6066,c_6067]) ).
tcf(c_9995,plain,
min_precedes(sK16,sK13(sK16),tptp0),
inference(superposition,[status(thm)],[c_9764,c_55]) ).
tcf(c_10212,plain,
( min_precedes(sK13(sK16),sK14(sK16),tptp0)
| ~ arboreal(sK16)
| ~ subactivity_occurrence(sK16,sK17)
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_111,c_6064]) ).
tcf(c_10235,plain,
min_precedes(sK13(sK16),sK14(sK16),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_10212,c_6065,c_6066,c_6067]) ).
tcf(c_10395,plain,
( min_precedes(sK14(sK16),sK15(sK16),tptp0)
| ~ arboreal(sK16)
| ~ subactivity_occurrence(sK16,sK17)
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_113,c_6064]) ).
tcf(c_10428,plain,
min_precedes(sK14(sK16),sK15(sK16),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_10395,c_6065,c_6066,c_6067]) ).
tcf(c_10588,plain,
( occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2)
| ~ arboreal(sK16)
| ~ subactivity_occurrence(sK16,sK17)
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_112,c_6064]) ).
tcf(c_10600,plain,
( occurrence_of(sK15(sK16),tptp1)
| occurrence_of(sK15(sK16),tptp2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_10588,c_6065,c_6066,c_6067]) ).
tcf(c_10950,plain,
! [X0: $i] :
( ~ leaf_occ(sK16,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_9995,c_87]) ).
tcf(c_11046,plain,
! [X0: $i] :
( min_precedes(sK13(sK16),X0,tptp0)
| ~ min_precedes(sK14(sK16),X0,tptp0) ),
inference(superposition,[status(thm)],[c_10235,c_49]) ).
tcf(c_11110,plain,
( leaf(sK15(sK16),tptp0)
| min_precedes(sK15(sK16),sK2(sK15(sK16),tptp0),tptp0) ),
inference(superposition,[status(thm)],[c_10428,c_73]) ).
tcf(c_11120,plain,
earlier(sK14(sK16),sK15(sK16)),
inference(superposition,[status(thm)],[c_10428,c_1057]) ).
tcf(c_12169,plain,
~ earlier(sK15(sK16),sK14(sK16)),
inference(superposition,[status(thm)],[c_11120,c_63]) ).
tcf(c_12774,plain,
min_precedes(sK13(sK16),sK15(sK16),tptp0),
inference(superposition,[status(thm)],[c_10428,c_11046]) ).
tcf(c_12824,plain,
! [X0: $i] :
( min_precedes(sK13(sK16),X0,tptp0)
| ~ min_precedes(sK15(sK16),X0,tptp0) ),
inference(superposition,[status(thm)],[c_12774,c_49]) ).
tcf(c_12826,plain,
( ~ leaf(sK15(sK16),tptp0)
| ~ occurrence_of(sK15(sK16),tptp2)
| ~ occurrence_of(sK13(sK16),tptp3)
| ~ next_subocc(sK16,sK13(sK16),tptp0) ),
inference(superposition,[status(thm)],[c_12774,c_6069]) ).
tcf(c_12827,plain,
( ~ leaf(sK15(sK16),tptp0)
| ~ occurrence_of(sK15(sK16),tptp1)
| ~ occurrence_of(sK13(sK16),tptp3)
| ~ next_subocc(sK16,sK13(sK16),tptp0) ),
inference(superposition,[status(thm)],[c_12774,c_6068]) ).
tcf(c_12832,plain,
( ~ leaf(sK15(sK16),tptp0)
| ~ occurrence_of(sK15(sK16),tptp1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12827,c_9545,c_9764]) ).
tcf(c_12835,plain,
( ~ leaf(sK15(sK16),tptp0)
| ~ occurrence_of(sK15(sK16),tptp2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12826,c_9545,c_9764]) ).
tcf(c_12904,plain,
~ leaf(sK15(sK16),tptp0),
inference(global_subsumption_just,[status(thm)],[c_12832,c_10600,c_12835,c_12832]) ).
tcf(c_23830,plain,
min_precedes(sK15(sK16),sK2(sK15(sK16),tptp0),tptp0),
inference(global_subsumption_just,[status(thm)],[c_11110,c_11110,c_12904]) ).
tcf(c_23843,plain,
earlier(sK15(sK16),sK2(sK15(sK16),tptp0)),
inference(superposition,[status(thm)],[c_23830,c_1057]) ).
tcf(c_23850,plain,
min_precedes(sK13(sK16),sK2(sK15(sK16),tptp0),tptp0),
inference(superposition,[status(thm)],[c_23830,c_12824]) ).
tcf(c_24279,plain,
~ earlier(sK2(sK15(sK16),tptp0),sK15(sK16)),
inference(superposition,[status(thm)],[c_23843,c_63]) ).
tcf(c_25802,plain,
! [X0: $i] :
( leaf_occ(sK16,X0)
| ( sK2(sK15(sK16),tptp0) = sK15(sK16) )
| ( sK2(sK15(sK16),tptp0) = sK14(sK16) )
| ~ arboreal(sK16)
| ~ subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_23850,c_114]) ).
tcf(c_25817,plain,
! [X0: $i] :
( leaf_occ(sK16,X0)
| ( sK2(sK15(sK16),tptp0) = sK15(sK16) )
| ( sK2(sK15(sK16),tptp0) = sK14(sK16) )
| ~ subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_25802,c_6065]) ).
tcf(c_25885,plain,
! [X0: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0)
| ( sK2(sK15(sK16),tptp0) = sK14(sK16) )
| ( sK2(sK15(sK16),tptp0) = sK15(sK16) ) ),
inference(global_subsumption_just,[status(thm)],[c_25817,c_10950,c_25817]) ).
tcf(c_25886,plain,
! [X0: $i] :
( ( sK2(sK15(sK16),tptp0) = sK15(sK16) )
| ( sK2(sK15(sK16),tptp0) = sK14(sK16) )
| ~ subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(renaming,[status(thm)],[c_25885]) ).
tcf(c_25898,plain,
( ( sK2(sK15(sK16),tptp0) = sK15(sK16) )
| ( sK2(sK15(sK16),tptp0) = sK14(sK16) )
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_6066,c_25886]) ).
tcf(c_25901,plain,
( ( sK2(sK15(sK16),tptp0) = sK15(sK16) )
| ( sK2(sK15(sK16),tptp0) = sK14(sK16) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_25898,c_6067]) ).
tcf(c_25926,plain,
( ( sK2(sK15(sK16),tptp0) = sK14(sK16) )
| ~ earlier(sK15(sK16),sK15(sK16)) ),
inference(superposition,[status(thm)],[c_25901,c_24279]) ).
tcf(c_25929,plain,
( earlier(sK15(sK16),sK15(sK16))
| ( sK2(sK15(sK16),tptp0) = sK14(sK16) ) ),
inference(superposition,[status(thm)],[c_25901,c_23843]) ).
tcf(c_25942,plain,
sK2(sK15(sK16),tptp0) = sK14(sK16),
inference(backward_subsumption_resolution,[status(thm)],[c_25929,c_25926]) ).
tcf(c_25955,plain,
earlier(sK15(sK16),sK14(sK16)),
inference(demodulation,[status(thm)],[c_23843,c_25942]) ).
tcf(c_25962,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_25955,c_12169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO017+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.39 % Computer : n017.cluster.edu
% 0.10/5.39 % Model : x86_64 x86_64
% 0.10/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.39 % Memory : 8046.5625MB
% 0.10/5.39 % OS : Linux 6.8.0-71-generic
% 0.10/5.39 % CPULimit : 300
% 0.10/5.39 % WCLimit : 300
% 0.10/5.39 % DateTime : Thu Sep 24 06:28:38 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/5.44
% 0.15/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44
% 0.15/5.44 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 10.52/7.32 % SZS status Started for theBenchmark.p
% 10.52/7.32 % SZS status Theorem for theBenchmark.p
% 10.52/7.32
% 10.52/7.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.52/7.32
% 10.52/7.32 % ------ iProver source info
% 10.52/7.32
% 10.52/7.32 % git: date: 2026-07-19 20:42:38 +0200
% 10.52/7.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.52/7.32 % git: non_committed_changes: false
% 10.52/7.32
% 10.52/7.32 % ------ Parsing...
% 10.52/7.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 10.52/7.32
% 10.52/7.32 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 10.52/7.32
% 10.52/7.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 10.52/7.32
% 10.52/7.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.52/7.32 % ------ Proving...
% 10.52/7.32 % ------ Problem Properties
% 10.52/7.32
% 10.52/7.32 %
% 10.52/7.32 % clauses 83
% 10.52/7.32 % conjectures 6
% 10.52/7.32 % EPR 49
% 10.52/7.32 % Horn 63
% 10.52/7.32 % unary 16
% 10.52/7.32 % binary 32
% 10.52/7.32 % lits 217
% 10.52/7.32 % lits eq 12
% 10.52/7.32 % fd_pure 0
% 10.52/7.32 % fd_pseudo 0
% 10.52/7.32 % fd_cond 0
% 10.52/7.32 % fd_pseudo_cond 5
% 10.52/7.32 % AC symbols 0
% 10.52/7.32
% 10.52/7.32 % ------ Schedule dynamic 5 is on
% 10.52/7.32
% 10.52/7.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.52/7.32
% 10.52/7.32
% 10.52/7.32 % ------
% 10.52/7.32 % Current options:
% 10.52/7.32 % ------
% 10.52/7.32
% 10.52/7.32
% 10.52/7.32 %
% 10.52/7.32
% 10.52/7.32 % ------ Proving...
% 10.52/7.32 %
% 10.52/7.32
% 10.52/7.32 % SZS status Theorem for theBenchmark.p
% 10.52/7.32
% 10.52/7.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.52/7.32
% 10.52/7.32
%------------------------------------------------------------------------------