%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO003+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 : n019.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:29 PM UTC 2026
% Result : Theorem 1.99s 0.74s
% Output : CNFRefutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 94 ( 38 unt; 0 def)
% Number of atoms : 254 ( 28 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 268 ( 108 ~; 100 |; 47 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 142 ( 2 sgn 70 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
~ ? [X108] : occurrence_of(X108,tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_45,axiom,
! [X105,X106] :
( ( root_occ(X105,X106)
& occurrence_of(X106,tptp0) )
=> ? [X107] :
( next_subocc(X105,X107,tptp0)
& occurrence_of(X107,tptp1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_45) ).
fof(sos_32,axiom,
! [X102] :
( occurrence_of(X102,tptp0)
=> ? [X103,X104] :
( next_subocc(X103,X104,tptp0)
& leaf_occ(X104,X102)
& occurrence_of(X104,tptp3)
& root_occ(X103,X102)
& occurrence_of(X103,tptp4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(sos,axiom,
! [X1,X2] :
( ( ~ atomic(X1)
& occurrence_of(X2,X1) )
=> ? [X3] :
( subactivity_occurrence(X3,X2)
& root(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(sos_34,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(sos_29,axiom,
! [X91,X92,X93,X94] :
( ( root_occ(X92,X93)
& root_occ(X91,X93)
& occurrence_of(X93,X94) )
=> X91 = X92 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_29) ).
fof(sos_19,axiom,
! [X59,X60] :
( root_occ(X59,X60)
<=> ? [X61] :
( root(X59,X61)
& subactivity_occurrence(X59,X60)
& occurrence_of(X60,X61) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_19) ).
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_01,axiom,
! [X4,X5,X6,X7,X8] :
( ( X6 != X8
& min_precedes(X7,X6,X4)
& subactivity_occurrence(X6,X5)
& leaf_occ(X8,X5)
& root_occ(X7,X5)
& occurrence_of(X5,X4) )
=> min_precedes(X6,X8,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
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_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_42,axiom,
tptp1 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_42) ).
fof(c_0_14,negated_conjecture,
~ ~ ? [X108] : occurrence_of(X108,tptp0),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_15,plain,
! [X230,X231] :
( ( ~ root_occ(X230,X231)
| ~ occurrence_of(X231,tptp0)
| next_subocc(X230,esk15_1(X230),tptp0) )
& ( ~ root_occ(X230,X231)
| ~ occurrence_of(X231,tptp0)
| occurrence_of(esk15_1(X230),tptp1) ) ),
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_45])])])])])])]) ).
fof(c_0_16,negated_conjecture,
occurrence_of(esk16_0,tptp0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_17,plain,
! [X227] :
( ( ~ occurrence_of(X227,tptp0)
| next_subocc(esk13_1(X227),esk14_1(X227),tptp0) )
& ( ~ occurrence_of(X227,tptp0)
| leaf_occ(esk14_1(X227),X227) )
& ( ~ occurrence_of(X227,tptp0)
| occurrence_of(esk14_1(X227),tptp3) )
& ( ~ occurrence_of(X227,tptp0)
| root_occ(esk13_1(X227),X227) )
& ( ~ occurrence_of(X227,tptp0)
| occurrence_of(esk13_1(X227),tptp4) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_32])])])])]) ).
fof(c_0_18,plain,
! [X1,X2] :
( ( ~ atomic(X1)
& occurrence_of(X2,X1) )
=> ? [X3] :
( subactivity_occurrence(X3,X2)
& root(X3,X1) ) ),
inference(fof_simplification,[status(thm)],[sos]) ).
fof(c_0_19,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_34]) ).
cnf(c_0_20,plain,
( ~ root_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| next_subocc(X1,esk15_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
occurrence_of(esk16_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ occurrence_of(X1,tptp0)
| root_occ(esk13_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X216,X217,X218,X219] :
( X216 = X217
| ~ root_occ(X217,X218)
| ~ root_occ(X216,X218)
| ~ occurrence_of(X218,X219) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])]) ).
fof(c_0_24,plain,
! [X177,X178,X180,X181,X182] :
( ( root_occ(X180,X181)
| ~ root(X180,X182)
| ~ subactivity_occurrence(X180,X181)
| ~ occurrence_of(X181,X182) )
& ( ~ root_occ(X177,X178)
| root(X177,esk10_2(X177,X178)) )
& ( ~ root_occ(X177,X178)
| subactivity_occurrence(X177,X178) )
& ( ~ root_occ(X177,X178)
| occurrence_of(X178,esk10_2(X177,X178)) ) ),
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_19])])])])])])]) ).
fof(c_0_25,plain,
! [X109,X110] :
( ( atomic(X109)
| ~ occurrence_of(X110,X109)
| subactivity_occurrence(esk1_2(X109,X110),X110) )
& ( atomic(X109)
| ~ occurrence_of(X110,X109)
| root(esk1_2(X109,X110),X109) ) ),
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_26,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
fof(c_0_27,plain,
! [X200,X201,X202,X203,X204,X205,X206] :
( ( next_subocc(X204,X205,X206)
| ~ min_precedes(X204,X205,X206)
| min_precedes(esk12_3(X204,X205,X206),X205,X206) )
& ( next_subocc(X204,X205,X206)
| ~ min_precedes(X204,X205,X206)
| min_precedes(X204,esk12_3(X204,X205,X206),X206) )
& ( ~ next_subocc(X200,X201,X202)
| ~ min_precedes(X203,X201,X202)
| ~ min_precedes(X200,X203,X202) )
& ( ~ next_subocc(X200,X201,X202)
| min_precedes(X200,X201,X202) ) ),
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_28,negated_conjecture,
( ~ root_occ(X1,esk16_0)
| next_subocc(X1,esk15_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
root_occ(esk13_1(esk16_0),esk16_0),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_30,plain,
( ~ root_occ(X4,X1)
| ~ root_occ(X3,X1)
| ~ occurrence_of(X1,X2)
| X3 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
( ~ root(X3,X2)
| ~ subactivity_occurrence(X3,X1)
| ~ occurrence_of(X1,X2)
| root_occ(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( ~ occurrence_of(X2,X1)
| atomic(X1)
| root(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( ~ occurrence_of(X2,X1)
| atomic(X1)
| subactivity_occurrence(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_35,plain,
! [X130,X131,X132] :
( ( ~ min_precedes(X131,X132,X130)
| subactivity_occurrence(X132,esk3_3(X130,X131,X132)) )
& ( ~ min_precedes(X131,X132,X130)
| subactivity_occurrence(X131,esk3_3(X130,X131,X132)) )
& ( ~ min_precedes(X131,X132,X130)
| occurrence_of(esk3_3(X130,X131,X132),X130) ) ),
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_36,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,negated_conjecture,
next_subocc(esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( ~ root_occ(X1,esk16_0)
| ~ root_occ(X2,esk16_0)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_39,negated_conjecture,
( ~ root(X1,tptp0)
| ~ subactivity_occurrence(X1,esk16_0)
| root_occ(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_21]) ).
cnf(c_0_40,negated_conjecture,
root(esk1_2(tptp0,esk16_0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_33]) ).
cnf(c_0_41,negated_conjecture,
subactivity_occurrence(esk1_2(tptp0,esk16_0),esk16_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_21]),c_0_33]) ).
cnf(c_0_42,plain,
( ~ min_precedes(X2,X3,X1)
| occurrence_of(esk3_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,negated_conjecture,
min_precedes(esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)),tptp0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( ~ root_occ(X1,esk16_0)
| X1 = esk13_1(esk16_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_29]) ).
cnf(c_0_45,negated_conjecture,
root_occ(esk1_2(tptp0,esk16_0),esk16_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
fof(c_0_46,plain,
! [X4,X5,X6,X7,X8] :
( ( X6 != X8
& min_precedes(X7,X6,X4)
& subactivity_occurrence(X6,X5)
& leaf_occ(X8,X5)
& root_occ(X7,X5)
& occurrence_of(X5,X4) )
=> min_precedes(X6,X8,X4) ),
inference(fof_simplification,[status(thm)],[sos_01]) ).
cnf(c_0_47,negated_conjecture,
occurrence_of(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))),tptp0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
esk1_2(tptp0,esk16_0) = esk13_1(esk16_0),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
( ~ min_precedes(X1,X3,X2)
| subactivity_occurrence(X1,esk3_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_50,plain,
! [X112,X113,X114,X115,X116] :
( min_precedes(X114,X116,X112)
| X114 = X116
| ~ min_precedes(X115,X114,X112)
| ~ subactivity_occurrence(X114,X113)
| ~ leaf_occ(X116,X113)
| ~ root_occ(X115,X113)
| ~ occurrence_of(X113,X112) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])]) ).
cnf(c_0_51,negated_conjecture,
( ~ root(X1,tptp0)
| ~ subactivity_occurrence(X1,esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))))
| root_occ(X1,esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))) ),
inference(spm,[status(thm)],[c_0_31,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
root(esk13_1(esk16_0),tptp0),
inference(rw,[status(thm)],[c_0_40,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
subactivity_occurrence(esk13_1(esk16_0),esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),
inference(spm,[status(thm)],[c_0_49,c_0_43]) ).
cnf(c_0_54,plain,
( ~ root_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| occurrence_of(esk15_1(X1),tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_55,plain,
! [X121,X122] :
( ( ~ occurrence_of(X122,X121)
| activity_occurrence(X122) )
& ( ~ occurrence_of(X122,X121)
| activity(X121) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_03])])])]) ).
cnf(c_0_56,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk14_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_57,plain,
( ~ min_precedes(X3,X5,X2)
| ~ subactivity_occurrence(X5,X1)
| ~ leaf_occ(X4,X1)
| ~ root_occ(X3,X1)
| ~ occurrence_of(X1,X2)
| min_precedes(X5,X4,X2)
| X5 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_58,plain,
( ~ occurrence_of(X1,tptp0)
| leaf_occ(esk14_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_59,plain,
( ~ min_precedes(X3,X1,X2)
| subactivity_occurrence(X1,esk3_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_60,negated_conjecture,
( ~ root_occ(X1,esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))))
| ~ root_occ(X2,esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_30,c_0_47]) ).
cnf(c_0_61,negated_conjecture,
root_occ(esk13_1(esk16_0),esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_62,negated_conjecture,
( ~ root_occ(X1,esk16_0)
| occurrence_of(esk15_1(X1),tptp1) ),
inference(spm,[status(thm)],[c_0_54,c_0_21]) ).
fof(c_0_63,plain,
! [X137,X138,X139] :
( X138 = X139
| ~ occurrence_of(X137,X139)
| ~ occurrence_of(X137,X138) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).
fof(c_0_64,plain,
! [X150] :
( ( ~ activity_occurrence(X150)
| occurrence_of(X150,esk5_1(X150)) )
& ( ~ activity_occurrence(X150)
| activity(esk5_1(X150)) ) ),
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])])])])]) ).
cnf(c_0_65,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_66,negated_conjecture,
occurrence_of(esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),tptp3),
inference(spm,[status(thm)],[c_0_56,c_0_47]) ).
cnf(c_0_67,negated_conjecture,
( ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(esk15_1(esk13_1(esk16_0)),X2)
| ~ root_occ(esk13_1(esk16_0),X2)
| ~ leaf_occ(X1,X2)
| min_precedes(esk15_1(esk13_1(esk16_0)),X1,tptp0)
| X1 = esk15_1(esk13_1(esk16_0)) ),
inference(spm,[status(thm)],[c_0_57,c_0_43]) ).
cnf(c_0_68,negated_conjecture,
leaf_occ(esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),
inference(spm,[status(thm)],[c_0_58,c_0_47]) ).
cnf(c_0_69,negated_conjecture,
subactivity_occurrence(esk15_1(esk13_1(esk16_0)),esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),
inference(spm,[status(thm)],[c_0_59,c_0_43]) ).
cnf(c_0_70,negated_conjecture,
( ~ root_occ(X1,esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))))
| X1 = esk13_1(esk16_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_71,negated_conjecture,
root_occ(esk13_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),
inference(spm,[status(thm)],[c_0_22,c_0_47]) ).
cnf(c_0_72,negated_conjecture,
occurrence_of(esk15_1(esk13_1(esk16_0)),tptp1),
inference(spm,[status(thm)],[c_0_62,c_0_29]) ).
cnf(c_0_73,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_74,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_75,negated_conjecture,
activity_occurrence(esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))))),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_76,plain,
( ~ next_subocc(X1,X4,X3)
| ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_77,negated_conjecture,
( min_precedes(esk15_1(esk13_1(esk16_0)),esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),tptp0)
| esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))) = esk15_1(esk13_1(esk16_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_61]),c_0_69]),c_0_47])]) ).
cnf(c_0_78,plain,
( ~ occurrence_of(X1,tptp0)
| next_subocc(esk13_1(X1),esk14_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_79,negated_conjecture,
esk13_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))) = esk13_1(esk16_0),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_80,negated_conjecture,
activity_occurrence(esk15_1(esk13_1(esk16_0))),
inference(spm,[status(thm)],[c_0_65,c_0_72]) ).
fof(c_0_81,plain,
tptp1 != tptp3,
inference(fof_simplification,[status(thm)],[sos_42]) ).
cnf(c_0_82,negated_conjecture,
( ~ occurrence_of(esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),X1)
| X1 = tptp3 ),
inference(spm,[status(thm)],[c_0_73,c_0_66]) ).
cnf(c_0_83,negated_conjecture,
occurrence_of(esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),esk5_1(esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))))),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_84,negated_conjecture,
( ~ min_precedes(X1,esk15_1(esk13_1(esk16_0)),tptp0)
| ~ next_subocc(X1,esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),tptp0)
| esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))) = esk15_1(esk13_1(esk16_0)) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_85,negated_conjecture,
next_subocc(esk13_1(esk16_0),esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_47]),c_0_79]) ).
cnf(c_0_86,negated_conjecture,
( ~ occurrence_of(esk15_1(esk13_1(esk16_0)),X1)
| X1 = tptp1 ),
inference(spm,[status(thm)],[c_0_73,c_0_72]) ).
cnf(c_0_87,negated_conjecture,
occurrence_of(esk15_1(esk13_1(esk16_0)),esk5_1(esk15_1(esk13_1(esk16_0)))),
inference(spm,[status(thm)],[c_0_74,c_0_80]) ).
fof(c_0_88,plain,
tptp1 != tptp3,
inference(fof_nnf,[status(thm)],[c_0_81]) ).
cnf(c_0_89,negated_conjecture,
esk5_1(esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))))) = tptp3,
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_90,negated_conjecture,
esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))) = esk15_1(esk13_1(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_43]),c_0_85])]) ).
cnf(c_0_91,negated_conjecture,
esk5_1(esk15_1(esk13_1(esk16_0))) = tptp1,
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_92,plain,
tptp1 != tptp3,
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90]),c_0_91]),c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO003+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:41:05 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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
% 1.99/0.74 % Version: 3.5.1
% 1.99/0.74 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.99/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/0.74 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.99/0.74 % Starting new_bool_3 with 300s (1) cores
% 1.99/0.74 % Starting new_bool_1 with 300s (1) cores
% 1.99/0.74 % Starting sh5l with 300s (1) cores
% 1.99/0.74 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1608511 completed with status 0
% 1.99/0.74 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.99/0.74 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.99/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/0.74 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.99/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.99/0.74 % No SInE strategy applied
% 1.99/0.74 % Search class: FGHSF-FFMM31-SFFFFFNN
% 1.99/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.99/0.74 % Starting SubtermCWHack with 136s (1) cores
% 1.99/0.74 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.99/0.74 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 1.99/0.74 % Starting new_bool_3 with 136s (1) cores
% 1.99/0.74 % Starting new_bool_1 with 136s (1) cores
% 1.99/0.74 % G-E--_208_C18_F1_SE_CS_SP_PS_S2g with pid 1608517 completed with status 0
% 1.99/0.74 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2g
% 1.99/0.74 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.99/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/0.74 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.99/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.99/0.74 % No SInE strategy applied
% 1.99/0.74 % Search class: FGHSF-FFMM31-SFFFFFNN
% 1.99/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.99/0.74 % Starting SubtermCWHack with 136s (1) cores
% 1.99/0.74 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.99/0.74 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 1.99/0.74 % Preprocessing time : 0.002 s
% 1.99/0.74 % Presaturation interreduction done
% 1.99/0.74
% 1.99/0.74 % Proof found!
% 1.99/0.74 % SZS status Theorem
% 1.99/0.74 % SZS output start CNFRefutation
% See solution above
% 1.99/0.74 % Parsed axioms : 47
% 1.99/0.74 % Removed by relevancy pruning/SinE : 0
% 1.99/0.74 % Initial clauses : 80
% 1.99/0.74 % Removed in clause preprocessing : 0
% 1.99/0.74 % Initial clauses in saturation : 80
% 1.99/0.74 % Processed clauses : 2035
% 1.99/0.74 % ...of these trivial : 76
% 1.99/0.74 % ...subsumed : 402
% 1.99/0.74 % ...remaining for further processing : 1557
% 1.99/0.74 % Other redundant clauses eliminated : 0
% 1.99/0.74 % Clauses deleted for lack of memory : 0
% 1.99/0.74 % Backward-subsumed : 1
% 1.99/0.74 % Backward-rewritten : 354
% 1.99/0.74 % Generated clauses : 3859
% 1.99/0.74 % ...of the previous two non-redundant : 3413
% 1.99/0.74 % ...aggressively subsumed : 0
% 1.99/0.74 % Contextual simplify-reflections : 7
% 1.99/0.74 % Paramodulations : 3859
% 1.99/0.74 % Factorizations : 0
% 1.99/0.74 % NegExts : 0
% 1.99/0.74 % Equation resolutions : 0
% 1.99/0.74 % Disequality decompositions : 0
% 1.99/0.74 % Total rewrite steps : 1844
% 1.99/0.74 % ...of those cached : 1641
% 1.99/0.74 % Propositional unsat checks : 0
% 1.99/0.74 % Propositional check models : 0
% 1.99/0.74 % Propositional check unsatisfiable : 0
% 1.99/0.74 % Propositional clauses : 0
% 1.99/0.74 % Propositional clauses after purity: 0
% 1.99/0.74 % Propositional unsat core size : 0
% 1.99/0.74 % Propositional preprocessing time : 0.000
% 1.99/0.74 % Propositional encoding time : 0.000
% 1.99/0.74 % Propositional solver time : 0.000
% 1.99/0.74 % Success case prop preproc time : 0.000
% 1.99/0.74 % Success case prop encoding time : 0.000
% 1.99/0.74 % Success case prop solver time : 0.000
% 1.99/0.74 % Current number of processed clauses : 1122
% 1.99/0.74 % Positive orientable unit clauses : 304
% 1.99/0.74 % Positive unorientable unit clauses: 0
% 1.99/0.74 % Negative unit clauses : 124
% 1.99/0.74 % Non-unit-clauses : 694
% 1.99/0.74 % Current number of unprocessed clauses: 1166
% 1.99/0.74 % ...number of literals in the above : 3236
% 1.99/0.74 % Current number of archived formulas : 0
% 1.99/0.74 % Current number of archived clauses : 435
% 1.99/0.74 % Clause-clause subsumption calls (NU) : 73306
% 1.99/0.74 % Rec. Clause-clause subsumption calls : 55289
% 1.99/0.74 % Non-unit clause-clause subsumptions : 239
% 1.99/0.74 % Unit Clause-clause subsumption calls : 6002
% 1.99/0.74 % Rewrite failures with RHS unbound : 0
% 1.99/0.74 % BW rewrite match attempts : 594
% 1.99/0.74 % BW rewrite match successes : 40
% 1.99/0.74 % Condensation attempts : 0
% 1.99/0.74 % Condensation successes : 0
% 1.99/0.74 % Termbank termtop insertions : 116758
% 1.99/0.74 % Search garbage collected termcells : 1276
% 1.99/0.74
% 1.99/0.74 % -------------------------------------------------
% 1.99/0.74 % User time : 0.237 s
% 1.99/0.74 % System time : 0.013 s
% 1.99/0.74 % Total time : 0.250 s
% 1.99/0.74 % Maximum resident set size: 3688 pages
% 1.99/0.74
% 1.99/0.74 % -------------------------------------------------
% 1.99/0.74 % User time : 1.203 s
% 1.99/0.74 % System time : 0.069 s
% 1.99/0.74 % Total time : 1.272 s
% 1.99/0.74 % Maximum resident set size: 4608 pages
% 1.99/0.74 % E exiting
%------------------------------------------------------------------------------