%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO017+2 : 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 : n016.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:35 PM UTC 2026
% Result : Theorem 0.14s 0.69s
% Output : CNFRefutation 0.14s
% 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,
! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105] :
( leaf(X105,tptp0)
& min_precedes(X104,X105,tptp0)
& ( occurrence_of(X105,tptp1)
| occurrence_of(X105,tptp2) )
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X96,X97] :
( ( ~ leaf_occ(X96,X97)
& arboreal(X96)
& subactivity_occurrence(X96,X97)
& occurrence_of(X97,tptp0) )
=> ? [X98,X99,X100] :
( ! [X101] :
( min_precedes(X98,X101,tptp0)
=> ( X101 = X100
| X101 = X99 ) )
& min_precedes(X99,X100,tptp0)
& ( occurrence_of(X100,tptp1)
| occurrence_of(X100,tptp2) )
& min_precedes(X98,X99,tptp0)
& occurrence_of(X99,tptp4)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X98,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(sos_04,axiom,
! [X16,X17,X18] :
( next_subocc(X16,X17,X18)
<=> ( ~ ? [X19] :
( min_precedes(X19,X17,X18)
& min_precedes(X16,X19,X18) )
& min_precedes(X16,X17,X18) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).
fof(sos_24,axiom,
! [X71,X72,X73] :
( min_precedes(X72,X73,X71)
=> ? [X74] :
( subactivity_occurrence(X73,X74)
& subactivity_occurrence(X72,X74)
& occurrence_of(X74,X71) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_24) ).
fof(sos_21,axiom,
! [X61,X62,X63] :
( ( leaf_occ(X62,X61)
& occurrence_of(X61,X63) )
=> ~ ? [X64] : min_precedes(X62,X64,X63) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_21) ).
fof(sos_13,axiom,
! [X41,X42] :
( occurrence_of(X41,X42)
=> ( arboreal(X41)
<=> atomic(X42) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_13) ).
fof(sos_38,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_38) ).
fof(sos_22,axiom,
! [X65,X66,X67] :
( ( occurrence_of(X65,X67)
& occurrence_of(X65,X66) )
=> X66 = X67 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_22) ).
fof(sos_39,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_39) ).
fof(c_0_9,negated_conjecture,
~ ! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105] :
( leaf(X105,tptp0)
& min_precedes(X104,X105,tptp0)
& ( occurrence_of(X105,tptp1)
| occurrence_of(X105,tptp2) )
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_10,plain,
! [X96,X97] :
( ( ~ leaf_occ(X96,X97)
& arboreal(X96)
& subactivity_occurrence(X96,X97)
& occurrence_of(X97,tptp0) )
=> ? [X98,X99,X100] :
( ! [X101] :
( min_precedes(X98,X101,tptp0)
=> ( X101 = X100
| X101 = X99 ) )
& min_precedes(X99,X100,tptp0)
& ( occurrence_of(X100,tptp1)
| occurrence_of(X100,tptp2) )
& min_precedes(X98,X99,tptp0)
& occurrence_of(X99,tptp4)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X98,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_11,negated_conjecture,
~ ! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105] :
( leaf(X105,tptp0)
& min_precedes(X104,X105,tptp0)
& ( occurrence_of(X105,tptp1)
| occurrence_of(X105,tptp2) )
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X218,X219,X223] :
( ( leaf_occ(X218,X219)
| ~ arboreal(X218)
| ~ subactivity_occurrence(X218,X219)
| ~ occurrence_of(X219,tptp0)
| X223 = esk17_1(X218)
| X223 = esk16_1(X218)
| ~ min_precedes(esk15_1(X218),X223,tptp0) )
& ( leaf_occ(X218,X219)
| ~ arboreal(X218)
| ~ subactivity_occurrence(X218,X219)
| ~ occurrence_of(X219,tptp0)
| min_precedes(esk16_1(X218),esk17_1(X218),tptp0) )
& ( leaf_occ(X218,X219)
| ~ arboreal(X218)
| ~ subactivity_occurrence(X218,X219)
| ~ occurrence_of(X219,tptp0)
| occurrence_of(esk17_1(X218),tptp1)
| occurrence_of(esk17_1(X218),tptp2) )
& ( leaf_occ(X218,X219)
| ~ arboreal(X218)
| ~ subactivity_occurrence(X218,X219)
| ~ occurrence_of(X219,tptp0)
| min_precedes(esk15_1(X218),esk16_1(X218),tptp0) )
& ( leaf_occ(X218,X219)
| ~ arboreal(X218)
| ~ subactivity_occurrence(X218,X219)
| ~ occurrence_of(X219,tptp0)
| occurrence_of(esk16_1(X218),tptp4) )
& ( leaf_occ(X218,X219)
| ~ arboreal(X218)
| ~ subactivity_occurrence(X218,X219)
| ~ occurrence_of(X219,tptp0)
| next_subocc(X218,esk15_1(X218),tptp0) )
& ( leaf_occ(X218,X219)
| ~ arboreal(X218)
| ~ subactivity_occurrence(X218,X219)
| ~ occurrence_of(X219,tptp0)
| occurrence_of(esk15_1(X218),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,
! [X226,X227] :
( ( ~ leaf(X227,tptp0)
| ~ min_precedes(X226,X227,tptp0)
| ~ next_subocc(esk18_0,X226,tptp0)
| ~ occurrence_of(X226,tptp3)
| ~ occurrence_of(X227,tptp1) )
& ( ~ leaf(X227,tptp0)
| ~ min_precedes(X226,X227,tptp0)
| ~ next_subocc(esk18_0,X226,tptp0)
| ~ occurrence_of(X226,tptp3)
| ~ occurrence_of(X227,tptp2) )
& ~ leaf_occ(esk18_0,esk19_0)
& arboreal(esk18_0)
& subactivity_occurrence(esk18_0,esk19_0)
& occurrence_of(esk19_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,esk15_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
occurrence_of(esk19_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X121,X122,X123,X124,X125,X126,X127] :
( ( next_subocc(X125,X126,X127)
| ~ min_precedes(X125,X126,X127)
| min_precedes(esk1_3(X125,X126,X127),X126,X127) )
& ( next_subocc(X125,X126,X127)
| ~ min_precedes(X125,X126,X127)
| min_precedes(X125,esk1_3(X125,X126,X127),X127) )
& ( ~ next_subocc(X121,X122,X123)
| ~ min_precedes(X124,X122,X123)
| ~ min_precedes(X121,X124,X123) )
& ( ~ next_subocc(X121,X122,X123)
| min_precedes(X121,X122,X123) ) ),
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_04])])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| leaf_occ(X1,esk19_0)
| next_subocc(X1,esk15_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
subactivity_occurrence(esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
arboreal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
~ leaf_occ(esk18_0,esk19_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(esk15_1(X1),esk16_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_22,plain,
! [X193,X194,X195] :
( ( ~ min_precedes(X194,X195,X193)
| subactivity_occurrence(X195,esk9_3(X193,X194,X195)) )
& ( ~ min_precedes(X194,X195,X193)
| subactivity_occurrence(X194,esk9_3(X193,X194,X195)) )
& ( ~ min_precedes(X194,X195,X193)
| occurrence_of(esk9_3(X193,X194,X195),X193) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_24])])])])]) ).
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(esk18_0,esk15_1(esk18_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(esk15_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_26,plain,
! [X183,X184,X185,X186] :
( ~ min_precedes(X184,X186,X185)
| ~ leaf_occ(X184,X183)
| ~ occurrence_of(X183,X185) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])]) ).
cnf(c_0_27,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| min_precedes(esk15_1(X1),esk16_1(X1),tptp0)
| leaf_occ(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_28,plain,
( ~ min_precedes(X2,X3,X1)
| occurrence_of(esk9_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
min_precedes(esk18_0,esk15_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_30,plain,
! [X156,X157] :
( ( ~ occurrence_of(X156,X157)
| arboreal(X156)
| ~ atomic(X157) )
& ( ~ occurrence_of(X156,X157)
| atomic(X157)
| ~ arboreal(X156) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_13])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| occurrence_of(esk15_1(X1),tptp3)
| leaf_occ(X1,esk19_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(esk15_1(esk18_0),esk16_1(esk18_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(esk9_3(tptp0,esk18_0,esk15_1(esk18_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,esk9_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(esk15_1(esk18_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_38]) ).
cnf(c_0_39,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(esk15_1(esk18_0),X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| leaf_occ(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| next_subocc(X1,esk15_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_14,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
subactivity_occurrence(esk15_1(esk18_0),esk9_3(tptp0,esk18_0,esk15_1(esk18_0))),
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_42,negated_conjecture,
arboreal(esk15_1(esk18_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(esk15_1(esk18_0),esk9_3(tptp0,esk18_0,esk15_1(esk18_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(esk15_1(X1),X2,tptp0)
| leaf_occ(X1,X3)
| X2 = esk17_1(X1)
| X2 = esk16_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(esk15_1(esk18_0),esk15_1(esk15_1(esk18_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,
( ~ min_precedes(esk15_1(X2),X1,tptp0)
| ~ arboreal(X2)
| ~ subactivity_occurrence(X2,esk19_0)
| leaf_occ(X2,esk19_0)
| X1 = esk16_1(X2)
| X1 = esk17_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(esk16_1(X1),esk17_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(esk16_1(X1),tptp4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_50,negated_conjecture,
( ~ min_precedes(esk15_1(esk18_0),X1,tptp0)
| ~ min_precedes(X1,esk15_1(esk15_1(esk18_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( ~ min_precedes(esk15_1(esk18_0),X1,tptp0)
| X1 = esk17_1(esk18_0)
| X1 = esk16_1(esk18_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(esk15_1(esk18_0),esk15_1(esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_23,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| leaf_occ(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_15]) ).
fof(c_0_54,plain,
! [X187,X188,X189] :
( X188 = X189
| ~ occurrence_of(X187,X189)
| ~ occurrence_of(X187,X188) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])])]) ).
cnf(c_0_55,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| occurrence_of(esk16_1(X1),tptp4)
| leaf_occ(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_15]) ).
cnf(c_0_56,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| occurrence_of(esk15_1(X1),tptp3)
| leaf_occ(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0))) ),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_57,negated_conjecture,
~ min_precedes(esk16_1(esk18_0),esk15_1(esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_50,c_0_33]) ).
cnf(c_0_58,negated_conjecture,
( esk15_1(esk15_1(esk18_0)) = esk16_1(esk18_0)
| esk15_1(esk15_1(esk18_0)) = esk17_1(esk18_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
min_precedes(esk16_1(esk18_0),esk17_1(esk18_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_39]) ).
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(esk16_1(esk18_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(esk15_1(esk15_1(esk18_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,
esk15_1(esk15_1(esk18_0)) = esk16_1(esk18_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(esk16_1(esk18_0),X1)
| X1 = tptp4 ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
occurrence_of(esk16_1(esk18_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.02 % Problem : PRO017+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.55 % Computer : n016.cluster.edu
% 0.09/0.55 % Model : x86_64 x86_64
% 0.09/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.55 % Memory : 8046.5625MB
% 0.09/0.55 % OS : Linux 6.8.0-71-generic
% 0.09/0.55 % CPULimit : 300
% 0.09/0.55 % WCLimit : 300
% 0.09/0.55 % DateTime : Mon Sep 21 03:48:37 UTC 2026
% 0.09/0.55 % CPUTime :
% 0.09/0.55 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.60 Running first-order theorem proving
% 0.14/0.60 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.14/0.69 % Version: 3.5.1
% 0.14/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.69 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.69 % Starting sh5l with 300s (1) cores
% 0.14/0.69 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1477756 completed with status 0
% 0.14/0.69 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.69 % No SInE strategy applied
% 0.14/0.69 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.14/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.14/0.69 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.14/0.69 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.69 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 1477765 completed with status 0
% 0.14/0.69 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.14/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.69 % No SInE strategy applied
% 0.14/0.69 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.14/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.14/0.69 % Preprocessing time : 0.002 s
% 0.14/0.69 % Presaturation interreduction done
% 0.14/0.69
% 0.14/0.69 % Proof found!
% 0.14/0.69 % SZS status Theorem
% 0.14/0.69 % SZS output start CNFRefutation
% See solution above
% 0.14/0.69 % Parsed axioms : 46
% 0.14/0.69 % Removed by relevancy pruning/SinE : 0
% 0.14/0.69 % Initial clauses : 88
% 0.14/0.69 % Removed in clause preprocessing : 0
% 0.14/0.69 % Initial clauses in saturation : 88
% 0.14/0.69 % Processed clauses : 883
% 0.14/0.69 % ...of these trivial : 21
% 0.14/0.69 % ...subsumed : 110
% 0.14/0.69 % ...remaining for further processing : 752
% 0.14/0.69 % Other redundant clauses eliminated : 0
% 0.14/0.69 % Clauses deleted for lack of memory : 0
% 0.14/0.69 % Backward-subsumed : 1
% 0.14/0.69 % Backward-rewritten : 62
% 0.14/0.69 % Generated clauses : 1465
% 0.14/0.69 % ...of the previous two non-redundant : 1248
% 0.14/0.69 % ...aggressively subsumed : 0
% 0.14/0.69 % Contextual simplify-reflections : 1
% 0.14/0.69 % Paramodulations : 1463
% 0.14/0.69 % Factorizations : 2
% 0.14/0.69 % NegExts : 0
% 0.14/0.69 % Equation resolutions : 0
% 0.14/0.69 % Disequality decompositions : 0
% 0.14/0.69 % Total rewrite steps : 515
% 0.14/0.69 % ...of those cached : 408
% 0.14/0.69 % Propositional unsat checks : 0
% 0.14/0.69 % Propositional check models : 0
% 0.14/0.69 % Propositional check unsatisfiable : 0
% 0.14/0.69 % Propositional clauses : 0
% 0.14/0.69 % Propositional clauses after purity: 0
% 0.14/0.69 % Propositional unsat core size : 0
% 0.14/0.69 % Propositional preprocessing time : 0.000
% 0.14/0.69 % Propositional encoding time : 0.000
% 0.14/0.69 % Propositional solver time : 0.000
% 0.14/0.69 % Success case prop preproc time : 0.000
% 0.14/0.69 % Success case prop encoding time : 0.000
% 0.14/0.69 % Success case prop solver time : 0.000
% 0.14/0.69 % Current number of processed clauses : 601
% 0.14/0.69 % Positive orientable unit clauses : 192
% 0.14/0.69 % Positive unorientable unit clauses: 0
% 0.14/0.69 % Negative unit clauses : 168
% 0.14/0.69 % Non-unit-clauses : 241
% 0.14/0.69 % Current number of unprocessed clauses: 505
% 0.14/0.69 % ...number of literals in the above : 1107
% 0.14/0.69 % Current number of archived formulas : 0
% 0.14/0.69 % Current number of archived clauses : 151
% 0.14/0.69 % Clause-clause subsumption calls (NU) : 12229
% 0.14/0.69 % Rec. Clause-clause subsumption calls : 6465
% 0.14/0.69 % Non-unit clause-clause subsumptions : 66
% 0.14/0.69 % Unit Clause-clause subsumption calls : 1936
% 0.14/0.69 % Rewrite failures with RHS unbound : 0
% 0.14/0.69 % BW rewrite match attempts : 85
% 0.14/0.69 % BW rewrite match successes : 18
% 0.14/0.69 % Condensation attempts : 0
% 0.14/0.69 % Condensation successes : 0
% 0.14/0.69 % Termbank termtop insertions : 27940
% 0.14/0.69 % Search garbage collected termcells : 1355
% 0.14/0.69
% 0.14/0.69 % -------------------------------------------------
% 0.14/0.69 % User time : 0.061 s
% 0.14/0.69 % System time : 0.014 s
% 0.14/0.69 % Total time : 0.075 s
% 0.14/0.69 % Maximum resident set size: 3996 pages
% 0.14/0.69
% 0.14/0.69 % -------------------------------------------------
% 0.14/0.69 % User time : 0.315 s
% 0.14/0.69 % System time : 0.041 s
% 0.14/0.69 % Total time : 0.356 s
% 0.14/0.69 % Maximum resident set size: 4864 pages
% 0.14/0.69 % E exiting
%------------------------------------------------------------------------------