%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC053+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 02:44:42 PM UTC 2026
% Result : Theorem 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 80 ( 14 unt; 0 def)
% Number of atoms : 329 ( 92 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 405 ( 156 ~; 170 |; 39 &)
% ( 5 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn 51 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil) ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( app(X2,X3) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax40,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X2,X3)
& frontsegP(X1,X2) )
=> frontsegP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax40) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil) ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,plain,
! [X25,X26,X27,X28] :
( segmentP(app(app(X27,X25),X28),X26)
| ~ segmentP(X25,X26)
| ~ ssList(X28)
| ~ ssList(X27)
| ~ ssList(X26)
| ~ ssList(X25) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_13,plain,
! [X64] :
( app(nil,X64) = X64
| ~ ssList(X64) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil) ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ segmentP(X1,X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X3,X1),X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_18,plain,
! [X40,X41,X43] :
( ( ~ ssList(X40)
| ~ ssList(X41)
| frontsegP(X40,X41)
| app(X41,X43) != X40
| ~ ssList(X43) )
& ( ~ ssList(X40)
| ~ ssList(X41)
| ~ frontsegP(X40,X41)
| app(X41,esk10_2(X40,X41)) = X40 )
& ( ~ ssList(X40)
| ~ ssList(X41)
| ~ frontsegP(X40,X41)
| ssList(esk10_2(X40,X41)) ) ),
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)],[ax5])])])])])]) ).
fof(c_0_19,negated_conjecture,
! [X12] :
( ( nil != esk1_0
| ~ segmentP(esk1_0,X12)
| ~ segmentP(esk2_0,X12)
| ~ neq(X12,nil)
| ~ ssList(X12) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ segmentP(esk1_0,X12)
| ~ segmentP(esk2_0,X12)
| ~ neq(X12,nil)
| ~ ssList(X12) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( frontsegP(esk3_0,esk5_0)
| nil = esk3_0 )
& ( frontsegP(esk3_0,esk5_0)
| nil = esk4_0 )
& ( frontsegP(esk4_0,esk5_0)
| nil = esk3_0 )
& ( frontsegP(esk4_0,esk5_0)
| nil = esk4_0 )
& ( neq(esk5_0,nil)
| nil = esk3_0 )
& ( neq(esk5_0,nil)
| nil = esk4_0 )
& ( ssList(esk5_0)
| nil = esk3_0 )
& ( ssList(esk5_0)
| nil = esk4_0 )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
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_14])])])])])]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk10_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk10_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X44,X45,X46] :
( frontsegP(X44,X46)
| ~ frontsegP(X45,X46)
| ~ frontsegP(X44,X45)
| ~ ssList(X46)
| ~ ssList(X45)
| ~ ssList(X44) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ frontsegP(X1,X3)
| ~ segmentP(X3,X2)
| segmentP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( frontsegP(esk3_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,negated_conjecture,
( ssList(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_31,plain,
! [X24] :
( segmentP(X24,X24)
| ~ ssList(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_32,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,negated_conjecture,
( ssList(esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_35,plain,
! [X58] :
( ( ~ ssList(X58)
| frontsegP(nil,X58)
| nil != X58 )
& ( ~ ssList(X58)
| nil = X58
| ~ frontsegP(nil,X58) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])])]) ).
cnf(c_0_36,plain,
( ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_37,negated_conjecture,
( frontsegP(esk3_0,esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_38,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk3_0,X1)
| esk4_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_25]) ).
cnf(c_0_39,negated_conjecture,
( neq(esk5_0,nil)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk5_0,X1)
| segmentP(esk3_0,X1)
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk5_0,X1)
| segmentP(esk4_0,X1)
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_32]),c_0_33])]),c_0_34]) ).
fof(c_0_43,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(X1,esk3_0)
| frontsegP(X1,esk5_0)
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_29])]),c_0_34]) ).
cnf(c_0_46,negated_conjecture,
( ~ segmentP(esk4_0,esk5_0)
| ~ segmentP(esk3_0,esk5_0)
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_34]) ).
cnf(c_0_47,negated_conjecture,
( segmentP(esk3_0,esk5_0)
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_30]) ).
cnf(c_0_48,negated_conjecture,
( segmentP(esk4_0,esk5_0)
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_41]),c_0_34]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_50,plain,
! [X33,X34] :
( ( ~ ssList(X33)
| ~ ssList(X34)
| neq(X33,X34)
| X33 = X34 )
& ( ~ ssList(X33)
| ~ ssList(X34)
| X33 != X34
| ~ neq(X33,X34) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])])])]) ).
cnf(c_0_51,negated_conjecture,
( ~ frontsegP(nil,esk3_0)
| esk5_0 = nil
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_17])]),c_0_34]) ).
cnf(c_0_52,negated_conjecture,
( esk4_0 = nil
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_53,plain,
frontsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_49]),c_0_17])]) ).
cnf(c_0_54,negated_conjecture,
( nil != esk1_0
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_55,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_57,negated_conjecture,
( esk4_0 = nil
| esk5_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
fof(c_0_58,plain,
! [X30] :
( ( ~ ssList(X30)
| segmentP(nil,X30)
| nil != X30 )
& ( ~ ssList(X30)
| nil = X30
| ~ segmentP(nil,X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_59,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk3_0,X1)
| esk3_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_26]),c_0_26]),c_0_25]) ).
cnf(c_0_60,negated_conjecture,
( esk3_0 != nil
| neq(esk4_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_25]),c_0_26]) ).
cnf(c_0_61,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_62,negated_conjecture,
( neq(nil,nil)
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_39,c_0_57]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_64,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_65,negated_conjecture,
( ~ segmentP(esk4_0,esk4_0)
| ~ segmentP(esk3_0,esk4_0)
| esk3_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_33])]) ).
cnf(c_0_66,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_17])]) ).
cnf(c_0_67,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_63]),c_0_17])]) ).
fof(c_0_68,plain,
! [X29] :
( segmentP(X29,nil)
| ~ ssList(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_69,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(X1,esk4_0)
| frontsegP(X1,esk5_0)
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_64]),c_0_33])]),c_0_30]) ).
cnf(c_0_70,negated_conjecture,
( ~ segmentP(esk3_0,nil)
| esk3_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_66]),c_0_66]),c_0_67])]) ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_72,negated_conjecture,
( ~ frontsegP(nil,esk4_0)
| esk5_0 = nil
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_69]),c_0_17])]),c_0_30]) ).
cnf(c_0_73,negated_conjecture,
( neq(esk5_0,nil)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_74,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_29])]) ).
cnf(c_0_75,negated_conjecture,
( esk3_0 = nil
| esk5_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_66]),c_0_53])]) ).
cnf(c_0_76,negated_conjecture,
neq(esk5_0,nil),
inference(sr,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
esk5_0 = nil,
inference(sr,[status(thm)],[c_0_75,c_0_74]) ).
cnf(c_0_78,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_78]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC053+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n005.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 07:51:33 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.20/0.55 % Version: 3.5.1
% 0.20/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 % Starting sh5l with 300s (1) cores
% 0.20/0.55 % new_bool_1 with pid 2945261 completed with status 0
% 0.20/0.55 % Result found by new_bool_1
% 0.20/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.55 % SubtermCWHack with pid 2945264 completed with status 0
% 0.20/0.55 % Result found by SubtermCWHack
% 0.20/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.55 % Preprocessing time : 0.001 s
% 0.20/0.55
% 0.20/0.55 % Proof found!
% 0.20/0.55 % SZS status Theorem
% 0.20/0.55 % SZS output start CNFRefutation
% See solution above
% 0.20/0.55 % Parsed axioms : 96
% 0.20/0.55 % Removed by relevancy pruning/SinE : 62
% 0.20/0.55 % Initial clauses : 69
% 0.20/0.55 % Removed in clause preprocessing : 0
% 0.20/0.55 % Initial clauses in saturation : 69
% 0.20/0.55 % Processed clauses : 1966
% 0.20/0.55 % ...of these trivial : 0
% 0.20/0.55 % ...subsumed : 1553
% 0.20/0.55 % ...remaining for further processing : 413
% 0.20/0.55 % Other redundant clauses eliminated : 146
% 0.20/0.55 % Clauses deleted for lack of memory : 0
% 0.20/0.55 % Backward-subsumed : 17
% 0.20/0.55 % Backward-rewritten : 63
% 0.20/0.55 % Generated clauses : 9934
% 0.20/0.55 % ...of the previous two non-redundant : 8796
% 0.20/0.55 % ...aggressively subsumed : 0
% 0.20/0.55 % Contextual simplify-reflections : 181
% 0.20/0.55 % Paramodulations : 9767
% 0.20/0.55 % Factorizations : 0
% 0.20/0.55 % NegExts : 0
% 0.20/0.55 % Equation resolutions : 161
% 0.20/0.55 % Disequality decompositions : 0
% 0.20/0.55 % Total rewrite steps : 6582
% 0.20/0.55 % ...of those cached : 6569
% 0.20/0.55 % Propositional unsat checks : 0
% 0.20/0.55 % Propositional check models : 0
% 0.20/0.55 % Propositional check unsatisfiable : 0
% 0.20/0.55 % Propositional clauses : 0
% 0.20/0.55 % Propositional clauses after purity: 0
% 0.20/0.55 % Propositional unsat core size : 0
% 0.20/0.55 % Propositional preprocessing time : 0.000
% 0.20/0.55 % Propositional encoding time : 0.000
% 0.20/0.55 % Propositional solver time : 0.000
% 0.20/0.55 % Success case prop preproc time : 0.000
% 0.20/0.55 % Success case prop encoding time : 0.000
% 0.20/0.55 % Success case prop solver time : 0.000
% 0.20/0.55 % Current number of processed clauses : 318
% 0.20/0.55 % Positive orientable unit clauses : 14
% 0.20/0.55 % Positive unorientable unit clauses: 0
% 0.20/0.55 % Negative unit clauses : 3
% 0.20/0.55 % Non-unit-clauses : 301
% 0.20/0.55 % Current number of unprocessed clauses: 6854
% 0.20/0.55 % ...number of literals in the above : 40605
% 0.20/0.55 % Current number of archived formulas : 0
% 0.20/0.55 % Current number of archived clauses : 87
% 0.20/0.55 % Clause-clause subsumption calls (NU) : 34027
% 0.20/0.55 % Rec. Clause-clause subsumption calls : 22233
% 0.20/0.55 % Non-unit clause-clause subsumptions : 1749
% 0.20/0.55 % Unit Clause-clause subsumption calls : 758
% 0.20/0.55 % Rewrite failures with RHS unbound : 0
% 0.20/0.55 % BW rewrite match attempts : 5
% 0.20/0.55 % BW rewrite match successes : 5
% 0.20/0.55 % Condensation attempts : 0
% 0.20/0.55 % Condensation successes : 0
% 0.20/0.55 % Termbank termtop insertions : 177281
% 0.20/0.55 % Search garbage collected termcells : 1844
% 0.20/0.55
% 0.20/0.55 % -------------------------------------------------
% 0.20/0.55 % User time : 0.105 s
% 0.20/0.55 % System time : 0.007 s
% 0.20/0.55 % Total time : 0.112 s
% 0.20/0.55 % Maximum resident set size: 3760 pages
% 0.20/0.55
% 0.20/0.55 % -------------------------------------------------
% 0.20/0.55 % User time : 0.109 s
% 0.20/0.55 % System time : 0.011 s
% 0.20/0.55 % Total time : 0.120 s
% 0.20/0.55 % Maximum resident set size: 4864 pages
% 0.20/0.55 % E exiting
%------------------------------------------------------------------------------