%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO006+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 : n001.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:30 PM UTC 2026
% Result : Theorem 2.46s 0.90s
% Output : CNFRefutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 17
% Syntax : Number of formulae : 112 ( 46 unt; 0 def)
% Number of atoms : 309 ( 28 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 334 ( 137 ~; 125 |; 55 &)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 168 ( 7 sgn 83 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
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(goals,conjecture,
~ ? [X108] : occurrence_of(X108,tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_34,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
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_03,axiom,
! [X13,X14] :
( occurrence_of(X14,X13)
=> ( activity_occurrence(X14)
& activity(X13) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
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_12,axiom,
! [X42] :
( activity_occurrence(X42)
=> ? [X43] :
( occurrence_of(X42,X43)
& activity(X43) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
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_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_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_45,axiom,
! [X105,X106] :
( ( ~ leaf_occ(X105,X106)
& arboreal(X105)
& subactivity_occurrence(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_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_35,axiom,
atomic(tptp4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35) ).
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_42,axiom,
tptp1 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_42) ).
fof(c_0_17,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_18,negated_conjecture,
~ ~ ? [X108] : occurrence_of(X108,tptp0),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_19,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_34]) ).
fof(c_0_20,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_17])])])])]) ).
fof(c_0_21,negated_conjecture,
occurrence_of(esk16_0,tptp0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
fof(c_0_22,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
fof(c_0_23,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_24,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])])])]) ).
fof(c_0_25,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])])])])])])]) ).
cnf(c_0_26,plain,
( ~ occurrence_of(X2,X1)
| atomic(X1)
| subactivity_occurrence(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
occurrence_of(esk16_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_30,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_31,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( ~ root(X3,X2)
| ~ subactivity_occurrence(X3,X1)
| ~ occurrence_of(X1,X2)
| root_occ(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
subactivity_occurrence(esk1_2(tptp0,esk16_0),esk16_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( ~ occurrence_of(esk16_0,X1)
| X1 = tptp0 ),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_35,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
activity_occurrence(esk16_0),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_37,plain,
( ~ occurrence_of(X2,X1)
| atomic(X1)
| root(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_38,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])])]) ).
cnf(c_0_39,negated_conjecture,
( ~ occurrence_of(esk16_0,X1)
| ~ root(esk1_2(tptp0,esk16_0),X1)
| root_occ(esk1_2(tptp0,esk16_0),esk16_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
esk5_1(esk16_0) = tptp0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_41,negated_conjecture,
root(esk1_2(tptp0,esk16_0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_27]),c_0_28]) ).
fof(c_0_42,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])])])])]) ).
cnf(c_0_43,plain,
( ~ root_occ(X4,X1)
| ~ root_occ(X3,X1)
| ~ occurrence_of(X1,X2)
| X3 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,negated_conjecture,
root_occ(esk1_2(tptp0,esk16_0),esk16_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_35]),c_0_40]),c_0_41]),c_0_36])]) ).
cnf(c_0_45,plain,
( ~ occurrence_of(X1,tptp0)
| root_occ(esk13_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_46,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_47,plain,
( ~ occurrence_of(X1,tptp0)
| next_subocc(esk13_1(X1),esk14_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_48,plain,
! [X105,X106] :
( ( ~ leaf_occ(X105,X106)
& arboreal(X105)
& subactivity_occurrence(X105,X106)
& occurrence_of(X106,tptp0) )
=> ? [X107] :
( next_subocc(X105,X107,tptp0)
& occurrence_of(X107,tptp1) ) ),
inference(fof_simplification,[status(thm)],[sos_45]) ).
cnf(c_0_49,negated_conjecture,
( ~ occurrence_of(esk16_0,X2)
| ~ root_occ(X1,esk16_0)
| X1 = esk1_2(tptp0,esk16_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
root_occ(esk13_1(esk16_0),esk16_0),
inference(spm,[status(thm)],[c_0_45,c_0_27]) ).
fof(c_0_51,plain,
! [X140,X141,X142,X143] :
( ~ min_precedes(X141,X143,X142)
| ~ leaf_occ(X141,X140)
| ~ occurrence_of(X140,X142) ),
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_52,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
next_subocc(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_47,c_0_27]) ).
fof(c_0_54,plain,
! [X230,X231] :
( ( leaf_occ(X230,X231)
| ~ arboreal(X230)
| ~ subactivity_occurrence(X230,X231)
| ~ occurrence_of(X231,tptp0)
| next_subocc(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) ) ),
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_48])])])])])])]) ).
cnf(c_0_55,negated_conjecture,
( ~ occurrence_of(esk16_0,X1)
| esk1_2(tptp0,esk16_0) = esk13_1(esk16_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
fof(c_0_56,plain,
! [X167,X168] :
( ( ~ occurrence_of(X167,X168)
| arboreal(X167)
| ~ atomic(X168) )
& ( ~ occurrence_of(X167,X168)
| atomic(X168)
| ~ arboreal(X167) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_16])])])]) ).
cnf(c_0_57,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk13_1(X1),tptp4) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_58,plain,
( ~ min_precedes(X3,X4,X2)
| ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_59,negated_conjecture,
min_precedes(esk13_1(esk16_0),esk14_1(esk16_0),tptp0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk15_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_61,negated_conjecture,
esk1_2(tptp0,esk16_0) = esk13_1(esk16_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_35]),c_0_36])]) ).
cnf(c_0_62,plain,
( ~ occurrence_of(X2,X1)
| ~ atomic(X1)
| arboreal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_63,negated_conjecture,
occurrence_of(esk13_1(esk16_0),tptp4),
inference(spm,[status(thm)],[c_0_57,c_0_27]) ).
cnf(c_0_64,plain,
atomic(tptp4),
inference(split_conjunct,[status(thm)],[sos_35]) ).
cnf(c_0_65,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(esk13_1(esk16_0),X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
( ~ subactivity_occurrence(X1,esk16_0)
| ~ arboreal(X1)
| leaf_occ(X1,esk16_0)
| next_subocc(X1,esk15_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_60,c_0_27]) ).
cnf(c_0_67,negated_conjecture,
subactivity_occurrence(esk13_1(esk16_0),esk16_0),
inference(rw,[status(thm)],[c_0_33,c_0_61]) ).
cnf(c_0_68,negated_conjecture,
arboreal(esk13_1(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_69,negated_conjecture,
~ leaf_occ(esk13_1(esk16_0),esk16_0),
inference(spm,[status(thm)],[c_0_65,c_0_27]) ).
fof(c_0_70,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_71,negated_conjecture,
next_subocc(esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]),c_0_69]) ).
cnf(c_0_72,plain,
( ~ min_precedes(X1,X3,X2)
| subactivity_occurrence(X1,esk3_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_73,negated_conjecture,
min_precedes(esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)),tptp0),
inference(spm,[status(thm)],[c_0_52,c_0_71]) ).
cnf(c_0_74,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_72,c_0_73]) ).
cnf(c_0_75,plain,
( ~ min_precedes(X2,X3,X1)
| occurrence_of(esk3_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_76,negated_conjecture,
( ~ occurrence_of(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))),X1)
| ~ root(esk13_1(esk16_0),X1)
| root_occ(esk13_1(esk16_0),esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))) ),
inference(spm,[status(thm)],[c_0_32,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
root(esk13_1(esk16_0),tptp0),
inference(rw,[status(thm)],[c_0_41,c_0_61]) ).
cnf(c_0_78,negated_conjecture,
occurrence_of(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))),tptp0),
inference(spm,[status(thm)],[c_0_75,c_0_73]) ).
cnf(c_0_79,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_76,c_0_77]),c_0_78])]) ).
fof(c_0_80,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_81,negated_conjecture,
( ~ occurrence_of(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))),X2)
| ~ 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_43,c_0_79]) ).
cnf(c_0_82,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_45,c_0_78]) ).
fof(c_0_83,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_80])])]) ).
cnf(c_0_84,plain,
( ~ next_subocc(X1,X4,X3)
| ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_85,negated_conjecture,
next_subocc(esk13_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),tptp0),
inference(spm,[status(thm)],[c_0_47,c_0_78]) ).
cnf(c_0_86,negated_conjecture,
( ~ occurrence_of(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))),X1)
| 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_81,c_0_82]) ).
cnf(c_0_87,negated_conjecture,
activity_occurrence(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),
inference(spm,[status(thm)],[c_0_31,c_0_78]) ).
cnf(c_0_88,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_83]) ).
cnf(c_0_89,plain,
( ~ min_precedes(X3,X1,X2)
| subactivity_occurrence(X1,esk3_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_90,negated_conjecture,
( ~ min_precedes(esk13_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),X1,tptp0)
| ~ min_precedes(X1,esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),tptp0) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_91,negated_conjecture,
esk13_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))) = esk13_1(esk16_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_35]),c_0_87])]) ).
cnf(c_0_92,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk15_1(X1),tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_93,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk14_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_94,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_88,c_0_73]) ).
cnf(c_0_95,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_89,c_0_73]) ).
cnf(c_0_96,plain,
( ~ occurrence_of(X1,tptp0)
| leaf_occ(esk14_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_97,negated_conjecture,
( ~ min_precedes(esk13_1(esk16_0),X1,tptp0)
| ~ min_precedes(X1,esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))),tptp0) ),
inference(rw,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_98,negated_conjecture,
( ~ subactivity_occurrence(X1,esk16_0)
| ~ arboreal(X1)
| occurrence_of(esk15_1(X1),tptp1)
| leaf_occ(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_92,c_0_27]) ).
fof(c_0_99,plain,
tptp1 != tptp3,
inference(fof_simplification,[status(thm)],[sos_42]) ).
cnf(c_0_100,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk5_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_35]),c_0_31]) ).
cnf(c_0_101,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_93,c_0_78]) ).
cnf(c_0_102,negated_conjecture,
( ~ leaf_occ(X1,esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0))))
| min_precedes(esk15_1(esk13_1(esk16_0)),X1,tptp0)
| X1 = esk15_1(esk13_1(esk16_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_78]),c_0_95])]),c_0_79])]) ).
cnf(c_0_103,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_96,c_0_78]) ).
cnf(c_0_104,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),
inference(spm,[status(thm)],[c_0_97,c_0_73]) ).
cnf(c_0_105,negated_conjecture,
occurrence_of(esk15_1(esk13_1(esk16_0)),tptp1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_67]),c_0_68])]),c_0_69]) ).
fof(c_0_106,plain,
tptp1 != tptp3,
inference(fof_nnf,[status(thm)],[c_0_99]) ).
cnf(c_0_107,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_100,c_0_101]) ).
cnf(c_0_108,negated_conjecture,
esk14_1(esk3_3(tptp0,esk13_1(esk16_0),esk15_1(esk13_1(esk16_0)))) = esk15_1(esk13_1(esk16_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]) ).
cnf(c_0_109,negated_conjecture,
esk5_1(esk15_1(esk13_1(esk16_0))) = tptp1,
inference(spm,[status(thm)],[c_0_100,c_0_105]) ).
cnf(c_0_110,plain,
tptp1 != tptp3,
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_111,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_110]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : PRO006+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.19/0.46 % Computer : n001.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 03:46:45 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 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
% 2.46/0.90 % Version: 3.5.1
% 2.46/0.90 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.46/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.46/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.46/0.90 % Starting new_bool_3 with 300s (1) cores
% 2.46/0.90 % Starting new_bool_1 with 300s (1) cores
% 2.46/0.90 % Starting sh5l with 300s (1) cores
% 2.46/0.90 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2113465 completed with status 0
% 2.46/0.90 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.46/0.90 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.46/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.46/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.46/0.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.46/0.90 % No SInE strategy applied
% 2.46/0.90 % Search class: FGHSF-FFMM31-SFFFFFNN
% 2.46/0.90 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.46/0.90 % Starting SubtermCWHack with 136s (1) cores
% 2.46/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.46/0.90 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 2.46/0.90 % Starting new_bool_3 with 136s (1) cores
% 2.46/0.90 % Starting new_bool_1 with 136s (1) cores
% 2.46/0.90 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2113472 completed with status 0
% 2.46/0.90 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.46/0.90 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.46/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.46/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.46/0.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.46/0.90 % No SInE strategy applied
% 2.46/0.90 % Search class: FGHSF-FFMM31-SFFFFFNN
% 2.46/0.90 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.46/0.90 % Starting SubtermCWHack with 136s (1) cores
% 2.46/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.46/0.90 % Preprocessing time : 0.003 s
% 2.46/0.90 % Presaturation interreduction done
% 2.46/0.90
% 2.46/0.90 % Proof found!
% 2.46/0.90 % SZS status Theorem
% 2.46/0.90 % SZS output start CNFRefutation
% See solution above
% 2.46/0.91 % Parsed axioms : 47
% 2.46/0.91 % Removed by relevancy pruning/SinE : 0
% 2.46/0.91 % Initial clauses : 80
% 2.46/0.91 % Removed in clause preprocessing : 0
% 2.46/0.91 % Initial clauses in saturation : 80
% 2.46/0.91 % Processed clauses : 1682
% 2.46/0.91 % ...of these trivial : 99
% 2.46/0.91 % ...subsumed : 381
% 2.46/0.91 % ...remaining for further processing : 1202
% 2.46/0.91 % Other redundant clauses eliminated : 0
% 2.46/0.91 % Clauses deleted for lack of memory : 0
% 2.46/0.91 % Backward-subsumed : 0
% 2.46/0.91 % Backward-rewritten : 307
% 2.46/0.91 % Generated clauses : 4462
% 2.46/0.91 % ...of the previous two non-redundant : 2928
% 2.46/0.91 % ...aggressively subsumed : 0
% 2.46/0.91 % Contextual simplify-reflections : 14
% 2.46/0.91 % Paramodulations : 4462
% 2.46/0.91 % Factorizations : 0
% 2.46/0.91 % NegExts : 0
% 2.46/0.91 % Equation resolutions : 0
% 2.46/0.91 % Disequality decompositions : 0
% 2.46/0.91 % Total rewrite steps : 6400
% 2.46/0.91 % ...of those cached : 6150
% 2.46/0.91 % Propositional unsat checks : 0
% 2.46/0.91 % Propositional check models : 0
% 2.46/0.91 % Propositional check unsatisfiable : 0
% 2.46/0.91 % Propositional clauses : 0
% 2.46/0.91 % Propositional clauses after purity: 0
% 2.46/0.91 % Propositional unsat core size : 0
% 2.46/0.91 % Propositional preprocessing time : 0.000
% 2.46/0.91 % Propositional encoding time : 0.000
% 2.46/0.91 % Propositional solver time : 0.000
% 2.46/0.91 % Success case prop preproc time : 0.000
% 2.46/0.91 % Success case prop encoding time : 0.000
% 2.46/0.91 % Success case prop solver time : 0.000
% 2.46/0.91 % Current number of processed clauses : 815
% 2.46/0.91 % Positive orientable unit clauses : 232
% 2.46/0.91 % Positive unorientable unit clauses: 0
% 2.46/0.91 % Negative unit clauses : 177
% 2.46/0.91 % Non-unit-clauses : 406
% 2.46/0.91 % Current number of unprocessed clauses: 1236
% 2.46/0.91 % ...number of literals in the above : 3267
% 2.46/0.91 % Current number of archived formulas : 0
% 2.46/0.91 % Current number of archived clauses : 387
% 2.46/0.91 % Clause-clause subsumption calls (NU) : 32589
% 2.46/0.91 % Rec. Clause-clause subsumption calls : 21732
% 2.46/0.91 % Non-unit clause-clause subsumptions : 172
% 2.46/0.91 % Unit Clause-clause subsumption calls : 4294
% 2.46/0.91 % Rewrite failures with RHS unbound : 0
% 2.46/0.91 % BW rewrite match attempts : 327
% 2.46/0.91 % BW rewrite match successes : 33
% 2.46/0.91 % Condensation attempts : 0
% 2.46/0.91 % Condensation successes : 0
% 2.46/0.91 % Termbank termtop insertions : 156556
% 2.46/0.91 % Search garbage collected termcells : 1289
% 2.46/0.91
% 2.46/0.91 % -------------------------------------------------
% 2.46/0.91 % User time : 0.280 s
% 2.46/0.91 % System time : 0.018 s
% 2.46/0.91 % Total time : 0.298 s
% 2.46/0.91 % Maximum resident set size: 3484 pages
% 2.46/0.91
% 2.46/0.91 % -------------------------------------------------
% 2.46/0.91 % User time : 1.347 s
% 2.46/0.91 % System time : 0.069 s
% 2.46/0.91 % Total time : 1.416 s
% 2.46/0.91 % Maximum resident set size: 4608 pages
% 2.46/0.91 % E exiting
%------------------------------------------------------------------------------