%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PRO017+3 : 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 : n014.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 33.13s 11.74s
% Output : CNFRefutation 33.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 116 ( 28 unt; 0 def)
% Number of atoms : 458 ( 50 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 592 ( 250 ~; 250 |; 80 &)
% ( 4 <=>; 8 =>; 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 : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 201 ( 0 sgn 177 !; 24 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f8,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(f23,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_22) ).
fof(f26,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3] :
( subactivity_occurrence(X2,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_25) ).
fof(f38,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_37) ).
fof(f50,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_49) ).
fof(f56,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_55) ).
fof(f57,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_56) ).
fof(f60,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_59) ).
fof(f61,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_60) ).
fof(f63,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(f64,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)],[f63]) ).
fof(f67,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,[],[f64]) ).
fof(f68,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,[],[f67]) ).
fof(f69,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,[],[f50]) ).
fof(f70,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,[],[f69]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ~ min_precedes(X1,X2,X0)
| ? [X3] :
( subactivity_occurrence(X2,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X0) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f74,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f3]) ).
fof(f75,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f74]) ).
fof(f84,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ( arboreal(X0)
<=> atomic(X1) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f92,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,[],[f23]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ! [X3] : ~ min_precedes(X1,X3,X2) ),
inference(ennf_transformation,[],[f38]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ! [X3] : ~ min_precedes(X1,X3,X2) ),
inference(flattening,[],[f101]) ).
fof(f131,plain,
( ~ leaf_occ(sK0,sK1)
& arboreal(sK0)
& subactivity_occurrence(sK0,sK1)
& occurrence_of(sK1,tptp0)
& ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(sK0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f68]) ).
fof(f132,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ( ! [X5] :
( ~ min_precedes(sK2(X0),X5,tptp0)
| sK4(X0) = X5
| sK3(X0) = X5 )
& min_precedes(sK3(X0),sK4(X0),tptp0)
& ( occurrence_of(sK4(X0),tptp1)
| occurrence_of(sK4(X0),tptp2) )
& min_precedes(sK2(X0),sK3(X0),tptp0)
& occurrence_of(sK3(X0),tptp4)
& next_subocc(X0,sK2(X0),tptp0)
& occurrence_of(sK2(X0),tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X2,sK2(X0)),skolemize(X3,sK3(X0)),skolemize(X4,sK4(X0))],[f70]) ).
fof(f133,plain,
! [X0,X1,X2] :
( ~ min_precedes(X1,X2,X0)
| ( subactivity_occurrence(X2,sK5(X0,X1,X2))
& subactivity_occurrence(X1,sK5(X0,X1,X2))
& occurrence_of(sK5(X0,X1,X2),X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1,X2))],[f73]) ).
fof(f134,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ( ( ~ arboreal(X0)
| atomic(X1) )
& ( ~ atomic(X1)
| arboreal(X0) ) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f143,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,[],[f92]) ).
fof(f144,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,[],[f143]) ).
fof(f145,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,[],[f144]) ).
fof(f146,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(sK10(X0,X1,X2),X1,X2)
& min_precedes(X0,sK10(X0,X1,X2),X2) )
| ~ min_precedes(X0,X1,X2)
| next_subocc(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X3,sK10(X0,X1,X2))],[f145]) ).
fof(f157,plain,
~ leaf_occ(sK0,sK1),
inference(cnf_transformation,[],[f131]) ).
fof(f158,plain,
arboreal(sK0),
inference(cnf_transformation,[],[f131]) ).
fof(f159,plain,
subactivity_occurrence(sK0,sK1),
inference(cnf_transformation,[],[f131]) ).
fof(f160,plain,
occurrence_of(sK1,tptp0),
inference(cnf_transformation,[],[f131]) ).
fof(f161,plain,
! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp1)
| ~ next_subocc(sK0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f131]) ).
fof(f165,plain,
! [X0,X1,X5] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ min_precedes(sK2(X0),X5,tptp0)
| sK4(X0) = X5
| sK3(X0) = X5 ),
inference(cnf_transformation,[],[f132]) ).
fof(f167,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK4(X0),tptp1)
| occurrence_of(sK4(X0),tptp2) ),
inference(cnf_transformation,[],[f132]) ).
fof(f168,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK2(X0),sK3(X0),tptp0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f169,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK3(X0),tptp4) ),
inference(cnf_transformation,[],[f132]) ).
fof(f170,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK2(X0),tptp0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f171,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK2(X0),tptp3) ),
inference(cnf_transformation,[],[f132]) ).
fof(f174,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| subactivity_occurrence(X1,sK5(X0,X1,X2)) ),
inference(cnf_transformation,[],[f133]) ).
fof(f175,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| occurrence_of(sK5(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f176,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f75]) ).
fof(f177,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f61]) ).
fof(f178,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f60]) ).
fof(f179,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f57]) ).
fof(f180,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f56]) ).
fof(f193,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f207,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f146]) ).
fof(f214,plain,
! [X2,X3,X0,X1] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ~ min_precedes(X1,X3,X2) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ leaf(X1,tptp0)
| ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X0,tptp3)
| ~ next_subocc(sK0,X0,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(cnf_transformation,[],[f161]) ).
tcf(c_51,negated_conjecture,
occurrence_of(sK1,tptp0),
inference(cnf_transformation,[],[f160]) ).
tcf(c_52,negated_conjecture,
subactivity_occurrence(sK0,sK1),
inference(cnf_transformation,[],[f159]) ).
tcf(c_53,negated_conjecture,
arboreal(sK0),
inference(cnf_transformation,[],[f158]) ).
tcf(c_54,negated_conjecture,
~ leaf_occ(sK0,sK1),
inference(cnf_transformation,[],[f157]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| occurrence_of(sK2(X0),tptp3)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f171]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| next_subocc(X0,sK2(X0),tptp0)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| occurrence_of(sK3(X0),tptp4)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| min_precedes(sK2(X0),sK3(X0),tptp0)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| occurrence_of(sK4(X0),tptp1)
| occurrence_of(sK4(X0),tptp2)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] :
( leaf_occ(X0,X2)
| ( sK4(X0) = X1 )
| ( sK3(X0) = X1 )
| ~ arboreal(X0)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X0,X2)
| ~ min_precedes(sK2(X0),X1,tptp0) ),
inference(cnf_transformation,[],[f165]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] :
( occurrence_of(sK5(X2,X0,X1),X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f175]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( subactivity_occurrence(X0,sK5(X2,X0,X1))
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f174]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f176]) ).
tcf(c_69,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f177]) ).
tcf(c_70,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f178]) ).
tcf(c_71,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f179]) ).
tcf(c_72,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f180]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i] :
( arboreal(X0)
| ~ atomic(X1)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i,X2: $i] :
( min_precedes(X0,X1,X2)
| ~ next_subocc(X0,X1,X2) ),
inference(cnf_transformation,[],[f207]) ).
tcf(c_106,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,[],[f214]) ).
tcf(c_3716,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_3719,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( occurrence_of(X0,X2)
| ~ occurrence_of(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_5079,plain,
( occurrence_of(sK2(sK0),tptp3)
| ~ arboreal(sK0)
| ~ subactivity_occurrence(sK0,sK1)
| ~ occurrence_of(sK1,tptp0) ),
inference(superposition,[status(thm)],[c_57,c_54]) ).
tcf(c_5082,plain,
occurrence_of(sK2(sK0),tptp3),
inference(forward_subsumption_resolution,[status(thm)],[c_5079,c_53,c_52,c_51]) ).
tcf(c_5146,plain,
( arboreal(sK2(sK0))
| ~ atomic(tptp3) ),
inference(superposition,[status(thm)],[c_5082,c_84]) ).
tcf(c_5147,plain,
arboreal(sK2(sK0)),
inference(forward_subsumption_resolution,[status(thm)],[c_5146,c_72]) ).
tcf(c_5302,plain,
( next_subocc(sK0,sK2(sK0),tptp0)
| ~ arboreal(sK0)
| ~ subactivity_occurrence(sK0,sK1)
| ~ occurrence_of(sK1,tptp0) ),
inference(superposition,[status(thm)],[c_58,c_54]) ).
tcf(c_5307,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| min_precedes(X0,sK2(X0),tptp0)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(superposition,[status(thm)],[c_58,c_100]) ).
tcf(c_5310,plain,
next_subocc(sK0,sK2(sK0),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_5302,c_53,c_52,c_51]) ).
tcf(c_5385,plain,
! [X0: $i] :
( ~ leaf(X0,tptp0)
| ~ occurrence_of(X0,tptp1)
| ~ occurrence_of(sK2(sK0),tptp3)
| ~ min_precedes(sK2(sK0),X0,tptp0) ),
inference(superposition,[status(thm)],[c_5310,c_50]) ).
tcf(c_5394,plain,
! [X0: $i] :
( ~ leaf(X0,tptp0)
| ~ occurrence_of(X0,tptp1)
| ~ min_precedes(sK2(sK0),X0,tptp0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5385,c_5082]) ).
tcf(c_5442,plain,
! [X0: $i] :
( leaf_occ(sK2(sK0),X0)
| ~ arboreal(sK2(sK0))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2(sK0),X0)
| ~ leaf(sK2(sK2(sK0)),tptp0)
| ~ occurrence_of(sK2(sK2(sK0)),tptp1) ),
inference(superposition,[status(thm)],[c_5307,c_5394]) ).
tcf(c_5470,plain,
! [X0: $i] :
( leaf_occ(sK2(sK0),X0)
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2(sK0),X0)
| ~ leaf(sK2(sK2(sK0)),tptp0)
| ~ occurrence_of(sK2(sK2(sK0)),tptp1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5442,c_5147]) ).
tcf(c_6107,plain,
! [X0: $i] :
( ( tptp3 = tptp1 )
| ~ occurrence_of(X0,tptp1)
| ~ occurrence_of(X0,tptp3) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_6109,plain,
! [X0: $i] :
( ( tptp3 = tptp2 )
| ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(X0,tptp3) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_6111,plain,
! [X0: $i] :
( ( tptp3 = tptp4 )
| ~ occurrence_of(X0,tptp4)
| ~ occurrence_of(X0,tptp3) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_6304,plain,
! [X0: $i] :
( leaf_occ(sK0,X0)
| occurrence_of(sK3(sK0),tptp4)
| ~ arboreal(sK0)
| ~ subactivity_occurrence(sK0,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_6875,plain,
! [X0: $i,X1: $i] :
( leaf_occ(sK0,X1)
| ( sK4(sK0) = X0 )
| ( sK3(sK0) = X0 )
| ~ arboreal(sK0)
| ~ subactivity_occurrence(sK0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ min_precedes(sK2(sK0),X0,tptp0) ),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_8412,plain,
( leaf_occ(sK0,sK1)
| occurrence_of(sK3(sK0),tptp4)
| ~ arboreal(sK0)
| ~ subactivity_occurrence(sK0,sK1)
| ~ occurrence_of(sK1,tptp0) ),
inference(instantiation,[status(thm)],[c_6304]) ).
tcf(c_8854,plain,
( min_precedes(sK2(sK0),sK3(sK0),tptp0)
| ~ arboreal(sK0)
| ~ subactivity_occurrence(sK0,sK1)
| ~ occurrence_of(sK1,tptp0) ),
inference(superposition,[status(thm)],[c_60,c_54]) ).
tcf(c_8875,plain,
min_precedes(sK2(sK0),sK3(sK0),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_8854,c_53,c_52,c_51]) ).
tcf(c_8961,plain,
! [X0: $i] :
( leaf_occ(sK0,sK1)
| ( sK4(sK0) = X0 )
| ( sK3(sK0) = X0 )
| ~ arboreal(sK0)
| ~ subactivity_occurrence(sK0,sK1)
| ~ occurrence_of(sK1,tptp0)
| ~ min_precedes(sK2(sK0),X0,tptp0) ),
inference(instantiation,[status(thm)],[c_6875]) ).
tcf(c_9093,plain,
! [X0: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ leaf_occ(sK2(sK0),X0) ),
inference(superposition,[status(thm)],[c_8875,c_106]) ).
tcf(c_9655,plain,
tptp3 = tptp3,
inference(instantiation,[status(thm)],[c_3716]) ).
tcf(c_10562,plain,
( occurrence_of(sK4(sK0),tptp1)
| occurrence_of(sK4(sK0),tptp2)
| ~ arboreal(sK0)
| ~ subactivity_occurrence(sK0,sK1)
| ~ occurrence_of(sK1,tptp0) ),
inference(superposition,[status(thm)],[c_61,c_54]) ).
tcf(c_10582,plain,
( occurrence_of(sK4(sK0),tptp1)
| occurrence_of(sK4(sK0),tptp2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_10562,c_53,c_52,c_51]) ).
tcf(c_15024,plain,
! [X0: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2(sK0),X0)
| ~ leaf(sK2(sK2(sK0)),tptp0)
| ~ occurrence_of(sK2(sK2(sK0)),tptp1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_5470,c_9093]) ).
tcf(c_15040,plain,
! [X0: $i] :
( min_precedes(sK2(sK0),sK2(sK2(sK0)),tptp0)
| ~ arboreal(sK2(sK0))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2(sK0),X0) ),
inference(superposition,[status(thm)],[c_5307,c_9093]) ).
tcf(c_15042,plain,
! [X0: $i] :
( occurrence_of(sK2(sK2(sK0)),tptp3)
| ~ arboreal(sK2(sK0))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2(sK0),X0) ),
inference(superposition,[status(thm)],[c_57,c_9093]) ).
tcf(c_15047,plain,
! [X0: $i] :
( occurrence_of(sK2(sK2(sK0)),tptp3)
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2(sK0),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_15042,c_5147]) ).
tcf(c_15059,plain,
! [X0: $i] :
( min_precedes(sK2(sK0),sK2(sK2(sK0)),tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2(sK0),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_15040,c_5147]) ).
tcf(c_35015,plain,
! [X0: $i,X1: $i] :
( occurrence_of(X0,X1)
| ~ occurrence_of(sK2(sK2(sK0)),tptp3)
| ( X1 != tptp3 )
| ( X0 != sK2(sK2(sK0)) ) ),
inference(instantiation,[status(thm)],[c_3719]) ).
tcf(c_60357,plain,
( leaf_occ(sK0,sK1)
| ( sK4(sK0) = sK2(sK2(sK0)) )
| ( sK3(sK0) = sK2(sK2(sK0)) )
| ~ arboreal(sK0)
| ~ subactivity_occurrence(sK0,sK1)
| ~ occurrence_of(sK1,tptp0)
| ~ min_precedes(sK2(sK0),sK2(sK2(sK0)),tptp0) ),
inference(instantiation,[status(thm)],[c_8961]) ).
tcf(c_67588,plain,
! [X0: $i] :
( occurrence_of(X0,tptp3)
| ~ occurrence_of(sK2(sK2(sK0)),tptp3)
| ( tptp3 != tptp3 )
| ( X0 != sK2(sK2(sK0)) ) ),
inference(instantiation,[status(thm)],[c_35015]) ).
tcf(c_88842,plain,
( occurrence_of(sK3(sK0),tptp3)
| ~ occurrence_of(sK2(sK2(sK0)),tptp3)
| ( tptp3 != tptp3 )
| ( sK3(sK0) != sK2(sK2(sK0)) ) ),
inference(instantiation,[status(thm)],[c_67588]) ).
tcf(c_95244,plain,
( occurrence_of(sK4(sK0),tptp3)
| ~ occurrence_of(sK2(sK2(sK0)),tptp3)
| ( tptp3 != tptp3 )
| ( sK4(sK0) != sK2(sK2(sK0)) ) ),
inference(instantiation,[status(thm)],[c_67588]) ).
tcf(c_108739,plain,
( ( tptp3 = tptp4 )
| ~ occurrence_of(sK3(sK0),tptp4)
| ~ occurrence_of(sK3(sK0),tptp3) ),
inference(instantiation,[status(thm)],[c_6111]) ).
tcf(c_109906,plain,
( ( tptp3 = tptp2 )
| ~ occurrence_of(sK4(sK0),tptp2)
| ~ occurrence_of(sK4(sK0),tptp3) ),
inference(instantiation,[status(thm)],[c_6109]) ).
tcf(c_109907,plain,
( ( tptp3 = tptp1 )
| ~ occurrence_of(sK4(sK0),tptp1)
| ~ occurrence_of(sK4(sK0),tptp3) ),
inference(instantiation,[status(thm)],[c_6107]) ).
tcf(c_118051,plain,
! [X0: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2(sK0),X0) ),
inference(global_subsumption_just,[status(thm)],[c_15024,c_53,c_52,c_51,c_54,c_71,c_70,c_69,c_8412,c_9655,c_10582,c_15047,c_15059,c_60357,c_88842,c_95244,c_108739,c_109907,c_109906]) ).
tcf(c_118070,plain,
! [X0: $i,X1: $i] :
( ~ min_precedes(sK2(sK0),X1,X0)
| ~ occurrence_of(sK5(X0,sK2(sK0),X1),tptp0) ),
inference(superposition,[status(thm)],[c_66,c_118051]) ).
tcf(c_118124,plain,
! [X0: $i] : ~ min_precedes(sK2(sK0),X0,tptp0),
inference(superposition,[status(thm)],[c_65,c_118070]) ).
tcf(c_118125,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_8875,c_118124]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO017+3 : 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 : n014.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:33:09 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.43 Running first-order theorem proving
% 0.14/5.43 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.14/5.44
% 0.14/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.44
% 0.14/5.44 % Detected problem language: tptp
% 0.14/5.46 % Proving...
% 33.13/11.74 % SZS status Started for theBenchmark.p
% 33.13/11.74 % SZS status Theorem for theBenchmark.p
% 33.13/11.74
% 33.13/11.74 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 33.13/11.74
% 33.13/11.74 % ------ iProver source info
% 33.13/11.74
% 33.13/11.74 % git: date: 2026-07-19 20:42:38 +0200
% 33.13/11.74 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 33.13/11.74 % git: non_committed_changes: false
% 33.13/11.74
% 33.13/11.74 % ------ Parsing...
% 33.13/11.74 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 33.13/11.74
% 33.13/11.74 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 33.13/11.74
% 33.13/11.74 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 33.13/11.74
% 33.13/11.74 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 33.13/11.74 % ------ Proving...
% 33.13/11.74 % ------ Problem Properties
% 33.13/11.74
% 33.13/11.74 %
% 33.13/11.74 % clauses 94
% 33.13/11.74 % conjectures 6
% 33.13/11.74 % EPR 56
% 33.13/11.74 % Horn 67
% 33.13/11.74 % unary 16
% 33.13/11.74 % binary 33
% 33.13/11.74 % lits 275
% 33.13/11.74 % lits eq 19
% 33.13/11.74 % fd_pure 0
% 33.13/11.74 % fd_pseudo 0
% 33.13/11.74 % fd_cond 0
% 33.13/11.74 % fd_pseudo_cond 12
% 33.13/11.74 % AC symbols 0
% 33.13/11.74
% 33.13/11.74 % ------ Schedule dynamic 5 is on
% 33.13/11.74
% 33.13/11.74 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 33.13/11.74
% 33.13/11.74
% 33.13/11.74 % ------
% 33.13/11.74 % Current options:
% 33.13/11.74 % ------
% 33.13/11.74
% 33.13/11.74
% 33.13/11.74 %
% 33.13/11.74
% 33.13/11.74 % ------ Proving...
% 33.13/11.74 %
% 33.13/11.74
% 33.13/11.74 % SZS status Theorem for theBenchmark.p
% 33.13/11.74
% 33.13/11.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 33.13/11.75
% 33.13/11.75
%------------------------------------------------------------------------------