%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO014+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 2.97s 0.80s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 103 ( 31 unt; 0 def)
% Number of atoms : 387 ( 9 equ)
% Maximal formula atoms : 36 ( 3 avg)
% Number of connectives : 455 ( 171 ~; 192 |; 75 &)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 176 ( 3 sgn 86 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X111,X112] :
( ( ~ leaf_occ(X111,X112)
& arboreal(X111)
& subactivity_occurrence(X111,X112)
& occurrence_of(X112,tptp0) )
=> ? [X113,X114] :
( leaf(X114,tptp0)
& min_precedes(X113,X114,tptp0)
& ( occurrence_of(X114,tptp1)
| occurrence_of(X114,tptp2) )
& next_subocc(X111,X113,tptp0)
& occurrence_of(X113,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_35,axiom,
! [X106,X107] :
( ( ~ leaf_occ(X106,X107)
& arboreal(X106)
& subactivity_occurrence(X106,X107)
& occurrence_of(X107,tptp0) )
=> ? [X108,X109,X110] :
( leaf(X110,tptp0)
& next_subocc(X109,X110,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& next_subocc(X108,X109,tptp0)
& occurrence_of(X109,tptp4)
& next_subocc(X106,X108,tptp0)
& occurrence_of(X108,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_35) ).
fof(sos_22,axiom,
! [X61,X62,X63] :
( next_subocc(X61,X62,X63)
<=> ( ~ ? [X64] :
( min_precedes(X64,X62,X63)
& min_precedes(X61,X64,X63) )
& min_precedes(X61,X62,X63) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_22) ).
fof(sos_15,axiom,
! [X39,X40,X41] :
( min_precedes(X39,X40,X41)
=> precedes(X39,X40) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_15) ).
fof(sos_10,axiom,
! [X22,X23] :
( precedes(X22,X23)
<=> ( legal(X23)
& earlier(X22,X23) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_10) ).
fof(sos_29,axiom,
! [X84,X85,X86,X87] :
( ( subactivity_occurrence(X85,X87)
& occurrence_of(X87,X86)
& min_precedes(X84,X85,X86) )
=> subactivity_occurrence(X84,X87) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_29) ).
fof(sos_25,axiom,
! [X70,X71,X72] :
( min_precedes(X71,X72,X70)
=> ? [X73] :
( subactivity_occurrence(X72,X73)
& subactivity_occurrence(X71,X73)
& occurrence_of(X73,X70) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_25) ).
fof(sos_08,axiom,
! [X19] :
( legal(X19)
=> arboreal(X19) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).
fof(sos_28,axiom,
! [X80,X81,X82,X83] :
( ( subactivity_occurrence(X83,X81)
& subactivity_occurrence(X82,X81)
& arboreal(X83)
& arboreal(X82)
& occurrence_of(X81,X80) )
=> ( X82 = X83
| min_precedes(X83,X82,X80)
| min_precedes(X82,X83,X80) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_28) ).
fof(sos_05,axiom,
! [X11,X12,X13] :
( ( earlier(X12,X13)
& earlier(X11,X12) )
=> earlier(X11,X13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_05) ).
fof(sos_21,axiom,
! [X57,X58] :
( leaf(X57,X58)
<=> ( ~ ? [X60] : min_precedes(X57,X60,X58)
& ( ? [X59] : min_precedes(X59,X57,X58)
| root(X57,X58) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_21) ).
fof(sos_04,axiom,
! [X9,X10] :
( earlier(X9,X10)
=> ~ earlier(X10,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).
fof(sos_18,axiom,
! [X46,X47,X48,X49] :
( ( precedes(X47,X48)
& min_precedes(X46,X48,X49)
& min_precedes(X46,X47,X49) )
=> min_precedes(X47,X48,X49) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_18) ).
fof(c_0_13,negated_conjecture,
~ ! [X111,X112] :
( ( ~ leaf_occ(X111,X112)
& arboreal(X111)
& subactivity_occurrence(X111,X112)
& occurrence_of(X112,tptp0) )
=> ? [X113,X114] :
( leaf(X114,tptp0)
& min_precedes(X113,X114,tptp0)
& ( occurrence_of(X114,tptp1)
| occurrence_of(X114,tptp2) )
& next_subocc(X111,X113,tptp0)
& occurrence_of(X113,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_14,plain,
! [X106,X107] :
( ( ~ leaf_occ(X106,X107)
& arboreal(X106)
& subactivity_occurrence(X106,X107)
& occurrence_of(X107,tptp0) )
=> ? [X108,X109,X110] :
( leaf(X110,tptp0)
& next_subocc(X109,X110,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& next_subocc(X108,X109,tptp0)
& occurrence_of(X109,tptp4)
& next_subocc(X106,X108,tptp0)
& occurrence_of(X108,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_35]) ).
fof(c_0_15,negated_conjecture,
~ ! [X111,X112] :
( ( ~ leaf_occ(X111,X112)
& arboreal(X111)
& subactivity_occurrence(X111,X112)
& occurrence_of(X112,tptp0) )
=> ? [X113,X114] :
( leaf(X114,tptp0)
& min_precedes(X113,X114,tptp0)
& ( occurrence_of(X114,tptp1)
| occurrence_of(X114,tptp2) )
& next_subocc(X111,X113,tptp0)
& occurrence_of(X113,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X237,X238] :
( ( leaf_occ(X237,X238)
| ~ arboreal(X237)
| ~ subactivity_occurrence(X237,X238)
| ~ occurrence_of(X238,tptp0)
| leaf(esk18_1(X237),tptp0) )
& ( leaf_occ(X237,X238)
| ~ arboreal(X237)
| ~ subactivity_occurrence(X237,X238)
| ~ occurrence_of(X238,tptp0)
| next_subocc(esk17_1(X237),esk18_1(X237),tptp0) )
& ( leaf_occ(X237,X238)
| ~ arboreal(X237)
| ~ subactivity_occurrence(X237,X238)
| ~ occurrence_of(X238,tptp0)
| occurrence_of(esk18_1(X237),tptp1)
| occurrence_of(esk18_1(X237),tptp2) )
& ( leaf_occ(X237,X238)
| ~ arboreal(X237)
| ~ subactivity_occurrence(X237,X238)
| ~ occurrence_of(X238,tptp0)
| next_subocc(esk16_1(X237),esk17_1(X237),tptp0) )
& ( leaf_occ(X237,X238)
| ~ arboreal(X237)
| ~ subactivity_occurrence(X237,X238)
| ~ occurrence_of(X238,tptp0)
| occurrence_of(esk17_1(X237),tptp4) )
& ( leaf_occ(X237,X238)
| ~ arboreal(X237)
| ~ subactivity_occurrence(X237,X238)
| ~ occurrence_of(X238,tptp0)
| next_subocc(X237,esk16_1(X237),tptp0) )
& ( leaf_occ(X237,X238)
| ~ arboreal(X237)
| ~ subactivity_occurrence(X237,X238)
| ~ occurrence_of(X238,tptp0)
| occurrence_of(esk16_1(X237),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_14])])])])])])]) ).
fof(c_0_17,negated_conjecture,
! [X244,X245] :
( ( ~ leaf(X245,tptp0)
| ~ min_precedes(X244,X245,tptp0)
| ~ next_subocc(esk19_0,X244,tptp0)
| ~ occurrence_of(X244,tptp3)
| ~ occurrence_of(X245,tptp1) )
& ( ~ leaf(X245,tptp0)
| ~ min_precedes(X244,X245,tptp0)
| ~ next_subocc(esk19_0,X244,tptp0)
| ~ occurrence_of(X244,tptp3)
| ~ occurrence_of(X245,tptp2) )
& ~ leaf_occ(esk19_0,esk20_0)
& arboreal(esk19_0)
& subactivity_occurrence(esk19_0,esk20_0)
& occurrence_of(esk20_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_15])])])])])]) ).
cnf(c_0_18,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk17_1(X1),esk18_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
occurrence_of(esk20_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X179,X180,X181,X182,X183,X184,X185] :
( ( next_subocc(X183,X184,X185)
| ~ min_precedes(X183,X184,X185)
| min_precedes(esk8_3(X183,X184,X185),X184,X185) )
& ( next_subocc(X183,X184,X185)
| ~ min_precedes(X183,X184,X185)
| min_precedes(X183,esk8_3(X183,X184,X185),X185) )
& ( ~ next_subocc(X179,X180,X181)
| ~ min_precedes(X182,X180,X181)
| ~ min_precedes(X179,X182,X181) )
& ( ~ next_subocc(X179,X180,X181)
| min_precedes(X179,X180,X181) ) ),
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_22])])])])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
| leaf_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
subactivity_occurrence(esk19_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
arboreal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
~ leaf_occ(esk19_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk16_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk16_1(X1),esk17_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_27,plain,
! [X153,X154,X155] :
( precedes(X153,X154)
| ~ min_precedes(X153,X154,X155) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])])]) ).
cnf(c_0_28,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,negated_conjecture,
next_subocc(esk17_1(esk19_0),esk18_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| next_subocc(X1,esk16_1(X1),tptp0)
| leaf_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_31,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
| leaf_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
fof(c_0_32,plain,
! [X136,X137] :
( ( precedes(X136,X137)
| ~ legal(X137)
| ~ earlier(X136,X137) )
& ( ~ precedes(X136,X137)
| legal(X137) )
& ( ~ precedes(X136,X137)
| earlier(X136,X137) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])])]) ).
cnf(c_0_33,plain,
( ~ min_precedes(X1,X2,X3)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
min_precedes(esk17_1(esk19_0),esk18_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_35,plain,
! [X209,X210,X211,X212] :
( subactivity_occurrence(X209,X212)
| ~ subactivity_occurrence(X210,X212)
| ~ occurrence_of(X212,X211)
| ~ min_precedes(X209,X210,X211) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])]) ).
cnf(c_0_36,negated_conjecture,
next_subocc(esk19_0,esk16_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_22]),c_0_23])]),c_0_24]) ).
fof(c_0_37,plain,
! [X195,X196,X197] :
( ( ~ min_precedes(X196,X197,X195)
| subactivity_occurrence(X197,esk10_3(X195,X196,X197)) )
& ( ~ min_precedes(X196,X197,X195)
| subactivity_occurrence(X196,esk10_3(X195,X196,X197)) )
& ( ~ min_precedes(X196,X197,X195)
| occurrence_of(esk10_3(X195,X196,X197),X195) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_25])])])])]) ).
cnf(c_0_38,negated_conjecture,
next_subocc(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_22]),c_0_23])]),c_0_24]) ).
fof(c_0_39,plain,
! [X133] :
( arboreal(X133)
| ~ legal(X133) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).
cnf(c_0_40,plain,
( ~ precedes(X2,X1)
| legal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,negated_conjecture,
precedes(esk17_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,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_43,negated_conjecture,
min_precedes(esk19_0,esk16_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
cnf(c_0_44,plain,
( ~ min_precedes(X2,X3,X1)
| occurrence_of(esk10_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,negated_conjecture,
min_precedes(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_46,plain,
( ~ min_precedes(X1,X3,X2)
| subactivity_occurrence(X1,esk10_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_47,plain,
! [X205,X206,X207,X208] :
( X207 = X208
| min_precedes(X208,X207,X205)
| min_precedes(X207,X208,X205)
| ~ subactivity_occurrence(X208,X206)
| ~ subactivity_occurrence(X207,X206)
| ~ arboreal(X208)
| ~ arboreal(X207)
| ~ occurrence_of(X206,X205) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_28])])]) ).
cnf(c_0_48,plain,
( ~ min_precedes(X3,X1,X2)
| subactivity_occurrence(X1,esk10_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_49,plain,
( ~ legal(X1)
| arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_50,negated_conjecture,
legal(esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_51,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk16_1(esk19_0),X1)
| subactivity_occurrence(esk19_0,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_52,negated_conjecture,
occurrence_of(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)),tptp0),
inference(spm,[status(thm)],[c_0_44,c_0_34]) ).
cnf(c_0_53,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk17_1(esk19_0),X1)
| subactivity_occurrence(esk16_1(esk19_0),X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_45]) ).
cnf(c_0_54,negated_conjecture,
subactivity_occurrence(esk17_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_46,c_0_34]) ).
cnf(c_0_55,plain,
( ~ subactivity_occurrence(X4,X1)
| ~ subactivity_occurrence(X3,X1)
| ~ arboreal(X4)
| ~ arboreal(X3)
| ~ occurrence_of(X1,X2)
| X3 = X4
| min_precedes(X4,X3,X2)
| min_precedes(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,negated_conjecture,
subactivity_occurrence(esk18_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_48,c_0_34]) ).
cnf(c_0_57,negated_conjecture,
arboreal(esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( ~ subactivity_occurrence(esk16_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
| subactivity_occurrence(esk19_0,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
subactivity_occurrence(esk16_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_52]),c_0_54])]) ).
cnf(c_0_60,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| leaf(esk18_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_61,negated_conjecture,
( ~ occurrence_of(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)),X2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
| min_precedes(esk18_1(esk19_0),X1,X2)
| min_precedes(X1,esk18_1(esk19_0),X2)
| X1 = esk18_1(esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
cnf(c_0_62,negated_conjecture,
subactivity_occurrence(esk19_0,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).
fof(c_0_63,plain,
! [X125,X126,X127] :
( earlier(X125,X127)
| ~ earlier(X126,X127)
| ~ earlier(X125,X126) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])])]) ).
cnf(c_0_64,plain,
( ~ precedes(X1,X2)
| earlier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_65,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| leaf(esk18_1(X1),tptp0)
| leaf_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_19]) ).
cnf(c_0_66,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk18_1(X1),tptp1)
| occurrence_of(esk18_1(X1),tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_67,plain,
! [X171,X172,X174,X175,X176,X177] :
( ( leaf(X175,X176)
| min_precedes(X175,esk7_2(X175,X176),X176)
| ~ min_precedes(X177,X175,X176) )
& ( leaf(X175,X176)
| min_precedes(X175,esk7_2(X175,X176),X176)
| ~ root(X175,X176) )
& ( ~ leaf(X171,X172)
| ~ min_precedes(X171,X174,X172) )
& ( ~ leaf(X171,X172)
| min_precedes(esk6_2(X171,X172),X171,X172)
| root(X171,X172) ) ),
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_21])])])])])])]) ).
cnf(c_0_68,negated_conjecture,
( ~ occurrence_of(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)),X1)
| min_precedes(esk19_0,esk18_1(esk19_0),X1)
| min_precedes(esk18_1(esk19_0),esk19_0,X1)
| esk18_1(esk19_0) = esk19_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_23])]) ).
cnf(c_0_69,plain,
( ~ earlier(X2,X3)
| ~ earlier(X1,X2)
| earlier(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_70,negated_conjecture,
earlier(esk17_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_64,c_0_41]) ).
cnf(c_0_71,negated_conjecture,
precedes(esk16_1(esk19_0),esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_33,c_0_45]) ).
cnf(c_0_72,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk19_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_73,negated_conjecture,
leaf(esk18_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_74,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| occurrence_of(esk18_1(X1),tptp2)
| occurrence_of(esk18_1(X1),tptp1)
| leaf_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_66,c_0_19]) ).
cnf(c_0_75,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk19_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_76,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk16_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_77,plain,
! [X9,X10] :
( earlier(X9,X10)
=> ~ earlier(X10,X9) ),
inference(fof_simplification,[status(thm)],[sos_04]) ).
fof(c_0_78,plain,
! [X160,X161,X162,X163] :
( min_precedes(X161,X162,X163)
| ~ precedes(X161,X162)
| ~ min_precedes(X160,X162,X163)
| ~ min_precedes(X160,X161,X163) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_18])])]) ).
cnf(c_0_79,plain,
( ~ leaf(X1,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_80,negated_conjecture,
( min_precedes(esk18_1(esk19_0),esk19_0,tptp0)
| min_precedes(esk19_0,esk18_1(esk19_0),tptp0)
| esk18_1(esk19_0) = esk19_0 ),
inference(spm,[status(thm)],[c_0_68,c_0_52]) ).
cnf(c_0_81,negated_conjecture,
( ~ earlier(X1,esk17_1(esk19_0))
| earlier(X1,esk18_1(esk19_0)) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_82,negated_conjecture,
earlier(esk16_1(esk19_0),esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_64,c_0_71]) ).
cnf(c_0_83,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(esk18_1(esk19_0),tptp1)
| ~ min_precedes(X1,esk18_1(esk19_0),tptp0)
| ~ next_subocc(esk19_0,X1,tptp0) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_84,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp1)
| occurrence_of(esk18_1(esk19_0),tptp2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_85,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(esk18_1(esk19_0),tptp2)
| ~ min_precedes(X1,esk18_1(esk19_0),tptp0)
| ~ next_subocc(esk19_0,X1,tptp0) ),
inference(spm,[status(thm)],[c_0_75,c_0_73]) ).
cnf(c_0_86,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| occurrence_of(esk16_1(X1),tptp3)
| leaf_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_76,c_0_19]) ).
fof(c_0_87,plain,
! [X123,X124] :
( ~ earlier(X124,X123)
| ~ earlier(X123,X124) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_77])])]) ).
cnf(c_0_88,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_78]) ).
cnf(c_0_89,negated_conjecture,
( min_precedes(esk19_0,esk18_1(esk19_0),tptp0)
| esk18_1(esk19_0) = esk19_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_73])]) ).
cnf(c_0_90,plain,
( ~ legal(X2)
| ~ earlier(X1,X2)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_91,negated_conjecture,
earlier(esk16_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_92,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ min_precedes(X1,esk18_1(esk19_0),tptp0)
| ~ next_subocc(esk19_0,X1,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]) ).
cnf(c_0_93,negated_conjecture,
occurrence_of(esk16_1(esk19_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_94,plain,
( ~ earlier(X2,X1)
| ~ earlier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_95,negated_conjecture,
( ~ precedes(X1,esk18_1(esk19_0))
| ~ min_precedes(esk19_0,X1,tptp0)
| min_precedes(X1,esk18_1(esk19_0),tptp0)
| esk18_1(esk19_0) = esk19_0 ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_96,negated_conjecture,
precedes(esk16_1(esk19_0),esk18_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_50])]) ).
cnf(c_0_97,negated_conjecture,
~ min_precedes(esk16_1(esk19_0),esk18_1(esk19_0),tptp0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_36])]) ).
cnf(c_0_98,negated_conjecture,
precedes(esk19_0,esk16_1(esk19_0)),
inference(spm,[status(thm)],[c_0_33,c_0_43]) ).
cnf(c_0_99,negated_conjecture,
~ earlier(esk18_1(esk19_0),esk16_1(esk19_0)),
inference(spm,[status(thm)],[c_0_94,c_0_91]) ).
cnf(c_0_100,negated_conjecture,
esk18_1(esk19_0) = esk19_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_43])]),c_0_97]) ).
cnf(c_0_101,negated_conjecture,
earlier(esk19_0,esk16_1(esk19_0)),
inference(spm,[status(thm)],[c_0_64,c_0_98]) ).
cnf(c_0_102,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_100]),c_0_101])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO014+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n006.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:42:27 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 2.97/0.80 % Version: 3.5.1
% 2.97/0.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.97/0.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.97/0.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.97/0.80 % Starting new_bool_3 with 300s (1) cores
% 2.97/0.80 % Starting new_bool_1 with 300s (1) cores
% 2.97/0.80 % Starting sh5l with 300s (1) cores
% 2.97/0.80 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1933506 completed with status 0
% 2.97/0.80 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.97/0.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.97/0.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.97/0.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.97/0.80 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.97/0.80 % No SInE strategy applied
% 2.97/0.80 % Search class: FGHSF-FFMM32-SFFFFFNN
% 2.97/0.80 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.97/0.80 % Starting SubtermCWHack with 136s (1) cores
% 2.97/0.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.97/0.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 2.97/0.80 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 2.97/0.80 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 2.97/0.80 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 1933522 completed with status 0
% 2.97/0.80 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 2.97/0.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.97/0.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.97/0.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.97/0.80 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.97/0.80 % No SInE strategy applied
% 2.97/0.80 % Search class: FGHSF-FFMM32-SFFFFFNN
% 2.97/0.80 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.97/0.80 % Starting SubtermCWHack with 136s (1) cores
% 2.97/0.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.97/0.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 2.97/0.80 % Preprocessing time : 0.001 s
% 2.97/0.80 % Presaturation interreduction done
% 2.97/0.80
% 2.97/0.80 % Proof found!
% 2.97/0.80 % SZS status Theorem
% 2.97/0.80 % SZS output start CNFRefutation
% See solution above
% 2.97/0.80 % Parsed axioms : 49
% 2.97/0.80 % Removed by relevancy pruning/SinE : 0
% 2.97/0.80 % Initial clauses : 91
% 2.97/0.80 % Removed in clause preprocessing : 0
% 2.97/0.80 % Initial clauses in saturation : 91
% 2.97/0.80 % Processed clauses : 3664
% 2.97/0.80 % ...of these trivial : 56
% 2.97/0.80 % ...subsumed : 1092
% 2.97/0.80 % ...remaining for further processing : 2516
% 2.97/0.80 % Other redundant clauses eliminated : 0
% 2.97/0.80 % Clauses deleted for lack of memory : 0
% 2.97/0.80 % Backward-subsumed : 26
% 2.97/0.80 % Backward-rewritten : 609
% 2.97/0.80 % Generated clauses : 11105
% 2.97/0.80 % ...of the previous two non-redundant : 10298
% 2.97/0.80 % ...aggressively subsumed : 0
% 2.97/0.80 % Contextual simplify-reflections : 38
% 2.97/0.80 % Paramodulations : 11101
% 2.97/0.80 % Factorizations : 4
% 2.97/0.80 % NegExts : 0
% 2.97/0.80 % Equation resolutions : 0
% 2.97/0.80 % Disequality decompositions : 0
% 2.97/0.80 % Total rewrite steps : 3454
% 2.97/0.80 % ...of those cached : 3183
% 2.97/0.80 % Propositional unsat checks : 0
% 2.97/0.80 % Propositional check models : 0
% 2.97/0.80 % Propositional check unsatisfiable : 0
% 2.97/0.80 % Propositional clauses : 0
% 2.97/0.80 % Propositional clauses after purity: 0
% 2.97/0.80 % Propositional unsat core size : 0
% 2.97/0.80 % Propositional preprocessing time : 0.000
% 2.97/0.80 % Propositional encoding time : 0.000
% 2.97/0.80 % Propositional solver time : 0.000
% 2.97/0.80 % Success case prop preproc time : 0.000
% 2.97/0.80 % Success case prop encoding time : 0.000
% 2.97/0.80 % Success case prop solver time : 0.000
% 2.97/0.80 % Current number of processed clauses : 1790
% 2.97/0.80 % Positive orientable unit clauses : 454
% 2.97/0.80 % Positive unorientable unit clauses: 0
% 2.97/0.80 % Negative unit clauses : 89
% 2.97/0.80 % Non-unit-clauses : 1247
% 2.97/0.80 % Current number of unprocessed clauses: 6013
% 2.97/0.80 % ...number of literals in the above : 18850
% 2.97/0.80 % Current number of archived formulas : 0
% 2.97/0.80 % Current number of archived clauses : 726
% 2.97/0.80 % Clause-clause subsumption calls (NU) : 173848
% 2.97/0.80 % Rec. Clause-clause subsumption calls : 97458
% 2.97/0.80 % Non-unit clause-clause subsumptions : 948
% 2.97/0.80 % Unit Clause-clause subsumption calls : 6273
% 2.97/0.80 % Rewrite failures with RHS unbound : 0
% 2.97/0.80 % BW rewrite match attempts : 413
% 2.97/0.80 % BW rewrite match successes : 51
% 2.97/0.80 % Condensation attempts : 0
% 2.97/0.80 % Condensation successes : 0
% 2.97/0.80 % Termbank termtop insertions : 271699
% 2.97/0.80 % Search garbage collected termcells : 1419
% 2.97/0.80
% 2.97/0.80 % -------------------------------------------------
% 2.97/0.80 % User time : 0.309 s
% 2.97/0.80 % System time : 0.012 s
% 2.97/0.80 % Total time : 0.321 s
% 2.97/0.80 % Maximum resident set size: 4004 pages
% 2.97/0.80
% 2.97/0.80 % -------------------------------------------------
% 2.97/0.80 % User time : 1.643 s
% 2.97/0.80 % System time : 0.061 s
% 2.97/0.80 % Total time : 1.705 s
% 2.97/0.80 % Maximum resident set size: 4608 pages
% 2.97/0.80 % E exiting
%------------------------------------------------------------------------------