%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC184+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 : n016.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:45:17 PM UTC 2026
% Result : Theorem 1.48s 0.84s
% Output : CNFRefutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 22
% Syntax : Number of formulae : 148 ( 29 unt; 0 def)
% Number of atoms : 576 ( 193 equ)
% Maximal formula atoms : 34 ( 3 avg)
% Number of connectives : 709 ( 281 ~; 300 |; 54 &)
% ( 7 <=>; 67 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-2 aty)
% Number of variables : 200 ( 0 sgn 116 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil != X3
| nil != X4 )
& ! [X8] :
( ? [X9] :
( leq(X9,X8)
& memberP(X4,X9)
& X8 != X9
& ssItem(X9) )
| ~ memberP(X4,X8)
| cons(X8,nil) != X3
| ~ ssItem(X8) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ( ~ memberP(X7,X5)
& ~ memberP(X6,X5) )
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ? [X4] :
( app(X3,cons(X2,X4)) = X1
& ssList(X4) )
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X3,X1)
| memberP(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
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(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax79) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( app(X3,X2) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( app(X2,X3) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( cons(X2,nil) = X1
& ssItem(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax80) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(c_0_22,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil != X3
| nil != X4 )
& ! [X8] :
( ? [X9] :
( leq(X9,X8)
& memberP(X4,X9)
& X8 != X9
& ssItem(X9) )
| ~ memberP(X4,X8)
| cons(X8,nil) != X3
| ~ ssItem(X8) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ( ~ memberP(X7,X5)
& ~ memberP(X6,X5) )
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_23,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( nil != X3
| nil != X4 )
& ! [X8] :
( ? [X9] :
( leq(X9,X8)
& memberP(X4,X9)
& X8 != X9
& ssItem(X9) )
| ~ memberP(X4,X8)
| cons(X8,nil) != X3
| ~ ssItem(X8) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ( ~ memberP(X7,X5)
& ~ memberP(X6,X5) )
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
fof(c_0_24,negated_conjecture,
! [X262] :
( ( ~ leq(X262,esk55_0)
| ~ memberP(esk51_0,X262)
| esk55_0 = X262
| ~ ssItem(X262)
| nil = esk50_0 )
& ( ~ leq(X262,esk55_0)
| ~ memberP(esk51_0,X262)
| esk55_0 = X262
| ~ ssItem(X262)
| nil = esk51_0 )
& ( memberP(esk51_0,esk55_0)
| nil = esk50_0 )
& ( memberP(esk51_0,esk55_0)
| nil = esk51_0 )
& ( cons(esk55_0,nil) = esk50_0
| nil = esk50_0 )
& ( cons(esk55_0,nil) = esk50_0
| nil = esk51_0 )
& ( ssItem(esk55_0)
| nil = esk50_0 )
& ( ssItem(esk55_0)
| nil = esk51_0 )
& ( memberP(esk54_0,esk52_0)
| memberP(esk53_0,esk52_0) )
& app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0
& ssList(esk54_0)
& ssList(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_23])])])])])]) ).
cnf(c_0_25,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_26,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_27,plain,
! [X225,X226,X227] :
( app(app(X225,X226),X227) = app(X225,app(X226,X227))
| ~ ssList(X227)
| ~ ssList(X226)
| ~ ssList(X225) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_28,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk50_0,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_32,plain,
! [X114,X115] :
( ssList(cons(X115,X114))
| ~ ssItem(X115)
| ~ ssList(X114) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| app(esk53_0,app(cons(esk52_0,nil),esk54_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_34,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_35,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_36,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_37,plain,
! [X223,X224] :
( cons(X224,X223) = app(cons(X224,nil),X223)
| ~ ssItem(X224)
| ~ ssList(X223) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_38,plain,
! [X14,X15,X18,X19] :
( ( ~ ssList(X14)
| ~ ssItem(X15)
| memberP(X14,X15)
| app(X18,cons(X15,X19)) != X14
| ~ ssList(X19)
| ~ ssList(X18) )
& ( ~ ssList(X14)
| ~ ssItem(X15)
| ~ memberP(X14,X15)
| app(esk3_2(X14,X15),cons(X15,esk4_2(X14,X15))) = X14 )
& ( ~ ssList(X14)
| ~ ssItem(X15)
| ~ memberP(X14,X15)
| ssList(esk4_2(X14,X15)) )
& ( ~ ssList(X14)
| ~ ssItem(X15)
| ~ memberP(X14,X15)
| ssList(esk3_2(X14,X15)) ) ),
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)],[ax3])])])])])]) ).
cnf(c_0_39,negated_conjecture,
app(esk53_0,app(cons(esk52_0,nil),esk54_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_40,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
( ~ ssList(X4)
| ~ ssItem(X3)
| app(X1,cons(X3,X2)) != X4
| ~ ssList(X2)
| ~ ssList(X1)
| memberP(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
app(esk53_0,cons(esk52_0,esk54_0)) = esk50_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_30]),c_0_36])]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_44,plain,
! [X154,X155,X156] :
( ( ~ ssItem(X154)
| ~ ssList(X155)
| ~ ssList(X156)
| memberP(app(X155,X156),X154)
| ~ memberP(X156,X154) )
& ( ~ ssItem(X154)
| ~ ssList(X155)
| ~ ssList(X156)
| memberP(app(X155,X156),X154)
| ~ memberP(X155,X154) )
& ( ~ ssItem(X154)
| ~ ssList(X155)
| ~ ssList(X156)
| memberP(X156,X154)
| memberP(X155,X154)
| ~ memberP(app(X155,X156),X154) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])])]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(X1)
| esk50_0 != X1
| memberP(X1,esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_30]),c_0_31]),c_0_36])]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_43,c_0_26]) ).
cnf(c_0_47,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_48,negated_conjecture,
memberP(esk50_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_45]),c_0_46])]) ).
cnf(c_0_49,negated_conjecture,
( cons(esk55_0,nil) = esk50_0
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_50,negated_conjecture,
( ssItem(esk55_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_51,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_52,plain,
! [X157,X158,X159] :
( ( ~ ssItem(X157)
| ~ ssItem(X158)
| ~ ssList(X159)
| memberP(cons(X158,X159),X157)
| ~ memberP(X159,X157) )
& ( ~ ssItem(X157)
| ~ ssItem(X158)
| ~ ssList(X159)
| memberP(cons(X158,X159),X157)
| X157 != X158 )
& ( ~ ssItem(X157)
| ~ ssItem(X158)
| ~ ssList(X159)
| memberP(X159,X157)
| X157 = X158
| ~ memberP(cons(X158,X159),X157) ) ),
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_53,negated_conjecture,
( ~ ssList(X1)
| memberP(app(esk50_0,X1),esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_46]),c_0_36])]) ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(X1)
| esk50_0 = nil
| app(esk50_0,X1) = cons(esk55_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_49]),c_0_50]) ).
fof(c_0_55,plain,
! [X160] :
( ~ memberP(nil,X160)
| ~ ssItem(X160) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])]) ).
cnf(c_0_56,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| memberP(X2,X3)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssList(X1)
| memberP(cons(esk55_0,X1),esk52_0)
| esk50_0 = nil ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(X1)
| memberP(X1,esk52_0)
| esk52_0 = esk55_0
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_36])]),c_0_50]) ).
fof(c_0_60,plain,
! [X217,X218,X219] :
( X219 = X217
| app(X219,X218) != app(X217,X218)
| ~ ssList(X219)
| ~ ssList(X218)
| ~ ssList(X217) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])])]) ).
cnf(c_0_61,negated_conjecture,
( esk50_0 = nil
| esk52_0 = esk55_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_36]),c_0_35])]) ).
fof(c_0_62,plain,
! [X27,X28,X30] :
( ( ~ ssList(X27)
| ~ ssList(X28)
| rearsegP(X27,X28)
| app(X30,X28) != X27
| ~ ssList(X30) )
& ( ~ ssList(X27)
| ~ ssList(X28)
| ~ rearsegP(X27,X28)
| app(esk7_2(X27,X28),X28) = X27 )
& ( ~ ssList(X27)
| ~ ssList(X28)
| ~ rearsegP(X27,X28)
| ssList(esk7_2(X27,X28)) ) ),
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)],[ax6])])])])])]) ).
fof(c_0_63,plain,
! [X133,X134] :
( ssList(app(X133,X134))
| ~ ssList(X134)
| ~ ssList(X133) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_64,plain,
( app(X3,X2) != app(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( esk50_0 = nil
| app(app(esk53_0,cons(esk55_0,nil)),esk54_0) = esk50_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_61]) ).
cnf(c_0_66,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| rearsegP(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(esk53_0,cons(esk52_0,nil)))
| app(X1,esk54_0) != esk50_0
| X1 = app(esk53_0,cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_28]),c_0_30])]) ).
cnf(c_0_69,negated_conjecture,
( esk50_0 = nil
| app(app(esk53_0,esk50_0),esk54_0) = esk50_0 ),
inference(spm,[status(thm)],[c_0_65,c_0_49]) ).
fof(c_0_70,plain,
! [X23,X24,X26] :
( ( ~ ssList(X23)
| ~ ssList(X24)
| frontsegP(X23,X24)
| app(X24,X26) != X23
| ~ ssList(X26) )
& ( ~ ssList(X23)
| ~ ssList(X24)
| ~ frontsegP(X23,X24)
| app(X24,esk6_2(X23,X24)) = X23 )
& ( ~ ssList(X23)
| ~ ssList(X24)
| ~ frontsegP(X23,X24)
| ssList(esk6_2(X23,X24)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])])]) ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_66]),c_0_67]) ).
fof(c_0_72,plain,
! [X20,X22] :
( ( ~ ssList(X20)
| singletonP(X20)
| cons(X22,nil) != X20
| ~ ssItem(X22) )
& ( ~ ssList(X20)
| ~ singletonP(X20)
| cons(esk5_1(X20),nil) = X20 )
& ( ~ ssList(X20)
| ~ singletonP(X20)
| ssItem(esk5_1(X20)) ) ),
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)],[ax4])])])])])]) ).
cnf(c_0_73,negated_conjecture,
( ~ ssList(app(esk53_0,esk50_0))
| ~ ssList(app(esk53_0,cons(esk52_0,nil)))
| esk50_0 = nil
| app(esk53_0,cons(esk52_0,nil)) = app(esk53_0,esk50_0) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
fof(c_0_74,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[ax86]) ).
fof(c_0_75,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_76,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| app(X2,X1) != X3
| ~ ssList(X1)
| frontsegP(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(app(esk53_0,cons(esk52_0,nil)))
| rearsegP(esk50_0,esk54_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_28]),c_0_30])]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(esk5_1(X1),nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_79,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| ssItem(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_80,plain,
( ~ ssList(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| singletonP(X2) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_81,negated_conjecture,
( ~ ssList(app(esk53_0,cons(esk52_0,nil)))
| esk50_0 = nil
| app(esk53_0,cons(esk52_0,nil)) = app(esk53_0,esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_67]),c_0_46]),c_0_31])]) ).
fof(c_0_82,plain,
! [X228,X229] :
( ( ~ ssList(X228)
| ~ ssList(X229)
| nil = app(X228,X229)
| nil != X228
| nil != X229 )
& ( ~ ssList(X228)
| ~ ssList(X229)
| nil != app(X228,X229)
| nil = X228 )
& ( ~ ssList(X228)
| ~ ssList(X229)
| nil != app(X228,X229)
| nil = X229 ) ),
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_83,plain,
! [X233,X234] :
( tl(app(X233,X234)) = app(tl(X233),X234)
| nil = X233
| ~ ssList(X234)
| ~ ssList(X233) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_74])])])]) ).
fof(c_0_84,plain,
! [X130] :
( ssList(tl(X130))
| nil = X130
| ~ ssList(X130) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_75])])]) ).
cnf(c_0_85,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_76]),c_0_67]) ).
cnf(c_0_86,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| rearsegP(esk50_0,esk54_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_67]),c_0_31])]) ).
cnf(c_0_87,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| ~ singletonP(X1)
| esk5_1(X1) = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_78]),c_0_35])]),c_0_79]),c_0_58]) ).
cnf(c_0_88,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_80]) ).
cnf(c_0_89,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| esk50_0 = nil
| app(esk53_0,cons(esk52_0,nil)) = app(esk53_0,esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_67]),c_0_31])]) ).
cnf(c_0_90,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_91,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X1,X2)) = app(tl(X1),X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_92,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_93,negated_conjecture,
( ~ ssList(cons(esk52_0,esk54_0))
| frontsegP(esk50_0,esk53_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_42]),c_0_31])]) ).
fof(c_0_94,plain,
! [X220,X221,X222] :
( X222 = X220
| app(X221,X222) != app(X221,X220)
| ~ ssList(X222)
| ~ ssList(X221)
| ~ ssList(X220) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
fof(c_0_95,plain,
! [X230] :
( app(X230,nil) = X230
| ~ ssList(X230) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_96,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(esk7_2(X1,X2),X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_97,negated_conjecture,
rearsegP(esk50_0,esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_98,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| ssList(esk7_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_99,negated_conjecture,
( ~ singletonP(esk50_0)
| esk5_1(esk50_0) = esk52_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_48]),c_0_46]),c_0_36])]) ).
cnf(c_0_100,negated_conjecture,
( singletonP(esk50_0)
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_49]),c_0_46])]),c_0_50]) ).
cnf(c_0_101,negated_conjecture,
( esk50_0 = nil
| app(esk53_0,cons(esk52_0,nil)) = app(esk53_0,esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_102,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| tl(app(X1,X2)) != nil
| nil = X2
| nil = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]) ).
fof(c_0_103,plain,
! [X131,X132] :
( tl(cons(X132,X131)) = X131
| ~ ssItem(X132)
| ~ ssList(X131) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])])]) ).
cnf(c_0_104,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk6_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_105,negated_conjecture,
frontsegP(esk50_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_34]),c_0_30]),c_0_36])]) ).
cnf(c_0_106,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_107,plain,
( app(X2,X3) != app(X2,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_108,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_109,negated_conjecture,
app(esk7_2(esk50_0,esk54_0),esk54_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_30]),c_0_46])]) ).
cnf(c_0_110,negated_conjecture,
ssList(esk7_2(esk50_0,esk54_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_97]),c_0_30]),c_0_46])]) ).
cnf(c_0_111,negated_conjecture,
( esk50_0 = nil
| esk5_1(esk50_0) = esk52_0 ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_112,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ssList(app(esk53_0,esk50_0))
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_101]),c_0_31])]) ).
fof(c_0_113,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_114,negated_conjecture,
( ~ ssList(cons(esk52_0,esk54_0))
| tl(esk50_0) != nil
| esk53_0 = nil
| cons(esk52_0,esk54_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_42]),c_0_31])]) ).
cnf(c_0_115,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| tl(cons(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_116,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_117,negated_conjecture,
app(esk53_0,esk6_2(esk50_0,esk53_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_46]),c_0_31])]) ).
cnf(c_0_118,negated_conjecture,
ssList(esk6_2(esk50_0,esk53_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_105]),c_0_31]),c_0_46])]) ).
fof(c_0_119,plain,
! [X138] :
( app(nil,X138) = X138
| ~ ssList(X138) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_120,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X2,X1) != X2
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_35])]) ).
cnf(c_0_121,negated_conjecture,
( ~ ssList(app(esk53_0,cons(esk52_0,nil)))
| esk7_2(esk50_0,esk54_0) = app(esk53_0,cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_109]),c_0_110])]) ).
cnf(c_0_122,negated_conjecture,
( esk50_0 = nil
| cons(esk52_0,nil) = esk50_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_111]),c_0_46])]),c_0_100]) ).
cnf(c_0_123,negated_conjecture,
( ssList(app(esk53_0,esk50_0))
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_34]),c_0_35]),c_0_36])]) ).
fof(c_0_124,plain,
! [X125,X126] :
( nil != 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)],[c_0_113])])])]) ).
cnf(c_0_125,negated_conjecture,
( tl(esk50_0) != nil
| esk53_0 = nil
| cons(esk52_0,esk54_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_34]),c_0_30]),c_0_36])]) ).
cnf(c_0_126,negated_conjecture,
( esk50_0 = nil
| tl(esk50_0) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_49]),c_0_35])]),c_0_50]) ).
cnf(c_0_127,negated_conjecture,
( esk50_0 != nil
| esk53_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_118]),c_0_31])]) ).
cnf(c_0_128,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_129,negated_conjecture,
( esk7_2(esk50_0,esk54_0) != esk50_0
| esk54_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_109]),c_0_110]),c_0_30])]) ).
cnf(c_0_130,negated_conjecture,
( esk50_0 = nil
| esk7_2(esk50_0,esk54_0) = app(esk53_0,esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_123]) ).
cnf(c_0_131,negated_conjecture,
( esk50_0 != nil
| esk54_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_109]),c_0_110]),c_0_30])]) ).
cnf(c_0_132,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_133,negated_conjecture,
( esk53_0 = nil
| cons(esk52_0,esk54_0) = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127]) ).
cnf(c_0_134,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_29,c_0_128]),c_0_35])]) ).
cnf(c_0_135,negated_conjecture,
( app(esk53_0,esk50_0) != esk50_0
| esk54_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_131]) ).
cnf(c_0_136,negated_conjecture,
esk53_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_133]),c_0_30]),c_0_36])]) ).
cnf(c_0_137,negated_conjecture,
app(nil,esk50_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_117]),c_0_118]),c_0_31])]) ).
cnf(c_0_138,negated_conjecture,
esk54_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_135,c_0_136]),c_0_137])]) ).
cnf(c_0_139,negated_conjecture,
app(nil,cons(esk52_0,nil)) = esk50_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_136]),c_0_138]) ).
cnf(c_0_140,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| cons(esk52_0,nil) = esk50_0 ),
inference(spm,[status(thm)],[c_0_128,c_0_139]) ).
cnf(c_0_141,negated_conjecture,
cons(esk52_0,nil) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_142,negated_conjecture,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_141]),c_0_35]),c_0_36])]) ).
cnf(c_0_143,negated_conjecture,
( memberP(esk54_0,esk52_0)
| memberP(esk53_0,esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_144,negated_conjecture,
esk52_0 = esk55_0,
inference(sr,[status(thm)],[c_0_61,c_0_142]) ).
cnf(c_0_145,negated_conjecture,
memberP(nil,esk55_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_143,c_0_136]),c_0_138]),c_0_144]),c_0_144])]) ).
cnf(c_0_146,negated_conjecture,
ssItem(esk55_0),
inference(sr,[status(thm)],[c_0_50,c_0_142]) ).
cnf(c_0_147,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_145]),c_0_146])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC184+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n016.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 08:07:23 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.52 Running first-order theorem proving
% 0.20/0.52 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
% 1.48/0.84 % Version: 3.5.1
% 1.48/0.84 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.48/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.48/0.84 % Starting new_bool_3 with 300s (1) cores
% 1.48/0.84 % Starting new_bool_1 with 300s (1) cores
% 1.48/0.84 % Starting sh5l with 300s (1) cores
% 1.48/0.84 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1972036 completed with status 0
% 1.48/0.84 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.48/0.84 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.48/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.48/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.48/0.84 % No SInE strategy applied
% 1.48/0.84 % Search class: FGHSF-FSLM21-MFFFFFNN
% 1.48/0.84 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.48/0.84 % Starting SubtermCWHack with 136s (1) cores
% 1.48/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.48/0.84 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 1.48/0.84 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 1.48/0.84 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 1.48/0.84 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 1972043 completed with status 0
% 1.48/0.84 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 1.48/0.84 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.48/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.48/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.48/0.84 % No SInE strategy applied
% 1.48/0.84 % Search class: FGHSF-FSLM21-MFFFFFNN
% 1.48/0.84 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.48/0.84 % Starting SubtermCWHack with 136s (1) cores
% 1.48/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.48/0.84 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 1.48/0.84 % Preprocessing time : 0.003 s
% 1.48/0.84
% 1.48/0.84 % Proof found!
% 1.48/0.84 % SZS status Theorem
% 1.48/0.84 % SZS output start CNFRefutation
% See solution above
% 1.48/0.85 % Parsed axioms : 96
% 1.48/0.85 % Removed by relevancy pruning/SinE : 0
% 1.48/0.85 % Initial clauses : 209
% 1.48/0.85 % Removed in clause preprocessing : 2
% 1.48/0.85 % Initial clauses in saturation : 207
% 1.48/0.85 % Processed clauses : 2313
% 1.48/0.85 % ...of these trivial : 46
% 1.48/0.85 % ...subsumed : 1207
% 1.48/0.85 % ...remaining for further processing : 1060
% 1.48/0.85 % Other redundant clauses eliminated : 95
% 1.48/0.85 % Clauses deleted for lack of memory : 0
% 1.48/0.85 % Backward-subsumed : 200
% 1.48/0.85 % Backward-rewritten : 317
% 1.48/0.85 % Generated clauses : 10321
% 1.48/0.85 % ...of the previous two non-redundant : 9890
% 1.48/0.85 % ...aggressively subsumed : 0
% 1.48/0.85 % Contextual simplify-reflections : 432
% 1.48/0.85 % Paramodulations : 10096
% 1.48/0.85 % Factorizations : 0
% 1.48/0.85 % NegExts : 0
% 1.48/0.85 % Equation resolutions : 141
% 1.48/0.85 % Disequality decompositions : 0
% 1.48/0.85 % Total rewrite steps : 7801
% 1.48/0.85 % ...of those cached : 7743
% 1.48/0.85 % Propositional unsat checks : 0
% 1.48/0.85 % Propositional check models : 0
% 1.48/0.85 % Propositional check unsatisfiable : 0
% 1.48/0.85 % Propositional clauses : 0
% 1.48/0.85 % Propositional clauses after purity: 0
% 1.48/0.85 % Propositional unsat core size : 0
% 1.48/0.85 % Propositional preprocessing time : 0.000
% 1.48/0.85 % Propositional encoding time : 0.000
% 1.48/0.85 % Propositional solver time : 0.000
% 1.48/0.85 % Success case prop preproc time : 0.000
% 1.48/0.85 % Success case prop encoding time : 0.000
% 1.48/0.85 % Success case prop solver time : 0.000
% 1.48/0.85 % Current number of processed clauses : 453
% 1.48/0.85 % Positive orientable unit clauses : 51
% 1.48/0.85 % Positive unorientable unit clauses: 0
% 1.48/0.85 % Negative unit clauses : 5
% 1.48/0.85 % Non-unit-clauses : 397
% 1.48/0.85 % Current number of unprocessed clauses: 7526
% 1.48/0.85 % ...number of literals in the above : 43424
% 1.48/0.85 % Current number of archived formulas : 0
% 1.48/0.85 % Current number of archived clauses : 601
% 1.48/0.85 % Clause-clause subsumption calls (NU) : 114950
% 1.48/0.85 % Rec. Clause-clause subsumption calls : 39628
% 1.48/0.85 % Non-unit clause-clause subsumptions : 1810
% 1.48/0.85 % Unit Clause-clause subsumption calls : 3812
% 1.48/0.85 % Rewrite failures with RHS unbound : 0
% 1.48/0.85 % BW rewrite match attempts : 29
% 1.48/0.85 % BW rewrite match successes : 27
% 1.48/0.85 % Condensation attempts : 0
% 1.48/0.85 % Condensation successes : 0
% 1.48/0.85 % Termbank termtop insertions : 208849
% 1.48/0.85 % Search garbage collected termcells : 4366
% 1.48/0.85
% 1.48/0.85 % -------------------------------------------------
% 1.48/0.85 % User time : 0.278 s
% 1.48/0.85 % System time : 0.014 s
% 1.48/0.85 % Total time : 0.292 s
% 1.48/0.85 % Maximum resident set size: 4276 pages
% 1.48/0.85
% 1.48/0.85 % -------------------------------------------------
% 1.48/0.85 % User time : 0.920 s
% 1.48/0.85 % System time : 0.058 s
% 1.48/0.85 % Total time : 0.979 s
% 1.48/0.85 % Maximum resident set size: 4864 pages
% 1.48/0.85 % E exiting
%------------------------------------------------------------------------------