%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC181+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 : n003.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:21 PM UTC 2026
% Result : Theorem 213.34s 31.74s
% Output : CNFRefutation 213.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 53 ( 8 unt; 0 def)
% Number of atoms : 380 ( 56 equ)
% Maximal formula atoms : 34 ( 7 avg)
% Number of connectives : 498 ( 171 ~; 194 |; 76 &)
% ( 4 <=>; 53 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 8 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 7 con; 0-2 aty)
% Number of variables : 151 ( 0 sgn 79 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax8,axiom,
! [X1] :
( ssList(X1)
=> ( cyclefreeP(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
=> ~ ( leq(X3,X2)
& leq(X2,X3) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax8) ).
fof(ax13,axiom,
! [X1] :
( ssList(X1)
=> ( duplicatefreeP(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
=> X2 != X3 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax13) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| duplicatefreeP(X1)
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(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 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax90,axiom,
! [X1] :
( ssItem(X1)
=> ~ lt(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax90) ).
fof(ax91,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ( ( lt(X2,X3)
& leq(X1,X2) )
=> lt(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax91) ).
fof(ax31,axiom,
! [X1] :
( ssItem(X1)
=> leq(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax31) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(c_0_7,plain,
! [X170,X171,X172,X173,X174,X175] :
( ( ~ ssList(X170)
| cyclefreeP(X170)
| leq(esk32_1(X170),esk31_1(X170)) )
& ( ~ ssList(X170)
| cyclefreeP(X170)
| leq(esk31_1(X170),esk32_1(X170)) )
& ( ~ ssList(X170)
| cyclefreeP(X170)
| app(app(esk33_1(X170),cons(esk31_1(X170),esk34_1(X170))),cons(esk32_1(X170),esk35_1(X170))) = X170 )
& ( ~ ssList(X170)
| cyclefreeP(X170)
| ssList(esk35_1(X170)) )
& ( ~ ssList(X170)
| cyclefreeP(X170)
| ssList(esk34_1(X170)) )
& ( ~ ssList(X170)
| cyclefreeP(X170)
| ssList(esk33_1(X170)) )
& ( ~ ssList(X170)
| cyclefreeP(X170)
| ssItem(esk32_1(X170)) )
& ( ~ ssList(X170)
| cyclefreeP(X170)
| ssItem(esk31_1(X170)) )
& ( ~ ssList(X170)
| ~ leq(X172,X171)
| ~ leq(X171,X172)
| app(app(X173,cons(X171,X174)),cons(X172,X175)) != X170
| ~ ssList(X175)
| ~ ssList(X174)
| ~ ssList(X173)
| ~ ssItem(X172)
| ~ ssItem(X171)
| ~ cyclefreeP(X170) ) ),
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)],[ax8])])])])])]) ).
fof(c_0_8,plain,
! [X1] :
( ssList(X1)
=> ( duplicatefreeP(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
=> X2 != X3 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ax13]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| duplicatefreeP(X1)
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(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 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
cnf(c_0_10,plain,
( ~ ssList(X1)
| ~ leq(X3,X2)
| ~ leq(X2,X3)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ cyclefreeP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X40,X41,X42,X43,X44,X45] :
( ( ~ ssList(X40)
| duplicatefreeP(X40)
| esk9_1(X40) = esk10_1(X40) )
& ( ~ ssList(X40)
| duplicatefreeP(X40)
| app(app(esk11_1(X40),cons(esk9_1(X40),esk12_1(X40))),cons(esk10_1(X40),esk13_1(X40))) = X40 )
& ( ~ ssList(X40)
| duplicatefreeP(X40)
| ssList(esk13_1(X40)) )
& ( ~ ssList(X40)
| duplicatefreeP(X40)
| ssList(esk12_1(X40)) )
& ( ~ ssList(X40)
| duplicatefreeP(X40)
| ssList(esk11_1(X40)) )
& ( ~ ssList(X40)
| duplicatefreeP(X40)
| ssItem(esk10_1(X40)) )
& ( ~ ssList(X40)
| duplicatefreeP(X40)
| ssItem(esk9_1(X40)) )
& ( ~ ssList(X40)
| X41 != X42
| app(app(X43,cons(X41,X44)),cons(X42,X45)) != X40
| ~ ssList(X45)
| ~ ssList(X44)
| ~ ssList(X43)
| ~ ssItem(X42)
| ~ ssItem(X41)
| ~ duplicatefreeP(X40) ) ),
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_8])])])])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| duplicatefreeP(X1)
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(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 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ cyclefreeP(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| app(app(esk11_1(X1),cons(esk9_1(X1),esk12_1(X1))),cons(esk10_1(X1),esk13_1(X1))) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| ssItem(esk9_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| ssItem(esk10_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| ssList(esk11_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| ssList(esk12_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| ssList(esk13_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,plain,
! [X1] :
( ssItem(X1)
=> ~ lt(X1,X1) ),
inference(fof_simplification,[status(thm)],[ax90]) ).
fof(c_0_21,plain,
! [X84,X85,X86] :
( lt(X84,X86)
| ~ lt(X85,X86)
| ~ leq(X84,X85)
| ~ ssItem(X86)
| ~ ssItem(X85)
| ~ ssItem(X84) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax91])])])]) ).
fof(c_0_22,negated_conjecture,
! [X21,X22,X23,X24,X25,X26,X27,X28] :
( ( nil != esk3_0
| nil = esk4_0 )
& ~ duplicatefreeP(esk1_0)
& ( ~ lt(X27,X25)
| app(X28,cons(X27,nil)) != esk3_0
| ~ ssList(X28)
| ~ ssItem(X27)
| app(cons(X25,nil),X26) != esk6_0
| ~ ssList(X26)
| ~ ssItem(X25) )
& ( ~ lt(X21,X23)
| app(cons(X23,nil),X24) != esk3_0
| ~ ssList(X24)
| ~ ssItem(X23)
| app(X22,cons(X21,nil)) != esk5_0
| ~ ssList(X22)
| ~ ssItem(X21) )
& strictorderedP(esk3_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& ssList(esk6_0)
& ssList(esk5_0)
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
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_12])])])])]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ cyclefreeP(X1)
| ~ leq(esk9_1(X1),esk10_1(X1))
| ~ leq(esk10_1(X1),esk9_1(X1))
| duplicatefreeP(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| esk9_1(X1) = esk10_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_25,plain,
! [X154] :
( leq(X154,X154)
| ~ ssItem(X154) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax31])])]) ).
fof(c_0_26,plain,
! [X63,X64,X65,X66,X67,X68] :
( ( ~ ssList(X63)
| strictorderedP(X63)
| ~ lt(esk19_1(X63),esk20_1(X63)) )
& ( ~ ssList(X63)
| strictorderedP(X63)
| app(app(esk21_1(X63),cons(esk19_1(X63),esk22_1(X63))),cons(esk20_1(X63),esk23_1(X63))) = X63 )
& ( ~ ssList(X63)
| strictorderedP(X63)
| ssList(esk23_1(X63)) )
& ( ~ ssList(X63)
| strictorderedP(X63)
| ssList(esk22_1(X63)) )
& ( ~ ssList(X63)
| strictorderedP(X63)
| ssList(esk21_1(X63)) )
& ( ~ ssList(X63)
| strictorderedP(X63)
| ssItem(esk20_1(X63)) )
& ( ~ ssList(X63)
| strictorderedP(X63)
| ssItem(esk19_1(X63)) )
& ( ~ ssList(X63)
| lt(X64,X65)
| app(app(X66,cons(X64,X67)),cons(X65,X68)) != X63
| ~ ssList(X68)
| ~ ssList(X67)
| ~ ssList(X66)
| ~ ssItem(X65)
| ~ ssItem(X64)
| ~ strictorderedP(X63) ) ),
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])])])])])]) ).
fof(c_0_27,plain,
! [X83] :
( ~ lt(X83,X83)
| ~ ssItem(X83) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_28,plain,
( ~ lt(X2,X3)
| ~ leq(X1,X2)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| lt(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| cyclefreeP(X1)
| leq(esk32_1(X1),esk31_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| cyclefreeP(X1)
| ssItem(esk32_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| cyclefreeP(X1)
| ssItem(esk31_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,negated_conjecture,
~ duplicatefreeP(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| ~ cyclefreeP(X1)
| ~ leq(esk10_1(X1),esk10_1(X1))
| duplicatefreeP(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_35,plain,
( ~ ssItem(X1)
| leq(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_37,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_26]) ).
cnf(c_0_38,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ lt(esk31_1(X1),X2)
| cyclefreeP(X1)
| lt(esk32_1(X1),X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_40,negated_conjecture,
~ duplicatefreeP(esk3_0),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ cyclefreeP(X1)
| duplicatefreeP(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_16]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_43,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_37]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| cyclefreeP(X1)
| app(app(esk33_1(X1),cons(esk31_1(X1),esk34_1(X1))),cons(esk32_1(X1),esk35_1(X1))) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| cyclefreeP(X1)
| ssList(esk33_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| cyclefreeP(X1)
| ssList(esk34_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| cyclefreeP(X1)
| ssList(esk35_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ~ lt(esk31_1(X1),esk32_1(X1))
| cyclefreeP(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_30]) ).
cnf(c_0_49,negated_conjecture,
~ cyclefreeP(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ strictorderedP(X1)
| cyclefreeP(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_31]),c_0_30]),c_0_45]),c_0_46]),c_0_47]),c_0_48]) ).
cnf(c_0_51,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC181+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n003.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 08:03:45 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 213.34/31.74 % Version: 3.5.1
% 213.34/31.74 % Preprocessing class: FSLSSMSSSSSNFFN.
% 213.34/31.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.34/31.74 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 213.34/31.74 % Starting new_bool_3 with 300s (1) cores
% 213.34/31.74 % Starting new_bool_1 with 300s (1) cores
% 213.34/31.74 % Starting sh5l with 300s (1) cores
% 213.34/31.74 % sh5l with pid 3813306 completed with status 0
% 213.34/31.74 % Result found by sh5l
% 213.34/31.74 % Preprocessing class: FSLSSMSSSSSNFFN.
% 213.34/31.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.34/31.74 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 213.34/31.74 % Starting new_bool_3 with 300s (1) cores
% 213.34/31.74 % Starting new_bool_1 with 300s (1) cores
% 213.34/31.74 % Starting sh5l with 300s (1) cores
% 213.34/31.74 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 213.34/31.74 % SinE strategy is gf500_gu_R04_F100_L20000
% 213.34/31.74 % Search class: FGHSF-FSLM21-MFFFFFNN
% 213.34/31.74 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 213.34/31.74 % Starting SubtermCWHack with 28s (1) cores
% 213.34/31.74 % SubtermCWHack with pid 3813309 completed with status 8
% 213.34/31.74 % Starting sh5l with 31s (1) cores
% 213.34/31.74 % sh5l with pid 3813349 completed with status 0
% 213.34/31.74 % Result found by sh5l
% 213.34/31.74 % Preprocessing class: FSLSSMSSSSSNFFN.
% 213.34/31.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.34/31.74 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 213.34/31.74 % Starting new_bool_3 with 300s (1) cores
% 213.34/31.74 % Starting new_bool_1 with 300s (1) cores
% 213.34/31.74 % Starting sh5l with 300s (1) cores
% 213.34/31.74 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 213.34/31.74 % SinE strategy is gf500_gu_R04_F100_L20000
% 213.34/31.74 % Search class: FGHSF-FSLM21-MFFFFFNN
% 213.34/31.74 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 213.34/31.74 % Starting SubtermCWHack with 28s (1) cores
% 213.34/31.74 % SubtermCWHack with pid 3813309 completed with status 8
% 213.34/31.74 % Starting sh5l with 31s (1) cores
% 213.34/31.74 % Preprocessing time : 0.006 s
% 213.34/31.74 % Presaturation interreduction done
% 213.34/31.74
% 213.34/31.74 % Proof found!
% 213.34/31.74 % SZS status Theorem
% 213.34/31.74 % SZS output start CNFRefutation
% See solution above
% 213.34/31.74 % Parsed axioms : 96
% 213.34/31.74 % Removed by relevancy pruning/SinE : 11
% 213.34/31.74 % Initial clauses : 176
% 213.34/31.74 % Removed in clause preprocessing : 2
% 213.34/31.74 % Initial clauses in saturation : 174
% 213.34/31.74 % Processed clauses : 10247
% 213.34/31.74 % ...of these trivial : 300
% 213.34/31.74 % ...subsumed : 8347
% 213.34/31.74 % ...remaining for further processing : 1600
% 213.34/31.74 % Other redundant clauses eliminated : 289
% 213.34/31.74 % Clauses deleted for lack of memory : 0
% 213.34/31.74 % Backward-subsumed : 80
% 213.34/31.74 % Backward-rewritten : 38
% 213.34/31.74 % Generated clauses : 51366
% 213.34/31.74 % ...of the previous two non-redundant : 47383
% 213.34/31.74 % ...aggressively subsumed : 0
% 213.34/31.74 % Contextual simplify-reflections : 498
% 213.34/31.74 % Paramodulations : 51074
% 213.34/31.74 % Factorizations : 0
% 213.34/31.74 % NegExts : 0
% 213.34/31.74 % Equation resolutions : 294
% 213.34/31.74 % Disequality decompositions : 0
% 213.34/31.74 % Total rewrite steps : 47296
% 213.34/31.74 % ...of those cached : 47266
% 213.34/31.74 % Propositional unsat checks : 0
% 213.34/31.74 % Propositional check models : 0
% 213.34/31.74 % Propositional check unsatisfiable : 0
% 213.34/31.74 % Propositional clauses : 0
% 213.34/31.74 % Propositional clauses after purity: 0
% 213.34/31.74 % Propositional unsat core size : 0
% 213.34/31.74 % Propositional preprocessing time : 0.000
% 213.34/31.74 % Propositional encoding time : 0.000
% 213.34/31.74 % Propositional solver time : 0.000
% 213.34/31.74 % Success case prop preproc time : 0.000
% 213.34/31.74 % Success case prop encoding time : 0.000
% 213.34/31.74 % Success case prop solver time : 0.000
% 213.34/31.74 % Current number of processed clauses : 1297
% 213.34/31.74 % Positive orientable unit clauses : 32
% 213.34/31.74 % Positive unorientable unit clauses: 0
% 213.34/31.74 % Negative unit clauses : 3
% 213.34/31.74 % Non-unit-clauses : 1262
% 213.34/31.74 % Current number of unprocessed clauses: 37356
% 213.34/31.74 % ...number of literals in the above : 224457
% 213.34/31.74 % Current number of archived formulas : 0
% 213.34/31.74 % Current number of archived clauses : 286
% 213.34/31.74 % Clause-clause subsumption calls (NU) : 719463
% 213.34/31.74 % Rec. Clause-clause subsumption calls : 224820
% 213.34/31.74 % Non-unit clause-clause subsumptions : 8906
% 213.34/31.74 % Unit Clause-clause subsumption calls : 3331
% 213.34/31.74 % Rewrite failures with RHS unbound : 0
% 213.34/31.74 % BW rewrite match attempts : 7
% 213.34/31.74 % BW rewrite match successes : 7
% 213.34/31.74 % Condensation attempts : 10247
% 213.34/31.74 % Condensation successes : 0
% 213.34/31.74 % Termbank termtop insertions : 1023695
% 213.34/31.74 % Search garbage collected termcells : 3978
% 213.34/31.74
% 213.34/31.74 % -------------------------------------------------
% 213.34/31.74 % User time : 29.409 s
% 213.34/31.74 % System time : 0.690 s
% 213.34/31.74 % Total time : 30.099 s
% 213.34/31.74 % Maximum resident set size: 4228 pages
% 213.34/31.74
% 213.34/31.74 % -------------------------------------------------
% 213.34/31.74 % User time : 29.411 s
% 213.34/31.74 % System time : 0.700 s
% 213.34/31.74 % Total time : 30.111 s
% 213.34/31.74 % Maximum resident set size: 4608 pages
% 213.34/31.74 % E exiting
%------------------------------------------------------------------------------