%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PRO018+4 : 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 : n002.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 15.95s 3.26s
% Output : CNFRefutation 15.95s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f103ERROR: Could not build tree for root c_41287ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( occurrence_of(X1,X0)
=> ( activity_occurrence(X1)
& activity(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
fof(f7,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_06) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f10,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_09) ).
fof(f13,axiom,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] :
( occurrence_of(X0,X1)
& activity(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
fof(f17,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_16) ).
fof(f27,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_26) ).
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,tptp2)
| occurrence_of(X4,tptp1) )
& 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(f39,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_38) ).
fof(f40,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_39) ).
fof(f52,plain,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] : occurrence_of(X0,X1) ),
inference(pure_predicate_removal,[],[f13]) ).
fof(f53,plain,
! [X0,X1] :
( occurrence_of(X1,X0)
=> activity_occurrence(X1) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f61,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(ennf_transformation,[],[f53]) ).
fof(f65,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,[],[f7]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f9]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ! [X3] : ~ min_precedes(X1,X3,X2) ),
inference(ennf_transformation,[],[f10]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ! [X3] : ~ min_precedes(X1,X3,X2) ),
inference(flattening,[],[f70]) ).
fof(f75,plain,
! [X0] :
( ~ activity_occurrence(X0)
| ? [X1] : occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f52]) ).
fof(f79,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ( arboreal(X0)
<=> atomic(X1) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f87,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,[],[f27]) ).
fof(f98,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,tptp2)
| occurrence_of(X4,tptp1) )
& min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f99,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,tptp2)
| occurrence_of(X4,tptp1) )
& min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(flattening,[],[f98]) ).
fof(f106,plain,
! [X0,X1,X2] :
( ~ min_precedes(X1,X2,X0)
| ( subactivity_occurrence(X2,sK3(X0,X1,X2))
& subactivity_occurrence(X1,sK3(X0,X1,X2))
& occurrence_of(sK3(X0,X1,X2),X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f65]) ).
fof(f108,plain,
! [X0] :
( ~ activity_occurrence(X0)
| occurrence_of(X0,sK5(X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X1,sK5(X0))],[f75]) ).
fof(f114,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ( ( ~ arboreal(X0)
| atomic(X1) )
& ( ~ atomic(X1)
| arboreal(X0) ) ) ),
inference(nnf_transformation,[],[f79]) ).
fof(f121,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,[],[f87]) ).
fof(f122,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,[],[f121]) ).
fof(f123,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,[],[f122]) ).
fof(f124,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(sK11(X0,X1,X2),X1,X2)
& min_precedes(X0,sK11(X0,X1,X2),X2) )
| ~ min_precedes(X0,X1,X2)
| next_subocc(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X3,sK11(X0,X1,X2))],[f123]) ).
fof(f125,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ( ! [X5] :
( ~ min_precedes(sK12(X0),X5,tptp0)
| sK14(X0) = X5
| sK13(X0) = X5 )
& min_precedes(sK13(X0),sK14(X0),tptp0)
& ( occurrence_of(sK14(X0),tptp2)
| occurrence_of(sK14(X0),tptp1) )
& min_precedes(sK12(X0),sK13(X0),tptp0)
& occurrence_of(sK13(X0),tptp4)
& next_subocc(X0,sK12(X0),tptp0)
& occurrence_of(sK12(X0),tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13,sK14]),skolemize(X2,sK12(X0)),skolemize(X3,sK13(X0)),skolemize(X4,sK14(X0))],[f99]) ).
fof(f129,plain,
( ~ leaf_occ(sK16,sK17)
& arboreal(sK16)
& subactivity_occurrence(sK16,sK17)
& occurrence_of(sK17,tptp0)
& ! [X2,X3] :
( sP0(X2,X3)
| ( occurrence_of(X3,tptp1)
& min_precedes(X2,sK18(X2),tptp0)
& occurrence_of(sK18(X2),tptp2) )
| ~ leaf_occ(X3,sK17)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ next_subocc(sK16,X2,tptp0)
| ~ occurrence_of(X2,tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17,sK18]),skolemize(X0,sK16),skolemize(X1,sK17),skolemize(X4,sK18(X2))],[f103]) ).
fof(f134,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| subactivity_occurrence(X2,sK3(X0,X1,X2)) ),
inference(cnf_transformation,[],[f106]) ).
fof(f139,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| occurrence_of(sK3(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f69]) ).
fof(f143,plain,
! [X2,X3,X0,X1] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ~ min_precedes(X1,X3,X2) ),
inference(cnf_transformation,[],[f71]) ).
fof(f147,plain,
! [X0] :
( ~ activity_occurrence(X0)
| occurrence_of(X0,sK5(X0)) ),
inference(cnf_transformation,[],[f108]) ).
fof(f156,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f173,plain,
! [X2,X0,X1,X4] :
( ~ next_subocc(X0,X1,X2)
| ~ min_precedes(X4,X1,X2)
| ~ min_precedes(X0,X4,X2) ),
inference(cnf_transformation,[],[f124]) ).
fof(f174,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f124]) ).
fof(f182,plain,
! [X0,X1,X5] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| ~ min_precedes(sK12(X0),X5,tptp0)
| sK14(X0) = X5
| sK13(X0) = X5 ),
inference(cnf_transformation,[],[f125]) ).
fof(f183,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,[],[f125]) ).
fof(f185,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK12(X0),sK13(X0),tptp0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f186,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK13(X0),tptp4) ),
inference(cnf_transformation,[],[f125]) ).
fof(f187,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK12(X0),tptp0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f188,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK12(X0),tptp3) ),
inference(cnf_transformation,[],[f125]) ).
fof(f193,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f39]) ).
fof(f194,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f40]) ).
fof(f203,plain,
~ leaf_occ(sK16,sK17),
inference(cnf_transformation,[],[f129]) ).
fof(f204,plain,
arboreal(sK16),
inference(cnf_transformation,[],[f129]) ).
fof(f205,plain,
subactivity_occurrence(sK16,sK17),
inference(cnf_transformation,[],[f129]) ).
fof(f206,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f129]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( activity_occurrence(X0)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( occurrence_of(sK3(X2,X0,X1),X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( subactivity_occurrence(X1,sK3(X2,X0,X1))
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f137]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
tcf(c_62,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,[],[f143]) ).
tcf(c_66,plain,
! [X0: $i] :
( occurrence_of(X0,sK5(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( arboreal(X0)
| ~ atomic(X1)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f156]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i,X2: $i] :
( min_precedes(X0,X1,X2)
| ~ next_subocc(X0,X1,X2) ),
inference(cnf_transformation,[],[f174]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ next_subocc(X0,X3,X2)
| ~ min_precedes(X1,X3,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f173]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| occurrence_of(sK12(X0),tptp3)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f188]) ).
tcf(c_102,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| next_subocc(X0,sK12(X0),tptp0)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f187]) ).
tcf(c_103,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| occurrence_of(sK13(X0),tptp4)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f186]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i] :
( leaf_occ(X0,X1)
| min_precedes(sK12(X0),sK13(X0),tptp0)
| ~ arboreal(X0)
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_106,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,[],[f183]) ).
tcf(c_107,plain,
! [X0: $i,X1: $i,X2: $i] :
( leaf_occ(X0,X2)
| ( sK14(X0) = X1 )
| ( sK13(X0) = X1 )
| ~ arboreal(X0)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X0,X2)
| ~ min_precedes(sK12(X0),X1,tptp0) ),
inference(cnf_transformation,[],[f182]) ).
tcf(c_112,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f193]) ).
tcf(c_113,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f194]) ).
tcf(c_127,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f206]) ).
tcf(c_128,negated_conjecture,
subactivity_occurrence(sK16,sK17),
inference(cnf_transformation,[],[f205]) ).
tcf(c_129,negated_conjecture,
arboreal(sK16),
inference(cnf_transformation,[],[f204]) ).
tcf(c_130,negated_conjecture,
~ leaf_occ(sK16,sK17),
inference(cnf_transformation,[],[f203]) ).
tcf(c_6092,negated_conjecture,
~ leaf_occ(sK16,sK17),
inference(demodulation,[status(thm)],[c_130]) ).
tcf(c_6093,negated_conjecture,
arboreal(sK16),
inference(demodulation,[status(thm)],[c_129]) ).
tcf(c_6094,negated_conjecture,
subactivity_occurrence(sK16,sK17),
inference(demodulation,[status(thm)],[c_128]) ).
tcf(c_6095,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(demodulation,[status(thm)],[c_127]) ).
tcf(c_7713,plain,
! [X0: $i,X1: $i] :
( ( sK5(X0) = X1 )
| ~ activity_occurrence(X0)
| ~ occurrence_of(X0,X1) ),
inference(superposition,[status(thm)],[c_66,c_61]) ).
tcf(c_9506,plain,
! [X0: $i,X1: $i] :
( ( sK5(X0) = X1 )
| ~ occurrence_of(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_7713,c_53,c_7713]) ).
tcf(c_9513,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( sK5(sK3(X2,X0,X1)) = X2 )
| ~ min_precedes(X0,X1,X2) ),
inference(superposition,[status(thm)],[c_56,c_9506]) ).
tcf(c_9835,plain,
! [X0: $i,X1: $i,X2: $i] :
( occurrence_of(sK12(X2),tptp3)
| leaf_occ(X2,sK3(X0,X1,X2))
| ~ arboreal(X2)
| ~ min_precedes(X1,X2,X0)
| ~ occurrence_of(sK3(X0,X1,X2),tptp0) ),
inference(superposition,[status(thm)],[c_58,c_101]) ).
tcf(c_9836,plain,
( leaf_occ(sK16,sK17)
| occurrence_of(sK12(sK16),tptp3)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_6094,c_101]) ).
tcf(c_9838,plain,
occurrence_of(sK12(sK16),tptp3),
inference(forward_subsumption_resolution,[status(thm)],[c_9836,c_6092,c_6093,c_6095]) ).
tcf(c_9874,plain,
( arboreal(sK12(sK16))
| ~ atomic(tptp3) ),
inference(superposition,[status(thm)],[c_9838,c_74]) ).
tcf(c_9876,plain,
arboreal(sK12(sK16)),
inference(forward_subsumption_resolution,[status(thm)],[c_9874,c_112]) ).
tcf(c_10297,plain,
( leaf_occ(sK16,sK17)
| occurrence_of(sK13(sK16),tptp4)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_6094,c_103]) ).
tcf(c_10299,plain,
occurrence_of(sK13(sK16),tptp4),
inference(forward_subsumption_resolution,[status(thm)],[c_10297,c_6092,c_6093,c_6095]) ).
tcf(c_10364,plain,
! [X0: $i,X1: $i,X2: $i] :
( next_subocc(X2,sK12(X2),tptp0)
| leaf_occ(X2,sK3(X0,X1,X2))
| ~ arboreal(X2)
| ~ min_precedes(X1,X2,X0)
| ~ occurrence_of(sK3(X0,X1,X2),tptp0) ),
inference(superposition,[status(thm)],[c_58,c_102]) ).
tcf(c_10365,plain,
( leaf_occ(sK16,sK17)
| next_subocc(sK16,sK12(sK16),tptp0)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_6094,c_102]) ).
tcf(c_10367,plain,
next_subocc(sK16,sK12(sK16),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_10365,c_6092,c_6093,c_6095]) ).
tcf(c_10504,plain,
( leaf_occ(sK16,sK17)
| min_precedes(sK12(sK16),sK13(sK16),tptp0)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_6094,c_104]) ).
tcf(c_10506,plain,
min_precedes(sK12(sK16),sK13(sK16),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_10504,c_6092,c_6093,c_6095]) ).
tcf(c_10544,plain,
( leaf_occ(sK16,sK17)
| min_precedes(sK13(sK16),sK14(sK16),tptp0)
| ~ arboreal(sK16)
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_6094,c_106]) ).
tcf(c_10546,plain,
min_precedes(sK13(sK16),sK14(sK16),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_10544,c_6092,c_6093,c_6095]) ).
tcf(c_10588,plain,
sK5(sK13(sK16)) = tptp4,
inference(superposition,[status(thm)],[c_10299,c_9506]) ).
tcf(c_10624,plain,
min_precedes(sK16,sK12(sK16),tptp0),
inference(superposition,[status(thm)],[c_10367,c_94]) ).
tcf(c_10697,plain,
! [X0: $i] :
( ~ next_subocc(sK12(sK16),X0,tptp0)
| ~ min_precedes(sK13(sK16),X0,tptp0) ),
inference(superposition,[status(thm)],[c_10506,c_95]) ).
tcf(c_10700,plain,
! [X0: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ leaf_occ(sK12(sK16),X0) ),
inference(superposition,[status(thm)],[c_10506,c_62]) ).
tcf(c_11851,plain,
! [X0: $i] :
( ~ leaf_occ(sK16,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_10624,c_62]) ).
tcf(c_14130,plain,
~ next_subocc(sK12(sK16),sK14(sK16),tptp0),
inference(superposition,[status(thm)],[c_10546,c_10697]) ).
tcf(c_16163,plain,
( occurrence_of(sK3(tptp0,sK16,sK12(sK16)),tptp0)
| ~ min_precedes(sK16,sK12(sK16),tptp0) ),
inference(instantiation,[status(thm)],[c_56]) ).
tcf(c_24893,plain,
sK5(sK3(tptp0,sK16,sK12(sK16))) = tptp0,
inference(superposition,[status(thm)],[c_10624,c_9513]) ).
tcf(c_25825,plain,
( occurrence_of(sK3(tptp0,sK16,sK12(sK16)),tptp0)
| ~ activity_occurrence(sK3(tptp0,sK16,sK12(sK16))) ),
inference(superposition,[status(thm)],[c_24893,c_66]) ).
tcf(c_28886,plain,
occurrence_of(sK3(tptp0,sK16,sK12(sK16)),tptp0),
inference(global_subsumption_just,[status(thm)],[c_25825,c_10624,c_16163]) ).
tcf(c_28906,plain,
( next_subocc(sK12(sK16),sK12(sK12(sK16)),tptp0)
| leaf_occ(sK12(sK16),sK3(tptp0,sK16,sK12(sK16)))
| ~ arboreal(sK12(sK16))
| ~ min_precedes(sK16,sK12(sK16),tptp0) ),
inference(superposition,[status(thm)],[c_28886,c_10364]) ).
tcf(c_28910,plain,
( occurrence_of(sK12(sK12(sK16)),tptp3)
| leaf_occ(sK12(sK16),sK3(tptp0,sK16,sK12(sK16)))
| ~ arboreal(sK12(sK16))
| ~ min_precedes(sK16,sK12(sK16),tptp0) ),
inference(superposition,[status(thm)],[c_28886,c_9835]) ).
tcf(c_28927,plain,
( occurrence_of(sK12(sK12(sK16)),tptp3)
| leaf_occ(sK12(sK16),sK3(tptp0,sK16,sK12(sK16))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_28910,c_9876,c_10624]) ).
tcf(c_28933,plain,
( next_subocc(sK12(sK16),sK12(sK12(sK16)),tptp0)
| leaf_occ(sK12(sK16),sK3(tptp0,sK16,sK12(sK16))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_28906,c_9876,c_10624]) ).
tcf(c_29004,plain,
( occurrence_of(sK12(sK12(sK16)),tptp3)
| ~ occurrence_of(sK3(tptp0,sK16,sK12(sK16)),tptp0) ),
inference(superposition,[status(thm)],[c_28927,c_10700]) ).
tcf(c_29005,plain,
occurrence_of(sK12(sK12(sK16)),tptp3),
inference(forward_subsumption_resolution,[status(thm)],[c_29004,c_28886]) ).
tcf(c_29778,plain,
sK5(sK12(sK12(sK16))) = tptp3,
inference(superposition,[status(thm)],[c_29005,c_9506]) ).
tcf(c_40850,plain,
( next_subocc(sK12(sK16),sK12(sK12(sK16)),tptp0)
| ~ occurrence_of(sK3(tptp0,sK16,sK12(sK16)),tptp0) ),
inference(superposition,[status(thm)],[c_28933,c_10700]) ).
tcf(c_40851,plain,
next_subocc(sK12(sK16),sK12(sK12(sK16)),tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_40850,c_28886]) ).
tcf(c_40852,plain,
min_precedes(sK12(sK16),sK12(sK12(sK16)),tptp0),
inference(superposition,[status(thm)],[c_40851,c_94]) ).
tcf(c_41019,plain,
! [X0: $i] :
( leaf_occ(sK16,X0)
| ( sK12(sK12(sK16)) = sK14(sK16) )
| ( sK12(sK12(sK16)) = sK13(sK16) )
| ~ arboreal(sK16)
| ~ subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_40852,c_107]) ).
tcf(c_41048,plain,
! [X0: $i] :
( leaf_occ(sK16,X0)
| ( sK12(sK12(sK16)) = sK14(sK16) )
| ( sK12(sK12(sK16)) = sK13(sK16) )
| ~ subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_41019,c_6093]) ).
tcf(c_41222,plain,
! [X0: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK16,X0)
| ( sK12(sK12(sK16)) = sK13(sK16) )
| ( sK12(sK12(sK16)) = sK14(sK16) ) ),
inference(global_subsumption_just,[status(thm)],[c_41048,c_11851,c_41048]) ).
tcf(c_41223,plain,
! [X0: $i] :
( ( sK12(sK12(sK16)) = sK14(sK16) )
| ( sK12(sK12(sK16)) = sK13(sK16) )
| ~ subactivity_occurrence(sK16,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(renaming,[status(thm)],[c_41222]) ).
tcf(c_41235,plain,
( ( sK12(sK12(sK16)) = sK14(sK16) )
| ( sK12(sK12(sK16)) = sK13(sK16) )
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_6094,c_41223]) ).
tcf(c_41237,plain,
( ( sK12(sK12(sK16)) = sK14(sK16) )
| ( sK12(sK12(sK16)) = sK13(sK16) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_41235,c_6095]) ).
tcf(c_41255,plain,
( next_subocc(sK12(sK16),sK14(sK16),tptp0)
| ( sK12(sK12(sK16)) = sK13(sK16) ) ),
inference(superposition,[status(thm)],[c_41237,c_40851]) ).
tcf(c_41268,plain,
sK12(sK12(sK16)) = sK13(sK16),
inference(forward_subsumption_resolution,[status(thm)],[c_41255,c_14130]) ).
tcf(c_41282,plain,
sK5(sK13(sK16)) = tptp3,
inference(demodulation,[status(thm)],[c_29778,c_41268]) ).
tcf(c_41286,plain,
tptp3 = tptp4,
inference(demodulation,[status(thm)],[c_10588,c_41282]) ).
tcf(c_41287,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_41286,c_113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO018+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 06:36:49 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 15.95/3.26 % SZS status Started for theBenchmark.p
% 15.95/3.26 % SZS status Theorem for theBenchmark.p
% 15.95/3.26
% 15.95/3.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 15.95/3.26
% 15.95/3.26 % ------ iProver source info
% 15.95/3.26
% 15.95/3.26 % git: date: 2026-07-19 20:42:38 +0200
% 15.95/3.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 15.95/3.26 % git: non_committed_changes: false
% 15.95/3.26
% 15.95/3.26 % ------ Parsing...
% 15.95/3.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 15.95/3.26
% 15.95/3.26 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 15.95/3.26
% 15.95/3.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 15.95/3.26
% 15.95/3.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 15.95/3.26 % ------ Proving...
% 15.95/3.26 % ------ Problem Properties
% 15.95/3.26
% 15.95/3.26 %
% 15.95/3.26 % clauses 81
% 15.95/3.26 % conjectures 9
% 15.95/3.26 % EPR 49
% 15.95/3.26 % Horn 56
% 15.95/3.26 % unary 15
% 15.95/3.26 % binary 28
% 15.95/3.26 % lits 241
% 15.95/3.26 % lits eq 14
% 15.95/3.26 % fd_pure 0
% 15.95/3.26 % fd_pseudo 0
% 15.95/3.26 % fd_cond 0
% 15.95/3.26 % fd_pseudo_cond 7
% 15.95/3.26 % AC symbols 0
% 15.95/3.26
% 15.95/3.26 % ------ Schedule dynamic 5 is on
% 15.95/3.26
% 15.95/3.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 15.95/3.26
% 15.95/3.26
% 15.95/3.26 % ------
% 15.95/3.26 % Current options:
% 15.95/3.26 % ------
% 15.95/3.26
% 15.95/3.26
% 15.95/3.26 %
% 15.95/3.26
% 15.95/3.26 % ------ Proving...
% 15.95/3.26 %
% 15.95/3.26
% 15.95/3.26 % SZS status Theorem for theBenchmark.p
% 15.95/3.26
% 15.95/3.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 15.95/3.26
% 15.95/3.26
%------------------------------------------------------------------------------