%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PRO009+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n013.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:35 PM UTC 2026
% Result : Theorem 3.51s 1.19s
% Output : CNFRefutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 9
% Syntax : Number of formulae : 102 ( 9 unt; 0 def)
% Number of atoms : 349 ( 28 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 422 ( 175 ~; 171 |; 65 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 186 ( 0 sgn 168 !; 18 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(f5,axiom,
! [X0,X1] :
( earlier(X0,X1)
=> ~ earlier(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).
fof(f11,axiom,
! [X0,X1] :
( precedes(X0,X1)
<=> ( legal(X1)
& earlier(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_10) ).
fof(f16,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> precedes(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_15) ).
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/sandbox/benchmark/theBenchmark.p',sos_22) ).
fof(f34,axiom,
! [X0,X1] :
( root_occ(X0,X1)
<=> ? [X2] :
( root(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_33) ).
fof(f42,axiom,
! [X0,X1,X2,X3] :
( ( X1 != X2
& root_occ(X2,X0)
& leaf_occ(X1,X0)
& occurrence_of(X0,X3) )
=> min_precedes(X2,X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_41) ).
fof(f50,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_49) ).
fof(f63,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& min_precedes(X1,X2,tptp0)
& ( occurrence_of(X2,tptp1)
| occurrence_of(X2,tptp2) )
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f64,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( leaf_occ(X2,X0)
& min_precedes(X1,X2,tptp0)
& ( occurrence_of(X2,tptp1)
| occurrence_of(X2,tptp2) )
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f65,plain,
? [X0] :
( occurrence_of(X0,tptp0)
& ! [X1,X2] :
( ~ leaf_occ(X2,X0)
| ~ min_precedes(X1,X2,tptp0)
| ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ root_occ(X1,X0)
| ~ occurrence_of(X1,tptp3) ) ),
inference(ennf_transformation,[],[f64]) ).
fof(f66,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(ennf_transformation,[],[f50]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f3]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f67]) ).
fof(f78,plain,
! [X0,X1,X2,X3] :
( X1 = X2
| ~ root_occ(X2,X0)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X3)
| min_precedes(X2,X1,X3) ),
inference(ennf_transformation,[],[f42]) ).
fof(f79,plain,
! [X0,X1,X2,X3] :
( X1 = X2
| ~ root_occ(X2,X0)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X3)
| min_precedes(X2,X1,X3) ),
inference(flattening,[],[f78]) ).
fof(f103,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(f129,plain,
! [X0,X1] :
( ~ earlier(X0,X1)
| ~ earlier(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f134,plain,
! [X0,X1,X2] :
( ~ min_precedes(X0,X1,X2)
| precedes(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f135,plain,
( occurrence_of(sK0,tptp0)
& ! [X1,X2] :
( ~ leaf_occ(X2,sK0)
| ~ min_precedes(X1,X2,tptp0)
| ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ root_occ(X1,sK0)
| ~ occurrence_of(X1,tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f65]) ).
fof(f136,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ( leaf_occ(sK3(X0),X0)
& next_subocc(sK2(X0),sK3(X0),tptp0)
& ( occurrence_of(sK3(X0),tptp1)
| occurrence_of(sK3(X0),tptp2) )
& next_subocc(sK1(X0),sK2(X0),tptp0)
& occurrence_of(sK2(X0),tptp4)
& root_occ(sK1(X0),X0)
& occurrence_of(sK1(X0),tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X1,sK1(X0)),skolemize(X2,sK2(X0)),skolemize(X3,sK3(X0))],[f66]) ).
fof(f138,plain,
! [X0,X1] :
( ( ~ root_occ(X0,X1)
| ? [X2] :
( root(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) ) )
& ( ! [X2] :
( ~ root(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) )
| root_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f139,plain,
! [X0,X1] :
( ( ~ root_occ(X0,X1)
| ? [X3] :
( root(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) ) )
& ( ! [X2] :
( ~ root(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) )
| root_occ(X0,X1) ) ),
inference(rectify,[],[f138]) ).
fof(f140,plain,
! [X0,X1] :
( ( ~ root_occ(X0,X1)
| ( root(X0,sK5(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK5(X0,X1)) ) )
& ( ! [X2] :
( ~ root(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) )
| root_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1))],[f139]) ).
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(nnf_transformation,[],[f103]) ).
fof(f145,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,[],[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) ) )
& ( ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2)
| next_subocc(X0,X1,X2) ) ),
inference(rectify,[],[f145]) ).
fof(f147,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(sK9(X0,X1,X2),X1,X2)
& min_precedes(X0,sK9(X0,X1,X2),X2) )
| ~ min_precedes(X0,X1,X2)
| next_subocc(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1,X2))],[f146]) ).
fof(f156,plain,
! [X0,X1] :
( ( ~ precedes(X0,X1)
| ( legal(X1)
& earlier(X0,X1) ) )
& ( ~ legal(X1)
| ~ earlier(X0,X1)
| precedes(X0,X1) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f157,plain,
! [X0,X1] :
( ( ~ precedes(X0,X1)
| ( legal(X1)
& earlier(X0,X1) ) )
& ( ~ legal(X1)
| ~ earlier(X0,X1)
| precedes(X0,X1) ) ),
inference(flattening,[],[f156]) ).
fof(f158,plain,
occurrence_of(sK0,tptp0),
inference(cnf_transformation,[],[f135]) ).
fof(f159,plain,
! [X2,X1] :
( ~ leaf_occ(X2,sK0)
| ~ min_precedes(X1,X2,tptp0)
| ~ occurrence_of(X2,tptp1)
| ~ root_occ(X1,sK0)
| ~ occurrence_of(X1,tptp3) ),
inference(cnf_transformation,[],[f135]) ).
fof(f160,plain,
! [X2,X1] :
( ~ leaf_occ(X2,sK0)
| ~ min_precedes(X1,X2,tptp0)
| ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,sK0)
| ~ occurrence_of(X1,tptp3) ),
inference(cnf_transformation,[],[f135]) ).
fof(f163,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK3(X0),X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f164,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| next_subocc(sK2(X0),sK3(X0),tptp0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f165,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sK3(X0),tptp1)
| occurrence_of(sK3(X0),tptp2) ),
inference(cnf_transformation,[],[f136]) ).
fof(f166,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| next_subocc(sK1(X0),sK2(X0),tptp0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f168,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| root_occ(sK1(X0),X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f169,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sK1(X0),tptp3) ),
inference(cnf_transformation,[],[f136]) ).
fof(f170,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f68]) ).
fof(f187,plain,
! [X2,X3,X0,X1] :
( X1 = X2
| ~ root_occ(X2,X0)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X3)
| min_precedes(X2,X1,X3) ),
inference(cnf_transformation,[],[f79]) ).
fof(f190,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| root(X0,sK5(X0,X1)) ),
inference(cnf_transformation,[],[f140]) ).
fof(f192,plain,
! [X0,X1] :
( ~ root_occ(X0,X1)
| occurrence_of(X1,sK5(X0,X1)) ),
inference(cnf_transformation,[],[f140]) ).
fof(f193,plain,
! [X2,X0,X1] :
( ~ root(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2)
| root_occ(X0,X1) ),
inference(cnf_transformation,[],[f140]) ).
fof(f213,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f147]) ).
fof(f243,plain,
! [X0,X1] :
( ~ precedes(X0,X1)
| earlier(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
fof(f248,plain,
! [X0,X1] :
( ~ earlier(X0,X1)
| ~ earlier(X1,X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f251,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| precedes(X0,X1) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_49,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ leaf_occ(X1,sK0)
| ~ root_occ(X0,sK0)
| ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X0,tptp3)
| ~ min_precedes(X0,X1,tptp0) ),
inference(cnf_transformation,[],[f160]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ leaf_occ(X1,sK0)
| ~ root_occ(X0,sK0)
| ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X0,tptp3)
| ~ min_precedes(X0,X1,tptp0) ),
inference(cnf_transformation,[],[f159]) ).
tcf(c_51,negated_conjecture,
occurrence_of(sK0,tptp0),
inference(cnf_transformation,[],[f158]) ).
tcf(c_54,plain,
! [X0: $i] :
( occurrence_of(sK1(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_55,plain,
! [X0: $i] :
( root_occ(sK1(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f168]) ).
tcf(c_57,plain,
! [X0: $i] :
( next_subocc(sK1(X0),sK2(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f166]) ).
tcf(c_58,plain,
! [X0: $i] :
( occurrence_of(sK3(X0),tptp1)
| occurrence_of(sK3(X0),tptp2)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f165]) ).
tcf(c_59,plain,
! [X0: $i] :
( next_subocc(sK2(X0),sK3(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f164]) ).
tcf(c_60,plain,
! [X0: $i] :
( leaf_occ(sK3(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f163]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( min_precedes(X2,X3,X1)
| ( X2 = X3 )
| ~ leaf_occ(X3,X0)
| ~ root_occ(X2,X0)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f187]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i,X2: $i] :
( root_occ(X2,X0)
| ~ root(X2,X1)
| ~ subactivity_occurrence(X2,X0)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] :
( occurrence_of(X1,sK5(X0,X1))
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f192]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i] :
( root(X0,sK5(X0,X1))
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f190]) ).
tcf(c_105,plain,
! [X0: $i,X1: $i,X2: $i] :
( min_precedes(X0,X1,X2)
| ~ next_subocc(X0,X1,X2) ),
inference(cnf_transformation,[],[f213]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i] :
( earlier(X0,X1)
| ~ precedes(X0,X1) ),
inference(cnf_transformation,[],[f243]) ).
tcf(c_139,plain,
! [X0: $i,X1: $i] :
( ~ earlier(X1,X0)
| ~ earlier(X0,X1) ),
inference(cnf_transformation,[],[f248]) ).
tcf(c_142,plain,
! [X0: $i,X1: $i,X2: $i] :
( precedes(X0,X1)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f251]) ).
tcf(c_4632,plain,
! [X0: $i] :
( min_precedes(sK1(X0),sK2(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_57,c_105]) ).
tcf(c_4764,plain,
! [X0: $i] :
( precedes(sK1(X0),sK2(X0))
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_4632,c_142]) ).
tcf(c_4789,plain,
! [X0: $i] :
( min_precedes(sK2(X0),sK3(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_59,c_105]) ).
tcf(c_4878,plain,
! [X0: $i] :
( earlier(sK1(X0),sK2(X0))
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_4764,c_134]) ).
tcf(c_4916,plain,
! [X0: $i] :
( precedes(sK2(X0),sK3(X0))
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_4789,c_142]) ).
tcf(c_5068,plain,
! [X0: $i] :
( earlier(sK2(X0),sK3(X0))
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_4916,c_134]) ).
tcf(c_5092,plain,
! [X0: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ earlier(sK3(X0),sK2(X0)) ),
inference(superposition,[status(thm)],[c_5068,c_139]) ).
tcf(c_5108,plain,
! [X0: $i] :
( ( X0 = tptp0 )
| ~ occurrence_of(sK0,X0) ),
inference(superposition,[status(thm)],[c_51,c_61]) ).
tcf(c_5228,plain,
( occurrence_of(sK1(sK0),tptp3)
| ~ occurrence_of(sK0,tptp0) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_5230,plain,
( root_occ(sK1(sK0),sK0)
| ~ occurrence_of(sK0,tptp0) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_5286,plain,
! [X0: $i] :
( ( sK5(X0,sK0) = tptp0 )
| ~ root_occ(X0,sK0) ),
inference(superposition,[status(thm)],[c_82,c_5108]) ).
tcf(c_5325,plain,
( ( sK5(sK1(sK0),sK0) = tptp0 )
| ~ occurrence_of(sK0,tptp0) ),
inference(superposition,[status(thm)],[c_55,c_5286]) ).
tcf(c_5326,plain,
sK5(sK1(sK0),sK0) = tptp0,
inference(forward_subsumption_resolution,[status(thm)],[c_5325,c_51]) ).
tcf(c_5327,plain,
( root(sK1(sK0),tptp0)
| ~ root_occ(sK1(sK0),sK0) ),
inference(superposition,[status(thm)],[c_5326,c_84]) ).
tcf(c_5344,plain,
root(sK1(sK0),tptp0),
inference(global_subsumption_just,[status(thm)],[c_5327,c_51,c_5230,c_5327]) ).
tcf(c_5866,plain,
! [X0: $i] :
( root_occ(X0,sK0)
| ~ root(X0,tptp0)
| ~ subactivity_occurrence(X0,sK0) ),
inference(superposition,[status(thm)],[c_51,c_81]) ).
tcf(c_6002,plain,
( root_occ(sK1(sK0),sK0)
| ~ subactivity_occurrence(sK1(sK0),sK0) ),
inference(superposition,[status(thm)],[c_5344,c_5866]) ).
tcf(c_6043,plain,
root_occ(sK1(sK0),sK0),
inference(global_subsumption_just,[status(thm)],[c_6002,c_51,c_5230]) ).
tcf(c_6821,plain,
! [X0: $i,X1: $i] :
( min_precedes(X0,X1,tptp0)
| ( X0 = X1 )
| ~ leaf_occ(X1,sK0)
| ~ root_occ(X0,sK0) ),
inference(superposition,[status(thm)],[c_51,c_78]) ).
tcf(c_7158,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ leaf_occ(X1,sK0)
| ~ root_occ(X0,sK0)
| ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X0,tptp3) ),
inference(superposition,[status(thm)],[c_6821,c_50]) ).
tcf(c_7159,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ leaf_occ(X1,sK0)
| ~ root_occ(X0,sK0)
| ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X0,tptp3) ),
inference(superposition,[status(thm)],[c_6821,c_49]) ).
tcf(c_7601,plain,
! [X0: $i] :
( ( sK1(sK0) = X0 )
| ~ leaf_occ(X0,sK0)
| ~ occurrence_of(X0,tptp1)
| ~ occurrence_of(sK1(sK0),tptp3) ),
inference(superposition,[status(thm)],[c_6043,c_7158]) ).
tcf(c_7629,plain,
! [X0: $i] :
( ( sK1(sK0) = X0 )
| ~ leaf_occ(X0,sK0)
| ~ occurrence_of(X0,tptp2)
| ~ occurrence_of(sK1(sK0),tptp3) ),
inference(superposition,[status(thm)],[c_6043,c_7159]) ).
tcf(c_9210,plain,
! [X0: $i] :
( ( sK1(sK0) = X0 )
| ~ leaf_occ(X0,sK0)
| ~ occurrence_of(X0,tptp1) ),
inference(global_subsumption_just,[status(thm)],[c_7601,c_51,c_5228,c_7601]) ).
tcf(c_9219,plain,
( ( sK1(sK0) = sK3(sK0) )
| ~ occurrence_of(sK0,tptp0)
| ~ occurrence_of(sK3(sK0),tptp1) ),
inference(superposition,[status(thm)],[c_60,c_9210]) ).
tcf(c_9220,plain,
( ( sK1(sK0) = sK3(sK0) )
| ~ occurrence_of(sK3(sK0),tptp1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_9219,c_51]) ).
tcf(c_9228,plain,
( occurrence_of(sK3(sK0),tptp2)
| ( sK1(sK0) = sK3(sK0) )
| ~ occurrence_of(sK0,tptp0) ),
inference(superposition,[status(thm)],[c_58,c_9220]) ).
tcf(c_9229,plain,
( occurrence_of(sK3(sK0),tptp2)
| ( sK1(sK0) = sK3(sK0) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_9228,c_51]) ).
tcf(c_9789,plain,
! [X0: $i] :
( ( sK1(sK0) = X0 )
| ~ leaf_occ(X0,sK0)
| ~ occurrence_of(X0,tptp2) ),
inference(global_subsumption_just,[status(thm)],[c_7629,c_51,c_5228,c_7629]) ).
tcf(c_9798,plain,
( ( sK1(sK0) = sK3(sK0) )
| ~ occurrence_of(sK0,tptp0)
| ~ occurrence_of(sK3(sK0),tptp2) ),
inference(superposition,[status(thm)],[c_60,c_9789]) ).
tcf(c_9799,plain,
( ( sK1(sK0) = sK3(sK0) )
| ~ occurrence_of(sK3(sK0),tptp2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_9798,c_51]) ).
tcf(c_9803,plain,
sK1(sK0) = sK3(sK0),
inference(global_subsumption_just,[status(thm)],[c_9799,c_9229,c_9799]) ).
tcf(c_9841,plain,
( earlier(sK3(sK0),sK2(sK0))
| ~ occurrence_of(sK0,tptp0) ),
inference(superposition,[status(thm)],[c_9803,c_4878]) ).
tcf(c_9850,plain,
earlier(sK3(sK0),sK2(sK0)),
inference(forward_subsumption_resolution,[status(thm)],[c_9841,c_51]) ).
tcf(c_9870,plain,
~ occurrence_of(sK0,tptp0),
inference(superposition,[status(thm)],[c_9850,c_5092]) ).
tcf(c_9871,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9870,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO009+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n013.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Thu Sep 24 06:27:22 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.43 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 3.51/1.19 % SZS status Started for theBenchmark.p
% 3.51/1.19 % SZS status Theorem for theBenchmark.p
% 3.51/1.19
% 3.51/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.51/1.19
% 3.51/1.19 % ------ iProver source info
% 3.51/1.19
% 3.51/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.51/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.51/1.19 % git: non_committed_changes: false
% 3.51/1.19
% 3.51/1.19 % ------ Parsing...
% 3.51/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.51/1.19
% 3.51/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.51/1.19
% 3.51/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.51/1.19
% 3.51/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.51/1.19 % ------ Proving...
% 3.51/1.19 % ------ Problem Properties
% 3.51/1.19
% 3.51/1.19 %
% 3.51/1.19 % clauses 94
% 3.51/1.19 % conjectures 3
% 3.51/1.19 % EPR 61
% 3.51/1.19 % Horn 77
% 3.51/1.19 % unary 13
% 3.51/1.19 % binary 42
% 3.51/1.19 % lits 258
% 3.51/1.19 % lits eq 18
% 3.51/1.19 % fd_pure 0
% 3.51/1.19 % fd_pseudo 0
% 3.51/1.19 % fd_cond 0
% 3.51/1.19 % fd_pseudo_cond 12
% 3.51/1.19 % AC symbols 0
% 3.51/1.19
% 3.51/1.19 % ------ Schedule dynamic 5 is on
% 3.51/1.19
% 3.51/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.51/1.19
% 3.51/1.19
% 3.51/1.19 % ------
% 3.51/1.19 % Current options:
% 3.51/1.19 % ------
% 3.51/1.19
% 3.51/1.19
% 3.51/1.19 %
% 3.51/1.19
% 3.51/1.19 % ------ Proving...
% 3.51/1.19 %
% 3.51/1.19
% 3.51/1.19 % SZS status Theorem for theBenchmark.p
% 3.51/1.19
% 3.51/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.51/1.19
%------------------------------------------------------------------------------