%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC055+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 : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:42:48 PM UTC 2026
% Result : Theorem 243.42s 41.04s
% Output : CNFRefutation 243.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 20
% Syntax : Number of formulae : 149 ( 27 unt; 0 def)
% Number of atoms : 588 ( 182 equ)
% Maximal formula atoms : 42 ( 3 avg)
% Number of connectives : 754 ( 315 ~; 313 |; 57 &)
% ( 5 <=>; 64 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 226 ( 0 sgn 105 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X7] :
( segmentP(X1,X7)
& segmentP(X2,X7)
& neq(X7,nil)
& ssList(X7) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( leq(X5,X6)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
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(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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(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(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(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ? [X4] :
( app(app(X3,X2),X4) = X1
& ssList(X4) )
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax54,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X2,X1)
& segmentP(X1,X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax54) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X2,X3)
& segmentP(X1,X2) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax53) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X7] :
( segmentP(X1,X7)
& segmentP(X2,X7)
& neq(X7,nil)
& ssList(X7) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( leq(X5,X6)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_21,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
fof(c_0_22,plain,
! [X86,X87,X88] :
( X88 = X86
| app(X88,X87) != app(X86,X87)
| ~ ssList(X88)
| ~ ssList(X87)
| ~ ssList(X86) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])])]) ).
fof(c_0_23,plain,
! [X92,X93,X94] :
( app(app(X92,X93),X94) = app(X92,app(X93,X94))
| ~ ssList(X94)
| ~ ssList(X93)
| ~ ssList(X92) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_24,plain,
! [X83,X84] :
( ssList(app(X83,X84))
| ~ ssList(X84)
| ~ ssList(X83) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_25,plain,
! [X85] :
( app(nil,X85) = X85
| ~ ssList(X85) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_26,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X7] :
( segmentP(X1,X7)
& segmentP(X2,X7)
& neq(X7,nil)
& ssList(X7) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( leq(X5,X6)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5)
| cons(X5,nil) != X3 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
fof(c_0_27,plain,
! [X72,X73] :
( cons(X73,X72) != X72
| ~ ssItem(X73)
| ~ ssList(X72) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
fof(c_0_28,plain,
! [X78,X79,X80] :
( cons(X80,app(X79,X78)) = app(cons(X80,X79),X78)
| ~ ssItem(X80)
| ~ ssList(X79)
| ~ ssList(X78) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_29,plain,
( app(X3,X2) != app(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_34,negated_conjecture,
! [X13,X14] :
( ( nil != esk1_0
| ~ segmentP(esk1_0,X14)
| ~ segmentP(esk2_0,X14)
| ~ neq(X14,nil)
| ~ ssList(X14) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ segmentP(esk1_0,X14)
| ~ segmentP(esk2_0,X14)
| ~ neq(X14,nil)
| ~ ssList(X14) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( ~ leq(esk5_0,X13)
| ~ memberP(esk4_0,X13)
| esk5_0 = X13
| ~ ssItem(X13)
| nil = esk3_0 )
& ( ~ leq(esk5_0,X13)
| ~ memberP(esk4_0,X13)
| esk5_0 = X13
| ~ ssItem(X13)
| nil = esk4_0 )
& ( memberP(esk4_0,esk5_0)
| nil = esk3_0 )
& ( memberP(esk4_0,esk5_0)
| nil = esk4_0 )
& ( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 )
& ( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 )
& ( ssItem(esk5_0)
| nil = esk3_0 )
& ( ssItem(esk5_0)
| nil = esk4_0 )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])])])]) ).
cnf(c_0_35,plain,
( cons(X2,X1) != X1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_37,plain,
! [X81,X82] :
( cons(X82,X81) = app(cons(X82,nil),X81)
| ~ ssItem(X82)
| ~ ssList(X81) ),
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,
! [X95,X96] :
( ( ~ ssList(X95)
| ~ ssList(X96)
| nil = app(X95,X96)
| nil != X95
| nil != X96 )
& ( ~ ssList(X95)
| ~ ssList(X96)
| nil != app(X95,X96)
| nil = X95 )
& ( ~ ssList(X95)
| ~ ssList(X96)
| nil != app(X95,X96)
| nil = X96 ) ),
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_39,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| app(X1,X4) != app(X2,app(X3,X4))
| X1 = app(X2,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_40,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_30,c_0_32]),c_0_33])]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| app(cons(X1,X2),X3) != app(X2,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_31]) ).
cnf(c_0_44,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_45,plain,
! [X89,X90,X91] :
( X91 = X89
| app(X90,X91) != app(X90,X89)
| ~ ssList(X91)
| ~ ssList(X90)
| ~ ssList(X89) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])]) ).
cnf(c_0_46,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_47,plain,
! [X97] :
( app(X97,nil) = X97
| ~ ssList(X97) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,X3) != app(X2,X3)
| X1 = app(nil,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_33])]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,X2) != app(nil,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_33])]) ).
fof(c_0_51,plain,
! [X15,X16,X19,X20] :
( ( ~ ssList(X15)
| ~ ssList(X16)
| segmentP(X15,X16)
| app(app(X19,X16),X20) != X15
| ~ ssList(X20)
| ~ ssList(X19) )
& ( ~ ssList(X15)
| ~ ssList(X16)
| ~ segmentP(X15,X16)
| app(app(esk6_2(X15,X16),X16),esk7_2(X15,X16)) = X15 )
& ( ~ ssList(X15)
| ~ ssList(X16)
| ~ segmentP(X15,X16)
| ssList(esk7_2(X15,X16)) )
& ( ~ ssList(X15)
| ~ ssList(X16)
| ~ segmentP(X15,X16)
| ssList(esk6_2(X15,X16)) ) ),
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)],[ax7])])])])])]) ).
cnf(c_0_52,plain,
( app(X2,X3) != app(X2,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_46])]),c_0_33])]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_30]),c_0_31]) ).
cnf(c_0_56,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X1,esk4_0) != app(X2,esk4_0)
| X1 = app(nil,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| app(cons(X1,X2),X3) != app(nil,app(X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_36]),c_0_31]) ).
cnf(c_0_58,plain,
( ~ ssList(X4)
| ~ ssList(X3)
| app(app(X1,X3),X2) != X4
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_59,plain,
! [X27,X28,X29,X30] :
( segmentP(app(app(X29,X27),X30),X28)
| ~ segmentP(X27,X28)
| ~ ssList(X30)
| ~ ssList(X29)
| ~ ssList(X28)
| ~ ssList(X27) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| app(nil,X1) != nil
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_33])]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,app(X2,nil)) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_30]),c_0_33])]),c_0_31]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| ssList(app(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_53]),c_0_33])]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(X1)
| app(esk4_0,esk4_0) != app(X1,esk4_0)
| app(nil,X1) = esk4_0 ),
inference(spm,[status(thm)],[c_0_56,c_0_49]) ).
cnf(c_0_64,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,X2) != app(nil,app(nil,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_44]),c_0_33])]) ).
cnf(c_0_65,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_66,negated_conjecture,
( ssItem(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_67,negated_conjecture,
( nil != esk1_0
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_68,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_69,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_71,plain,
( ~ segmentP(X1,X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X3,X1),X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| app(nil,X1) != nil
| app(X1,nil) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_33])]),c_0_62]) ).
cnf(c_0_73,negated_conjecture,
app(nil,esk4_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_63]),c_0_49])]) ).
cnf(c_0_74,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,app(X2,nil)) != app(nil,app(nil,X2)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_61]),c_0_33])]),c_0_62]) ).
cnf(c_0_75,negated_conjecture,
( ~ ssList(X1)
| esk3_0 = nil
| cons(esk5_0,X1) = app(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_65]),c_0_66]) ).
cnf(c_0_76,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk3_0,X1)
| esk3_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68]),c_0_68]),c_0_42]) ).
cnf(c_0_77,negated_conjecture,
( esk3_0 != nil
| neq(esk4_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_42]),c_0_68]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_54]),c_0_33])]),c_0_31]) ).
cnf(c_0_79,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(nil,X2)
| segmentP(app(nil,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_53]),c_0_33])]) ).
cnf(c_0_80,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_32]),c_0_33])]),c_0_31]) ).
cnf(c_0_81,negated_conjecture,
( esk4_0 != nil
| app(esk4_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_49])]) ).
fof(c_0_82,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_83,plain,
! [X70,X71] :
( ssList(cons(X71,X70))
| ~ ssItem(X71)
| ~ ssList(X70) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_84,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,X2),nil) != app(nil,app(nil,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_36]),c_0_33])]) ).
cnf(c_0_85,negated_conjecture,
( esk3_0 = nil
| cons(esk5_0,esk4_0) = app(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_75,c_0_49]) ).
cnf(c_0_86,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_87,negated_conjecture,
( ~ segmentP(esk4_0,esk4_0)
| ~ segmentP(esk3_0,esk4_0)
| esk3_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_49])]) ).
cnf(c_0_88,negated_conjecture,
segmentP(esk4_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_73]),c_0_49]),c_0_33])]) ).
cnf(c_0_89,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(nil,X2)
| segmentP(X1,X2) ),
inference(spm,[status(thm)],[c_0_79,c_0_32]) ).
cnf(c_0_90,negated_conjecture,
( esk4_0 != nil
| segmentP(nil,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_49]),c_0_33])]) ).
cnf(c_0_91,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_92,negated_conjecture,
( ssItem(esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_93,plain,
! [X35,X36] :
( ( ~ ssList(X35)
| ~ ssList(X36)
| neq(X35,X36)
| X35 = X36 )
& ( ~ ssList(X35)
| ~ ssList(X36)
| X35 != X36
| ~ neq(X35,X36) ) ),
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_82])])])])]) ).
fof(c_0_94,plain,
! [X55,X56,X59,X60] :
( ( ~ ssList(X55)
| ~ ssItem(X56)
| memberP(X55,X56)
| app(X59,cons(X56,X60)) != X55
| ~ ssList(X60)
| ~ ssList(X59) )
& ( ~ ssList(X55)
| ~ ssItem(X56)
| ~ memberP(X55,X56)
| app(esk10_2(X55,X56),cons(X56,esk11_2(X55,X56))) = X55 )
& ( ~ ssList(X55)
| ~ ssItem(X56)
| ~ memberP(X55,X56)
| ssList(esk11_2(X55,X56)) )
& ( ~ ssList(X55)
| ~ ssItem(X56)
| ~ memberP(X55,X56)
| ssList(esk10_2(X55,X56)) ) ),
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_95,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,X2),nil) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_54]),c_0_33])]) ).
cnf(c_0_96,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_97,negated_conjecture,
( app(app(esk3_0,esk4_0),nil) != app(nil,app(nil,esk4_0))
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_49])]),c_0_66]) ).
cnf(c_0_98,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_86,c_0_68]) ).
cnf(c_0_99,negated_conjecture,
( ~ segmentP(esk3_0,esk4_0)
| esk3_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_100,negated_conjecture,
( ~ ssList(X1)
| esk4_0 != nil
| segmentP(X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_49])]) ).
cnf(c_0_101,negated_conjecture,
( esk3_0 != nil
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_91]),c_0_33])]),c_0_92]) ).
cnf(c_0_102,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_103,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ssList(esk11_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_104,negated_conjecture,
( esk3_0 = nil
| app(app(esk3_0,esk4_0),nil) = app(esk3_0,esk4_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_85]),c_0_49])]),c_0_66]) ).
cnf(c_0_105,negated_conjecture,
( ssList(app(esk3_0,esk4_0))
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_85]),c_0_49])]),c_0_66]) ).
cnf(c_0_106,negated_conjecture,
( app(esk3_0,app(esk4_0,nil)) != app(nil,app(nil,esk4_0))
| esk3_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_30]),c_0_33]),c_0_49]),c_0_98])]) ).
cnf(c_0_107,negated_conjecture,
esk3_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_98])]),c_0_101]) ).
cnf(c_0_108,negated_conjecture,
( esk3_0 = nil
| cons(esk5_0,nil) = app(esk3_0,nil) ),
inference(spm,[status(thm)],[c_0_75,c_0_33]) ).
cnf(c_0_109,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_110,plain,
( ~ ssList(X1)
| neq(X1,nil)
| X1 = nil ),
inference(spm,[status(thm)],[c_0_102,c_0_33]) ).
cnf(c_0_111,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| esk3_0 = nil
| cons(esk5_0,esk11_2(X1,X2)) = app(esk3_0,esk11_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_75,c_0_103]) ).
cnf(c_0_112,negated_conjecture,
( memberP(esk4_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_113,plain,
! [X24,X25] :
( X24 = X25
| ~ segmentP(X25,X24)
| ~ segmentP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])])])]) ).
cnf(c_0_114,negated_conjecture,
( segmentP(app(esk3_0,esk4_0),esk4_0)
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_104]),c_0_49]),c_0_33]),c_0_98])]),c_0_105]) ).
cnf(c_0_115,negated_conjecture,
app(esk3_0,app(esk4_0,nil)) != esk4_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_73]),c_0_73]),c_0_107]) ).
cnf(c_0_116,negated_conjecture,
app(app(esk3_0,esk4_0),nil) = app(esk3_0,esk4_0),
inference(sr,[status(thm)],[c_0_104,c_0_107]) ).
cnf(c_0_117,negated_conjecture,
( esk3_0 = nil
| app(esk3_0,nil) = esk3_0 ),
inference(spm,[status(thm)],[c_0_65,c_0_108]) ).
cnf(c_0_118,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk3_0,X1)
| esk4_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_42]),c_0_68]),c_0_42]) ).
cnf(c_0_119,negated_conjecture,
( neq(esk3_0,nil)
| esk3_0 = nil ),
inference(spm,[status(thm)],[c_0_110,c_0_98]) ).
fof(c_0_120,plain,
! [X26] :
( segmentP(X26,X26)
| ~ ssList(X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
fof(c_0_121,plain,
! [X21,X22,X23] :
( segmentP(X21,X23)
| ~ segmentP(X22,X23)
| ~ segmentP(X21,X22)
| ~ ssList(X23)
| ~ ssList(X22)
| ~ ssList(X21) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])])]) ).
cnf(c_0_122,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(esk10_2(X1,X2),cons(X2,esk11_2(X1,X2))) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_123,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ssList(esk10_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_124,negated_conjecture,
( esk3_0 = nil
| cons(esk5_0,esk11_2(esk4_0,esk5_0)) = app(esk3_0,esk11_2(esk4_0,esk5_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_49])]),c_0_66]) ).
cnf(c_0_125,plain,
( ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_126,negated_conjecture,
segmentP(app(esk3_0,esk4_0),esk4_0),
inference(sr,[status(thm)],[c_0_114,c_0_107]) ).
cnf(c_0_127,negated_conjecture,
ssList(app(esk3_0,esk4_0)),
inference(sr,[status(thm)],[c_0_105,c_0_107]) ).
cnf(c_0_128,negated_conjecture,
app(esk3_0,esk4_0) != esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_54]),c_0_49])]) ).
cnf(c_0_129,negated_conjecture,
app(esk3_0,app(esk4_0,nil)) = app(esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_116]),c_0_33]),c_0_49]),c_0_98])]) ).
cnf(c_0_130,negated_conjecture,
app(esk3_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_117,c_0_107]) ).
cnf(c_0_131,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ segmentP(esk3_0,esk3_0)
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_98])]),c_0_101]) ).
cnf(c_0_132,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_120]) ).
cnf(c_0_133,plain,
( ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_134,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(cons(X2,esk11_2(X1,X2)))
| ~ memberP(X1,X2)
| segmentP(X1,cons(X2,esk11_2(X1,X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_122]),c_0_123]) ).
cnf(c_0_135,negated_conjecture,
cons(esk5_0,esk11_2(esk4_0,esk5_0)) = app(esk3_0,esk11_2(esk4_0,esk5_0)),
inference(sr,[status(thm)],[c_0_124,c_0_107]) ).
cnf(c_0_136,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_112,c_0_107]) ).
cnf(c_0_137,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_66,c_0_107]) ).
cnf(c_0_138,negated_conjecture,
~ segmentP(esk4_0,app(esk3_0,esk4_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127]),c_0_49])]),c_0_128]) ).
cnf(c_0_139,negated_conjecture,
( esk4_0 != nil
| app(esk3_0,esk4_0) = esk3_0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_81]),c_0_130]) ).
cnf(c_0_140,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_98])]) ).
cnf(c_0_141,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_36]),c_0_31]) ).
cnf(c_0_142,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_65,c_0_107]) ).
cnf(c_0_143,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,app(X2,X3))
| segmentP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_80]),c_0_31]) ).
cnf(c_0_144,negated_conjecture,
( ~ ssList(app(esk3_0,esk11_2(esk4_0,esk5_0)))
| segmentP(esk4_0,app(esk3_0,esk11_2(esk4_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]),c_0_49]),c_0_137])]) ).
cnf(c_0_145,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140]) ).
cnf(c_0_146,negated_conjecture,
( ~ ssList(X1)
| ssList(app(esk3_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_33]),c_0_137])]) ).
cnf(c_0_147,negated_conjecture,
~ ssList(esk11_2(esk4_0,esk5_0)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_98]),c_0_49])]),c_0_145]),c_0_146]) ).
cnf(c_0_148,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_103]),c_0_136]),c_0_49]),c_0_137])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC055+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.39 % Computer : n007.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Mon Sep 21 07:49:55 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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
% 243.42/41.04 % Version: 3.5.1
% 243.42/41.04 % Preprocessing class: FSLSSMSSSSSNFFN.
% 243.42/41.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 243.42/41.04 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 243.42/41.04 % Starting new_bool_3 with 300s (1) cores
% 243.42/41.04 % Starting new_bool_1 with 300s (1) cores
% 243.42/41.04 % Starting sh5l with 300s (1) cores
% 243.42/41.04 % new_bool_1 with pid 574199 completed with status 0
% 243.42/41.04 % Result found by new_bool_1
% 243.42/41.04 % Preprocessing class: FSLSSMSSSSSNFFN.
% 243.42/41.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 243.42/41.04 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 243.42/41.04 % Starting new_bool_3 with 300s (1) cores
% 243.42/41.04 % Starting new_bool_1 with 300s (1) cores
% 243.42/41.04 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 243.42/41.04 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 243.42/41.04 % Search class: FGHSF-FFMM21-MFFFFFNN
% 243.42/41.04 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 243.42/41.04 % Starting SubtermCWHack with 31s (1) cores
% 243.42/41.04 % SubtermCWHack with pid 574202 completed with status 8
% 243.42/41.04 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 243.42/41.04 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 574852 completed with status 0
% 243.42/41.04 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 243.42/41.04 % Preprocessing class: FSLSSMSSSSSNFFN.
% 243.42/41.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 243.42/41.04 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 243.42/41.04 % Starting new_bool_3 with 300s (1) cores
% 243.42/41.04 % Starting new_bool_1 with 300s (1) cores
% 243.42/41.04 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 243.42/41.04 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 243.42/41.04 % Search class: FGHSF-FFMM21-MFFFFFNN
% 243.42/41.04 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 243.42/41.04 % Starting SubtermCWHack with 31s (1) cores
% 243.42/41.04 % SubtermCWHack with pid 574202 completed with status 8
% 243.42/41.04 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 243.42/41.04 % Preprocessing time : 0.002 s
% 243.42/41.04 % Presaturation interreduction done
% 243.42/41.04
% 243.42/41.04 % Proof found!
% 243.42/41.04 % SZS status Theorem
% 243.42/41.04 % SZS output start CNFRefutation
% See solution above
% 243.42/41.04 % Parsed axioms : 96
% 243.42/41.04 % Removed by relevancy pruning/SinE : 57
% 243.42/41.04 % Initial clauses : 78
% 243.42/41.04 % Removed in clause preprocessing : 0
% 243.42/41.04 % Initial clauses in saturation : 78
% 243.42/41.04 % Processed clauses : 14242
% 243.42/41.04 % ...of these trivial : 553
% 243.42/41.04 % ...subsumed : 9241
% 243.42/41.04 % ...remaining for further processing : 4448
% 243.42/41.04 % Other redundant clauses eliminated : 47
% 243.42/41.04 % Clauses deleted for lack of memory : 0
% 243.42/41.04 % Backward-subsumed : 757
% 243.42/41.04 % Backward-rewritten : 311
% 243.42/41.04 % Generated clauses : 192300
% 243.42/41.04 % ...of the previous two non-redundant : 188902
% 243.42/41.04 % ...aggressively subsumed : 0
% 243.42/41.04 % Contextual simplify-reflections : 1054
% 243.42/41.04 % Paramodulations : 191749
% 243.42/41.04 % Factorizations : 0
% 243.42/41.04 % NegExts : 0
% 243.42/41.04 % Equation resolutions : 79
% 243.42/41.04 % Disequality decompositions : 0
% 243.42/41.04 % Total rewrite steps : 109527
% 243.42/41.04 % ...of those cached : 109191
% 243.42/41.04 % Propositional unsat checks : 0
% 243.42/41.04 % Propositional check models : 0
% 243.42/41.04 % Propositional check unsatisfiable : 0
% 243.42/41.04 % Propositional clauses : 0
% 243.42/41.04 % Propositional clauses after purity: 0
% 243.42/41.04 % Propositional unsat core size : 0
% 243.42/41.04 % Propositional preprocessing time : 0.000
% 243.42/41.04 % Propositional encoding time : 0.000
% 243.42/41.04 % Propositional solver time : 0.000
% 243.42/41.04 % Success case prop preproc time : 0.000
% 243.42/41.04 % Success case prop encoding time : 0.000
% 243.42/41.04 % Success case prop solver time : 0.000
% 243.42/41.04 % Current number of processed clauses : 2825
% 243.42/41.04 % Positive orientable unit clauses : 416
% 243.42/41.04 % Positive unorientable unit clauses: 0
% 243.42/41.04 % Negative unit clauses : 354
% 243.42/41.04 % Non-unit-clauses : 2055
% 243.42/41.04 % Current number of unprocessed clauses: 169246
% 243.42/41.04 % ...number of literals in the above : 669255
% 243.42/41.04 % Current number of archived formulas : 0
% 243.42/41.04 % Current number of archived clauses : 1615
% 243.42/41.04 % Clause-clause subsumption calls (NU) : 440824
% 243.42/41.04 % Rec. Clause-clause subsumption calls : 169938
% 243.42/41.04 % Non-unit clause-clause subsumptions : 7520
% 243.42/41.04 % Unit Clause-clause subsumption calls : 31832
% 243.42/41.04 % Rewrite failures with RHS unbound : 0
% 243.42/41.04 % BW rewrite match attempts : 2502
% 243.42/41.04 % BW rewrite match successes : 90
% 243.42/41.04 % Condensation attempts : 0
% 243.42/41.04 % Condensation successes : 0
% 243.42/41.04 % Termbank termtop insertions : 5000890
% 243.42/41.04 % Search garbage collected termcells : 2091
% 243.42/41.04
% 243.42/41.04 % -------------------------------------------------
% 243.42/41.04 % User time : 33.256 s
% 243.42/41.04 % System time : 1.298 s
% 243.42/41.04 % Total time : 34.554 s
% 243.42/41.04 % Maximum resident set size: 3760 pages
% 243.42/41.04
% 243.42/41.04 % -------------------------------------------------
% 243.42/41.04 % User time : 33.259 s
% 243.42/41.04 % System time : 1.306 s
% 243.42/41.04 % Total time : 34.565 s
% 243.42/41.04 % Maximum resident set size: 4608 pages
% 243.42/41.04 % E exiting
%------------------------------------------------------------------------------