%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO014+3 : 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 : n005.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.22s 5.85s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 91 ( 30 unt; 0 def)
% Number of atoms : 352 ( 10 equ)
% Maximal formula atoms : 36 ( 3 avg)
% Number of connectives : 414 ( 153 ~; 164 |; 79 &)
% ( 4 <=>; 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 : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 146 ( 1 sgn 77 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X167,X168] :
( ( ~ leaf_occ(X167,X168)
& arboreal(X167)
& subactivity_occurrence(X167,X168)
& occurrence_of(X168,tptp0) )
=> ? [X169,X170] :
( leaf(X170,tptp0)
& min_precedes(X169,X170,tptp0)
& ( occurrence_of(X170,tptp1)
| occurrence_of(X170,tptp2) )
& next_subocc(X167,X169,tptp0)
& occurrence_of(X169,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_49,axiom,
! [X162,X163] :
( ( ~ leaf_occ(X162,X163)
& arboreal(X162)
& subactivity_occurrence(X162,X163)
& occurrence_of(X163,tptp0) )
=> ? [X164,X165,X166] :
( leaf(X166,tptp0)
& next_subocc(X165,X166,tptp0)
& ( occurrence_of(X166,tptp1)
| occurrence_of(X166,tptp2) )
& next_subocc(X164,X165,tptp0)
& occurrence_of(X165,tptp4)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X164,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_49) ).
fof(sos_45,axiom,
! [X146,X147] :
( ( ~ atomic(X147)
& leaf(X146,X147) )
=> ? [X148] :
( leaf_occ(X146,X148)
& occurrence_of(X148,X147) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_45) ).
fof(sos_51,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_51) ).
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/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(sos_43,axiom,
! [X139,X140,X141,X142] :
( ( ~ min_precedes(X141,X142,X139)
& arboreal(X141)
& leaf_occ(X142,X140)
& subactivity_occurrence(X141,X140)
& occurrence_of(X140,X139) )
=> X142 = X141 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_43) ).
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/sandbox2/benchmark/theBenchmark.p',sos_29) ).
fof(sos_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( leaf(X103,X105)
& subactivity_occurrence(X103,X104)
& occurrence_of(X104,X105) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(sos_15,axiom,
! [X39,X40,X41] :
( min_precedes(X39,X40,X41)
=> precedes(X39,X40) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_15) ).
fof(sos_55,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_55) ).
fof(sos_04,axiom,
! [X9,X10] :
( earlier(X9,X10)
=> ~ earlier(X10,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(sos_10,axiom,
! [X22,X23] :
( precedes(X22,X23)
<=> ( legal(X23)
& earlier(X22,X23) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10) ).
fof(c_0_13,negated_conjecture,
~ ! [X167,X168] :
( ( ~ leaf_occ(X167,X168)
& arboreal(X167)
& subactivity_occurrence(X167,X168)
& occurrence_of(X168,tptp0) )
=> ? [X169,X170] :
( leaf(X170,tptp0)
& min_precedes(X169,X170,tptp0)
& ( occurrence_of(X170,tptp1)
| occurrence_of(X170,tptp2) )
& next_subocc(X167,X169,tptp0)
& occurrence_of(X169,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_14,plain,
! [X162,X163] :
( ( ~ leaf_occ(X162,X163)
& arboreal(X162)
& subactivity_occurrence(X162,X163)
& occurrence_of(X163,tptp0) )
=> ? [X164,X165,X166] :
( leaf(X166,tptp0)
& next_subocc(X165,X166,tptp0)
& ( occurrence_of(X166,tptp1)
| occurrence_of(X166,tptp2) )
& next_subocc(X164,X165,tptp0)
& occurrence_of(X165,tptp4)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X164,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_49]) ).
fof(c_0_15,negated_conjecture,
~ ! [X167,X168] :
( ( ~ leaf_occ(X167,X168)
& arboreal(X167)
& subactivity_occurrence(X167,X168)
& occurrence_of(X168,tptp0) )
=> ? [X169,X170] :
( leaf(X170,tptp0)
& min_precedes(X169,X170,tptp0)
& ( occurrence_of(X170,tptp1)
| occurrence_of(X170,tptp2) )
& next_subocc(X167,X169,tptp0)
& occurrence_of(X169,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X349,X350] :
( ( leaf_occ(X349,X350)
| ~ arboreal(X349)
| ~ subactivity_occurrence(X349,X350)
| ~ occurrence_of(X350,tptp0)
| leaf(esk19_1(X349),tptp0) )
& ( leaf_occ(X349,X350)
| ~ arboreal(X349)
| ~ subactivity_occurrence(X349,X350)
| ~ occurrence_of(X350,tptp0)
| next_subocc(esk18_1(X349),esk19_1(X349),tptp0) )
& ( leaf_occ(X349,X350)
| ~ arboreal(X349)
| ~ subactivity_occurrence(X349,X350)
| ~ occurrence_of(X350,tptp0)
| occurrence_of(esk19_1(X349),tptp1)
| occurrence_of(esk19_1(X349),tptp2) )
& ( leaf_occ(X349,X350)
| ~ arboreal(X349)
| ~ subactivity_occurrence(X349,X350)
| ~ occurrence_of(X350,tptp0)
| next_subocc(esk17_1(X349),esk18_1(X349),tptp0) )
& ( leaf_occ(X349,X350)
| ~ arboreal(X349)
| ~ subactivity_occurrence(X349,X350)
| ~ occurrence_of(X350,tptp0)
| occurrence_of(esk18_1(X349),tptp4) )
& ( leaf_occ(X349,X350)
| ~ arboreal(X349)
| ~ subactivity_occurrence(X349,X350)
| ~ occurrence_of(X350,tptp0)
| next_subocc(X349,esk17_1(X349),tptp0) )
& ( leaf_occ(X349,X350)
| ~ arboreal(X349)
| ~ subactivity_occurrence(X349,X350)
| ~ occurrence_of(X350,tptp0)
| occurrence_of(esk17_1(X349),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,
! [X356,X357] :
( ( ~ leaf(X357,tptp0)
| ~ min_precedes(X356,X357,tptp0)
| ~ next_subocc(esk20_0,X356,tptp0)
| ~ occurrence_of(X356,tptp3)
| ~ occurrence_of(X357,tptp1) )
& ( ~ leaf(X357,tptp0)
| ~ min_precedes(X356,X357,tptp0)
| ~ next_subocc(esk20_0,X356,tptp0)
| ~ occurrence_of(X356,tptp3)
| ~ occurrence_of(X357,tptp2) )
& ~ leaf_occ(esk20_0,esk21_0)
& arboreal(esk20_0)
& subactivity_occurrence(esk20_0,esk21_0)
& occurrence_of(esk21_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(esk21_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk18_1(X1),esk19_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X146,X147] :
( ( ~ atomic(X147)
& leaf(X146,X147) )
=> ? [X148] :
( leaf_occ(X146,X148)
& occurrence_of(X148,X147) ) ),
inference(fof_simplification,[status(thm)],[sos_45]) ).
cnf(c_0_22,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| leaf(esk19_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_51]) ).
fof(c_0_24,plain,
! [X235,X236,X237,X238,X239,X240,X241] :
( ( next_subocc(X239,X240,X241)
| ~ min_precedes(X239,X240,X241)
| min_precedes(esk8_3(X239,X240,X241),X240,X241) )
& ( next_subocc(X239,X240,X241)
| ~ min_precedes(X239,X240,X241)
| min_precedes(X239,esk8_3(X239,X240,X241),X241) )
& ( ~ next_subocc(X235,X236,X237)
| ~ min_precedes(X238,X236,X237)
| ~ min_precedes(X235,X238,X237) )
& ( ~ next_subocc(X235,X236,X237)
| min_precedes(X235,X236,X237) ) ),
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_25,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
subactivity_occurrence(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
arboreal(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,negated_conjecture,
~ leaf_occ(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| next_subocc(esk18_1(X1),esk19_1(X1),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
fof(c_0_30,plain,
! [X333,X334] :
( ( atomic(X334)
| ~ leaf(X333,X334)
| leaf_occ(X333,esk16_2(X333,X334)) )
& ( atomic(X334)
| ~ leaf(X333,X334)
| occurrence_of(esk16_2(X333,X334),X334) ) ),
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_21])])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| leaf(esk19_1(X1),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
fof(c_0_32,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
fof(c_0_33,plain,
! [X139,X140,X141,X142] :
( ( ~ min_precedes(X141,X142,X139)
& arboreal(X141)
& leaf_occ(X142,X140)
& subactivity_occurrence(X141,X140)
& occurrence_of(X140,X139) )
=> X142 = X141 ),
inference(fof_simplification,[status(thm)],[sos_43]) ).
fof(c_0_34,plain,
! [X265,X266,X267,X268] :
( subactivity_occurrence(X265,X268)
| ~ subactivity_occurrence(X266,X268)
| ~ occurrence_of(X268,X267)
| ~ min_precedes(X265,X266,X267) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])]) ).
cnf(c_0_35,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,negated_conjecture,
next_subocc(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_37,negated_conjecture,
next_subocc(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_27])]),c_0_28]) ).
fof(c_0_38,plain,
! [X287,X288,X290,X291,X292] :
( ( leaf_occ(X290,X291)
| ~ leaf(X290,X292)
| ~ subactivity_occurrence(X290,X291)
| ~ occurrence_of(X291,X292) )
& ( ~ leaf_occ(X287,X288)
| leaf(X287,esk15_2(X287,X288)) )
& ( ~ leaf_occ(X287,X288)
| subactivity_occurrence(X287,X288) )
& ( ~ leaf_occ(X287,X288)
| occurrence_of(X288,esk15_2(X287,X288)) ) ),
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_34])])])])])])]) ).
cnf(c_0_39,plain,
( ~ leaf(X1,X2)
| atomic(X2)
| leaf_occ(X1,esk16_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,negated_conjecture,
leaf(esk19_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_41,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_42,plain,
! [X326,X327,X328,X329] :
( X329 = X328
| min_precedes(X328,X329,X326)
| ~ arboreal(X328)
| ~ leaf_occ(X329,X327)
| ~ subactivity_occurrence(X328,X327)
| ~ occurrence_of(X327,X326) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])]) ).
cnf(c_0_43,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_34]) ).
cnf(c_0_44,negated_conjecture,
min_precedes(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,plain,
( ~ leaf(X1,X2)
| atomic(X2)
| occurrence_of(esk16_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_46,negated_conjecture,
min_precedes(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_35,c_0_37]) ).
cnf(c_0_47,plain,
( ~ leaf_occ(X1,X2)
| subactivity_occurrence(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,negated_conjecture,
leaf_occ(esk19_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_49,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk17_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_50,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_42]) ).
cnf(c_0_51,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk18_1(esk20_0),X1)
| subactivity_occurrence(esk17_1(esk20_0),X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_40]),c_0_41]) ).
cnf(c_0_53,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk19_1(esk20_0),X1)
| subactivity_occurrence(esk18_1(esk20_0),X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_46]) ).
cnf(c_0_54,negated_conjecture,
subactivity_occurrence(esk19_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
fof(c_0_55,plain,
! [X187,X188] :
( ( ~ occurrence_of(X187,X188)
| arboreal(X187)
| ~ atomic(X188) )
& ( ~ occurrence_of(X187,X188)
| atomic(X188)
| ~ arboreal(X187) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).
cnf(c_0_56,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| occurrence_of(esk17_1(X1),tptp3)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_19]) ).
fof(c_0_57,plain,
! [X209,X210,X211] :
( precedes(X209,X210)
| ~ min_precedes(X209,X210,X211) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])])]) ).
cnf(c_0_58,negated_conjecture,
( ~ occurrence_of(esk16_2(esk19_1(esk20_0),tptp0),X2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk16_2(esk19_1(esk20_0),tptp0))
| min_precedes(X1,esk19_1(esk20_0),X2)
| X1 = esk19_1(esk20_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_48]) ).
cnf(c_0_59,negated_conjecture,
( ~ subactivity_occurrence(esk18_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0))
| subactivity_occurrence(esk17_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_60,negated_conjecture,
subactivity_occurrence(esk18_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_52]),c_0_54])]) ).
cnf(c_0_61,plain,
( ~ occurrence_of(X2,X1)
| ~ atomic(X1)
| arboreal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_62,negated_conjecture,
occurrence_of(esk17_1(esk20_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_63,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_55]) ).
cnf(c_0_64,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk17_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_65,plain,
! [X9,X10] :
( earlier(X9,X10)
=> ~ earlier(X10,X9) ),
inference(fof_simplification,[status(thm)],[sos_04]) ).
fof(c_0_66,plain,
! [X192,X193] :
( ( precedes(X192,X193)
| ~ legal(X193)
| ~ earlier(X192,X193) )
& ( ~ precedes(X192,X193)
| legal(X193) )
& ( ~ precedes(X192,X193)
| earlier(X192,X193) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])])]) ).
cnf(c_0_67,plain,
( ~ min_precedes(X1,X2,X3)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_68,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk16_2(esk19_1(esk20_0),tptp0))
| min_precedes(X1,esk19_1(esk20_0),tptp0)
| X1 = esk19_1(esk20_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_52]) ).
cnf(c_0_69,negated_conjecture,
subactivity_occurrence(esk17_1(esk20_0),esk16_2(esk19_1(esk20_0),tptp0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]) ).
cnf(c_0_70,negated_conjecture,
arboreal(esk17_1(esk20_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).
cnf(c_0_71,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| next_subocc(X1,esk17_1(X1),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_64,c_0_19]) ).
cnf(c_0_72,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk19_1(X1),tptp1)
| occurrence_of(esk19_1(X1),tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_73,plain,
! [X179,X180] :
( ~ earlier(X180,X179)
| ~ earlier(X179,X180) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])])]) ).
cnf(c_0_74,plain,
( ~ precedes(X1,X2)
| earlier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_75,negated_conjecture,
precedes(esk17_1(esk20_0),esk18_1(esk20_0)),
inference(spm,[status(thm)],[c_0_67,c_0_44]) ).
cnf(c_0_76,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk20_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_77,negated_conjecture,
( min_precedes(esk17_1(esk20_0),esk19_1(esk20_0),tptp0)
| esk17_1(esk20_0) = esk19_1(esk20_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
cnf(c_0_78,negated_conjecture,
next_subocc(esk20_0,esk17_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_79,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| occurrence_of(esk19_1(X1),tptp2)
| occurrence_of(esk19_1(X1),tptp1)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_72,c_0_19]) ).
cnf(c_0_80,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk20_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_81,plain,
( ~ earlier(X2,X1)
| ~ earlier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_82,negated_conjecture,
earlier(esk17_1(esk20_0),esk18_1(esk20_0)),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_83,negated_conjecture,
( ~ occurrence_of(esk19_1(esk20_0),tptp1)
| esk17_1(esk20_0) = esk19_1(esk20_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),c_0_40]),c_0_62])]) ).
cnf(c_0_84,negated_conjecture,
( occurrence_of(esk19_1(esk20_0),tptp1)
| occurrence_of(esk19_1(esk20_0),tptp2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_85,negated_conjecture,
( ~ occurrence_of(esk19_1(esk20_0),tptp2)
| esk17_1(esk20_0) = esk19_1(esk20_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_77]),c_0_78]),c_0_40]),c_0_62])]) ).
cnf(c_0_86,negated_conjecture,
precedes(esk18_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_67,c_0_46]) ).
cnf(c_0_87,negated_conjecture,
~ earlier(esk18_1(esk20_0),esk17_1(esk20_0)),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_88,negated_conjecture,
esk17_1(esk20_0) = esk19_1(esk20_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]) ).
cnf(c_0_89,negated_conjecture,
earlier(esk18_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_74,c_0_86]) ).
cnf(c_0_90,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88]),c_0_89])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : PRO014+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/5.46 % Computer : n005.cluster.edu
% 0.18/5.46 % Model : x86_64 x86_64
% 0.18/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.46 % Memory : 8046.5625MB
% 0.18/5.46 % OS : Linux 6.8.0-71-generic
% 0.18/5.46 % CPULimit : 300
% 0.18/5.46 % WCLimit : 300
% 0.18/5.46 % DateTime : Mon Sep 21 03:42:54 UTC 2026
% 0.18/5.46 % CPUTime :
% 0.18/5.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/5.50 Running first-order theorem proving
% 0.22/5.50 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.22/5.85 % Version: 3.5.1
% 0.22/5.85 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/5.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/5.85 % Starting new_bool_3 with 300s (1) cores
% 0.22/5.85 % Starting new_bool_1 with 300s (1) cores
% 0.22/5.85 % Starting sh5l with 300s (1) cores
% 0.22/5.85 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2470938 completed with status 0
% 0.22/5.85 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/5.85 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/5.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/5.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.85 % No SInE strategy applied
% 0.22/5.85 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.22/5.85 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.85 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.22/5.85 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.22/5.85 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.22/5.85 % G-E--_208_C18_F1_SE_CS_SP_PS_S2g with pid 2470947 completed with status 0
% 0.22/5.85 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2g
% 0.22/5.85 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/5.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/5.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.85 % No SInE strategy applied
% 0.22/5.85 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.22/5.85 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.85 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/5.85 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.22/5.85 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.22/5.85 % Preprocessing time : 0.003 s
% 0.22/5.85 % Presaturation interreduction done
% 0.22/5.85
% 0.22/5.85 % Proof found!
% 0.22/5.85 % SZS status Theorem
% 0.22/5.85 % SZS output start CNFRefutation
% See solution above
% 0.22/5.85 % Parsed axioms : 63
% 0.22/5.85 % Removed by relevancy pruning/SinE : 0
% 0.22/5.85 % Initial clauses : 107
% 0.22/5.85 % Removed in clause preprocessing : 0
% 0.22/5.85 % Initial clauses in saturation : 107
% 0.22/5.85 % Processed clauses : 2190
% 0.22/5.85 % ...of these trivial : 35
% 0.22/5.85 % ...subsumed : 357
% 0.22/5.85 % ...remaining for further processing : 1798
% 0.22/5.85 % Other redundant clauses eliminated : 0
% 0.22/5.85 % Clauses deleted for lack of memory : 0
% 0.22/5.85 % Backward-subsumed : 45
% 0.22/5.85 % Backward-rewritten : 387
% 0.22/5.85 % Generated clauses : 8497
% 0.22/5.85 % ...of the previous two non-redundant : 6569
% 0.22/5.85 % ...aggressively subsumed : 0
% 0.22/5.85 % Contextual simplify-reflections : 3
% 0.22/5.85 % Paramodulations : 8487
% 0.22/5.85 % Factorizations : 0
% 0.22/5.85 % NegExts : 0
% 0.22/5.85 % Equation resolutions : 0
% 0.22/5.85 % Disequality decompositions : 0
% 0.22/5.85 % Total rewrite steps : 2626
% 0.22/5.85 % ...of those cached : 2416
% 0.22/5.85 % Propositional unsat checks : 0
% 0.22/5.85 % Propositional check models : 0
% 0.22/5.85 % Propositional check unsatisfiable : 0
% 0.22/5.85 % Propositional clauses : 0
% 0.22/5.85 % Propositional clauses after purity: 0
% 0.22/5.85 % Propositional unsat core size : 0
% 0.22/5.85 % Propositional preprocessing time : 0.000
% 0.22/5.85 % Propositional encoding time : 0.000
% 0.22/5.85 % Propositional solver time : 0.000
% 0.22/5.85 % Success case prop preproc time : 0.000
% 0.22/5.85 % Success case prop encoding time : 0.000
% 0.22/5.85 % Success case prop solver time : 0.000
% 0.22/5.85 % Current number of processed clauses : 1249
% 0.22/5.85 % Positive orientable unit clauses : 296
% 0.22/5.85 % Positive unorientable unit clauses: 0
% 0.22/5.85 % Negative unit clauses : 150
% 0.22/5.85 % Non-unit-clauses : 803
% 0.22/5.85 % Current number of unprocessed clauses: 4345
% 0.22/5.85 % ...number of literals in the above : 13459
% 0.22/5.85 % Current number of archived formulas : 0
% 0.22/5.85 % Current number of archived clauses : 549
% 0.22/5.85 % Clause-clause subsumption calls (NU) : 109216
% 0.22/5.85 % Rec. Clause-clause subsumption calls : 68212
% 0.22/5.85 % Non-unit clause-clause subsumptions : 275
% 0.22/5.85 % Unit Clause-clause subsumption calls : 17909
% 0.22/5.85 % Rewrite failures with RHS unbound : 0
% 0.22/5.85 % BW rewrite match attempts : 119
% 0.22/5.85 % BW rewrite match successes : 41
% 0.22/5.85 % Condensation attempts : 0
% 0.22/5.85 % Condensation successes : 0
% 0.22/5.85 % Termbank termtop insertions : 196507
% 0.22/5.85 % Search garbage collected termcells : 1945
% 0.22/5.85
% 0.22/5.85 % -------------------------------------------------
% 0.22/5.85 % User time : 0.305 s
% 0.22/5.85 % System time : 0.018 s
% 0.22/5.85 % Total time : 0.323 s
% 0.22/5.85 % Maximum resident set size: 4068 pages
% 0.22/5.85
% 0.22/5.85 % -------------------------------------------------
% 0.22/5.85 % User time : 1.518 s
% 0.22/5.85 % System time : 0.085 s
% 0.22/5.85 % Total time : 1.603 s
% 0.22/5.85 % Maximum resident set size: 5120 pages
% 0.22/5.85 % E exiting
%------------------------------------------------------------------------------