%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO017+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 : n002.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.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 70 ( 27 unt; 0 def)
% Number of atoms : 278 ( 23 equ)
% Maximal formula atoms : 38 ( 3 avg)
% Number of connectives : 330 ( 122 ~; 133 |; 62 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 113 ( 1 sgn 50 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X168,X169] :
( ( ~ leaf_occ(X168,X169)
& arboreal(X168)
& subactivity_occurrence(X168,X169)
& occurrence_of(X169,tptp0) )
=> ? [X170,X171] :
( leaf(X171,tptp0)
& min_precedes(X170,X171,tptp0)
& ( occurrence_of(X171,tptp1)
| occurrence_of(X171,tptp2) )
& next_subocc(X168,X170,tptp0)
& occurrence_of(X170,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_49,axiom,
! [X162,X163] :
( ( ~ leaf_occ(X162,X163)
& arboreal(X162)
& subactivity_occurrence(X162,X163)
& occurrence_of(X163,tptp0) )
=> ? [X164,X165,X166] :
( ! [X167] :
( min_precedes(X164,X167,tptp0)
=> ( X167 = X166
| X167 = X165 ) )
& min_precedes(X165,X166,tptp0)
& ( occurrence_of(X166,tptp1)
| occurrence_of(X166,tptp2) )
& min_precedes(X164,X165,tptp0)
& occurrence_of(X165,tptp4)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X164,tptp3) ) ),
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_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_37,axiom,
! [X114,X115,X116] :
( ( leaf_occ(X115,X114)
& occurrence_of(X114,X116) )
=> ~ ? [X117] : min_precedes(X115,X117,X116) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_37) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
fof(sos_55,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_55) ).
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_56,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_56) ).
fof(c_0_9,negated_conjecture,
~ ! [X168,X169] :
( ( ~ leaf_occ(X168,X169)
& arboreal(X168)
& subactivity_occurrence(X168,X169)
& occurrence_of(X169,tptp0) )
=> ? [X170,X171] :
( leaf(X171,tptp0)
& min_precedes(X170,X171,tptp0)
& ( occurrence_of(X171,tptp1)
| occurrence_of(X171,tptp2) )
& next_subocc(X168,X170,tptp0)
& occurrence_of(X170,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_10,plain,
! [X162,X163] :
( ( ~ leaf_occ(X162,X163)
& arboreal(X162)
& subactivity_occurrence(X162,X163)
& occurrence_of(X163,tptp0) )
=> ? [X164,X165,X166] :
( ! [X167] :
( min_precedes(X164,X167,tptp0)
=> ( X167 = X166
| X167 = X165 ) )
& min_precedes(X165,X166,tptp0)
& ( occurrence_of(X166,tptp1)
| occurrence_of(X166,tptp2) )
& min_precedes(X164,X165,tptp0)
& occurrence_of(X165,tptp4)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X164,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_49]) ).
fof(c_0_11,negated_conjecture,
~ ! [X168,X169] :
( ( ~ leaf_occ(X168,X169)
& arboreal(X168)
& subactivity_occurrence(X168,X169)
& occurrence_of(X169,tptp0) )
=> ? [X170,X171] :
( leaf(X171,tptp0)
& min_precedes(X170,X171,tptp0)
& ( occurrence_of(X171,tptp1)
| occurrence_of(X171,tptp2) )
& next_subocc(X168,X170,tptp0)
& occurrence_of(X170,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X350,X351,X355] :
( ( leaf_occ(X350,X351)
| ~ arboreal(X350)
| ~ subactivity_occurrence(X350,X351)
| ~ occurrence_of(X351,tptp0)
| X355 = esk19_1(X350)
| X355 = esk18_1(X350)
| ~ min_precedes(esk17_1(X350),X355,tptp0) )
& ( leaf_occ(X350,X351)
| ~ arboreal(X350)
| ~ subactivity_occurrence(X350,X351)
| ~ occurrence_of(X351,tptp0)
| min_precedes(esk18_1(X350),esk19_1(X350),tptp0) )
& ( leaf_occ(X350,X351)
| ~ arboreal(X350)
| ~ subactivity_occurrence(X350,X351)
| ~ occurrence_of(X351,tptp0)
| occurrence_of(esk19_1(X350),tptp1)
| occurrence_of(esk19_1(X350),tptp2) )
& ( leaf_occ(X350,X351)
| ~ arboreal(X350)
| ~ subactivity_occurrence(X350,X351)
| ~ occurrence_of(X351,tptp0)
| min_precedes(esk17_1(X350),esk18_1(X350),tptp0) )
& ( leaf_occ(X350,X351)
| ~ arboreal(X350)
| ~ subactivity_occurrence(X350,X351)
| ~ occurrence_of(X351,tptp0)
| occurrence_of(esk18_1(X350),tptp4) )
& ( leaf_occ(X350,X351)
| ~ arboreal(X350)
| ~ subactivity_occurrence(X350,X351)
| ~ occurrence_of(X351,tptp0)
| next_subocc(X350,esk17_1(X350),tptp0) )
& ( leaf_occ(X350,X351)
| ~ arboreal(X350)
| ~ subactivity_occurrence(X350,X351)
| ~ occurrence_of(X351,tptp0)
| occurrence_of(esk17_1(X350),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_10])])])])])])]) ).
fof(c_0_13,negated_conjecture,
! [X358,X359] :
( ( ~ leaf(X359,tptp0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp1) )
& ( ~ leaf(X359,tptp0)
| ~ min_precedes(X358,X359,tptp0)
| ~ next_subocc(esk20_0,X358,tptp0)
| ~ occurrence_of(X358,tptp3)
| ~ occurrence_of(X359,tptp2) )
& ~ leaf_occ(esk20_0,esk21_0)
& arboreal(esk20_0)
& subactivity_occurrence(esk20_0,esk21_0)
& occurrence_of(esk21_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_11])])])])])]) ).
cnf(c_0_14,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk17_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
occurrence_of(esk21_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X236,X237,X238,X239,X240,X241,X242] :
( ( next_subocc(X240,X241,X242)
| ~ min_precedes(X240,X241,X242)
| min_precedes(esk8_3(X240,X241,X242),X241,X242) )
& ( next_subocc(X240,X241,X242)
| ~ min_precedes(X240,X241,X242)
| min_precedes(X240,esk8_3(X240,X241,X242),X242) )
& ( ~ next_subocc(X236,X237,X238)
| ~ min_precedes(X239,X237,X238)
| ~ min_precedes(X236,X239,X238) )
& ( ~ next_subocc(X236,X237,X238)
| min_precedes(X236,X237,X238) ) ),
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_17,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| next_subocc(X1,esk17_1(X1),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
subactivity_occurrence(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
arboreal(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
~ leaf_occ(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| min_precedes(esk17_1(X1),esk18_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_22,plain,
! [X252,X253,X254] :
( ( ~ min_precedes(X253,X254,X252)
| subactivity_occurrence(X254,esk10_3(X252,X253,X254)) )
& ( ~ min_precedes(X253,X254,X252)
| subactivity_occurrence(X253,esk10_3(X252,X253,X254)) )
& ( ~ min_precedes(X253,X254,X252)
| occurrence_of(esk10_3(X252,X253,X254),X252) ) ),
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_23,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
next_subocc(esk20_0,esk17_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_25,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk17_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_26,plain,
! [X302,X303,X304,X305] :
( ~ min_precedes(X303,X305,X304)
| ~ leaf_occ(X303,X302)
| ~ occurrence_of(X302,X304) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_37])])])]) ).
cnf(c_0_27,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| min_precedes(esk17_1(X1),esk18_1(X1),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_28,plain,
( ~ min_precedes(X2,X3,X1)
| occurrence_of(esk10_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
min_precedes(esk20_0,esk17_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_30,plain,
! [X188,X189] :
( ( ~ occurrence_of(X188,X189)
| arboreal(X188)
| ~ atomic(X189) )
& ( ~ occurrence_of(X188,X189)
| atomic(X189)
| ~ arboreal(X188) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| occurrence_of(esk17_1(X1),tptp3)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_32,plain,
( ~ min_precedes(X3,X4,X2)
| ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
min_precedes(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_34,negated_conjecture,
occurrence_of(esk10_3(tptp0,esk20_0,esk17_1(esk20_0)),tptp0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( ~ min_precedes(X3,X1,X2)
| subactivity_occurrence(X1,esk10_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_36,plain,
( ~ occurrence_of(X2,X1)
| ~ atomic(X1)
| arboreal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
occurrence_of(esk17_1(esk20_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_38,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_55]) ).
cnf(c_0_39,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(esk17_1(esk20_0),X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk20_0,esk17_1(esk20_0)))
| next_subocc(X1,esk17_1(X1),tptp0)
| leaf_occ(X1,esk10_3(tptp0,esk20_0,esk17_1(esk20_0))) ),
inference(spm,[status(thm)],[c_0_14,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
subactivity_occurrence(esk17_1(esk20_0),esk10_3(tptp0,esk20_0,esk17_1(esk20_0))),
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_42,negated_conjecture,
arboreal(esk17_1(esk20_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_43,negated_conjecture,
~ leaf_occ(esk17_1(esk20_0),esk10_3(tptp0,esk20_0,esk17_1(esk20_0))),
inference(spm,[status(thm)],[c_0_39,c_0_34]) ).
cnf(c_0_44,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X3)
| ~ occurrence_of(X3,tptp0)
| ~ min_precedes(esk17_1(X1),X2,tptp0)
| leaf_occ(X1,X3)
| X2 = esk19_1(X1)
| X2 = esk18_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_45,plain,
( ~ next_subocc(X1,X4,X3)
| ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_46,negated_conjecture,
next_subocc(esk17_1(esk20_0),esk17_1(esk17_1(esk20_0)),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( ~ arboreal(X2)
| ~ min_precedes(esk17_1(X2),X1,tptp0)
| ~ subactivity_occurrence(X2,esk21_0)
| leaf_occ(X2,esk21_0)
| X1 = esk18_1(X2)
| X1 = esk19_1(X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_15]) ).
cnf(c_0_48,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| min_precedes(esk18_1(X1),esk19_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_49,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk18_1(X1),tptp4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_50,negated_conjecture,
( ~ min_precedes(esk17_1(esk20_0),X1,tptp0)
| ~ min_precedes(X1,esk17_1(esk17_1(esk20_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( ~ min_precedes(esk17_1(esk20_0),X1,tptp0)
| X1 = esk19_1(esk20_0)
| X1 = esk18_1(esk20_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_52,negated_conjecture,
min_precedes(esk17_1(esk20_0),esk17_1(esk17_1(esk20_0)),tptp0),
inference(spm,[status(thm)],[c_0_23,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| min_precedes(esk18_1(X1),esk19_1(X1),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_15]) ).
fof(c_0_54,plain,
! [X176,X177,X178] :
( X177 = X178
| ~ occurrence_of(X176,X178)
| ~ occurrence_of(X176,X177) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
cnf(c_0_55,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| occurrence_of(esk18_1(X1),tptp4)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_15]) ).
cnf(c_0_56,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk20_0,esk17_1(esk20_0)))
| occurrence_of(esk17_1(X1),tptp3)
| leaf_occ(X1,esk10_3(tptp0,esk20_0,esk17_1(esk20_0))) ),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_57,negated_conjecture,
~ min_precedes(esk18_1(esk20_0),esk17_1(esk17_1(esk20_0)),tptp0),
inference(spm,[status(thm)],[c_0_50,c_0_33]) ).
cnf(c_0_58,negated_conjecture,
( esk17_1(esk17_1(esk20_0)) = esk18_1(esk20_0)
| esk17_1(esk17_1(esk20_0)) = esk19_1(esk20_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
min_precedes(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_18]),c_0_19])]),c_0_20]) ).
fof(c_0_60,plain,
tptp4 != tptp3,
inference(fof_simplification,[status(thm)],[sos_56]) ).
cnf(c_0_61,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_62,negated_conjecture,
occurrence_of(esk18_1(esk20_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_63,negated_conjecture,
occurrence_of(esk17_1(esk17_1(esk20_0)),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_64,negated_conjecture,
esk17_1(esk17_1(esk20_0)) = esk18_1(esk20_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
fof(c_0_65,plain,
tptp4 != tptp3,
inference(fof_nnf,[status(thm)],[c_0_60]) ).
cnf(c_0_66,negated_conjecture,
( ~ occurrence_of(esk18_1(esk20_0),X1)
| X1 = tptp4 ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
occurrence_of(esk18_1(esk20_0),tptp3),
inference(rw,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,plain,
tptp4 != tptp3,
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO017+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n002.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 03:46:32 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 % Version: 3.5.1
% 0.19/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.54 % Starting sh5l with 300s (1) cores
% 0.19/0.54 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2351384 completed with status 0
% 0.19/0.54 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.54 % No SInE strategy applied
% 0.19/0.54 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.19/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.19/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.19/0.54 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.19/0.54 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 2351392 completed with status 0
% 0.19/0.54 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.19/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.54 % No SInE strategy applied
% 0.19/0.54 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.19/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.19/0.54 % Preprocessing time : 0.003 s
% 0.19/0.54 % Presaturation interreduction done
% 0.19/0.54
% 0.19/0.54 % Proof found!
% 0.19/0.54 % SZS status Theorem
% 0.19/0.54 % SZS output start CNFRefutation
% See solution above
% 0.19/0.54 % Parsed axioms : 63
% 0.19/0.54 % Removed by relevancy pruning/SinE : 0
% 0.19/0.54 % Initial clauses : 107
% 0.19/0.54 % Removed in clause preprocessing : 0
% 0.19/0.54 % Initial clauses in saturation : 107
% 0.19/0.54 % Processed clauses : 1085
% 0.19/0.54 % ...of these trivial : 19
% 0.19/0.54 % ...subsumed : 162
% 0.19/0.54 % ...remaining for further processing : 904
% 0.19/0.54 % Other redundant clauses eliminated : 0
% 0.19/0.54 % Clauses deleted for lack of memory : 0
% 0.19/0.54 % Backward-subsumed : 0
% 0.19/0.54 % Backward-rewritten : 58
% 0.19/0.54 % Generated clauses : 2070
% 0.19/0.54 % ...of the previous two non-redundant : 1770
% 0.19/0.54 % ...aggressively subsumed : 0
% 0.19/0.54 % Contextual simplify-reflections : 2
% 0.19/0.54 % Paramodulations : 2065
% 0.19/0.54 % Factorizations : 5
% 0.19/0.54 % NegExts : 0
% 0.19/0.54 % Equation resolutions : 0
% 0.19/0.54 % Disequality decompositions : 0
% 0.19/0.54 % Total rewrite steps : 631
% 0.19/0.54 % ...of those cached : 522
% 0.19/0.54 % Propositional unsat checks : 0
% 0.19/0.54 % Propositional check models : 0
% 0.19/0.54 % Propositional check unsatisfiable : 0
% 0.19/0.54 % Propositional clauses : 0
% 0.19/0.54 % Propositional clauses after purity: 0
% 0.19/0.54 % Propositional unsat core size : 0
% 0.19/0.54 % Propositional preprocessing time : 0.000
% 0.19/0.54 % Propositional encoding time : 0.000
% 0.19/0.54 % Propositional solver time : 0.000
% 0.19/0.54 % Success case prop preproc time : 0.000
% 0.19/0.54 % Success case prop encoding time : 0.000
% 0.19/0.54 % Success case prop solver time : 0.000
% 0.19/0.54 % Current number of processed clauses : 739
% 0.19/0.54 % Positive orientable unit clauses : 193
% 0.19/0.54 % Positive unorientable unit clauses: 0
% 0.19/0.54 % Negative unit clauses : 166
% 0.19/0.54 % Non-unit-clauses : 380
% 0.19/0.54 % Current number of unprocessed clauses: 860
% 0.19/0.54 % ...number of literals in the above : 2165
% 0.19/0.54 % Current number of archived formulas : 0
% 0.19/0.54 % Current number of archived clauses : 165
% 0.19/0.54 % Clause-clause subsumption calls (NU) : 29209
% 0.19/0.54 % Rec. Clause-clause subsumption calls : 13201
% 0.19/0.54 % Non-unit clause-clause subsumptions : 103
% 0.19/0.54 % Unit Clause-clause subsumption calls : 8136
% 0.19/0.54 % Rewrite failures with RHS unbound : 0
% 0.19/0.54 % BW rewrite match attempts : 21
% 0.19/0.54 % BW rewrite match successes : 16
% 0.19/0.54 % Condensation attempts : 0
% 0.19/0.54 % Condensation successes : 0
% 0.19/0.54 % Termbank termtop insertions : 43677
% 0.19/0.54 % Search garbage collected termcells : 1967
% 0.19/0.54
% 0.19/0.54 % -------------------------------------------------
% 0.19/0.54 % User time : 0.097 s
% 0.19/0.54 % System time : 0.008 s
% 0.19/0.54 % Total time : 0.105 s
% 0.19/0.54 % Maximum resident set size: 4068 pages
% 0.19/0.54
% 0.19/0.54 % -------------------------------------------------
% 0.19/0.54 % User time : 0.365 s
% 0.19/0.54 % System time : 0.034 s
% 0.19/0.54 % Total time : 0.400 s
% 0.19/0.54 % Maximum resident set size: 5120 pages
% 0.19/0.54 % E exiting
%------------------------------------------------------------------------------