%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO014+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 : Thu Sep 24 01:59:34 PM UTC 2026
% Result : Theorem 0.17s 5.63s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 17
% Syntax : Number of formulae : 116 ( 36 unt; 0 def)
% Number of atoms : 402 ( 16 equ)
% Maximal formula atoms : 36 ( 3 avg)
% Number of connectives : 461 ( 175 ~; 176 |; 88 &)
% ( 3 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 195 ( 4 sgn 103 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X107,X108] :
( ( ~ leaf_occ(X107,X108)
& arboreal(X107)
& subactivity_occurrence(X107,X108)
& occurrence_of(X108,tptp0) )
=> ? [X109,X110] :
( leaf(X110,tptp0)
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& next_subocc(X107,X109,tptp0)
& occurrence_of(X109,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105,X106] :
( leaf(X106,tptp0)
& next_subocc(X105,X106,tptp0)
& ( occurrence_of(X106,tptp1)
| occurrence_of(X106,tptp2) )
& next_subocc(X104,X105,tptp0)
& occurrence_of(X105,tptp4)
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(sos_07,axiom,
! [X26,X27] :
( ( ~ atomic(X27)
& leaf(X26,X27) )
=> ? [X28] :
( leaf_occ(X26,X28)
& occurrence_of(X28,X27) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(sos_34,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(sos_18,axiom,
! [X56,X57] :
( leaf_occ(X56,X57)
<=> ? [X58] :
( leaf(X56,X58)
& subactivity_occurrence(X56,X57)
& occurrence_of(X57,X58) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_18) ).
fof(sos_27,axiom,
! [X83,X84,X85,X86] :
( ( subactivity_occurrence(X84,X86)
& occurrence_of(X86,X85)
& min_precedes(X83,X84,X85) )
=> subactivity_occurrence(X83,X86) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_27) ).
fof(sos_26,axiom,
! [X79,X80,X81] :
( next_subocc(X79,X80,X81)
<=> ( ~ ? [X82] :
( min_precedes(X82,X80,X81)
& min_precedes(X79,X82,X81) )
& min_precedes(X79,X80,X81) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_26) ).
fof(sos_24,axiom,
! [X73,X74,X75] :
( min_precedes(X73,X74,X75)
=> precedes(X73,X74) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_24) ).
fof(sos_21,axiom,
! [X64,X65] :
( precedes(X64,X65)
<=> ( legal(X65)
& earlier(X64,X65) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(sos_30,axiom,
! [X95,X96,X97] :
( ( earlier(X96,X97)
& earlier(X95,X96) )
=> earlier(X95,X97) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_30) ).
fof(sos_02,axiom,
! [X9,X10,X11,X12] :
( ( ~ min_precedes(X11,X12,X9)
& arboreal(X11)
& leaf_occ(X12,X10)
& subactivity_occurrence(X11,X10)
& occurrence_of(X10,X9) )
=> X12 = X11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(sos_08,axiom,
! [X29,X30,X31] :
( ( occurrence_of(X29,X31)
& occurrence_of(X29,X30) )
=> X30 = X31 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(sos_12,axiom,
! [X42] :
( activity_occurrence(X42)
=> ? [X43] :
( occurrence_of(X42,X43)
& activity(X43) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
fof(sos_03,axiom,
! [X13,X14] :
( occurrence_of(X14,X13)
=> ( activity_occurrence(X14)
& activity(X13) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
fof(sos_11,axiom,
! [X40,X41] :
( subactivity_occurrence(X40,X41)
=> ( activity_occurrence(X41)
& activity_occurrence(X40) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_11) ).
fof(sos_31,axiom,
! [X98,X99,X100,X101] :
( ( precedes(X99,X100)
& min_precedes(X98,X100,X101)
& min_precedes(X98,X99,X101) )
=> min_precedes(X99,X100,X101) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_31) ).
fof(sos_20,axiom,
! [X62,X63] :
( earlier(X62,X63)
=> ~ earlier(X63,X62) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_20) ).
fof(c_0_17,negated_conjecture,
~ ! [X107,X108] :
( ( ~ leaf_occ(X107,X108)
& arboreal(X107)
& subactivity_occurrence(X107,X108)
& occurrence_of(X108,tptp0) )
=> ? [X109,X110] :
( leaf(X110,tptp0)
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& next_subocc(X107,X109,tptp0)
& occurrence_of(X109,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_18,plain,
! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105,X106] :
( leaf(X106,tptp0)
& next_subocc(X105,X106,tptp0)
& ( occurrence_of(X106,tptp1)
| occurrence_of(X106,tptp2) )
& next_subocc(X104,X105,tptp0)
& occurrence_of(X105,tptp4)
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_19,negated_conjecture,
~ ! [X107,X108] :
( ( ~ leaf_occ(X107,X108)
& arboreal(X107)
& subactivity_occurrence(X107,X108)
& occurrence_of(X108,tptp0) )
=> ? [X109,X110] :
( leaf(X110,tptp0)
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& next_subocc(X107,X109,tptp0)
& occurrence_of(X109,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X26,X27] :
( ( ~ atomic(X27)
& leaf(X26,X27) )
=> ? [X28] :
( leaf_occ(X26,X28)
& occurrence_of(X28,X27) ) ),
inference(fof_simplification,[status(thm)],[sos_07]) ).
fof(c_0_21,plain,
! [X229,X230] :
( ( leaf_occ(X229,X230)
| ~ arboreal(X229)
| ~ subactivity_occurrence(X229,X230)
| ~ occurrence_of(X230,tptp0)
| leaf(esk15_1(X229),tptp0) )
& ( leaf_occ(X229,X230)
| ~ arboreal(X229)
| ~ subactivity_occurrence(X229,X230)
| ~ occurrence_of(X230,tptp0)
| next_subocc(esk14_1(X229),esk15_1(X229),tptp0) )
& ( leaf_occ(X229,X230)
| ~ arboreal(X229)
| ~ subactivity_occurrence(X229,X230)
| ~ occurrence_of(X230,tptp0)
| occurrence_of(esk15_1(X229),tptp1)
| occurrence_of(esk15_1(X229),tptp2) )
& ( leaf_occ(X229,X230)
| ~ arboreal(X229)
| ~ subactivity_occurrence(X229,X230)
| ~ occurrence_of(X230,tptp0)
| next_subocc(esk13_1(X229),esk14_1(X229),tptp0) )
& ( leaf_occ(X229,X230)
| ~ arboreal(X229)
| ~ subactivity_occurrence(X229,X230)
| ~ occurrence_of(X230,tptp0)
| occurrence_of(esk14_1(X229),tptp4) )
& ( leaf_occ(X229,X230)
| ~ arboreal(X229)
| ~ subactivity_occurrence(X229,X230)
| ~ occurrence_of(X230,tptp0)
| next_subocc(X229,esk13_1(X229),tptp0) )
& ( leaf_occ(X229,X230)
| ~ arboreal(X229)
| ~ subactivity_occurrence(X229,X230)
| ~ occurrence_of(X230,tptp0)
| occurrence_of(esk13_1(X229),tptp3) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])])]) ).
fof(c_0_22,negated_conjecture,
! [X236,X237] :
( ( ~ leaf(X237,tptp0)
| ~ min_precedes(X236,X237,tptp0)
| ~ next_subocc(esk16_0,X236,tptp0)
| ~ occurrence_of(X236,tptp3)
| ~ occurrence_of(X237,tptp1) )
& ( ~ leaf(X237,tptp0)
| ~ min_precedes(X236,X237,tptp0)
| ~ next_subocc(esk16_0,X236,tptp0)
| ~ occurrence_of(X236,tptp3)
| ~ occurrence_of(X237,tptp2) )
& ~ leaf_occ(esk16_0,esk17_0)
& arboreal(esk16_0)
& subactivity_occurrence(esk16_0,esk17_0)
& occurrence_of(esk17_0,tptp0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])])]) ).
fof(c_0_23,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_34]) ).
fof(c_0_24,plain,
! [X136,X137] :
( ( atomic(X137)
| ~ leaf(X136,X137)
| leaf_occ(X136,esk4_2(X136,X137)) )
& ( atomic(X137)
| ~ leaf(X136,X137)
| occurrence_of(esk4_2(X136,X137),X137) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])]) ).
cnf(c_0_25,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| leaf(esk15_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
subactivity_occurrence(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
arboreal(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
occurrence_of(esk17_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
~ leaf_occ(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_30,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
fof(c_0_31,plain,
! [X173,X174,X176,X177,X178] :
( ( leaf_occ(X176,X177)
| ~ leaf(X176,X178)
| ~ subactivity_occurrence(X176,X177)
| ~ occurrence_of(X177,X178) )
& ( ~ leaf_occ(X173,X174)
| leaf(X173,esk9_2(X173,X174)) )
& ( ~ leaf_occ(X173,X174)
| subactivity_occurrence(X173,X174) )
& ( ~ leaf_occ(X173,X174)
| occurrence_of(X174,esk9_2(X173,X174)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_18])])])])])])]) ).
cnf(c_0_32,plain,
( ~ leaf(X1,X2)
| atomic(X2)
| leaf_occ(X1,esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
leaf(esk15_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_34,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_35,plain,
! [X210,X211,X212,X213] :
( subactivity_occurrence(X210,X213)
| ~ subactivity_occurrence(X211,X213)
| ~ occurrence_of(X213,X212)
| ~ min_precedes(X210,X211,X212) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_27])])]) ).
cnf(c_0_36,plain,
( ~ leaf_occ(X1,X2)
| subactivity_occurrence(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
leaf_occ(esk15_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
fof(c_0_38,plain,
! [X202,X203,X204,X205,X206,X207,X208] :
( ( next_subocc(X206,X207,X208)
| ~ min_precedes(X206,X207,X208)
| min_precedes(esk12_3(X206,X207,X208),X207,X208) )
& ( next_subocc(X206,X207,X208)
| ~ min_precedes(X206,X207,X208)
| min_precedes(X206,esk12_3(X206,X207,X208),X208) )
& ( ~ next_subocc(X202,X203,X204)
| ~ min_precedes(X205,X203,X204)
| ~ min_precedes(X202,X205,X204) )
& ( ~ next_subocc(X202,X203,X204)
| min_precedes(X202,X203,X204) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_26])])])])])])]) ).
cnf(c_0_39,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk14_1(X1),esk15_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_40,plain,
( ~ subactivity_occurrence(X2,X4)
| ~ occurrence_of(X4,X3)
| ~ min_precedes(X1,X2,X3)
| subactivity_occurrence(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,negated_conjecture,
subactivity_occurrence(esk15_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,negated_conjecture,
next_subocc(esk14_1(esk16_0),esk15_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_44,plain,
( ~ leaf(X1,X2)
| atomic(X2)
| occurrence_of(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_45,plain,
! [X196,X197,X198] :
( precedes(X196,X197)
| ~ min_precedes(X196,X197,X198) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_24])])]) ).
cnf(c_0_46,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk13_1(X1),esk14_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_47,negated_conjecture,
( ~ occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),X2)
| ~ min_precedes(X1,esk15_1(esk16_0),X2)
| subactivity_occurrence(X1,esk4_2(esk15_1(esk16_0),tptp0)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
min_precedes(esk14_1(esk16_0),esk15_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_34]) ).
fof(c_0_50,plain,
! [X187,X188] :
( ( precedes(X187,X188)
| ~ legal(X188)
| ~ earlier(X187,X188) )
& ( ~ precedes(X187,X188)
| legal(X188) )
& ( ~ precedes(X187,X188)
| earlier(X187,X188) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])]) ).
cnf(c_0_51,plain,
( ~ min_precedes(X1,X2,X3)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,negated_conjecture,
next_subocc(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_53,negated_conjecture,
subactivity_occurrence(esk14_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
fof(c_0_54,plain,
! [X222,X223,X224] :
( earlier(X222,X224)
| ~ earlier(X223,X224)
| ~ earlier(X222,X223) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_30])])]) ).
cnf(c_0_55,plain,
( ~ precedes(X1,X2)
| earlier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,negated_conjecture,
precedes(esk14_1(esk16_0),esk15_1(esk16_0)),
inference(spm,[status(thm)],[c_0_51,c_0_48]) ).
cnf(c_0_57,negated_conjecture,
min_precedes(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_42,c_0_52]) ).
fof(c_0_58,plain,
! [X9,X10,X11,X12] :
( ( ~ min_precedes(X11,X12,X9)
& arboreal(X11)
& leaf_occ(X12,X10)
& subactivity_occurrence(X11,X10)
& occurrence_of(X10,X9) )
=> X12 = X11 ),
inference(fof_simplification,[status(thm)],[sos_02]) ).
cnf(c_0_59,negated_conjecture,
( ~ occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),X2)
| ~ min_precedes(X1,esk14_1(esk16_0),X2)
| subactivity_occurrence(X1,esk4_2(esk15_1(esk16_0),tptp0)) ),
inference(spm,[status(thm)],[c_0_40,c_0_53]) ).
cnf(c_0_60,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk13_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_61,plain,
( ~ earlier(X2,X3)
| ~ earlier(X1,X2)
| earlier(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_62,negated_conjecture,
earlier(esk14_1(esk16_0),esk15_1(esk16_0)),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,negated_conjecture,
precedes(esk13_1(esk16_0),esk14_1(esk16_0)),
inference(spm,[status(thm)],[c_0_51,c_0_57]) ).
fof(c_0_64,plain,
! [X119,X120,X121,X122] :
( X122 = X121
| min_precedes(X121,X122,X119)
| ~ arboreal(X121)
| ~ leaf_occ(X122,X120)
| ~ subactivity_occurrence(X121,X120)
| ~ occurrence_of(X120,X119) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_58])])]) ).
cnf(c_0_65,negated_conjecture,
subactivity_occurrence(esk13_1(esk16_0),esk4_2(esk15_1(esk16_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_57]),c_0_49])]) ).
cnf(c_0_66,negated_conjecture,
next_subocc(esk16_0,esk13_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
fof(c_0_67,plain,
! [X139,X140,X141] :
( X140 = X141
| ~ occurrence_of(X139,X141)
| ~ occurrence_of(X139,X140) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).
fof(c_0_68,plain,
! [X152] :
( ( ~ activity_occurrence(X152)
| occurrence_of(X152,esk5_1(X152)) )
& ( ~ activity_occurrence(X152)
| activity(esk5_1(X152)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_12])])])])]) ).
fof(c_0_69,plain,
! [X123,X124] :
( ( ~ occurrence_of(X124,X123)
| activity_occurrence(X124) )
& ( ~ occurrence_of(X124,X123)
| activity(X123) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_03])])])]) ).
cnf(c_0_70,negated_conjecture,
( ~ earlier(X1,esk14_1(esk16_0))
| earlier(X1,esk15_1(esk16_0)) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_71,negated_conjecture,
earlier(esk13_1(esk16_0),esk14_1(esk16_0)),
inference(spm,[status(thm)],[c_0_55,c_0_63]) ).
cnf(c_0_72,plain,
( ~ precedes(X2,X1)
| legal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_73,plain,
( ~ arboreal(X3)
| ~ leaf_occ(X4,X1)
| ~ subactivity_occurrence(X3,X1)
| ~ occurrence_of(X1,X2)
| X4 = X3
| min_precedes(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_74,negated_conjecture,
( ~ occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),X2)
| ~ min_precedes(X1,esk13_1(esk16_0),X2)
| subactivity_occurrence(X1,esk4_2(esk15_1(esk16_0),tptp0)) ),
inference(spm,[status(thm)],[c_0_40,c_0_65]) ).
cnf(c_0_75,negated_conjecture,
min_precedes(esk16_0,esk13_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_42,c_0_66]) ).
cnf(c_0_76,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_77,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_78,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
fof(c_0_79,plain,
! [X150,X151] :
( ( ~ subactivity_occurrence(X150,X151)
| activity_occurrence(X151) )
& ( ~ subactivity_occurrence(X150,X151)
| activity_occurrence(X150) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_11])])])]) ).
cnf(c_0_80,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk13_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_81,plain,
! [X225,X226,X227,X228] :
( min_precedes(X226,X227,X228)
| ~ precedes(X226,X227)
| ~ min_precedes(X225,X227,X228)
| ~ min_precedes(X225,X226,X228) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_31])])]) ).
cnf(c_0_82,plain,
( ~ legal(X2)
| ~ earlier(X1,X2)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_83,negated_conjecture,
earlier(esk13_1(esk16_0),esk15_1(esk16_0)),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_84,negated_conjecture,
legal(esk15_1(esk16_0)),
inference(spm,[status(thm)],[c_0_72,c_0_56]) ).
cnf(c_0_85,negated_conjecture,
( ~ occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),X2)
| ~ subactivity_occurrence(X1,esk4_2(esk15_1(esk16_0),tptp0))
| ~ arboreal(X1)
| min_precedes(X1,esk15_1(esk16_0),X2)
| X1 = esk15_1(esk16_0) ),
inference(spm,[status(thm)],[c_0_73,c_0_37]) ).
cnf(c_0_86,negated_conjecture,
subactivity_occurrence(esk16_0,esk4_2(esk15_1(esk16_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_49])]) ).
cnf(c_0_87,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk5_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]) ).
cnf(c_0_88,plain,
( ~ subactivity_occurrence(X2,X1)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_89,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk16_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_90,negated_conjecture,
occurrence_of(esk13_1(esk16_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_91,plain,
( ~ precedes(X2,X4)
| ~ min_precedes(X1,X4,X3)
| ~ min_precedes(X1,X2,X3)
| min_precedes(X2,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_92,negated_conjecture,
precedes(esk13_1(esk16_0),esk15_1(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]) ).
cnf(c_0_93,negated_conjecture,
( ~ occurrence_of(esk4_2(esk15_1(esk16_0),tptp0),X1)
| min_precedes(esk16_0,esk15_1(esk16_0),X1)
| esk15_1(esk16_0) = esk16_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_27])]) ).
cnf(c_0_94,negated_conjecture,
esk5_1(esk4_2(esk15_1(esk16_0),tptp0)) = tptp0,
inference(spm,[status(thm)],[c_0_87,c_0_49]) ).
cnf(c_0_95,negated_conjecture,
activity_occurrence(esk4_2(esk15_1(esk16_0),tptp0)),
inference(spm,[status(thm)],[c_0_88,c_0_41]) ).
cnf(c_0_96,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk16_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_97,plain,
! [X62,X63] :
( earlier(X62,X63)
=> ~ earlier(X63,X62) ),
inference(fof_simplification,[status(thm)],[sos_20]) ).
cnf(c_0_98,negated_conjecture,
( ~ occurrence_of(X1,tptp1)
| ~ min_precedes(esk13_1(esk16_0),X1,tptp0)
| ~ leaf(X1,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_66]),c_0_90])]) ).
cnf(c_0_99,negated_conjecture,
( ~ min_precedes(X2,esk13_1(esk16_0),X1)
| ~ min_precedes(X2,esk15_1(esk16_0),X1)
| min_precedes(esk13_1(esk16_0),esk15_1(esk16_0),X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_100,negated_conjecture,
( min_precedes(esk16_0,esk15_1(esk16_0),tptp0)
| esk15_1(esk16_0) = esk16_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_77]),c_0_94]),c_0_95])]) ).
cnf(c_0_101,negated_conjecture,
( ~ occurrence_of(X1,tptp2)
| ~ min_precedes(esk13_1(esk16_0),X1,tptp0)
| ~ leaf(X1,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_66]),c_0_90])]) ).
fof(c_0_102,plain,
! [X185,X186] :
( ~ earlier(X186,X185)
| ~ earlier(X185,X186) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_97])])]) ).
cnf(c_0_103,negated_conjecture,
( ~ occurrence_of(esk15_1(esk16_0),tptp1)
| ~ min_precedes(esk13_1(esk16_0),esk15_1(esk16_0),tptp0) ),
inference(spm,[status(thm)],[c_0_98,c_0_33]) ).
cnf(c_0_104,negated_conjecture,
( min_precedes(esk13_1(esk16_0),esk15_1(esk16_0),tptp0)
| esk15_1(esk16_0) = esk16_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_75])]) ).
cnf(c_0_105,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk15_1(X1),tptp1)
| occurrence_of(esk15_1(X1),tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_106,negated_conjecture,
( ~ occurrence_of(esk15_1(esk16_0),tptp2)
| ~ min_precedes(esk13_1(esk16_0),esk15_1(esk16_0),tptp0) ),
inference(spm,[status(thm)],[c_0_101,c_0_33]) ).
cnf(c_0_107,plain,
( ~ earlier(X2,X1)
| ~ earlier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_108,negated_conjecture,
( ~ occurrence_of(esk15_1(esk16_0),tptp1)
| esk15_1(esk16_0) = esk16_0 ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_109,negated_conjecture,
( occurrence_of(esk15_1(esk16_0),tptp2)
| occurrence_of(esk15_1(esk16_0),tptp1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_110,negated_conjecture,
( ~ occurrence_of(esk15_1(esk16_0),tptp2)
| esk15_1(esk16_0) = esk16_0 ),
inference(spm,[status(thm)],[c_0_106,c_0_104]) ).
cnf(c_0_111,negated_conjecture,
precedes(esk16_0,esk13_1(esk16_0)),
inference(spm,[status(thm)],[c_0_51,c_0_75]) ).
cnf(c_0_112,negated_conjecture,
~ earlier(esk15_1(esk16_0),esk13_1(esk16_0)),
inference(spm,[status(thm)],[c_0_107,c_0_83]) ).
cnf(c_0_113,negated_conjecture,
esk15_1(esk16_0) = esk16_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_110]) ).
cnf(c_0_114,negated_conjecture,
earlier(esk16_0,esk13_1(esk16_0)),
inference(spm,[status(thm)],[c_0_55,c_0_111]) ).
cnf(c_0_115,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_113]),c_0_114])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO014+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.39 % Computer : n007.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Mon Sep 21 03:40:56 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.45 Running first-order theorem proving
% 0.17/5.45 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/5.63 % Version: 3.5.1
% 0.17/5.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/5.63 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.63 % Starting new_bool_1 with 300s (1) cores
% 0.17/5.63 % Starting sh5l with 300s (1) cores
% 0.17/5.63 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 94294 completed with status 0
% 0.17/5.63 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/5.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/5.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.63 % No SInE strategy applied
% 0.17/5.63 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.17/5.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.63 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/5.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.17/5.63 % Starting new_bool_3 with 136s (1) cores
% 0.17/5.63 % Starting new_bool_1 with 136s (1) cores
% 0.17/5.63 % new_bool_3 with pid 94301 completed with status 0
% 0.17/5.63 % Result found by new_bool_3
% 0.17/5.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/5.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.63 % No SInE strategy applied
% 0.17/5.63 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.17/5.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.63 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/5.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.17/5.63 % Starting new_bool_3 with 136s (1) cores
% 0.17/5.63 % Preprocessing time : 0.004 s
% 0.17/5.63 % Presaturation interreduction done
% 0.17/5.63
% 0.17/5.63 % Proof found!
% 0.17/5.63 % SZS status Theorem
% 0.17/5.63 % SZS output start CNFRefutation
% See solution above
% 0.17/5.63 % Parsed axioms : 46
% 0.17/5.63 % Removed by relevancy pruning/SinE : 0
% 0.17/5.63 % Initial clauses : 85
% 0.17/5.63 % Removed in clause preprocessing : 0
% 0.17/5.63 % Initial clauses in saturation : 85
% 0.17/5.63 % Processed clauses : 867
% 0.17/5.63 % ...of these trivial : 27
% 0.17/5.63 % ...subsumed : 123
% 0.17/5.63 % ...remaining for further processing : 717
% 0.17/5.63 % Other redundant clauses eliminated : 0
% 0.17/5.63 % Clauses deleted for lack of memory : 0
% 0.17/5.63 % Backward-subsumed : 6
% 0.17/5.63 % Backward-rewritten : 108
% 0.17/5.63 % Generated clauses : 1861
% 0.17/5.63 % ...of the previous two non-redundant : 1442
% 0.17/5.63 % ...aggressively subsumed : 0
% 0.17/5.63 % Contextual simplify-reflections : 8
% 0.17/5.63 % Paramodulations : 1861
% 0.17/5.63 % Factorizations : 0
% 0.17/5.63 % NegExts : 0
% 0.17/5.63 % Equation resolutions : 0
% 0.17/5.63 % Disequality decompositions : 0
% 0.17/5.63 % Total rewrite steps : 1211
% 0.17/5.63 % ...of those cached : 1083
% 0.17/5.63 % Propositional unsat checks : 0
% 0.17/5.63 % Propositional check models : 0
% 0.17/5.63 % Propositional check unsatisfiable : 0
% 0.17/5.63 % Propositional clauses : 0
% 0.17/5.63 % Propositional clauses after purity: 0
% 0.17/5.63 % Propositional unsat core size : 0
% 0.17/5.63 % Propositional preprocessing time : 0.000
% 0.17/5.63 % Propositional encoding time : 0.000
% 0.17/5.63 % Propositional solver time : 0.000
% 0.17/5.63 % Success case prop preproc time : 0.000
% 0.17/5.63 % Success case prop encoding time : 0.000
% 0.17/5.63 % Success case prop solver time : 0.000
% 0.17/5.63 % Current number of processed clauses : 518
% 0.17/5.63 % Positive orientable unit clauses : 166
% 0.17/5.63 % Positive unorientable unit clauses: 0
% 0.17/5.63 % Negative unit clauses : 39
% 0.17/5.63 % Non-unit-clauses : 313
% 0.17/5.63 % Current number of unprocessed clauses: 646
% 0.17/5.63 % ...number of literals in the above : 1893
% 0.17/5.63 % Current number of archived formulas : 0
% 0.17/5.63 % Current number of archived clauses : 199
% 0.17/5.63 % Clause-clause subsumption calls (NU) : 25734
% 0.17/5.63 % Rec. Clause-clause subsumption calls : 19026
% 0.17/5.63 % Non-unit clause-clause subsumptions : 78
% 0.17/5.63 % Unit Clause-clause subsumption calls : 1375
% 0.17/5.63 % Rewrite failures with RHS unbound : 0
% 0.17/5.63 % BW rewrite match attempts : 48
% 0.17/5.63 % BW rewrite match successes : 13
% 0.17/5.63 % Condensation attempts : 0
% 0.17/5.63 % Condensation successes : 0
% 0.17/5.63 % Termbank termtop insertions : 42867
% 0.17/5.63 % Search garbage collected termcells : 1410
% 0.17/5.63
% 0.17/5.63 % -------------------------------------------------
% 0.17/5.63 % User time : 0.127 s
% 0.17/5.63 % System time : 0.016 s
% 0.17/5.63 % Total time : 0.143 s
% 0.17/5.63 % Maximum resident set size: 4000 pages
% 0.17/5.63
% 0.17/5.63 % -------------------------------------------------
% 0.17/5.63 % User time : 0.489 s
% 0.17/5.63 % System time : 0.053 s
% 0.17/5.63 % Total time : 0.542 s
% 0.17/5.63 % Maximum resident set size: 4864 pages
% 0.17/5.63 % E exiting
%------------------------------------------------------------------------------