%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO016+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 : 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:35 PM UTC 2026
% Result : Theorem 261.35s 34.06s
% Output : CNFRefutation 261.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 17
% Syntax : Number of formulae : 120 ( 28 unt; 0 def)
% Number of atoms : 550 ( 15 equ)
% Maximal formula atoms : 130 ( 4 avg)
% Number of connectives : 670 ( 240 ~; 294 |; 110 &)
% ( 5 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-3 aty)
% Number of variables : 194 ( 7 sgn 97 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X111,X112] :
( ( ~ leaf_occ(X111,X112)
& arboreal(X111)
& subactivity_occurrence(X111,X112)
& occurrence_of(X112,tptp0) )
=> ? [X113,X114] :
( ( occurrence_of(X114,tptp2)
=> ~ ? [X116] :
( min_precedes(X113,X116,tptp0)
& occurrence_of(X116,tptp1) ) )
& ( occurrence_of(X114,tptp1)
=> ~ ? [X115] :
( min_precedes(X113,X115,tptp0)
& occurrence_of(X115,tptp2) ) )
& leaf_occ(X114,X112)
& min_precedes(X113,X114,tptp0)
& ( occurrence_of(X114,tptp2)
| occurrence_of(X114,tptp1) )
& 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_occ(X110,X107)
& next_subocc(X109,X110,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& 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_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_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_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_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
fof(sos_38,axiom,
atomic(tptp4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_38) ).
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_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,axiom,
! [X1,X2] :
( occurrence_of(X2,X1)
=> ( activity_occurrence(X2)
& activity(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
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_01,axiom,
! [X3] :
( activity_occurrence(X3)
=> ? [X4] :
( occurrence_of(X3,X4)
& activity(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_01) ).
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_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_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_20,axiom,
! [X53,X54,X55,X56] :
( ( precedes(X54,X55)
& min_precedes(X55,X53,X56)
& min_precedes(X54,X53,X56) )
=> min_precedes(X54,X55,X56) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_20) ).
fof(c_0_17,negated_conjecture,
~ ! [X111,X112] :
( ( ~ leaf_occ(X111,X112)
& arboreal(X111)
& subactivity_occurrence(X111,X112)
& occurrence_of(X112,tptp0) )
=> ? [X113,X114] :
( ( occurrence_of(X114,tptp2)
=> ~ ? [X116] :
( min_precedes(X113,X116,tptp0)
& occurrence_of(X116,tptp1) ) )
& ( occurrence_of(X114,tptp1)
=> ~ ? [X115] :
( min_precedes(X113,X115,tptp0)
& occurrence_of(X115,tptp2) ) )
& leaf_occ(X114,X112)
& min_precedes(X113,X114,tptp0)
& ( occurrence_of(X114,tptp2)
| occurrence_of(X114,tptp1) )
& next_subocc(X111,X113,tptp0)
& occurrence_of(X113,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_18,plain,
! [X106,X107] :
( ( ~ leaf_occ(X106,X107)
& arboreal(X106)
& subactivity_occurrence(X106,X107)
& occurrence_of(X107,tptp0) )
=> ? [X108,X109,X110] :
( leaf_occ(X110,X107)
& next_subocc(X109,X110,tptp0)
& ( occurrence_of(X110,tptp2)
| occurrence_of(X110,tptp1) )
& 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_19,negated_conjecture,
~ ! [X111,X112] :
( ( ~ leaf_occ(X111,X112)
& arboreal(X111)
& subactivity_occurrence(X111,X112)
& occurrence_of(X112,tptp0) )
=> ? [X113,X114] :
( ( occurrence_of(X114,tptp2)
=> ~ ? [X116] :
( min_precedes(X113,X116,tptp0)
& occurrence_of(X116,tptp1) ) )
& ( occurrence_of(X114,tptp1)
=> ~ ? [X115] :
( min_precedes(X113,X115,tptp0)
& occurrence_of(X115,tptp2) ) )
& leaf_occ(X114,X112)
& min_precedes(X113,X114,tptp0)
& ( occurrence_of(X114,tptp2)
| occurrence_of(X114,tptp1) )
& next_subocc(X111,X113,tptp0)
& occurrence_of(X113,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X141,X142] :
( ( leaf_occ(X141,X142)
| ~ arboreal(X141)
| ~ subactivity_occurrence(X141,X142)
| ~ occurrence_of(X142,tptp0)
| leaf_occ(esk9_2(X141,X142),X142) )
& ( leaf_occ(X141,X142)
| ~ arboreal(X141)
| ~ subactivity_occurrence(X141,X142)
| ~ occurrence_of(X142,tptp0)
| next_subocc(esk8_2(X141,X142),esk9_2(X141,X142),tptp0) )
& ( leaf_occ(X141,X142)
| ~ arboreal(X141)
| ~ subactivity_occurrence(X141,X142)
| ~ occurrence_of(X142,tptp0)
| occurrence_of(esk9_2(X141,X142),tptp2)
| occurrence_of(esk9_2(X141,X142),tptp1) )
& ( leaf_occ(X141,X142)
| ~ arboreal(X141)
| ~ subactivity_occurrence(X141,X142)
| ~ occurrence_of(X142,tptp0)
| next_subocc(esk7_2(X141,X142),esk8_2(X141,X142),tptp0) )
& ( leaf_occ(X141,X142)
| ~ arboreal(X141)
| ~ subactivity_occurrence(X141,X142)
| ~ occurrence_of(X142,tptp0)
| occurrence_of(esk8_2(X141,X142),tptp4) )
& ( leaf_occ(X141,X142)
| ~ arboreal(X141)
| ~ subactivity_occurrence(X141,X142)
| ~ occurrence_of(X142,tptp0)
| next_subocc(X141,esk7_2(X141,X142),tptp0) )
& ( leaf_occ(X141,X142)
| ~ arboreal(X141)
| ~ subactivity_occurrence(X141,X142)
| ~ occurrence_of(X142,tptp0)
| occurrence_of(esk7_2(X141,X142),tptp3) ) ),
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_18])])])])]) ).
fof(c_0_21,negated_conjecture,
! [X119,X120] :
( ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp2)
| min_precedes(X119,esk3_2(X119,X120),tptp0)
| min_precedes(X119,esk4_2(X119,X120),tptp0) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp2)
| min_precedes(X119,esk3_2(X119,X120),tptp0)
| occurrence_of(esk4_2(X119,X120),tptp1) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp2)
| min_precedes(X119,esk3_2(X119,X120),tptp0)
| occurrence_of(X120,tptp2) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp2)
| occurrence_of(esk3_2(X119,X120),tptp2)
| min_precedes(X119,esk4_2(X119,X120),tptp0) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp2)
| occurrence_of(esk3_2(X119,X120),tptp2)
| occurrence_of(esk4_2(X119,X120),tptp1) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp2)
| occurrence_of(esk3_2(X119,X120),tptp2)
| occurrence_of(X120,tptp2) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp2)
| occurrence_of(X120,tptp1)
| min_precedes(X119,esk4_2(X119,X120),tptp0) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp2)
| occurrence_of(X120,tptp1)
| occurrence_of(esk4_2(X119,X120),tptp1) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp2)
| occurrence_of(X120,tptp1)
| occurrence_of(X120,tptp2) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp1)
| min_precedes(X119,esk3_2(X119,X120),tptp0)
| min_precedes(X119,esk4_2(X119,X120),tptp0) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp1)
| min_precedes(X119,esk3_2(X119,X120),tptp0)
| occurrence_of(esk4_2(X119,X120),tptp1) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp1)
| min_precedes(X119,esk3_2(X119,X120),tptp0)
| occurrence_of(X120,tptp2) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp1)
| occurrence_of(esk3_2(X119,X120),tptp2)
| min_precedes(X119,esk4_2(X119,X120),tptp0) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp1)
| occurrence_of(esk3_2(X119,X120),tptp2)
| occurrence_of(esk4_2(X119,X120),tptp1) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp1)
| occurrence_of(esk3_2(X119,X120),tptp2)
| occurrence_of(X120,tptp2) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp1)
| occurrence_of(X120,tptp1)
| min_precedes(X119,esk4_2(X119,X120),tptp0) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp1)
| occurrence_of(X120,tptp1)
| occurrence_of(esk4_2(X119,X120),tptp1) )
& ( ~ leaf_occ(X120,esk2_0)
| ~ min_precedes(X119,X120,tptp0)
| ~ next_subocc(esk1_0,X119,tptp0)
| ~ occurrence_of(X119,tptp3)
| ~ occurrence_of(X120,tptp1)
| occurrence_of(X120,tptp1)
| occurrence_of(X120,tptp2) )
& ~ leaf_occ(esk1_0,esk2_0)
& arboreal(esk1_0)
& subactivity_occurrence(esk1_0,esk2_0)
& occurrence_of(esk2_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_22,plain,
! [X149,X150,X152,X153,X154] :
( ( leaf_occ(X152,X153)
| ~ leaf(X152,X154)
| ~ subactivity_occurrence(X152,X153)
| ~ occurrence_of(X153,X154) )
& ( ~ leaf_occ(X149,X150)
| leaf(X149,esk10_2(X149,X150)) )
& ( ~ leaf_occ(X149,X150)
| subactivity_occurrence(X149,X150) )
& ( ~ leaf_occ(X149,X150)
| occurrence_of(X150,esk10_2(X149,X150)) ) ),
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_23,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| leaf_occ(esk9_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
subactivity_occurrence(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
arboreal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
occurrence_of(esk2_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
~ leaf_occ(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X137,X138,X139,X140] :
( subactivity_occurrence(X137,X140)
| ~ subactivity_occurrence(X138,X140)
| ~ occurrence_of(X140,X139)
| ~ min_precedes(X137,X138,X139) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])]) ).
cnf(c_0_29,plain,
( ~ leaf_occ(X1,X2)
| subactivity_occurrence(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
leaf_occ(esk9_2(esk1_0,esk2_0),esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
fof(c_0_31,plain,
! [X155,X156,X157,X158,X159,X160,X161] :
( ( next_subocc(X159,X160,X161)
| ~ min_precedes(X159,X160,X161)
| min_precedes(esk11_3(X159,X160,X161),X160,X161) )
& ( next_subocc(X159,X160,X161)
| ~ min_precedes(X159,X160,X161)
| min_precedes(X159,esk11_3(X159,X160,X161),X161) )
& ( ~ next_subocc(X155,X156,X157)
| ~ min_precedes(X158,X156,X157)
| ~ min_precedes(X155,X158,X157) )
& ( ~ next_subocc(X155,X156,X157)
| min_precedes(X155,X156,X157) ) ),
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_32,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk8_2(X1,X2),esk9_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,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_28]) ).
cnf(c_0_34,negated_conjecture,
subactivity_occurrence(esk9_2(esk1_0,esk2_0),esk2_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
next_subocc(esk8_2(esk1_0,esk2_0),esk9_2(esk1_0,esk2_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
fof(c_0_37,plain,
! [X163,X164] :
( ( ~ occurrence_of(X163,X164)
| arboreal(X163)
| ~ atomic(X164) )
& ( ~ occurrence_of(X163,X164)
| atomic(X164)
| ~ arboreal(X163) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).
cnf(c_0_38,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk8_2(X1,X2),tptp4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_39,negated_conjecture,
( ~ occurrence_of(esk2_0,X2)
| ~ min_precedes(X1,esk9_2(esk1_0,esk2_0),X2)
| subactivity_occurrence(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
min_precedes(esk8_2(esk1_0,esk2_0),esk9_2(esk1_0,esk2_0),tptp0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( ~ occurrence_of(X2,X1)
| ~ atomic(X1)
| arboreal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
occurrence_of(esk8_2(esk1_0,esk2_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_43,plain,
atomic(tptp4),
inference(split_conjunct,[status(thm)],[sos_38]) ).
cnf(c_0_44,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(esk7_2(X1,X2),esk8_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_45,negated_conjecture,
subactivity_occurrence(esk8_2(esk1_0,esk2_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_26])]) ).
cnf(c_0_46,negated_conjecture,
arboreal(esk8_2(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
fof(c_0_47,plain,
! [X233,X234,X235] :
( precedes(X233,X234)
| ~ min_precedes(X233,X234,X235) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])])]) ).
cnf(c_0_48,negated_conjecture,
( next_subocc(esk7_2(esk8_2(esk1_0,esk2_0),esk2_0),esk8_2(esk8_2(esk1_0,esk2_0),esk2_0),tptp0)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_26])]) ).
cnf(c_0_49,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk7_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_50,plain,
! [X146,X147,X148] :
( X147 = X148
| ~ occurrence_of(X146,X148)
| ~ occurrence_of(X146,X147) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
fof(c_0_51,plain,
! [X179,X180] :
( ( ~ occurrence_of(X180,X179)
| activity_occurrence(X180) )
& ( ~ occurrence_of(X180,X179)
| activity(X179) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])])]) ).
fof(c_0_52,plain,
! [X194,X195] :
( ( precedes(X194,X195)
| ~ legal(X195)
| ~ earlier(X194,X195) )
& ( ~ precedes(X194,X195)
| legal(X195) )
& ( ~ precedes(X194,X195)
| earlier(X194,X195) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])])]) ).
cnf(c_0_53,plain,
( ~ min_precedes(X1,X2,X3)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( min_precedes(esk7_2(esk8_2(esk1_0,esk2_0),esk2_0),esk8_2(esk8_2(esk1_0,esk2_0),esk2_0),tptp0)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
( next_subocc(esk8_2(esk1_0,esk2_0),esk7_2(esk8_2(esk1_0,esk2_0),esk2_0),tptp0)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_45]),c_0_46]),c_0_26])]) ).
cnf(c_0_56,negated_conjecture,
( next_subocc(esk8_2(esk8_2(esk1_0,esk2_0),esk2_0),esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),tptp0)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_45]),c_0_46]),c_0_26])]) ).
fof(c_0_57,plain,
! [X181] :
( ( ~ activity_occurrence(X181)
| occurrence_of(X181,esk14_1(X181)) )
& ( ~ activity_occurrence(X181)
| activity(esk14_1(X181)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_01])])])])]) ).
cnf(c_0_58,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_59,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_60,plain,
! [X227,X228,X229] :
( earlier(X227,X229)
| ~ earlier(X228,X229)
| ~ earlier(X227,X228) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])])]) ).
cnf(c_0_61,plain,
( ~ precedes(X1,X2)
| earlier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_62,negated_conjecture,
( precedes(esk7_2(esk8_2(esk1_0,esk2_0),esk2_0),esk8_2(esk8_2(esk1_0,esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_63,negated_conjecture,
( min_precedes(esk8_2(esk1_0,esk2_0),esk7_2(esk8_2(esk1_0,esk2_0),esk2_0),tptp0)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_55]) ).
fof(c_0_64,plain,
! [X165] :
( arboreal(X165)
| ~ legal(X165) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).
cnf(c_0_65,plain,
( ~ precedes(X2,X1)
| legal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_66,negated_conjecture,
precedes(esk8_2(esk1_0,esk2_0),esk9_2(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_53,c_0_40]) ).
cnf(c_0_67,negated_conjecture,
( min_precedes(esk8_2(esk8_2(esk1_0,esk2_0),esk2_0),esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),tptp0)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_56]) ).
cnf(c_0_68,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk14_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_69,plain,
( ~ leaf_occ(X2,X1)
| occurrence_of(X1,esk10_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_70,negated_conjecture,
( ~ occurrence_of(esk2_0,X1)
| X1 = tptp0 ),
inference(spm,[status(thm)],[c_0_58,c_0_26]) ).
cnf(c_0_71,negated_conjecture,
activity_occurrence(esk2_0),
inference(spm,[status(thm)],[c_0_59,c_0_26]) ).
cnf(c_0_72,negated_conjecture,
( leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0)
| leaf_occ(esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_45]),c_0_46]),c_0_26])]) ).
cnf(c_0_73,plain,
( ~ earlier(X2,X3)
| ~ earlier(X1,X2)
| earlier(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_74,negated_conjecture,
( earlier(esk7_2(esk8_2(esk1_0,esk2_0),esk2_0),esk8_2(esk8_2(esk1_0,esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_75,negated_conjecture,
( precedes(esk8_2(esk1_0,esk2_0),esk7_2(esk8_2(esk1_0,esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_63]) ).
fof(c_0_76,plain,
! [X166,X167,X168,X169] :
( X168 = X169
| min_precedes(X169,X168,X166)
| min_precedes(X168,X169,X166)
| ~ subactivity_occurrence(X169,X167)
| ~ subactivity_occurrence(X168,X167)
| ~ arboreal(X169)
| ~ arboreal(X168)
| ~ occurrence_of(X167,X166) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_28])])]) ).
cnf(c_0_77,plain,
( ~ legal(X1)
| arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_78,negated_conjecture,
legal(esk9_2(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_79,negated_conjecture,
( precedes(esk8_2(esk8_2(esk1_0,esk2_0),esk2_0),esk9_2(esk8_2(esk1_0,esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_67]) ).
cnf(c_0_80,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk14_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_68]),c_0_59]) ).
cnf(c_0_81,negated_conjecture,
occurrence_of(esk2_0,esk10_2(esk9_2(esk1_0,esk2_0),esk2_0)),
inference(spm,[status(thm)],[c_0_69,c_0_30]) ).
cnf(c_0_82,negated_conjecture,
esk14_1(esk2_0) = tptp0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_68]),c_0_71])]) ).
cnf(c_0_83,plain,
( ~ leaf_occ(X1,X2)
| leaf(X1,esk10_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_84,negated_conjecture,
( occurrence_of(esk2_0,esk10_2(esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_69,c_0_72]) ).
cnf(c_0_85,negated_conjecture,
( ~ earlier(X1,esk7_2(esk8_2(esk1_0,esk2_0),esk2_0))
| earlier(X1,esk8_2(esk8_2(esk1_0,esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_86,negated_conjecture,
( earlier(esk8_2(esk1_0,esk2_0),esk7_2(esk8_2(esk1_0,esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_61,c_0_75]) ).
cnf(c_0_87,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_76]) ).
cnf(c_0_88,negated_conjecture,
arboreal(esk9_2(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_89,negated_conjecture,
( legal(esk9_2(esk8_2(esk1_0,esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_65,c_0_79]) ).
fof(c_0_90,plain,
! [X184,X185,X187,X188,X189,X190] :
( ( leaf(X188,X189)
| min_precedes(X188,esk16_2(X188,X189),X189)
| ~ min_precedes(X190,X188,X189) )
& ( leaf(X188,X189)
| min_precedes(X188,esk16_2(X188,X189),X189)
| ~ root(X188,X189) )
& ( ~ leaf(X184,X185)
| ~ min_precedes(X184,X187,X185) )
& ( ~ leaf(X184,X185)
| min_precedes(esk15_2(X184,X185),X184,X185)
| root(X184,X185) ) ),
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_91,negated_conjecture,
esk10_2(esk9_2(esk1_0,esk2_0),esk2_0) = tptp0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).
cnf(c_0_92,negated_conjecture,
( leaf(esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),esk10_2(esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_83,c_0_72]) ).
cnf(c_0_93,negated_conjecture,
( leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0)
| esk10_2(esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),esk2_0) = tptp0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_84]),c_0_82]) ).
fof(c_0_94,plain,
! [X240,X241,X242,X243] :
( min_precedes(X241,X242,X243)
| ~ precedes(X241,X242)
| ~ min_precedes(X242,X240,X243)
| ~ min_precedes(X241,X240,X243) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_20])])]) ).
cnf(c_0_95,plain,
( ~ legal(X2)
| ~ earlier(X1,X2)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_96,negated_conjecture,
( earlier(esk8_2(esk1_0,esk2_0),esk8_2(esk8_2(esk1_0,esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_97,negated_conjecture,
( legal(esk8_2(esk8_2(esk1_0,esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_65,c_0_62]) ).
cnf(c_0_98,negated_conjecture,
( ~ occurrence_of(esk2_0,X2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk2_0)
| min_precedes(esk9_2(esk1_0,esk2_0),X1,X2)
| min_precedes(X1,esk9_2(esk1_0,esk2_0),X2)
| X1 = esk9_2(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_34]),c_0_88])]) ).
cnf(c_0_99,negated_conjecture,
( subactivity_occurrence(esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),esk2_0)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_72]) ).
cnf(c_0_100,negated_conjecture,
( arboreal(esk9_2(esk8_2(esk1_0,esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_77,c_0_89]) ).
cnf(c_0_101,plain,
( ~ leaf(X1,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_102,negated_conjecture,
leaf(esk9_2(esk1_0,esk2_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_30]),c_0_91]) ).
cnf(c_0_103,negated_conjecture,
( leaf(esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),tptp0)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_104,plain,
( ~ precedes(X1,X4)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X1,X2,X3)
| min_precedes(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_105,negated_conjecture,
( precedes(esk8_2(esk1_0,esk2_0),esk8_2(esk8_2(esk1_0,esk2_0),esk2_0))
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]) ).
cnf(c_0_106,plain,
( ~ next_subocc(X1,X4,X3)
| ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_107,negated_conjecture,
( ~ occurrence_of(esk2_0,X1)
| min_precedes(esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),esk9_2(esk1_0,esk2_0),X1)
| min_precedes(esk9_2(esk1_0,esk2_0),esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),X1)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0)
| esk9_2(esk8_2(esk1_0,esk2_0),esk2_0) = esk9_2(esk1_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]) ).
cnf(c_0_108,negated_conjecture,
~ min_precedes(esk9_2(esk1_0,esk2_0),X1,tptp0),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_109,negated_conjecture,
( ~ min_precedes(esk9_2(esk8_2(esk1_0,esk2_0),esk2_0),X1,tptp0)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_101,c_0_103]) ).
cnf(c_0_110,negated_conjecture,
( ~ min_precedes(esk8_2(esk1_0,esk2_0),X2,X1)
| ~ min_precedes(esk8_2(esk8_2(esk1_0,esk2_0),esk2_0),X2,X1)
| min_precedes(esk8_2(esk1_0,esk2_0),esk8_2(esk8_2(esk1_0,esk2_0),esk2_0),X1)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_111,negated_conjecture,
( ~ min_precedes(esk8_2(esk1_0,esk2_0),X1,tptp0)
| ~ min_precedes(X1,esk9_2(esk1_0,esk2_0),tptp0) ),
inference(spm,[status(thm)],[c_0_106,c_0_36]) ).
cnf(c_0_112,negated_conjecture,
( leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0)
| esk9_2(esk8_2(esk1_0,esk2_0),esk2_0) = esk9_2(esk1_0,esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_68]),c_0_82]),c_0_82]),c_0_71])]),c_0_108]),c_0_109]) ).
cnf(c_0_113,negated_conjecture,
( ~ min_precedes(esk8_2(esk8_2(esk1_0,esk2_0),esk2_0),esk9_2(esk1_0,esk2_0),tptp0)
| leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_40]),c_0_111]) ).
cnf(c_0_114,negated_conjecture,
leaf_occ(esk8_2(esk1_0,esk2_0),esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_112]),c_0_113]) ).
cnf(c_0_115,negated_conjecture,
occurrence_of(esk2_0,esk10_2(esk8_2(esk1_0,esk2_0),esk2_0)),
inference(spm,[status(thm)],[c_0_69,c_0_114]) ).
cnf(c_0_116,negated_conjecture,
esk10_2(esk8_2(esk1_0,esk2_0),esk2_0) = tptp0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_115]),c_0_82]) ).
cnf(c_0_117,negated_conjecture,
leaf(esk8_2(esk1_0,esk2_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_114]),c_0_116]) ).
cnf(c_0_118,negated_conjecture,
~ min_precedes(esk8_2(esk1_0,esk2_0),X1,tptp0),
inference(spm,[status(thm)],[c_0_101,c_0_117]) ).
cnf(c_0_119,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_40,c_0_118]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO016+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.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 03:43:02 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/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
% 261.35/34.06 % Version: 3.5.1
% 261.35/34.06 % Preprocessing class: FSLSSMSSSSSNFFN.
% 261.35/34.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 261.35/34.06 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 261.35/34.06 % Starting new_bool_3 with 300s (1) cores
% 261.35/34.06 % Starting new_bool_1 with 300s (1) cores
% 261.35/34.06 % Starting sh5l with 300s (1) cores
% 261.35/34.06 % new_bool_1 with pid 2471564 completed with status 0
% 261.35/34.06 % Result found by new_bool_1
% 261.35/34.06 % Preprocessing class: FSLSSMSSSSSNFFN.
% 261.35/34.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 261.35/34.06 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 261.35/34.06 % Starting new_bool_3 with 300s (1) cores
% 261.35/34.06 % Starting new_bool_1 with 300s (1) cores
% 261.35/34.06 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 261.35/34.06 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 261.35/34.06 % Search class: FGHSF-FFMM32-SFFFFFNN
% 261.35/34.06 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 261.35/34.06 % Starting SubtermCWHack with 28s (1) cores
% 261.35/34.06 % SubtermCWHack with pid 2471571 completed with status 8
% 261.35/34.06 % Starting new_bool_1 with 31s (1) cores
% 261.35/34.06 % new_bool_1 with pid 2471599 completed with status 0
% 261.35/34.06 % Result found by new_bool_1
% 261.35/34.06 % Preprocessing class: FSLSSMSSSSSNFFN.
% 261.35/34.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 261.35/34.06 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 261.35/34.06 % Starting new_bool_3 with 300s (1) cores
% 261.35/34.06 % Starting new_bool_1 with 300s (1) cores
% 261.35/34.06 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 261.35/34.06 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 261.35/34.06 % Search class: FGHSF-FFMM32-SFFFFFNN
% 261.35/34.06 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 261.35/34.06 % Starting SubtermCWHack with 28s (1) cores
% 261.35/34.06 % SubtermCWHack with pid 2471571 completed with status 8
% 261.35/34.06 % Starting new_bool_1 with 31s (1) cores
% 261.35/34.06 % Preprocessing time : 0.004 s
% 261.35/34.06 % Presaturation interreduction done
% 261.35/34.06
% 261.35/34.06 % Proof found!
% 261.35/34.06 % SZS status Theorem
% 261.35/34.06 % SZS output start CNFRefutation
% See solution above
% 261.35/34.06 % Parsed axioms : 49
% 261.35/34.06 % Removed by relevancy pruning/SinE : 1
% 261.35/34.06 % Initial clauses : 103
% 261.35/34.06 % Removed in clause preprocessing : 6
% 261.35/34.06 % Initial clauses in saturation : 97
% 261.35/34.06 % Processed clauses : 17564
% 261.35/34.06 % ...of these trivial : 330
% 261.35/34.06 % ...subsumed : 7782
% 261.35/34.06 % ...remaining for further processing : 9452
% 261.35/34.06 % Other redundant clauses eliminated : 0
% 261.35/34.06 % Clauses deleted for lack of memory : 0
% 261.35/34.06 % Backward-subsumed : 2727
% 261.35/34.06 % Backward-rewritten : 1439
% 261.35/34.06 % Generated clauses : 90284
% 261.35/34.06 % ...of the previous two non-redundant : 79240
% 261.35/34.06 % ...aggressively subsumed : 0
% 261.35/34.06 % Contextual simplify-reflections : 941
% 261.35/34.06 % Paramodulations : 90283
% 261.35/34.06 % Factorizations : 0
% 261.35/34.06 % NegExts : 0
% 261.35/34.06 % Equation resolutions : 0
% 261.35/34.06 % Disequality decompositions : 0
% 261.35/34.06 % Total rewrite steps : 40282
% 261.35/34.06 % ...of those cached : 39524
% 261.35/34.06 % Propositional unsat checks : 1
% 261.35/34.06 % Propositional check models : 0
% 261.35/34.06 % Propositional check unsatisfiable : 0
% 261.35/34.06 % Propositional clauses : 0
% 261.35/34.06 % Propositional clauses after purity: 0
% 261.35/34.06 % Propositional unsat core size : 0
% 261.35/34.06 % Propositional preprocessing time : 0.000
% 261.35/34.06 % Propositional encoding time : 0.028
% 261.35/34.06 % Propositional solver time : 0.041
% 261.35/34.06 % Success case prop preproc time : 0.000
% 261.35/34.06 % Success case prop encoding time : 0.000
% 261.35/34.06 % Success case prop solver time : 0.000
% 261.35/34.06 % Current number of processed clauses : 5188
% 261.35/34.06 % Positive orientable unit clauses : 861
% 261.35/34.06 % Positive unorientable unit clauses: 0
% 261.35/34.06 % Negative unit clauses : 329
% 261.35/34.06 % Non-unit-clauses : 3998
% 261.35/34.06 % Current number of unprocessed clauses: 59791
% 261.35/34.06 % ...number of literals in the above : 243658
% 261.35/34.06 % Current number of archived formulas : 0
% 261.35/34.06 % Current number of archived clauses : 4264
% 261.35/34.06 % Clause-clause subsumption calls (NU) : 2549685
% 261.35/34.06 % Rec. Clause-clause subsumption calls : 1074211
% 261.35/34.06 % Non-unit clause-clause subsumptions : 7755
% 261.35/34.06 % Unit Clause-clause subsumption calls : 227666
% 261.35/34.06 % Rewrite failures with RHS unbound : 0
% 261.35/34.06 % BW rewrite match attempts : 5040
% 261.35/34.06 % BW rewrite match successes : 430
% 261.35/34.06 % Condensation attempts : 0
% 261.35/34.06 % Condensation successes : 0
% 261.35/34.06 % Termbank termtop insertions : 3574229
% 261.35/34.06 % Search garbage collected termcells : 1465
% 261.35/34.06
% 261.35/34.06 % -------------------------------------------------
% 261.35/34.06 % User time : 32.801 s
% 261.35/34.06 % System time : 0.503 s
% 261.35/34.06 % Total time : 33.304 s
% 261.35/34.06 % Maximum resident set size: 4008 pages
% 261.35/34.06
% 261.35/34.06 % -------------------------------------------------
% 261.35/34.06 % User time : 32.804 s
% 261.35/34.06 % System time : 0.510 s
% 261.35/34.06 % Total time : 33.315 s
% 261.35/34.06 % Maximum resident set size: 4864 pages
% 261.35/34.06 % E exiting
%------------------------------------------------------------------------------