%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PRO003+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:39 PM UTC 2026
% Result : Theorem 5.13s 11.79s
% Output : CNFRefutation 5.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 84 ( 33 unt; 0 def)
% Number of atoms : 228 ( 25 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 243 ( 99 ~; 92 |; 41 &)
% ( 3 <=>; 8 =>; 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 : 132 ( 2 sgn 66 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
~ ? [X168] : occurrence_of(X168,tptp0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_62,axiom,
! [X165,X166] :
( ( root_occ(X165,X166)
& occurrence_of(X166,tptp0) )
=> ? [X167] :
( next_subocc(X165,X167,tptp0)
& occurrence_of(X167,tptp1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_62) ).
fof(sos_49,axiom,
! [X162] :
( occurrence_of(X162,tptp0)
=> ? [X163,X164] :
( next_subocc(X163,X164,tptp0)
& leaf_occ(X164,X162)
& occurrence_of(X164,tptp3)
& root_occ(X163,X162)
& occurrence_of(X163,tptp4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_49) ).
fof(sos_22,axiom,
! [X61,X62,X63] :
( next_subocc(X61,X62,X63)
<=> ( ~ ? [X64] :
( min_precedes(X64,X62,X63)
& min_precedes(X61,X64,X63) )
& min_precedes(X61,X62,X63) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_22) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X7)
& occurrence_of(X5,X6) )
=> X6 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(sos_33,axiom,
! [X100,X101] :
( root_occ(X100,X101)
<=> ? [X102] :
( root(X100,X102)
& subactivity_occurrence(X100,X101)
& occurrence_of(X101,X102) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_33) ).
fof(sos_25,axiom,
! [X70,X71,X72] :
( min_precedes(X71,X72,X70)
=> ? [X73] :
( subactivity_occurrence(X72,X73)
& subactivity_occurrence(X71,X73)
& occurrence_of(X73,X70) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_25) ).
fof(sos_35,axiom,
! [X106,X107,X108,X109] :
( ( root_occ(X107,X108)
& root_occ(X106,X108)
& occurrence_of(X108,X109) )
=> X106 = X107 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_35) ).
fof(sos,axiom,
! [X1,X2] :
( occurrence_of(X2,X1)
=> ( activity_occurrence(X2)
& activity(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
fof(sos_39,axiom,
! [X122,X123,X124,X125,X126] :
( ( subactivity_occurrence(X123,X126)
& subactivity_occurrence(X124,X126)
& occurrence_of(X126,X125)
& next_subocc(X122,X124,X125)
& next_subocc(X122,X123,X125) )
=> X123 = X124 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_39) ).
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_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_59,axiom,
tptp1 != tptp3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_59) ).
fof(c_0_13,negated_conjecture,
~ ~ ? [X168] : occurrence_of(X168,tptp0),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_14,plain,
! [X350,X351] :
( ( ~ root_occ(X350,X351)
| ~ occurrence_of(X351,tptp0)
| next_subocc(X350,esk19_1(X350),tptp0) )
& ( ~ root_occ(X350,X351)
| ~ occurrence_of(X351,tptp0)
| occurrence_of(esk19_1(X350),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_62])])])])])])]) ).
fof(c_0_15,negated_conjecture,
occurrence_of(esk20_0,tptp0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_16,plain,
! [X347] :
( ( ~ occurrence_of(X347,tptp0)
| next_subocc(esk17_1(X347),esk18_1(X347),tptp0) )
& ( ~ occurrence_of(X347,tptp0)
| leaf_occ(esk18_1(X347),X347) )
& ( ~ occurrence_of(X347,tptp0)
| occurrence_of(esk18_1(X347),tptp3) )
& ( ~ occurrence_of(X347,tptp0)
| root_occ(esk17_1(X347),X347) )
& ( ~ occurrence_of(X347,tptp0)
| occurrence_of(esk17_1(X347),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_49])])])])]) ).
cnf(c_0_17,plain,
( ~ root_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| next_subocc(X1,esk19_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
occurrence_of(esk20_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ~ occurrence_of(X1,tptp0)
| root_occ(esk17_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X233,X234,X235,X236,X237,X238,X239] :
( ( next_subocc(X237,X238,X239)
| ~ min_precedes(X237,X238,X239)
| min_precedes(esk8_3(X237,X238,X239),X238,X239) )
& ( next_subocc(X237,X238,X239)
| ~ min_precedes(X237,X238,X239)
| min_precedes(X237,esk8_3(X237,X238,X239),X239) )
& ( ~ next_subocc(X233,X234,X235)
| ~ min_precedes(X236,X234,X235)
| ~ min_precedes(X233,X236,X235) )
& ( ~ next_subocc(X233,X234,X235)
| min_precedes(X233,X234,X235) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])])])])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ root_occ(X1,esk20_0)
| next_subocc(X1,esk19_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
root_occ(esk17_1(esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
fof(c_0_23,plain,
! [X173,X174,X175] :
( X174 = X175
| ~ occurrence_of(X173,X175)
| ~ occurrence_of(X173,X174) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
fof(c_0_24,plain,
! [X279,X280,X282,X283,X284] :
( ( root_occ(X282,X283)
| ~ root(X282,X284)
| ~ subactivity_occurrence(X282,X283)
| ~ occurrence_of(X283,X284) )
& ( ~ root_occ(X279,X280)
| root(X279,esk14_2(X279,X280)) )
& ( ~ root_occ(X279,X280)
| subactivity_occurrence(X279,X280) )
& ( ~ root_occ(X279,X280)
| occurrence_of(X280,esk14_2(X279,X280)) ) ),
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_33])])])])])])]) ).
fof(c_0_25,plain,
! [X249,X250,X251] :
( ( ~ min_precedes(X250,X251,X249)
| subactivity_occurrence(X251,esk10_3(X249,X250,X251)) )
& ( ~ min_precedes(X250,X251,X249)
| subactivity_occurrence(X250,esk10_3(X249,X250,X251)) )
& ( ~ min_precedes(X250,X251,X249)
| occurrence_of(esk10_3(X249,X250,X251),X249) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_25])])])])]) ).
cnf(c_0_26,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
next_subocc(esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)),tptp0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( ~ root_occ(X2,X1)
| occurrence_of(X1,esk14_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( ~ min_precedes(X2,X3,X1)
| occurrence_of(esk10_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
min_precedes(esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)),tptp0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( ~ occurrence_of(esk20_0,X1)
| X1 = tptp0 ),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_33,negated_conjecture,
occurrence_of(esk20_0,esk14_2(esk17_1(esk20_0),esk20_0)),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
fof(c_0_34,plain,
! [X291,X292,X293,X294] :
( X291 = X292
| ~ root_occ(X292,X293)
| ~ root_occ(X291,X293)
| ~ occurrence_of(X293,X294) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_35])])]) ).
cnf(c_0_35,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_36,negated_conjecture,
occurrence_of(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))),tptp0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( ~ root_occ(X1,X2)
| root(X1,esk14_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,negated_conjecture,
esk14_2(esk17_1(esk20_0),esk20_0) = tptp0,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( ~ min_precedes(X1,X3,X2)
| subactivity_occurrence(X1,esk10_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_40,plain,
( ~ root_occ(X4,X1)
| ~ root_occ(X3,X1)
| ~ occurrence_of(X1,X2)
| X3 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( ~ root(X1,tptp0)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))))
| root_occ(X1,esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
root(esk17_1(esk20_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_22]),c_0_38]) ).
cnf(c_0_43,negated_conjecture,
subactivity_occurrence(esk17_1(esk20_0),esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),
inference(spm,[status(thm)],[c_0_39,c_0_31]) ).
cnf(c_0_44,negated_conjecture,
( ~ root_occ(X1,esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))))
| ~ root_occ(X2,esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_40,c_0_36]) ).
cnf(c_0_45,negated_conjecture,
root_occ(esk17_1(esk20_0),esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_46,plain,
( ~ root_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| occurrence_of(esk19_1(X1),tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_47,plain,
! [X169,X170] :
( ( ~ occurrence_of(X170,X169)
| activity_occurrence(X170) )
& ( ~ occurrence_of(X170,X169)
| activity(X169) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])])]) ).
cnf(c_0_48,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk18_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_49,plain,
! [X307,X308,X309,X310,X311] :
( X308 = X309
| ~ subactivity_occurrence(X308,X311)
| ~ subactivity_occurrence(X309,X311)
| ~ occurrence_of(X311,X310)
| ~ next_subocc(X307,X309,X310)
| ~ next_subocc(X307,X308,X310) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_39])])]) ).
cnf(c_0_50,negated_conjecture,
( ~ root_occ(X1,esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))))
| X1 = esk17_1(esk20_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
root_occ(esk17_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_52,negated_conjecture,
( ~ root_occ(X1,esk20_0)
| occurrence_of(esk19_1(X1),tptp1) ),
inference(spm,[status(thm)],[c_0_46,c_0_18]) ).
fof(c_0_53,plain,
! [X171] :
( ( ~ activity_occurrence(X171)
| occurrence_of(X171,esk1_1(X171)) )
& ( ~ activity_occurrence(X171)
| activity(esk1_1(X171)) ) ),
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_54,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,negated_conjecture,
occurrence_of(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),tptp3),
inference(spm,[status(thm)],[c_0_48,c_0_36]) ).
cnf(c_0_56,plain,
( ~ subactivity_occurrence(X2,X5)
| ~ subactivity_occurrence(X4,X5)
| ~ occurrence_of(X5,X3)
| ~ next_subocc(X1,X4,X3)
| ~ next_subocc(X1,X2,X3)
| X2 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,plain,
( ~ occurrence_of(X1,tptp0)
| next_subocc(esk17_1(X1),esk18_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_58,negated_conjecture,
esk17_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))) = esk17_1(esk20_0),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
fof(c_0_59,plain,
! [X285,X286,X288,X289,X290] :
( ( leaf_occ(X288,X289)
| ~ leaf(X288,X290)
| ~ subactivity_occurrence(X288,X289)
| ~ occurrence_of(X289,X290) )
& ( ~ leaf_occ(X285,X286)
| leaf(X285,esk15_2(X285,X286)) )
& ( ~ leaf_occ(X285,X286)
| subactivity_occurrence(X285,X286) )
& ( ~ leaf_occ(X285,X286)
| occurrence_of(X286,esk15_2(X285,X286)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_34])])])])])])]) ).
cnf(c_0_60,plain,
( ~ occurrence_of(X1,tptp0)
| leaf_occ(esk18_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_61,negated_conjecture,
occurrence_of(esk19_1(esk17_1(esk20_0)),tptp1),
inference(spm,[status(thm)],[c_0_52,c_0_22]) ).
cnf(c_0_62,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_63,negated_conjecture,
activity_occurrence(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_64,negated_conjecture,
( ~ occurrence_of(X2,tptp0)
| ~ next_subocc(esk17_1(esk20_0),X1,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ subactivity_occurrence(esk19_1(esk17_1(esk20_0)),X2)
| X1 = esk19_1(esk17_1(esk20_0)) ),
inference(spm,[status(thm)],[c_0_56,c_0_27]) ).
cnf(c_0_65,negated_conjecture,
next_subocc(esk17_1(esk20_0),esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_36]),c_0_58]) ).
cnf(c_0_66,plain,
( ~ leaf_occ(X1,X2)
| subactivity_occurrence(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_67,negated_conjecture,
leaf_occ(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),
inference(spm,[status(thm)],[c_0_60,c_0_36]) ).
cnf(c_0_68,plain,
( ~ min_precedes(X3,X1,X2)
| subactivity_occurrence(X1,esk10_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_69,negated_conjecture,
activity_occurrence(esk19_1(esk17_1(esk20_0))),
inference(spm,[status(thm)],[c_0_54,c_0_61]) ).
fof(c_0_70,plain,
tptp1 != tptp3,
inference(fof_simplification,[status(thm)],[sos_59]) ).
cnf(c_0_71,negated_conjecture,
( ~ occurrence_of(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),X1)
| X1 = tptp3 ),
inference(spm,[status(thm)],[c_0_28,c_0_55]) ).
cnf(c_0_72,negated_conjecture,
occurrence_of(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),esk1_1(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))))),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_73,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk19_1(esk17_1(esk20_0)),X1)
| ~ subactivity_occurrence(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),X1)
| esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))) = esk19_1(esk17_1(esk20_0)) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_74,negated_conjecture,
subactivity_occurrence(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_75,negated_conjecture,
subactivity_occurrence(esk19_1(esk17_1(esk20_0)),esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))),
inference(spm,[status(thm)],[c_0_68,c_0_31]) ).
cnf(c_0_76,negated_conjecture,
( ~ occurrence_of(esk19_1(esk17_1(esk20_0)),X1)
| X1 = tptp1 ),
inference(spm,[status(thm)],[c_0_28,c_0_61]) ).
cnf(c_0_77,negated_conjecture,
occurrence_of(esk19_1(esk17_1(esk20_0)),esk1_1(esk19_1(esk17_1(esk20_0)))),
inference(spm,[status(thm)],[c_0_62,c_0_69]) ).
fof(c_0_78,plain,
tptp1 != tptp3,
inference(fof_nnf,[status(thm)],[c_0_70]) ).
cnf(c_0_79,negated_conjecture,
esk1_1(esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0))))) = tptp3,
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_80,negated_conjecture,
esk18_1(esk10_3(tptp0,esk17_1(esk20_0),esk19_1(esk17_1(esk20_0)))) = esk19_1(esk17_1(esk20_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_36]),c_0_74]),c_0_75])]) ).
cnf(c_0_81,negated_conjecture,
esk1_1(esk19_1(esk17_1(esk20_0))) = tptp1,
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_82,plain,
tptp1 != tptp3,
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : PRO003+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/10.95 % Computer : n012.cluster.edu
% 0.05/10.95 % Model : x86_64 x86_64
% 0.05/10.95 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/10.95 % Memory : 8046.5625MB
% 0.05/10.95 % OS : Linux 6.8.0-71-generic
% 0.05/10.95 % CPULimit : 300
% 0.05/10.95 % WCLimit : 300
% 0.05/10.95 % DateTime : Mon Sep 21 03:40:34 UTC 2026
% 0.05/10.95 % CPUTime :
% 0.05/10.95 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/10.98 Running first-order theorem proving
% 0.05/10.98 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
% 5.13/11.79 % Version: 3.5.1
% 5.13/11.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.13/11.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.13/11.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.13/11.79 % Starting new_bool_3 with 300s (1) cores
% 5.13/11.79 % Starting new_bool_1 with 300s (1) cores
% 5.13/11.79 % Starting sh5l with 300s (1) cores
% 5.13/11.79 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1482574 completed with status 0
% 5.13/11.79 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 5.13/11.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.13/11.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.13/11.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.13/11.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.13/11.79 % No SInE strategy applied
% 5.13/11.79 % Search class: FGHSF-FFMM32-SFFFFFNN
% 5.13/11.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.13/11.79 % Starting SubtermCWHack with 136s (1) cores
% 5.13/11.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 5.13/11.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 5.13/11.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 5.13/11.79 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 5.13/11.79 % G-E--_208_C18_F1_SE_CS_SP_PS_S2g with pid 1482583 completed with status 0
% 5.13/11.79 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2g
% 5.13/11.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.13/11.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.13/11.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.13/11.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.13/11.79 % No SInE strategy applied
% 5.13/11.79 % Search class: FGHSF-FFMM32-SFFFFFNN
% 5.13/11.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.13/11.79 % Starting SubtermCWHack with 136s (1) cores
% 5.13/11.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 5.13/11.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 5.13/11.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 5.13/11.79 % Preprocessing time : 0.002 s
% 5.13/11.79 % Presaturation interreduction done
% 5.13/11.79
% 5.13/11.79 % Proof found!
% 5.13/11.79 % SZS status Theorem
% 5.13/11.79 % SZS output start CNFRefutation
% See solution above
% 5.13/11.79 % Parsed axioms : 64
% 5.13/11.79 % Removed by relevancy pruning/SinE : 0
% 5.13/11.79 % Initial clauses : 102
% 5.13/11.79 % Removed in clause preprocessing : 0
% 5.13/11.79 % Initial clauses in saturation : 102
% 5.13/11.79 % Processed clauses : 6461
% 5.13/11.79 % ...of these trivial : 337
% 5.13/11.79 % ...subsumed : 2399
% 5.13/11.79 % ...remaining for further processing : 3725
% 5.13/11.79 % Other redundant clauses eliminated : 0
% 5.13/11.79 % Clauses deleted for lack of memory : 0
% 5.13/11.79 % Backward-subsumed : 0
% 5.13/11.79 % Backward-rewritten : 729
% 5.13/11.79 % Generated clauses : 30118
% 5.13/11.79 % ...of the previous two non-redundant : 18469
% 5.13/11.79 % ...aggressively subsumed : 0
% 5.13/11.79 % Contextual simplify-reflections : 5
% 5.13/11.79 % Paramodulations : 30118
% 5.13/11.79 % Factorizations : 0
% 5.13/11.79 % NegExts : 0
% 5.13/11.79 % Equation resolutions : 0
% 5.13/11.79 % Disequality decompositions : 0
% 5.13/11.79 % Total rewrite steps : 26801
% 5.13/11.79 % ...of those cached : 26379
% 5.13/11.79 % Propositional unsat checks : 0
% 5.13/11.79 % Propositional check models : 0
% 5.13/11.79 % Propositional check unsatisfiable : 0
% 5.13/11.79 % Propositional clauses : 0
% 5.13/11.79 % Propositional clauses after purity: 0
% 5.13/11.79 % Propositional unsat core size : 0
% 5.13/11.79 % Propositional preprocessing time : 0.000
% 5.13/11.79 % Propositional encoding time : 0.000
% 5.13/11.79 % Propositional solver time : 0.000
% 5.13/11.79 % Success case prop preproc time : 0.000
% 5.13/11.79 % Success case prop encoding time : 0.000
% 5.13/11.79 % Success case prop solver time : 0.000
% 5.13/11.79 % Current number of processed clauses : 2894
% 5.13/11.79 % Positive orientable unit clauses : 885
% 5.13/11.79 % Positive unorientable unit clauses: 0
% 5.13/11.79 % Negative unit clauses : 369
% 5.13/11.79 % Non-unit-clauses : 1640
% 5.13/11.79 % Current number of unprocessed clauses: 11030
% 5.13/11.79 % ...number of literals in the above : 29916
% 5.13/11.79 % Current number of archived formulas : 0
% 5.13/11.79 % Current number of archived clauses : 831
% 5.13/11.79 % Clause-clause subsumption calls (NU) : 346908
% 5.13/11.79 % Rec. Clause-clause subsumption calls : 278711
% 5.13/11.79 % Non-unit clause-clause subsumptions : 1894
% 5.13/11.79 % Unit Clause-clause subsumption calls : 44837
% 5.13/11.79 % Rewrite failures with RHS unbound : 0
% 5.13/11.79 % BW rewrite match attempts : 3027
% 5.13/11.79 % BW rewrite match successes : 91
% 5.13/11.79 % Condensation attempts : 0
% 5.13/11.79 % Condensation successes : 0
% 5.13/11.79 % Termbank termtop insertions : 1104462
% 5.13/11.79 % Search garbage collected termcells : 1811
% 5.13/11.79
% 5.13/11.79 % -------------------------------------------------
% 5.13/11.79 % User time : 0.753 s
% 5.13/11.79 % System time : 0.033 s
% 5.13/11.79 % Total time : 0.786 s
% 5.13/11.79 % Maximum resident set size: 4064 pages
% 5.13/11.79
% 5.13/11.79 % -------------------------------------------------
% 5.13/11.79 % User time : 3.378 s
% 5.13/11.79 % System time : 0.114 s
% 5.13/11.79 % Total time : 3.492 s
% 5.13/11.79 % Maximum resident set size: 4864 pages
% 5.13/11.79 % E exiting
%------------------------------------------------------------------------------