%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO009+3 : 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 : n026.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:32 PM UTC 2026
% Result : Theorem 0.29s 0.48s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 87 ( 26 unt; 0 def)
% Number of atoms : 275 ( 12 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 311 ( 123 ~; 119 |; 53 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 158 ( 5 sgn 88 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( leaf_occ(X168,X166)
& min_precedes(X167,X168,tptp0)
& ( occurrence_of(X168,tptp1)
| occurrence_of(X168,tptp2) )
& root_occ(X167,X166)
& occurrence_of(X167,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_49,axiom,
! [X162] :
( occurrence_of(X162,tptp0)
=> ? [X163,X164,X165] :
( leaf_occ(X165,X162)
& next_subocc(X164,X165,tptp0)
& ( occurrence_of(X165,tptp1)
| occurrence_of(X165,tptp2) )
& next_subocc(X163,X164,tptp0)
& occurrence_of(X164,tptp4)
& root_occ(X163,X162)
& occurrence_of(X163,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_49) ).
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_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X7)
& occurrence_of(X5,X6) )
=> X6 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
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/sandbox/benchmark/theBenchmark.p',sos_34) ).
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_14,axiom,
! [X36,X37,X38] :
( min_precedes(X36,X37,X38)
=> ~ root(X37,X38) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_14) ).
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_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_42,axiom,
! [X135,X136,X137,X138] :
( ( ~ min_precedes(X138,X137,X135)
& arboreal(X137)
& root_occ(X138,X136)
& subactivity_occurrence(X137,X136)
& occurrence_of(X136,X135) )
=> X138 = X137 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_42) ).
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_44,axiom,
! [X143,X144,X145] :
( next_subocc(X143,X144,X145)
=> ( arboreal(X144)
& arboreal(X143) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_44) ).
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,
~ ! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( leaf_occ(X168,X166)
& min_precedes(X167,X168,tptp0)
& ( occurrence_of(X168,tptp1)
| occurrence_of(X168,tptp2) )
& root_occ(X167,X166)
& occurrence_of(X167,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_14,plain,
! [X347] :
( ( ~ occurrence_of(X347,tptp0)
| leaf_occ(esk19_1(X347),X347) )
& ( ~ occurrence_of(X347,tptp0)
| next_subocc(esk18_1(X347),esk19_1(X347),tptp0) )
& ( ~ occurrence_of(X347,tptp0)
| occurrence_of(esk19_1(X347),tptp1)
| occurrence_of(esk19_1(X347),tptp2) )
& ( ~ occurrence_of(X347,tptp0)
| next_subocc(esk17_1(X347),esk18_1(X347),tptp0) )
& ( ~ occurrence_of(X347,tptp0)
| occurrence_of(esk18_1(X347),tptp4) )
& ( ~ occurrence_of(X347,tptp0)
| root_occ(esk17_1(X347),X347) )
& ( ~ occurrence_of(X347,tptp0)
| occurrence_of(esk17_1(X347),tptp3) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_49])])])])]) ).
fof(c_0_15,negated_conjecture,
! [X352,X353] :
( ( ~ leaf_occ(X353,esk20_0)
| ~ min_precedes(X352,X353,tptp0)
| ~ root_occ(X352,esk20_0)
| ~ occurrence_of(X352,tptp3)
| ~ occurrence_of(X353,tptp1) )
& ( ~ leaf_occ(X353,esk20_0)
| ~ min_precedes(X352,X353,tptp0)
| ~ root_occ(X352,esk20_0)
| ~ occurrence_of(X352,tptp3)
| ~ occurrence_of(X353,tptp2) )
& 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_13])])])])])]) ).
fof(c_0_16,plain,
! [X233,X234,X235,X236,X237,X238,X239] :
( ( next_subocc(X237,X238,X239)
| ~ min_precedes(X237,X238,X239)
| min_precedes(esk8_3(X237,X238,X239),X238,X239) )
& ( next_subocc(X237,X238,X239)
| ~ min_precedes(X237,X238,X239)
| min_precedes(X237,esk8_3(X237,X238,X239),X239) )
& ( ~ next_subocc(X233,X234,X235)
| ~ min_precedes(X236,X234,X235)
| ~ min_precedes(X233,X236,X235) )
& ( ~ next_subocc(X233,X234,X235)
| min_precedes(X233,X234,X235) ) ),
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_17,plain,
( ~ occurrence_of(X1,tptp0)
| next_subocc(esk18_1(X1),esk19_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
occurrence_of(esk20_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X173,X174,X175] :
( X174 = X175
| ~ occurrence_of(X173,X175)
| ~ occurrence_of(X173,X174) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
fof(c_0_20,plain,
! [X285,X286,X288,X289,X290] :
( ( leaf_occ(X288,X289)
| ~ leaf(X288,X290)
| ~ subactivity_occurrence(X288,X289)
| ~ occurrence_of(X289,X290) )
& ( ~ leaf_occ(X285,X286)
| leaf(X285,esk15_2(X285,X286)) )
& ( ~ leaf_occ(X285,X286)
| subactivity_occurrence(X285,X286) )
& ( ~ leaf_occ(X285,X286)
| occurrence_of(X286,esk15_2(X285,X286)) ) ),
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_21,plain,
( ~ occurrence_of(X1,tptp0)
| leaf_occ(esk19_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X207,X208,X209] :
( precedes(X207,X208)
| ~ min_precedes(X207,X208,X209) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])])]) ).
cnf(c_0_23,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
next_subocc(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( ~ occurrence_of(X1,tptp0)
| next_subocc(esk17_1(X1),esk18_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( ~ leaf_occ(X2,X1)
| occurrence_of(X1,esk15_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
leaf_occ(esk19_1(esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
fof(c_0_29,plain,
! [X36,X37,X38] :
( min_precedes(X36,X37,X38)
=> ~ root(X37,X38) ),
inference(fof_simplification,[status(thm)],[sos_14]) ).
fof(c_0_30,plain,
! [X190,X191] :
( ( precedes(X190,X191)
| ~ legal(X191)
| ~ earlier(X190,X191) )
& ( ~ precedes(X190,X191)
| legal(X191) )
& ( ~ precedes(X190,X191)
| earlier(X190,X191) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])])]) ).
cnf(c_0_31,plain,
( ~ min_precedes(X1,X2,X3)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
min_precedes(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
next_subocc(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_34,negated_conjecture,
( ~ occurrence_of(esk20_0,X1)
| X1 = tptp0 ),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_35,negated_conjecture,
occurrence_of(esk20_0,esk15_2(esk19_1(esk20_0),esk20_0)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_36,plain,
! [X204,X205,X206] :
( ~ root(X205,X206)
| ~ min_precedes(X204,X205,X206) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
fof(c_0_37,plain,
! [X179,X180,X181] :
( earlier(X179,X181)
| ~ earlier(X180,X181)
| ~ earlier(X179,X180) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])])]) ).
cnf(c_0_38,plain,
( ~ precedes(X1,X2)
| earlier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,negated_conjecture,
precedes(esk18_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
min_precedes(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_23,c_0_33]) ).
fof(c_0_41,plain,
! [X135,X136,X137,X138] :
( ( ~ min_precedes(X138,X137,X135)
& arboreal(X137)
& root_occ(X138,X136)
& subactivity_occurrence(X137,X136)
& occurrence_of(X136,X135) )
=> X138 = X137 ),
inference(fof_simplification,[status(thm)],[sos_42]) ).
fof(c_0_42,plain,
! [X225,X226,X228,X229,X230,X231] :
( ( leaf(X229,X230)
| min_precedes(X229,esk7_2(X229,X230),X230)
| ~ min_precedes(X231,X229,X230) )
& ( leaf(X229,X230)
| min_precedes(X229,esk7_2(X229,X230),X230)
| ~ root(X229,X230) )
& ( ~ leaf(X225,X226)
| ~ min_precedes(X225,X228,X226) )
& ( ~ leaf(X225,X226)
| min_precedes(esk6_2(X225,X226),X225,X226)
| root(X225,X226) ) ),
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_43,plain,
( ~ leaf_occ(X1,X2)
| leaf(X1,esk15_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_44,negated_conjecture,
esk15_2(esk19_1(esk20_0),esk20_0) = tptp0,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
( ~ root(X2,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,plain,
( ~ earlier(X2,X3)
| ~ earlier(X1,X2)
| earlier(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_47,negated_conjecture,
earlier(esk18_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_48,negated_conjecture,
precedes(esk17_1(esk20_0),esk18_1(esk20_0)),
inference(spm,[status(thm)],[c_0_31,c_0_40]) ).
cnf(c_0_49,negated_conjecture,
( ~ leaf_occ(X1,esk20_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk20_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_50,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk19_1(X1),tptp1)
| occurrence_of(esk19_1(X1),tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_51,negated_conjecture,
( ~ leaf_occ(X1,esk20_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk20_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_52,plain,
! [X320,X321,X322,X323] :
( X323 = X322
| min_precedes(X323,X322,X320)
| ~ arboreal(X322)
| ~ root_occ(X323,X321)
| ~ subactivity_occurrence(X322,X321)
| ~ occurrence_of(X321,X320) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])]) ).
cnf(c_0_53,plain,
( ~ occurrence_of(X1,tptp0)
| root_occ(esk17_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_54,plain,
! [X328,X329,X330] :
( ( ~ next_subocc(X328,X329,X330)
| arboreal(X329) )
& ( ~ next_subocc(X328,X329,X330)
| arboreal(X328) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_44])])])]) ).
fof(c_0_55,plain,
! [X214,X215,X216,X217] :
( min_precedes(X215,X216,X217)
| ~ precedes(X215,X216)
| ~ min_precedes(X214,X216,X217)
| ~ min_precedes(X214,X215,X217) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_18])])]) ).
cnf(c_0_56,plain,
( ~ leaf(X1,X2)
| min_precedes(esk6_2(X1,X2),X1,X2)
| root(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_57,negated_conjecture,
leaf(esk19_1(esk20_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_28]),c_0_44]) ).
cnf(c_0_58,negated_conjecture,
~ root(esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_45,c_0_32]) ).
cnf(c_0_59,negated_conjecture,
( ~ earlier(X1,esk18_1(esk20_0))
| earlier(X1,esk19_1(esk20_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_60,negated_conjecture,
earlier(esk17_1(esk20_0),esk18_1(esk20_0)),
inference(spm,[status(thm)],[c_0_38,c_0_48]) ).
cnf(c_0_61,plain,
( ~ precedes(X2,X1)
| legal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_62,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(esk19_1(esk20_0),tptp1)
| ~ min_precedes(X1,esk19_1(esk20_0),tptp0)
| ~ root_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_28]) ).
cnf(c_0_63,negated_conjecture,
( occurrence_of(esk19_1(esk20_0),tptp2)
| occurrence_of(esk19_1(esk20_0),tptp1) ),
inference(spm,[status(thm)],[c_0_50,c_0_18]) ).
cnf(c_0_64,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(esk19_1(esk20_0),tptp2)
| ~ min_precedes(X1,esk19_1(esk20_0),tptp0)
| ~ root_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_28]) ).
cnf(c_0_65,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk17_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_66,plain,
( ~ arboreal(X3)
| ~ root_occ(X4,X1)
| ~ subactivity_occurrence(X3,X1)
| ~ occurrence_of(X1,X2)
| X4 = X3
| min_precedes(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_67,negated_conjecture,
root_occ(esk17_1(esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_53,c_0_18]) ).
cnf(c_0_68,plain,
( ~ leaf_occ(X1,X2)
| subactivity_occurrence(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_69,plain,
( ~ next_subocc(X2,X1,X3)
| arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_70,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_55]) ).
cnf(c_0_71,negated_conjecture,
min_precedes(esk6_2(esk19_1(esk20_0),tptp0),esk19_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_72,plain,
( ~ legal(X2)
| ~ earlier(X1,X2)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_73,negated_conjecture,
earlier(esk17_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_74,negated_conjecture,
legal(esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_61,c_0_39]) ).
cnf(c_0_75,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| ~ min_precedes(X1,esk19_1(esk20_0),tptp0)
| ~ root_occ(X1,esk20_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_76,negated_conjecture,
occurrence_of(esk17_1(esk20_0),tptp3),
inference(spm,[status(thm)],[c_0_65,c_0_18]) ).
cnf(c_0_77,negated_conjecture,
( ~ occurrence_of(esk20_0,X2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| min_precedes(esk17_1(esk20_0),X1,X2)
| X1 = esk17_1(esk20_0) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_78,negated_conjecture,
subactivity_occurrence(esk19_1(esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_68,c_0_28]) ).
cnf(c_0_79,negated_conjecture,
arboreal(esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_69,c_0_24]) ).
cnf(c_0_80,negated_conjecture,
( ~ precedes(X1,esk19_1(esk20_0))
| ~ min_precedes(esk6_2(esk19_1(esk20_0),tptp0),X1,tptp0)
| min_precedes(X1,esk19_1(esk20_0),tptp0) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_81,negated_conjecture,
precedes(esk17_1(esk20_0),esk19_1(esk20_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_82,negated_conjecture,
~ min_precedes(esk17_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_67]),c_0_76])]) ).
cnf(c_0_83,negated_conjecture,
( ~ occurrence_of(esk20_0,X1)
| min_precedes(esk17_1(esk20_0),esk19_1(esk20_0),X1)
| esk17_1(esk20_0) = esk19_1(esk20_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]) ).
cnf(c_0_84,negated_conjecture,
~ min_precedes(esk6_2(esk19_1(esk20_0),tptp0),esk17_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).
cnf(c_0_85,negated_conjecture,
esk17_1(esk20_0) = esk19_1(esk20_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_18]),c_0_82]) ).
cnf(c_0_86,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO009+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.37 % Computer : n026.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Mon Sep 21 03:45:07 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.42 Running first-order theorem proving
% 0.08/0.42 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
% 0.29/0.48 % Version: 3.5.1
% 0.29/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.29/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.29/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.48 % Starting sh5l with 300s (1) cores
% 0.29/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1289684 completed with status 0
% 0.29/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.29/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.29/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.29/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.48 % No SInE strategy applied
% 0.29/0.48 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.29/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.29/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.29/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.29/0.48 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.29/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 1289693 completed with status 0
% 0.29/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.29/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.29/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.29/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.48 % No SInE strategy applied
% 0.29/0.48 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.29/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.29/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.29/0.48 % Preprocessing time : 0.002 s
% 0.29/0.48 % Presaturation interreduction done
% 0.29/0.48
% 0.29/0.48 % Proof found!
% 0.29/0.48 % SZS status Theorem
% 0.29/0.48 % SZS output start CNFRefutation
% See solution above
% 0.29/0.48 % Parsed axioms : 63
% 0.29/0.48 % Removed by relevancy pruning/SinE : 0
% 0.29/0.48 % Initial clauses : 104
% 0.29/0.48 % Removed in clause preprocessing : 0
% 0.29/0.48 % Initial clauses in saturation : 104
% 0.29/0.48 % Processed clauses : 544
% 0.29/0.48 % ...of these trivial : 8
% 0.29/0.48 % ...subsumed : 36
% 0.29/0.48 % ...remaining for further processing : 500
% 0.29/0.48 % Other redundant clauses eliminated : 0
% 0.29/0.48 % Clauses deleted for lack of memory : 0
% 0.29/0.48 % Backward-subsumed : 2
% 0.29/0.48 % Backward-rewritten : 84
% 0.29/0.48 % Generated clauses : 809
% 0.29/0.48 % ...of the previous two non-redundant : 621
% 0.29/0.48 % ...aggressively subsumed : 0
% 0.29/0.48 % Contextual simplify-reflections : 1
% 0.29/0.48 % Paramodulations : 808
% 0.29/0.48 % Factorizations : 1
% 0.29/0.48 % NegExts : 0
% 0.29/0.48 % Equation resolutions : 0
% 0.29/0.48 % Disequality decompositions : 0
% 0.29/0.48 % Total rewrite steps : 266
% 0.29/0.48 % ...of those cached : 200
% 0.29/0.48 % Propositional unsat checks : 0
% 0.29/0.48 % Propositional check models : 0
% 0.29/0.48 % Propositional check unsatisfiable : 0
% 0.29/0.48 % Propositional clauses : 0
% 0.29/0.48 % Propositional clauses after purity: 0
% 0.29/0.48 % Propositional unsat core size : 0
% 0.29/0.48 % Propositional preprocessing time : 0.000
% 0.29/0.48 % Propositional encoding time : 0.000
% 0.29/0.48 % Propositional solver time : 0.000
% 0.29/0.48 % Success case prop preproc time : 0.000
% 0.29/0.48 % Success case prop encoding time : 0.000
% 0.29/0.48 % Success case prop solver time : 0.000
% 0.29/0.48 % Current number of processed clauses : 310
% 0.29/0.48 % Positive orientable unit clauses : 91
% 0.29/0.48 % Positive unorientable unit clauses: 0
% 0.29/0.48 % Negative unit clauses : 46
% 0.29/0.48 % Non-unit-clauses : 173
% 0.29/0.48 % Current number of unprocessed clauses: 244
% 0.29/0.48 % ...number of literals in the above : 531
% 0.29/0.48 % Current number of archived formulas : 0
% 0.29/0.48 % Current number of archived clauses : 190
% 0.29/0.48 % Clause-clause subsumption calls (NU) : 10130
% 0.29/0.48 % Rec. Clause-clause subsumption calls : 5554
% 0.29/0.48 % Non-unit clause-clause subsumptions : 19
% 0.29/0.48 % Unit Clause-clause subsumption calls : 2403
% 0.29/0.48 % Rewrite failures with RHS unbound : 0
% 0.29/0.48 % BW rewrite match attempts : 14
% 0.29/0.48 % BW rewrite match successes : 11
% 0.29/0.48 % Condensation attempts : 0
% 0.29/0.48 % Condensation successes : 0
% 0.29/0.48 % Termbank termtop insertions : 20280
% 0.29/0.48 % Search garbage collected termcells : 1879
% 0.29/0.48
% 0.29/0.48 % -------------------------------------------------
% 0.29/0.48 % User time : 0.028 s
% 0.29/0.48 % System time : 0.011 s
% 0.29/0.48 % Total time : 0.039 s
% 0.29/0.48 % Maximum resident set size: 4064 pages
% 0.29/0.48
% 0.29/0.48 % -------------------------------------------------
% 0.29/0.48 % User time : 0.108 s
% 0.29/0.48 % System time : 0.023 s
% 0.29/0.48 % Total time : 0.132 s
% 0.29/0.48 % Maximum resident set size: 5120 pages
% 0.29/0.48 % E exiting
%------------------------------------------------------------------------------