%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO017+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:36 PM UTC 2026
% Result : Theorem 0.23s 0.71s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 77 ( 28 unt; 0 def)
% Number of atoms : 297 ( 25 equ)
% Maximal formula atoms : 38 ( 3 avg)
% Number of connectives : 348 ( 128 ~; 139 |; 66 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 124 ( 2 sgn 56 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X108,X109] :
( ( ~ leaf_occ(X108,X109)
& arboreal(X108)
& subactivity_occurrence(X108,X109)
& occurrence_of(X109,tptp0) )
=> ? [X110,X111] :
( leaf(X111,tptp0)
& min_precedes(X110,X111,tptp0)
& ( occurrence_of(X111,tptp1)
| occurrence_of(X111,tptp2) )
& next_subocc(X108,X110,tptp0)
& occurrence_of(X110,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105,X106] :
( ! [X107] :
( min_precedes(X104,X107,tptp0)
=> ( X107 = X106
| X107 = X105 ) )
& min_precedes(X105,X106,tptp0)
& ( occurrence_of(X106,tptp1)
| occurrence_of(X106,tptp2) )
& min_precedes(X104,X105,tptp0)
& occurrence_of(X105,tptp4)
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(sos_26,axiom,
! [X79,X80,X81] :
( next_subocc(X79,X80,X81)
<=> ( ~ ? [X82] :
( min_precedes(X82,X80,X81)
& min_precedes(X79,X82,X81) )
& min_precedes(X79,X80,X81) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_26) ).
fof(sos_06,axiom,
! [X22,X23,X24] :
( min_precedes(X23,X24,X22)
=> ? [X25] :
( subactivity_occurrence(X24,X25)
& subactivity_occurrence(X23,X25)
& occurrence_of(X25,X22) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
fof(sos_09,axiom,
! [X32,X33,X34] :
( ( leaf_occ(X33,X32)
& occurrence_of(X32,X34) )
=> ~ ? [X35] : min_precedes(X33,X35,X34) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(sos_16,axiom,
! [X52,X53] :
( occurrence_of(X52,X53)
=> ( arboreal(X52)
<=> atomic(X53) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_16) ).
fof(sos_38,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_38) ).
fof(sos_08,axiom,
! [X29,X30,X31] :
( ( occurrence_of(X29,X31)
& occurrence_of(X29,X30) )
=> X30 = X31 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(sos_12,axiom,
! [X42] :
( activity_occurrence(X42)
=> ? [X43] :
( occurrence_of(X42,X43)
& activity(X43) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
fof(sos_03,axiom,
! [X13,X14] :
( occurrence_of(X14,X13)
=> ( activity_occurrence(X14)
& activity(X13) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
fof(sos_39,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_39) ).
fof(c_0_11,negated_conjecture,
~ ! [X108,X109] :
( ( ~ leaf_occ(X108,X109)
& arboreal(X108)
& subactivity_occurrence(X108,X109)
& occurrence_of(X109,tptp0) )
=> ? [X110,X111] :
( leaf(X111,tptp0)
& min_precedes(X110,X111,tptp0)
& ( occurrence_of(X111,tptp1)
| occurrence_of(X111,tptp2) )
& next_subocc(X108,X110,tptp0)
& occurrence_of(X110,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_12,plain,
! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105,X106] :
( ! [X107] :
( min_precedes(X104,X107,tptp0)
=> ( X107 = X106
| X107 = X105 ) )
& min_precedes(X105,X106,tptp0)
& ( occurrence_of(X106,tptp1)
| occurrence_of(X106,tptp2) )
& min_precedes(X104,X105,tptp0)
& occurrence_of(X105,tptp4)
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_13,negated_conjecture,
~ ! [X108,X109] :
( ( ~ leaf_occ(X108,X109)
& arboreal(X108)
& subactivity_occurrence(X108,X109)
& occurrence_of(X109,tptp0) )
=> ? [X110,X111] :
( leaf(X111,tptp0)
& min_precedes(X110,X111,tptp0)
& ( occurrence_of(X111,tptp1)
| occurrence_of(X111,tptp2) )
& next_subocc(X108,X110,tptp0)
& occurrence_of(X110,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X230,X231,X235] :
( ( leaf_occ(X230,X231)
| ~ arboreal(X230)
| ~ subactivity_occurrence(X230,X231)
| ~ occurrence_of(X231,tptp0)
| X235 = esk15_1(X230)
| X235 = esk14_1(X230)
| ~ min_precedes(esk13_1(X230),X235,tptp0) )
& ( leaf_occ(X230,X231)
| ~ arboreal(X230)
| ~ subactivity_occurrence(X230,X231)
| ~ occurrence_of(X231,tptp0)
| min_precedes(esk14_1(X230),esk15_1(X230),tptp0) )
& ( leaf_occ(X230,X231)
| ~ arboreal(X230)
| ~ subactivity_occurrence(X230,X231)
| ~ occurrence_of(X231,tptp0)
| occurrence_of(esk15_1(X230),tptp1)
| occurrence_of(esk15_1(X230),tptp2) )
& ( leaf_occ(X230,X231)
| ~ arboreal(X230)
| ~ subactivity_occurrence(X230,X231)
| ~ occurrence_of(X231,tptp0)
| min_precedes(esk13_1(X230),esk14_1(X230),tptp0) )
& ( leaf_occ(X230,X231)
| ~ arboreal(X230)
| ~ subactivity_occurrence(X230,X231)
| ~ occurrence_of(X231,tptp0)
| occurrence_of(esk14_1(X230),tptp4) )
& ( leaf_occ(X230,X231)
| ~ arboreal(X230)
| ~ subactivity_occurrence(X230,X231)
| ~ occurrence_of(X231,tptp0)
| next_subocc(X230,esk13_1(X230),tptp0) )
& ( leaf_occ(X230,X231)
| ~ arboreal(X230)
| ~ subactivity_occurrence(X230,X231)
| ~ occurrence_of(X231,tptp0)
| occurrence_of(esk13_1(X230),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_12])])])])])])]) ).
fof(c_0_15,negated_conjecture,
! [X238,X239] :
( ( ~ leaf(X239,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp1) )
& ( ~ leaf(X239,tptp0)
| ~ min_precedes(X238,X239,tptp0)
| ~ next_subocc(esk16_0,X238,tptp0)
| ~ occurrence_of(X238,tptp3)
| ~ occurrence_of(X239,tptp2) )
& ~ leaf_occ(esk16_0,esk17_0)
& arboreal(esk16_0)
& subactivity_occurrence(esk16_0,esk17_0)
& occurrence_of(esk17_0,tptp0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])]) ).
cnf(c_0_16,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk13_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
occurrence_of(esk17_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X203,X204,X205,X206,X207,X208,X209] :
( ( next_subocc(X207,X208,X209)
| ~ min_precedes(X207,X208,X209)
| min_precedes(esk12_3(X207,X208,X209),X208,X209) )
& ( next_subocc(X207,X208,X209)
| ~ min_precedes(X207,X208,X209)
| min_precedes(X207,esk12_3(X207,X208,X209),X209) )
& ( ~ next_subocc(X203,X204,X205)
| ~ min_precedes(X206,X204,X205)
| ~ min_precedes(X203,X206,X205) )
& ( ~ next_subocc(X203,X204,X205)
| min_precedes(X203,X204,X205) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_26])])])])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1)
| leaf_occ(X1,esk17_0)
| next_subocc(X1,esk13_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
subactivity_occurrence(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
arboreal(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
~ leaf_occ(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| min_precedes(esk13_1(X1),esk14_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X133,X134,X135] :
( ( ~ min_precedes(X134,X135,X133)
| subactivity_occurrence(X135,esk3_3(X133,X134,X135)) )
& ( ~ min_precedes(X134,X135,X133)
| subactivity_occurrence(X134,esk3_3(X133,X134,X135)) )
& ( ~ min_precedes(X134,X135,X133)
| occurrence_of(esk3_3(X133,X134,X135),X133) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])])])])]) ).
cnf(c_0_25,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
next_subocc(esk16_0,esk13_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_27,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk13_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_28,plain,
! [X143,X144,X145,X146] :
( ~ min_precedes(X144,X146,X145)
| ~ leaf_occ(X144,X143)
| ~ occurrence_of(X143,X145) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1)
| leaf_occ(X1,esk17_0)
| min_precedes(esk13_1(X1),esk14_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_30,plain,
( ~ min_precedes(X2,X3,X1)
| occurrence_of(esk3_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
min_precedes(esk16_0,esk13_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_32,plain,
! [X170,X171] :
( ( ~ occurrence_of(X170,X171)
| arboreal(X170)
| ~ atomic(X171) )
& ( ~ occurrence_of(X170,X171)
| atomic(X171)
| ~ arboreal(X170) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_16])])])]) ).
cnf(c_0_33,negated_conjecture,
( ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1)
| occurrence_of(esk13_1(X1),tptp3)
| leaf_occ(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_34,plain,
( ~ min_precedes(X3,X4,X2)
| ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,negated_conjecture,
min_precedes(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_36,negated_conjecture,
occurrence_of(esk3_3(tptp0,esk16_0,esk13_1(esk16_0)),tptp0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( ~ min_precedes(X3,X1,X2)
| subactivity_occurrence(X1,esk3_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,plain,
( ~ occurrence_of(X2,X1)
| ~ atomic(X1)
| arboreal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
occurrence_of(esk13_1(esk16_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_40,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_38]) ).
cnf(c_0_41,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(esk13_1(esk16_0),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( ~ subactivity_occurrence(X1,esk3_3(tptp0,esk16_0,esk13_1(esk16_0)))
| ~ arboreal(X1)
| leaf_occ(X1,esk3_3(tptp0,esk16_0,esk13_1(esk16_0)))
| next_subocc(X1,esk13_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_16,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
subactivity_occurrence(esk13_1(esk16_0),esk3_3(tptp0,esk16_0,esk13_1(esk16_0))),
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_44,negated_conjecture,
arboreal(esk13_1(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_45,negated_conjecture,
~ leaf_occ(esk13_1(esk16_0),esk3_3(tptp0,esk16_0,esk13_1(esk16_0))),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_46,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X3)
| ~ occurrence_of(X3,tptp0)
| ~ min_precedes(esk13_1(X1),X2,tptp0)
| leaf_occ(X1,X3)
| X2 = esk15_1(X1)
| X2 = esk14_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_47,plain,
! [X140,X141,X142] :
( X141 = X142
| ~ occurrence_of(X140,X142)
| ~ occurrence_of(X140,X141) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).
fof(c_0_48,plain,
! [X153] :
( ( ~ activity_occurrence(X153)
| occurrence_of(X153,esk5_1(X153)) )
& ( ~ activity_occurrence(X153)
| activity(esk5_1(X153)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_12])])])])]) ).
fof(c_0_49,plain,
! [X124,X125] :
( ( ~ occurrence_of(X125,X124)
| activity_occurrence(X125) )
& ( ~ occurrence_of(X125,X124)
| activity(X124) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_03])])])]) ).
cnf(c_0_50,plain,
( ~ next_subocc(X1,X4,X3)
| ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_51,negated_conjecture,
next_subocc(esk13_1(esk16_0),esk13_1(esk13_1(esk16_0)),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( ~ subactivity_occurrence(X2,esk17_0)
| ~ min_precedes(esk13_1(X2),X1,tptp0)
| ~ arboreal(X2)
| leaf_occ(X2,esk17_0)
| X1 = esk14_1(X2)
| X1 = esk15_1(X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_17]) ).
cnf(c_0_53,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| min_precedes(esk14_1(X1),esk15_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_54,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk14_1(X1),tptp4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_55,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_57,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_58,negated_conjecture,
( ~ subactivity_occurrence(X1,esk3_3(tptp0,esk16_0,esk13_1(esk16_0)))
| ~ arboreal(X1)
| occurrence_of(esk13_1(X1),tptp3)
| leaf_occ(X1,esk3_3(tptp0,esk16_0,esk13_1(esk16_0))) ),
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_59,negated_conjecture,
( ~ min_precedes(esk13_1(esk16_0),X1,tptp0)
| ~ min_precedes(X1,esk13_1(esk13_1(esk16_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_60,negated_conjecture,
( ~ min_precedes(esk13_1(esk16_0),X1,tptp0)
| X1 = esk15_1(esk16_0)
| X1 = esk14_1(esk16_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_61,negated_conjecture,
min_precedes(esk13_1(esk16_0),esk13_1(esk13_1(esk16_0)),tptp0),
inference(spm,[status(thm)],[c_0_25,c_0_51]) ).
cnf(c_0_62,negated_conjecture,
( ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1)
| leaf_occ(X1,esk17_0)
| min_precedes(esk14_1(X1),esk15_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_53,c_0_17]) ).
cnf(c_0_63,negated_conjecture,
( ~ subactivity_occurrence(X1,esk17_0)
| ~ arboreal(X1)
| occurrence_of(esk14_1(X1),tptp4)
| leaf_occ(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_54,c_0_17]) ).
fof(c_0_64,plain,
tptp4 != tptp3,
inference(fof_simplification,[status(thm)],[sos_39]) ).
cnf(c_0_65,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk5_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_66,negated_conjecture,
occurrence_of(esk13_1(esk13_1(esk16_0)),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_43]),c_0_44])]),c_0_45]) ).
cnf(c_0_67,negated_conjecture,
~ min_precedes(esk14_1(esk16_0),esk13_1(esk13_1(esk16_0)),tptp0),
inference(spm,[status(thm)],[c_0_59,c_0_35]) ).
cnf(c_0_68,negated_conjecture,
( esk13_1(esk13_1(esk16_0)) = esk14_1(esk16_0)
| esk13_1(esk13_1(esk16_0)) = esk15_1(esk16_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,negated_conjecture,
min_precedes(esk14_1(esk16_0),esk15_1(esk16_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_70,negated_conjecture,
occurrence_of(esk14_1(esk16_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_20]),c_0_21])]),c_0_22]) ).
fof(c_0_71,plain,
tptp4 != tptp3,
inference(fof_nnf,[status(thm)],[c_0_64]) ).
cnf(c_0_72,negated_conjecture,
esk5_1(esk13_1(esk13_1(esk16_0))) = tptp3,
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_73,negated_conjecture,
esk13_1(esk13_1(esk16_0)) = esk14_1(esk16_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69])]) ).
cnf(c_0_74,negated_conjecture,
esk5_1(esk14_1(esk16_0)) = tptp4,
inference(spm,[status(thm)],[c_0_65,c_0_70]) ).
cnf(c_0_75,plain,
tptp4 != tptp3,
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : PRO017+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.46 % Computer : n009.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 03:43:43 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.52 Running first-order theorem proving
% 0.18/0.52 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.23/0.71 % Version: 3.5.1
% 0.23/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.71 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.71 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.71 % Starting sh5l with 300s (1) cores
% 0.23/0.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 766517 completed with status 0
% 0.23/0.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.71 % No SInE strategy applied
% 0.23/0.71 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.23/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.71 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.23/0.71 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.71 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 766523 completed with status 0
% 0.23/0.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.71 % No SInE strategy applied
% 0.23/0.71 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.23/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.71 % Preprocessing time : 0.003 s
% 0.23/0.71 % Presaturation interreduction done
% 0.23/0.71
% 0.23/0.71 % Proof found!
% 0.23/0.71 % SZS status Theorem
% 0.23/0.71 % SZS output start CNFRefutation
% See solution above
% 0.23/0.71 % Parsed axioms : 46
% 0.23/0.71 % Removed by relevancy pruning/SinE : 0
% 0.23/0.71 % Initial clauses : 85
% 0.23/0.71 % Removed in clause preprocessing : 0
% 0.23/0.71 % Initial clauses in saturation : 85
% 0.23/0.71 % Processed clauses : 756
% 0.23/0.71 % ...of these trivial : 12
% 0.23/0.71 % ...subsumed : 92
% 0.23/0.71 % ...remaining for further processing : 652
% 0.23/0.71 % Other redundant clauses eliminated : 0
% 0.23/0.71 % Clauses deleted for lack of memory : 0
% 0.23/0.71 % Backward-subsumed : 3
% 0.23/0.71 % Backward-rewritten : 33
% 0.23/0.71 % Generated clauses : 1454
% 0.23/0.71 % ...of the previous two non-redundant : 1127
% 0.23/0.71 % ...aggressively subsumed : 0
% 0.23/0.71 % Contextual simplify-reflections : 5
% 0.23/0.71 % Paramodulations : 1452
% 0.23/0.71 % Factorizations : 2
% 0.23/0.71 % NegExts : 0
% 0.23/0.71 % Equation resolutions : 0
% 0.23/0.71 % Disequality decompositions : 0
% 0.23/0.71 % Total rewrite steps : 769
% 0.23/0.71 % ...of those cached : 667
% 0.23/0.71 % Propositional unsat checks : 0
% 0.23/0.71 % Propositional check models : 0
% 0.23/0.71 % Propositional check unsatisfiable : 0
% 0.23/0.71 % Propositional clauses : 0
% 0.23/0.71 % Propositional clauses after purity: 0
% 0.23/0.71 % Propositional unsat core size : 0
% 0.23/0.71 % Propositional preprocessing time : 0.000
% 0.23/0.71 % Propositional encoding time : 0.000
% 0.23/0.71 % Propositional solver time : 0.000
% 0.23/0.71 % Success case prop preproc time : 0.000
% 0.23/0.71 % Success case prop encoding time : 0.000
% 0.23/0.71 % Success case prop solver time : 0.000
% 0.23/0.71 % Current number of processed clauses : 531
% 0.23/0.71 % Positive orientable unit clauses : 131
% 0.23/0.71 % Positive unorientable unit clauses: 0
% 0.23/0.71 % Negative unit clauses : 111
% 0.23/0.71 % Non-unit-clauses : 289
% 0.23/0.71 % Current number of unprocessed clauses: 516
% 0.23/0.71 % ...number of literals in the above : 1339
% 0.23/0.71 % Current number of archived formulas : 0
% 0.23/0.71 % Current number of archived clauses : 121
% 0.23/0.71 % Clause-clause subsumption calls (NU) : 18413
% 0.23/0.71 % Rec. Clause-clause subsumption calls : 10913
% 0.23/0.71 % Non-unit clause-clause subsumptions : 56
% 0.23/0.71 % Unit Clause-clause subsumption calls : 1991
% 0.23/0.71 % Rewrite failures with RHS unbound : 0
% 0.23/0.71 % BW rewrite match attempts : 17
% 0.23/0.71 % BW rewrite match successes : 5
% 0.23/0.71 % Condensation attempts : 0
% 0.23/0.71 % Condensation successes : 0
% 0.23/0.71 % Termbank termtop insertions : 33666
% 0.23/0.71 % Search garbage collected termcells : 1432
% 0.23/0.71
% 0.23/0.71 % -------------------------------------------------
% 0.23/0.71 % User time : 0.107 s
% 0.23/0.71 % System time : 0.012 s
% 0.23/0.71 % Total time : 0.119 s
% 0.23/0.71 % Maximum resident set size: 3488 pages
% 0.23/0.71
% 0.23/0.71 % -------------------------------------------------
% 0.23/0.71 % User time : 0.334 s
% 0.23/0.71 % System time : 0.049 s
% 0.23/0.71 % Total time : 0.383 s
% 0.23/0.71 % Maximum resident set size: 4608 pages
% 0.23/0.71 % E exiting
%------------------------------------------------------------------------------