%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC045+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:42:45 PM UTC 2026
% Result : Theorem 98.61s 14.82s
% Output : CNFRefutation 98.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 77 ( 12 unt; 0 def)
% Number of atoms : 304 ( 86 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 383 ( 156 ~; 152 |; 32 &)
% ( 2 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 135 ( 0 sgn 65 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ( ( memberP(X3,X5)
& ! [X6] :
( ssList(X6)
=> ~ segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) ) )
| ( ? [X6] :
( segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil)))
& ssList(X6) )
& ~ memberP(X3,X5) ) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4
| nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax54,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X2,X1)
& segmentP(X1,X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax54) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( memberP(X3,X1)
| X1 = X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_14,plain,
! [X59,X60,X61] :
( app(app(X59,X60),X61) = app(X59,app(X60,X61))
| ~ ssList(X61)
| ~ ssList(X60)
| ~ ssList(X59) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_15,plain,
! [X50] :
( app(nil,X50) = X50
| ~ ssList(X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_16,plain,
! [X64] :
( app(X64,nil) = X64
| ~ ssList(X64) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_17,plain,
! [X45,X46] :
( ssList(app(X45,X46))
| ~ ssList(X46)
| ~ ssList(X45) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ( ( memberP(X3,X5)
& ! [X6] :
( ssList(X6)
=> ~ segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) ) )
| ( ? [X6] :
( segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil)))
& ssList(X6) )
& ~ memberP(X3,X5) ) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4
| nil != X2 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
cnf(c_0_19,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ( ( memberP(X3,X5)
& ! [X6] :
( ssList(X6)
=> ~ segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) ) )
| ( ? [X6] :
( segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil)))
& ssList(X6) )
& ~ memberP(X3,X5) ) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4
| nil != X2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X62,X63] :
( ( ~ ssList(X62)
| ~ ssList(X63)
| nil = app(X62,X63)
| nil != X62
| nil != X63 )
& ( ~ ssList(X62)
| ~ ssList(X63)
| nil != app(X62,X63)
| nil = X62 )
& ( ~ ssList(X62)
| ~ ssList(X63)
| nil != app(X62,X63)
| nil = X63 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
fof(c_0_26,plain,
! [X47,X48,X49] :
( cons(X49,app(X48,X47)) = app(cons(X49,X48),X47)
| ~ ssItem(X49)
| ~ ssList(X48)
| ~ ssList(X47) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,app(X2,nil)) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_21])]),c_0_23]) ).
fof(c_0_29,negated_conjecture,
! [X11,X12] :
( ( ~ ssItem(X11)
| ~ memberP(esk3_0,X11)
| segmentP(esk4_0,app(app(cons(X11,nil),esk5_1(X11)),cons(X11,nil))) )
& ( ~ ssItem(X11)
| ~ memberP(esk3_0,X11)
| ssList(esk5_1(X11)) )
& ( ~ ssItem(X11)
| ~ segmentP(esk4_0,app(app(cons(X11,nil),X12),cons(X11,nil)))
| ~ ssList(X12)
| memberP(esk3_0,X11) )
& nil != esk1_0
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& nil = esk2_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_24])])])])])]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| app(nil,X1) = app(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21])]) ).
fof(c_0_33,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_34,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,negated_conjecture,
nil = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_36,plain,
! [X65,X66] :
( ssList(cons(X66,X65))
| ~ ssItem(X66)
| ~ ssList(X65) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X2,app(X3,X1)) != nil
| nil = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_23]) ).
cnf(c_0_39,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,app(nil,X2)) = app(cons(X1,X2),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_21])]) ).
fof(c_0_40,plain,
! [X76,X77] :
( nil != cons(X77,X76)
| ~ ssItem(X77)
| ~ ssList(X76) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])]) ).
fof(c_0_41,plain,
! [X36,X37] :
( X36 = X37
| ~ segmentP(X37,X36)
| ~ segmentP(X36,X37)
| ~ ssList(X37)
| ~ ssList(X36) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk3_0,X1)
| segmentP(esk4_0,app(app(cons(X1,nil),esk5_1(X1)),cons(X1,nil))) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_43,negated_conjecture,
esk4_0 = nil,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_44,plain,
! [X43] :
( segmentP(X43,nil)
| ~ ssList(X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_45,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_37])]),c_0_21])]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X2,app(X1,nil)) != nil
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_32]),c_0_21])]) ).
cnf(c_0_48,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,X2),nil) = app(cons(X1,nil),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_39]),c_0_21])]) ).
cnf(c_0_49,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_50,plain,
( ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk3_0,X1)
| segmentP(nil,app(app(cons(X1,nil),esk5_1(X1)),cons(X1,nil))) ),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_53,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_31]),c_0_23]) ).
cnf(c_0_54,plain,
( ~ ssItem(X1)
| app(cons(X1,nil),nil) = cons(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_46]),c_0_21])]) ).
cnf(c_0_55,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X1,app(cons(X2,nil),X3)) != nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_45]),c_0_49]) ).
cnf(c_0_56,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,X2),nil) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_22]),c_0_21])]) ).
fof(c_0_57,plain,
! [X23,X24,X25] :
( ( ~ ssItem(X23)
| ~ ssItem(X24)
| ~ ssList(X25)
| memberP(cons(X24,X25),X23)
| ~ memberP(X25,X23) )
& ( ~ ssItem(X23)
| ~ ssItem(X24)
| ~ ssList(X25)
| memberP(cons(X24,X25),X23)
| X23 != X24 )
& ( ~ ssItem(X23)
| ~ ssItem(X24)
| ~ ssList(X25)
| memberP(X25,X23)
| X23 = X24
| ~ memberP(cons(X24,X25),X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(app(app(cons(X1,nil),esk5_1(X1)),cons(X1,nil)))
| ~ memberP(esk3_0,X1)
| app(app(cons(X1,nil),esk5_1(X1)),cons(X1,nil)) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_21])]),c_0_52]) ).
cnf(c_0_59,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_21])]) ).
cnf(c_0_60,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| app(X1,cons(X2,nil)) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_21])]) ).
cnf(c_0_61,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
fof(c_0_62,plain,
! [X73] :
( ( ~ ssList(X73)
| nil = X73
| cons(esk11_1(X73),esk10_1(X73)) = X73 )
& ( ~ ssList(X73)
| nil = X73
| ssItem(esk11_1(X73)) )
& ( ~ ssList(X73)
| nil = X73
| ssList(esk10_1(X73)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(app(cons(X1,nil),esk5_1(X1)))
| ~ memberP(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_23]),c_0_59]),c_0_60]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk3_0,X1)
| ssList(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_65,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk11_1(X1),esk10_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk11_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk10_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_69,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_70,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_71,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_53]),c_0_21])]),c_0_64]) ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| memberP(X1,esk11_1(X1))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_68]) ).
cnf(c_0_73,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_74,negated_conjecture,
esk3_0 != nil,
inference(rw,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_75,negated_conjecture,
~ ssItem(esk11_1(esk3_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73])]),c_0_74]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_67]),c_0_73])]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC045+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 07:52:33 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 98.61/14.82 % Version: 3.5.1
% 98.61/14.82 % Preprocessing class: FSLSSMSSSSSNFFN.
% 98.61/14.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 98.61/14.82 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 98.61/14.82 % Starting new_bool_3 with 300s (1) cores
% 98.61/14.82 % Starting new_bool_1 with 300s (1) cores
% 98.61/14.82 % Starting sh5l with 300s (1) cores
% 98.61/14.82 % new_bool_3 with pid 2422042 completed with status 0
% 98.61/14.82 % Result found by new_bool_3
% 98.61/14.82 % Preprocessing class: FSLSSMSSSSSNFFN.
% 98.61/14.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 98.61/14.82 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 98.61/14.82 % Starting new_bool_3 with 300s (1) cores
% 98.61/14.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 98.61/14.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 98.61/14.82 % Search class: FGHSF-FFMM21-MFFFFFNN
% 98.61/14.82 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 98.61/14.82 % Starting SubtermCWHack with 31s (1) cores
% 98.61/14.82 % SubtermCWHack with pid 2422047 completed with status 0
% 98.61/14.82 % Result found by SubtermCWHack
% 98.61/14.82 % Preprocessing class: FSLSSMSSSSSNFFN.
% 98.61/14.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 98.61/14.82 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 98.61/14.82 % Starting new_bool_3 with 300s (1) cores
% 98.61/14.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 98.61/14.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 98.61/14.82 % Search class: FGHSF-FFMM21-MFFFFFNN
% 98.61/14.82 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 98.61/14.82 % Starting SubtermCWHack with 31s (1) cores
% 98.61/14.82 % Preprocessing time : 0.002 s
% 98.61/14.82
% 98.61/14.82 % Proof found!
% 98.61/14.82 % SZS status Theorem
% 98.61/14.82 % SZS output start CNFRefutation
% See solution above
% 98.61/14.82 % Parsed axioms : 96
% 98.61/14.82 % Removed by relevancy pruning/SinE : 68
% 98.61/14.82 % Initial clauses : 56
% 98.61/14.82 % Removed in clause preprocessing : 0
% 98.61/14.82 % Initial clauses in saturation : 56
% 98.61/14.82 % Processed clauses : 44923
% 98.61/14.82 % ...of these trivial : 1
% 98.61/14.82 % ...subsumed : 42239
% 98.61/14.82 % ...remaining for further processing : 2683
% 98.61/14.82 % Other redundant clauses eliminated : 3279
% 98.61/14.82 % Clauses deleted for lack of memory : 0
% 98.61/14.82 % Backward-subsumed : 30
% 98.61/14.82 % Backward-rewritten : 6
% 98.61/14.82 % Generated clauses : 1449771
% 98.61/14.82 % ...of the previous two non-redundant : 1403896
% 98.61/14.82 % ...aggressively subsumed : 0
% 98.61/14.82 % Contextual simplify-reflections : 2180
% 98.61/14.82 % Paramodulations : 1446318
% 98.61/14.82 % Factorizations : 0
% 98.61/14.82 % NegExts : 0
% 98.61/14.82 % Equation resolutions : 3454
% 98.61/14.82 % Disequality decompositions : 0
% 98.61/14.82 % Total rewrite steps : 808267
% 98.61/14.82 % ...of those cached : 808257
% 98.61/14.82 % Propositional unsat checks : 0
% 98.61/14.82 % Propositional check models : 0
% 98.61/14.82 % Propositional check unsatisfiable : 0
% 98.61/14.82 % Propositional clauses : 0
% 98.61/14.82 % Propositional clauses after purity: 0
% 98.61/14.82 % Propositional unsat core size : 0
% 98.61/14.82 % Propositional preprocessing time : 0.000
% 98.61/14.82 % Propositional encoding time : 0.000
% 98.61/14.82 % Propositional solver time : 0.000
% 98.61/14.82 % Success case prop preproc time : 0.000
% 98.61/14.82 % Success case prop encoding time : 0.000
% 98.61/14.82 % Success case prop solver time : 0.000
% 98.61/14.82 % Current number of processed clauses : 2642
% 98.61/14.82 % Positive orientable unit clauses : 11
% 98.61/14.82 % Positive unorientable unit clauses: 0
% 98.61/14.82 % Negative unit clauses : 3
% 98.61/14.82 % Non-unit-clauses : 2628
% 98.61/14.82 % Current number of unprocessed clauses: 1358947
% 98.61/14.82 % ...number of literals in the above : 9651795
% 98.61/14.82 % Current number of archived formulas : 0
% 98.61/14.82 % Current number of archived clauses : 36
% 98.61/14.82 % Clause-clause subsumption calls (NU) : 2123333
% 98.61/14.82 % Rec. Clause-clause subsumption calls : 775412
% 98.61/14.82 % Non-unit clause-clause subsumptions : 44449
% 98.61/14.82 % Unit Clause-clause subsumption calls : 311
% 98.61/14.82 % Rewrite failures with RHS unbound : 0
% 98.61/14.82 % BW rewrite match attempts : 5
% 98.61/14.82 % BW rewrite match successes : 5
% 98.61/14.82 % Condensation attempts : 0
% 98.61/14.82 % Condensation successes : 0
% 98.61/14.82 % Termbank termtop insertions : 36464102
% 98.61/14.82 % Search garbage collected termcells : 1699
% 98.61/14.82
% 98.61/14.82 % -------------------------------------------------
% 98.61/14.82 % User time : 13.299 s
% 98.61/14.82 % System time : 0.662 s
% 98.61/14.82 % Total time : 13.961 s
% 98.61/14.82 % Maximum resident set size: 3760 pages
% 98.61/14.82
% 98.61/14.82 % -------------------------------------------------
% 98.61/14.82 % User time : 13.301 s
% 98.61/14.82 % System time : 0.669 s
% 98.61/14.82 % Total time : 13.970 s
% 98.61/14.82 % Maximum resident set size: 4608 pages
% 98.61/14.82 % E exiting
%------------------------------------------------------------------------------