%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC161+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 : n017.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:43:16 PM UTC 2026
% Result : Theorem 0.15s 0.71s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 55 ( 22 unt; 0 def)
% Number of atoms : 315 ( 67 equ)
% Maximal formula atoms : 40 ( 5 avg)
% Number of connectives : 389 ( 129 ~; 136 |; 74 &)
% ( 1 <=>; 49 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 6 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 13 con; 0-2 aty)
% Number of variables : 132 ( 0 sgn 84 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssItem(X16)
=> ! [X17] :
( ssList(X17)
=> ! [X18] :
( ssList(X18)
=> ! [X19] :
( ( leq(X15,X16)
& ! [X20] :
( ( leq(X20,X16)
& leq(X15,X20) )
| ~ memberP(X18,X20)
| ~ ssItem(X20) ) )
| ~ leq(X16,X15)
| app(app(app(app(X17,cons(X15,nil)),X18),cons(X16,nil)),X19) != X1
| ~ ssList(X19) ) ) ) ) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4
| ~ ssList(X6) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax33) ).
fof(ax92,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( leq(X1,X2)
=> ( lt(X1,X2)
| X1 = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax92) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssItem(X16)
=> ! [X17] :
( ssList(X17)
=> ! [X18] :
( ssList(X18)
=> ! [X19] :
( ( leq(X15,X16)
& ! [X20] :
( ( leq(X20,X16)
& leq(X15,X20) )
| ~ memberP(X18,X20)
| ~ ssItem(X20) ) )
| ~ leq(X16,X15)
| app(app(app(app(X17,cons(X15,nil)),X18),cons(X16,nil)),X19) != X1
| ~ ssList(X19) ) ) ) ) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4
| ~ ssList(X6) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssItem(X16)
=> ! [X17] :
( ssList(X17)
=> ! [X18] :
( ssList(X18)
=> ! [X19] :
( ( leq(X15,X16)
& ! [X20] :
( ( leq(X20,X16)
& leq(X15,X20) )
| ~ memberP(X18,X20)
| ~ ssItem(X20) ) )
| ~ leq(X16,X15)
| app(app(app(app(X17,cons(X15,nil)),X18),cons(X16,nil)),X19) != X1
| ~ ssList(X19) ) ) ) ) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4
| ~ ssList(X6) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,negated_conjecture,
! [X271,X272,X273,X274,X275,X276,X277,X278] :
( ( nil != esk50_0
| nil = esk51_0 )
& ( ~ leq(esk54_0,esk55_0)
| ~ leq(esk59_0,esk55_0)
| ~ leq(esk54_0,esk59_0) )
& ( ~ leq(esk54_0,esk55_0)
| memberP(esk57_0,esk59_0) )
& ( ~ leq(esk54_0,esk55_0)
| ssItem(esk59_0) )
& leq(esk55_0,esk54_0)
& app(app(app(app(esk56_0,cons(esk54_0,nil)),esk57_0),cons(esk55_0,nil)),esk58_0) = esk48_0
& ssList(esk58_0)
& ssList(esk57_0)
& ssList(esk56_0)
& ssItem(esk55_0)
& ssItem(esk54_0)
& ( ~ lt(X277,X275)
| app(X278,cons(X277,nil)) != esk50_0
| ~ ssList(X278)
| ~ ssItem(X277)
| app(cons(X275,nil),X276) != esk53_0
| ~ ssList(X276)
| ~ ssItem(X275) )
& ( ~ lt(X271,X273)
| app(cons(X273,nil),X274) != esk50_0
| ~ ssList(X274)
| ~ ssItem(X273)
| app(X272,cons(X271,nil)) != esk52_0
| ~ ssList(X272)
| ~ ssItem(X271) )
& strictorderedP(esk50_0)
& app(app(esk52_0,esk50_0),esk53_0) = esk51_0
& ssList(esk53_0)
& ssList(esk52_0)
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_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_10])])])])])]) ).
cnf(c_0_12,negated_conjecture,
app(app(app(app(esk56_0,cons(esk54_0,nil)),esk57_0),cons(esk55_0,nil)),esk58_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_13,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X236,X237,X238] :
( app(app(X236,X237),X238) = app(X236,app(X237,X238))
| ~ ssList(X238)
| ~ ssList(X237)
| ~ ssList(X236) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_15,negated_conjecture,
app(app(app(app(esk56_0,cons(esk54_0,nil)),esk57_0),cons(esk55_0,nil)),esk58_0) = esk50_0,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,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_17,negated_conjecture,
ssList(esk57_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X125,X126] :
( ssList(cons(X126,X125))
| ~ ssItem(X126)
| ~ ssList(X125) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_20,negated_conjecture,
( ~ ssList(cons(esk54_0,nil))
| app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_23,negated_conjecture,
ssItem(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_24,plain,
! [X234,X235] :
( cons(X235,X234) = app(cons(X235,nil),X234)
| ~ ssItem(X235)
| ~ ssList(X234) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_25,negated_conjecture,
app(app(app(esk56_0,app(cons(esk54_0,nil),esk57_0)),cons(esk55_0,nil)),esk58_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_26,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
app(app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,nil)),esk58_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk58_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(cons(esk55_0,nil))
| ~ ssList(app(esk56_0,cons(esk54_0,esk57_0)))
| app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_27]),c_0_28])]) ).
cnf(c_0_30,negated_conjecture,
ssItem(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_31,plain,
! [X144,X145] :
( ssList(app(X144,X145))
| ~ ssList(X145)
| ~ ssList(X144) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(app(esk56_0,cons(esk54_0,esk57_0)))
| app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_22]),c_0_30])]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_34,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_35,plain,
! [X256,X257] :
( lt(X256,X257)
| X256 = X257
| ~ leq(X256,X257)
| ~ ssItem(X257)
| ~ ssItem(X256) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax92])])])]) ).
fof(c_0_36,plain,
! [X92,X93,X94,X95,X96,X97] :
( ( ~ ssList(X92)
| strictorderedP(X92)
| ~ lt(esk30_1(X92),esk31_1(X92)) )
& ( ~ ssList(X92)
| strictorderedP(X92)
| app(app(esk32_1(X92),cons(esk30_1(X92),esk33_1(X92))),cons(esk31_1(X92),esk34_1(X92))) = X92 )
& ( ~ ssList(X92)
| strictorderedP(X92)
| ssList(esk34_1(X92)) )
& ( ~ ssList(X92)
| strictorderedP(X92)
| ssList(esk33_1(X92)) )
& ( ~ ssList(X92)
| strictorderedP(X92)
| ssList(esk32_1(X92)) )
& ( ~ ssList(X92)
| strictorderedP(X92)
| ssItem(esk31_1(X92)) )
& ( ~ ssList(X92)
| strictorderedP(X92)
| ssItem(esk30_1(X92)) )
& ( ~ ssList(X92)
| lt(X93,X94)
| app(app(X95,cons(X93,X96)),cons(X94,X97)) != X92
| ~ ssList(X97)
| ~ ssList(X96)
| ~ ssList(X95)
| ~ ssItem(X94)
| ~ ssItem(X93)
| ~ strictorderedP(X92) ) ),
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)],[ax12])])])])])]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(cons(esk54_0,esk57_0))
| app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_18])]) ).
fof(c_0_38,plain,
! [X158,X159] :
( ~ lt(X159,X158)
| ~ lt(X158,X159)
| ~ ssItem(X159)
| ~ ssItem(X158) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])]) ).
cnf(c_0_39,plain,
( ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| lt(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
leq(esk55_0,esk54_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ strictorderedP(X1)
| lt(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
app(app(esk56_0,cons(esk54_0,esk57_0)),app(cons(esk55_0,nil),esk58_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_21]),c_0_17]),c_0_23])]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,plain,
( ~ lt(X2,X1)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( lt(esk55_0,esk54_0)
| esk55_0 = esk54_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_23]),c_0_30])]) ).
cnf(c_0_46,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_47,negated_conjecture,
app(app(esk56_0,cons(esk54_0,esk57_0)),cons(esk55_0,esk58_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_26]),c_0_28]),c_0_30])]) ).
cnf(c_0_48,negated_conjecture,
strictorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_43,c_0_13]) ).
cnf(c_0_50,negated_conjecture,
( ~ lt(esk54_0,esk55_0)
| esk55_0 = esk54_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_30]),c_0_23])]) ).
cnf(c_0_51,negated_conjecture,
lt(esk54_0,esk55_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49]),c_0_28]),c_0_17]),c_0_18]),c_0_30]),c_0_23])]) ).
cnf(c_0_52,negated_conjecture,
esk55_0 = esk54_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_53,negated_conjecture,
lt(esk54_0,esk54_0),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_53]),c_0_53]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC161+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.57 % Computer : n017.cluster.edu
% 0.11/0.57 % Model : x86_64 x86_64
% 0.11/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.57 % Memory : 8046.5625MB
% 0.11/0.57 % OS : Linux 6.8.0-71-generic
% 0.11/0.57 % CPULimit : 300
% 0.11/0.57 % WCLimit : 300
% 0.11/0.57 % DateTime : Mon Sep 21 07:54:45 UTC 2026
% 0.11/0.58 % CPUTime :
% 0.11/0.58 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.62 Running first-order theorem proving
% 0.11/0.62 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.15/0.71 % Version: 3.5.1
% 0.15/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.71 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.71 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.71 % Starting sh5l with 300s (1) cores
% 0.15/0.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1836793 completed with status 0
% 0.15/0.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.71 % No SInE strategy applied
% 0.15/0.71 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/0.71 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.71 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/0.71 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.15/0.71 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.15/0.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1836801 completed with status 0
% 0.15/0.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.71 % No SInE strategy applied
% 0.15/0.71 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/0.71 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.71 % Preprocessing time : 0.003 s
% 0.15/0.71 % Presaturation interreduction done
% 0.15/0.71
% 0.15/0.71 % Proof found!
% 0.15/0.71 % SZS status Theorem
% 0.15/0.71 % SZS output start CNFRefutation
% See solution above
% 0.15/0.71 % Parsed axioms : 96
% 0.15/0.71 % Removed by relevancy pruning/SinE : 0
% 0.15/0.71 % Initial clauses : 213
% 0.15/0.71 % Removed in clause preprocessing : 2
% 0.15/0.71 % Initial clauses in saturation : 211
% 0.15/0.71 % Processed clauses : 766
% 0.15/0.71 % ...of these trivial : 3
% 0.15/0.71 % ...subsumed : 110
% 0.15/0.71 % ...remaining for further processing : 653
% 0.15/0.71 % Other redundant clauses eliminated : 76
% 0.15/0.71 % Clauses deleted for lack of memory : 0
% 0.15/0.71 % Backward-subsumed : 17
% 0.15/0.71 % Backward-rewritten : 40
% 0.15/0.71 % Generated clauses : 1713
% 0.15/0.71 % ...of the previous two non-redundant : 1554
% 0.15/0.71 % ...aggressively subsumed : 0
% 0.15/0.71 % Contextual simplify-reflections : 56
% 0.15/0.71 % Paramodulations : 1634
% 0.15/0.71 % Factorizations : 0
% 0.15/0.71 % NegExts : 0
% 0.15/0.71 % Equation resolutions : 81
% 0.15/0.71 % Disequality decompositions : 0
% 0.15/0.71 % Total rewrite steps : 1251
% 0.15/0.71 % ...of those cached : 1197
% 0.15/0.71 % Propositional unsat checks : 0
% 0.15/0.71 % Propositional check models : 0
% 0.15/0.71 % Propositional check unsatisfiable : 0
% 0.15/0.71 % Propositional clauses : 0
% 0.15/0.71 % Propositional clauses after purity: 0
% 0.15/0.71 % Propositional unsat core size : 0
% 0.15/0.71 % Propositional preprocessing time : 0.000
% 0.15/0.71 % Propositional encoding time : 0.000
% 0.15/0.71 % Propositional solver time : 0.000
% 0.15/0.71 % Success case prop preproc time : 0.000
% 0.15/0.71 % Success case prop encoding time : 0.000
% 0.15/0.71 % Success case prop solver time : 0.000
% 0.15/0.71 % Current number of processed clauses : 368
% 0.15/0.71 % Positive orientable unit clauses : 70
% 0.15/0.71 % Positive unorientable unit clauses: 0
% 0.15/0.71 % Negative unit clauses : 2
% 0.15/0.71 % Non-unit-clauses : 296
% 0.15/0.71 % Current number of unprocessed clauses: 1197
% 0.15/0.71 % ...number of literals in the above : 6607
% 0.15/0.71 % Current number of archived formulas : 0
% 0.15/0.71 % Current number of archived clauses : 262
% 0.15/0.71 % Clause-clause subsumption calls (NU) : 26739
% 0.15/0.71 % Rec. Clause-clause subsumption calls : 8894
% 0.15/0.71 % Non-unit clause-clause subsumptions : 139
% 0.15/0.71 % Unit Clause-clause subsumption calls : 1081
% 0.15/0.71 % Rewrite failures with RHS unbound : 0
% 0.15/0.71 % BW rewrite match attempts : 39
% 0.15/0.71 % BW rewrite match successes : 20
% 0.15/0.71 % Condensation attempts : 0
% 0.15/0.71 % Condensation successes : 0
% 0.15/0.71 % Termbank termtop insertions : 55952
% 0.15/0.71 % Search garbage collected termcells : 4592
% 0.15/0.71
% 0.15/0.71 % -------------------------------------------------
% 0.15/0.71 % User time : 0.061 s
% 0.15/0.71 % System time : 0.007 s
% 0.15/0.71 % Total time : 0.068 s
% 0.15/0.71 % Maximum resident set size: 4236 pages
% 0.15/0.71
% 0.15/0.71 % -------------------------------------------------
% 0.15/0.71 % User time : 0.260 s
% 0.15/0.71 % System time : 0.029 s
% 0.15/0.71 % Total time : 0.289 s
% 0.15/0.71 % Maximum resident set size: 4864 pages
% 0.15/0.71 % E exiting
%------------------------------------------------------------------------------