%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC164+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 : n006.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.14s 0.73s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of formulae : 66 ( 18 unt; 0 def)
% Number of atoms : 315 ( 99 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 401 ( 152 ~; 150 |; 42 &)
% ( 5 <=>; 52 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 113 ( 0 sgn 82 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil != X3
| nil != X4 )
& ! [X9] :
( ? [X10] :
( leq(X10,X9)
& memberP(X4,X10)
& X9 != X10
& ssItem(X10) )
| ~ memberP(X4,X9)
| cons(X9,nil) != X3
| ~ ssItem(X9) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( neq(X5,X6)
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1
| ~ ssList(X8) ) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax1) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax13) ).
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(ax71,axiom,
! [X1] :
( ssItem(X1)
=> duplicatefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax71) ).
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(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil != X3
| nil != X4 )
& ! [X9] :
( ? [X10] :
( leq(X10,X9)
& memberP(X4,X10)
& X9 != X10
& ssItem(X10) )
| ~ memberP(X4,X9)
| cons(X9,nil) != X3
| ~ ssItem(X9) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( neq(X5,X6)
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1
| ~ ssList(X8) ) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil != X3
| nil != X4 )
& ! [X9] :
( ? [X10] :
( leq(X10,X9)
& memberP(X4,X10)
& X9 != X10
& ssItem(X10) )
| ~ memberP(X4,X9)
| cons(X9,nil) != X3
| ~ ssItem(X9) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( neq(X5,X6)
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1
| ~ ssList(X8) ) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,negated_conjecture,
! [X264] :
( ( ~ leq(X264,esk56_0)
| ~ memberP(esk51_0,X264)
| esk56_0 = X264
| ~ ssItem(X264)
| nil = esk50_0 )
& ( ~ leq(X264,esk56_0)
| ~ memberP(esk51_0,X264)
| esk56_0 = X264
| ~ ssItem(X264)
| nil = esk51_0 )
& ( memberP(esk51_0,esk56_0)
| nil = esk50_0 )
& ( memberP(esk51_0,esk56_0)
| nil = esk51_0 )
& ( cons(esk56_0,nil) = esk50_0
| nil = esk50_0 )
& ( cons(esk56_0,nil) = esk50_0
| nil = esk51_0 )
& ( ssItem(esk56_0)
| nil = esk50_0 )
& ( ssItem(esk56_0)
| nil = esk51_0 )
& ~ neq(esk52_0,esk53_0)
& app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0
& ssList(esk55_0)
& ssList(esk54_0)
& ssItem(esk53_0)
& ssItem(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_12])])])])])]) ).
fof(c_0_14,plain,
! [X229,X230] :
( ( ~ ssList(X229)
| ~ ssList(X230)
| nil = app(X229,X230)
| nil != X229
| nil != X230 )
& ( ~ ssList(X229)
| ~ ssList(X230)
| nil != app(X229,X230)
| nil = X229 )
& ( ~ ssList(X229)
| ~ ssList(X230)
| nil != app(X229,X230)
| nil = X230 ) ),
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])])])])]) ).
cnf(c_0_15,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk50_0,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X134,X135] :
( ssList(app(X134,X135))
| ~ ssList(X135)
| ~ ssList(X134) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)))
| esk50_0 != nil
| app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax1]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| esk50_0 != nil
| app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_26,plain,
! [X11,X12] :
( ( ~ ssItem(X11)
| ~ ssItem(X12)
| neq(X11,X12)
| X11 = X12 )
& ( ~ ssItem(X11)
| ~ ssItem(X12)
| X11 != X12
| ~ neq(X11,X12) ) ),
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_23])])])])]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| esk50_0 != nil
| cons(esk53_0,nil) = nil ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_29,plain,
! [X115,X116] :
( ssList(cons(X116,X115))
| ~ ssItem(X116)
| ~ ssList(X115) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_30,negated_conjecture,
~ neq(esk52_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_31,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_34,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil))
| esk50_0 != nil
| cons(esk53_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_22]),c_0_28])]) ).
cnf(c_0_36,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_38,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]) ).
cnf(c_0_39,negated_conjecture,
esk53_0 = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
fof(c_0_40,plain,
! [X226,X227,X228] :
( app(app(X226,X227),X228) = app(X226,app(X227,X228))
| ~ ssList(X228)
| ~ ssList(X227)
| ~ ssList(X226) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_41,plain,
! [X209] :
( duplicatefreeP(cons(X209,nil))
| ~ ssItem(X209) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax71])])]) ).
fof(c_0_42,plain,
! [X117,X118] :
( cons(X118,X117) != X117
| ~ ssItem(X118)
| ~ ssList(X117) ),
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_43,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| esk50_0 != nil
| cons(esk53_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_32])]) ).
fof(c_0_44,plain,
! [X93,X94,X95,X96,X97,X98] :
( ( ~ ssList(X93)
| duplicatefreeP(X93)
| esk35_1(X93) = esk36_1(X93) )
& ( ~ ssList(X93)
| duplicatefreeP(X93)
| app(app(esk37_1(X93),cons(esk35_1(X93),esk38_1(X93))),cons(esk36_1(X93),esk39_1(X93))) = X93 )
& ( ~ ssList(X93)
| duplicatefreeP(X93)
| ssList(esk39_1(X93)) )
& ( ~ ssList(X93)
| duplicatefreeP(X93)
| ssList(esk38_1(X93)) )
& ( ~ ssList(X93)
| duplicatefreeP(X93)
| ssList(esk37_1(X93)) )
& ( ~ ssList(X93)
| duplicatefreeP(X93)
| ssItem(esk36_1(X93)) )
& ( ~ ssList(X93)
| duplicatefreeP(X93)
| ssItem(esk35_1(X93)) )
& ( ~ ssList(X93)
| X94 != X95
| app(app(X96,cons(X94,X97)),cons(X95,X98)) != X93
| ~ ssList(X98)
| ~ ssList(X97)
| ~ ssList(X96)
| ~ ssItem(X95)
| ~ ssItem(X94)
| ~ duplicatefreeP(X93) ) ),
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_38])])])])])]) ).
cnf(c_0_45,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,nil)),esk55_0) = esk50_0,
inference(spm,[status(thm)],[c_0_18,c_0_39]) ).
cnf(c_0_46,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_47,plain,
! [X224,X225] :
( cons(X225,X224) = app(cons(X225,nil),X224)
| ~ ssItem(X225)
| ~ ssList(X224) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_48,plain,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( cons(esk56_0,nil) = esk50_0
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_50,negated_conjecture,
( ssItem(esk56_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_51,plain,
( cons(X2,X1) != X1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_52,negated_conjecture,
( esk50_0 != nil
| cons(esk53_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_37]),c_0_33])]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| X2 != X3
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ duplicatefreeP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_19])]) ).
cnf(c_0_55,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,negated_conjecture,
( duplicatefreeP(esk50_0)
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_57,negated_conjecture,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_37]),c_0_32])]) ).
cnf(c_0_58,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_59,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ duplicatefreeP(app(app(X1,cons(X2,X3)),cons(X2,X4))) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_53])]) ).
cnf(c_0_60,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_19]),c_0_33])]) ).
cnf(c_0_61,negated_conjecture,
duplicatefreeP(esk50_0),
inference(sr,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_58,c_0_16]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(app(esk54_0,cons(esk52_0,nil))) ),
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(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62]),c_0_19]),c_0_37]),c_0_28]),c_0_33])]) ).
cnf(c_0_64,negated_conjecture,
~ ssList(cons(esk52_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_22]),c_0_28])]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_36]),c_0_37]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC164+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.58 % Computer : n006.cluster.edu
% 0.11/0.58 % Model : x86_64 x86_64
% 0.11/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58 % Memory : 8046.5625MB
% 0.11/0.58 % OS : Linux 6.8.0-71-generic
% 0.11/0.58 % CPULimit : 300
% 0.11/0.58 % WCLimit : 300
% 0.11/0.58 % DateTime : Mon Sep 21 08:00:28 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.14/0.73 % Version: 3.5.1
% 0.14/0.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.73 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.73 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.73 % Starting sh5l with 300s (1) cores
% 0.14/0.73 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2372628 completed with status 0
% 0.14/0.73 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.73 % No SInE strategy applied
% 0.14/0.73 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.14/0.73 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.73 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.73 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.14/0.73 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.14/0.73 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.14/0.73 % G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 2372639 completed with status 0
% 0.14/0.73 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 0.14/0.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.73 % No SInE strategy applied
% 0.14/0.73 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.14/0.73 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.73 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.73 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.14/0.73 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.14/0.73 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.14/0.73 % Preprocessing time : 0.004 s
% 0.14/0.73 % Presaturation interreduction done
% 0.14/0.73
% 0.14/0.73 % Proof found!
% 0.14/0.73 % SZS status Theorem
% 0.14/0.73 % SZS output start CNFRefutation
% See solution above
% 0.14/0.73 % Parsed axioms : 96
% 0.14/0.73 % Removed by relevancy pruning/SinE : 0
% 0.14/0.73 % Initial clauses : 210
% 0.14/0.73 % Removed in clause preprocessing : 2
% 0.14/0.73 % Initial clauses in saturation : 208
% 0.14/0.73 % Processed clauses : 641
% 0.14/0.73 % ...of these trivial : 11
% 0.14/0.73 % ...subsumed : 78
% 0.14/0.73 % ...remaining for further processing : 552
% 0.14/0.73 % Other redundant clauses eliminated : 76
% 0.14/0.73 % Clauses deleted for lack of memory : 0
% 0.14/0.73 % Backward-subsumed : 51
% 0.14/0.73 % Backward-rewritten : 6
% 0.14/0.73 % Generated clauses : 1557
% 0.14/0.73 % ...of the previous two non-redundant : 1336
% 0.14/0.73 % ...aggressively subsumed : 0
% 0.14/0.73 % Contextual simplify-reflections : 35
% 0.14/0.73 % Paramodulations : 1468
% 0.14/0.73 % Factorizations : 0
% 0.14/0.73 % NegExts : 0
% 0.14/0.73 % Equation resolutions : 81
% 0.14/0.73 % Disequality decompositions : 0
% 0.14/0.73 % Total rewrite steps : 1108
% 0.14/0.73 % ...of those cached : 1068
% 0.14/0.73 % Propositional unsat checks : 0
% 0.14/0.73 % Propositional check models : 0
% 0.14/0.73 % Propositional check unsatisfiable : 0
% 0.14/0.73 % Propositional clauses : 0
% 0.14/0.73 % Propositional clauses after purity: 0
% 0.14/0.73 % Propositional unsat core size : 0
% 0.14/0.73 % Propositional preprocessing time : 0.000
% 0.14/0.73 % Propositional encoding time : 0.000
% 0.14/0.73 % Propositional solver time : 0.000
% 0.14/0.73 % Success case prop preproc time : 0.000
% 0.14/0.73 % Success case prop encoding time : 0.000
% 0.14/0.73 % Success case prop solver time : 0.000
% 0.14/0.73 % Current number of processed clauses : 260
% 0.14/0.73 % Positive orientable unit clauses : 45
% 0.14/0.73 % Positive unorientable unit clauses: 0
% 0.14/0.73 % Negative unit clauses : 7
% 0.14/0.73 % Non-unit-clauses : 208
% 0.14/0.73 % Current number of unprocessed clauses: 1090
% 0.14/0.73 % ...number of literals in the above : 6992
% 0.14/0.73 % Current number of archived formulas : 0
% 0.14/0.73 % Current number of archived clauses : 269
% 0.14/0.73 % Clause-clause subsumption calls (NU) : 21993
% 0.14/0.73 % Rec. Clause-clause subsumption calls : 6261
% 0.14/0.73 % Non-unit clause-clause subsumptions : 97
% 0.14/0.73 % Unit Clause-clause subsumption calls : 209
% 0.14/0.73 % Rewrite failures with RHS unbound : 0
% 0.14/0.73 % BW rewrite match attempts : 16
% 0.14/0.73 % BW rewrite match successes : 15
% 0.14/0.73 % Condensation attempts : 0
% 0.14/0.73 % Condensation successes : 0
% 0.14/0.73 % Termbank termtop insertions : 51347
% 0.14/0.73 % Search garbage collected termcells : 4387
% 0.14/0.73
% 0.14/0.73 % -------------------------------------------------
% 0.14/0.73 % User time : 0.079 s
% 0.14/0.73 % System time : 0.011 s
% 0.14/0.73 % Total time : 0.090 s
% 0.14/0.73 % Maximum resident set size: 4276 pages
% 0.14/0.73
% 0.14/0.73 % -------------------------------------------------
% 0.14/0.73 % User time : 0.374 s
% 0.14/0.73 % System time : 0.032 s
% 0.14/0.73 % Total time : 0.406 s
% 0.14/0.73 % Maximum resident set size: 4864 pages
% 0.14/0.73 % E exiting
%------------------------------------------------------------------------------