%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC117+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 : n004.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:00 PM UTC 2026
% Result : Theorem 13.03s 2.35s
% Output : CNFRefutation 13.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 30
% Syntax : Number of formulae : 178 ( 45 unt; 0 def)
% Number of atoms : 607 ( 155 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 727 ( 298 ~; 289 |; 44 &)
% ( 7 <=>; 89 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 256 ( 1 sgn 132 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ( nil = X1
& nil = X2 )
| ? [X5] :
( equalelemsP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ equalelemsP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax43,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(X1,X2)
=> frontsegP(app(X1,X3),X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax43) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax45) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax50,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( rearsegP(X1,X2)
=> rearsegP(app(X3,X1),X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax50) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax51) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( app(X2,X3) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( app(X3,X2) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).
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(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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
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(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/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax79) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax73,axiom,
! [X1] :
( ssItem(X1)
=> equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax73) ).
fof(c_0_30,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ( nil = X1
& nil = X2 )
| ? [X5] :
( equalelemsP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ equalelemsP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_31,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ( nil = X1
& nil = X2 )
| ? [X5] :
( equalelemsP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ equalelemsP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_30]) ).
fof(c_0_32,negated_conjecture,
! [X255] :
( ( ~ segmentP(esk49_0,esk48_0)
| ~ neq(esk48_0,nil) )
& ( nil != esk48_0
| nil != esk49_0 )
& ( ~ equalelemsP(X255)
| ~ segmentP(X255,esk50_0)
| ~ segmentP(esk51_0,X255)
| ~ neq(esk50_0,X255)
| ~ ssList(X255) )
& equalelemsP(esk50_0)
& segmentP(esk51_0,esk50_0)
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])]) ).
fof(c_0_33,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_34,negated_conjecture,
( ~ segmentP(esk49_0,esk48_0)
| ~ neq(esk48_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_35,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_38,plain,
! [X109,X110] :
( ( ~ ssList(X109)
| ~ ssList(X110)
| neq(X109,X110)
| X109 = X110 )
& ( ~ ssList(X109)
| ~ ssList(X110)
| X109 != X110
| ~ neq(X109,X110) ) ),
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_33])])])])]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
~ neq(esk50_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_35]),c_0_37])]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_39,c_0_35]) ).
fof(c_0_44,plain,
! [X28,X29,X32,X33] :
( ( ~ ssList(X28)
| ~ ssList(X29)
| segmentP(X28,X29)
| app(app(X32,X29),X33) != X28
| ~ ssList(X33)
| ~ ssList(X32) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| app(app(esk8_2(X28,X29),X29),esk9_2(X28,X29)) = X28 )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk9_2(X28,X29)) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk8_2(X28,X29)) ) ),
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_45,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_47,plain,
! [X164,X165,X166] :
( frontsegP(app(X164,X166),X165)
| ~ frontsegP(X164,X165)
| ~ ssList(X166)
| ~ ssList(X165)
| ~ ssList(X164) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax43])])])]) ).
fof(c_0_48,plain,
! [X171] :
( frontsegP(X171,nil)
| ~ ssList(X171) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(esk8_2(X1,X2),X2),esk9_2(X1,X2)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,negated_conjecture,
segmentP(esk51_0,nil),
inference(rw,[status(thm)],[c_0_37,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_46,c_0_36]) ).
fof(c_0_52,plain,
! [X227] :
( app(X227,nil) = X227
| ~ ssList(X227) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ssList(esk8_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_54,plain,
( ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(app(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,negated_conjecture,
app(app(esk8_2(esk51_0,nil),nil),esk9_2(esk51_0,nil)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_42]),c_0_51])]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_58,negated_conjecture,
ssList(esk8_2(esk51_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_50]),c_0_42]),c_0_51])]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ssList(esk9_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
fof(c_0_60,plain,
! [X179,X180,X181] :
( rearsegP(app(X181,X179),X180)
| ~ rearsegP(X179,X180)
| ~ ssList(X181)
| ~ ssList(X180)
| ~ ssList(X179) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])])]) ).
fof(c_0_61,plain,
! [X182] :
( rearsegP(X182,nil)
| ~ ssList(X182) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])])]) ).
fof(c_0_62,plain,
! [X20,X21,X23] :
( ( ~ ssList(X20)
| ~ ssList(X21)
| frontsegP(X20,X21)
| app(X21,X23) != X20
| ~ ssList(X23) )
& ( ~ ssList(X20)
| ~ ssList(X21)
| ~ frontsegP(X20,X21)
| app(X21,esk6_2(X20,X21)) = X20 )
& ( ~ ssList(X20)
| ~ ssList(X21)
| ~ frontsegP(X20,X21)
| ssList(esk6_2(X20,X21)) ) ),
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_63,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_42])]) ).
cnf(c_0_64,negated_conjecture,
app(esk8_2(esk51_0,nil),esk9_2(esk51_0,nil)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_65,negated_conjecture,
ssList(esk9_2(esk51_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_50]),c_0_42]),c_0_51])]) ).
fof(c_0_66,plain,
! [X172] :
( ( ~ ssList(X172)
| frontsegP(nil,X172)
| nil != X172 )
& ( ~ ssList(X172)
| nil = X172
| ~ frontsegP(nil,X172) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])])]) ).
cnf(c_0_67,plain,
( ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| rearsegP(app(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
fof(c_0_69,plain,
! [X135] :
( app(nil,X135) = X135
| ~ ssList(X135) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_70,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk6_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_71,negated_conjecture,
frontsegP(esk51_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_58])]) ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_73,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
fof(c_0_74,plain,
! [X24,X25,X27] :
( ( ~ ssList(X24)
| ~ ssList(X25)
| rearsegP(X24,X25)
| app(X27,X25) != X24
| ~ ssList(X27) )
& ( ~ ssList(X24)
| ~ ssList(X25)
| ~ rearsegP(X24,X25)
| app(esk7_2(X24,X25),X25) = X24 )
& ( ~ ssList(X24)
| ~ ssList(X25)
| ~ rearsegP(X24,X25)
| ssList(esk7_2(X24,X25)) ) ),
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])])])])])]) ).
cnf(c_0_75,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| rearsegP(app(X1,X2),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_42])]) ).
fof(c_0_76,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax85]) ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_78,negated_conjecture,
app(nil,esk6_2(esk51_0,nil)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_51]),c_0_42])]) ).
cnf(c_0_79,negated_conjecture,
ssList(esk6_2(esk51_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_71]),c_0_42]),c_0_51])]) ).
fof(c_0_80,plain,
! [X225,X226] :
( ( ~ ssList(X225)
| ~ ssList(X226)
| nil = app(X225,X226)
| nil != X225
| nil != X226 )
& ( ~ ssList(X225)
| ~ ssList(X226)
| nil != app(X225,X226)
| nil = X225 )
& ( ~ ssList(X225)
| ~ ssList(X226)
| nil != app(X225,X226)
| nil = X226 ) ),
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_81,plain,
frontsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_73]),c_0_42])]) ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(esk7_2(X1,X2),X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_83,negated_conjecture,
rearsegP(esk51_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_64]),c_0_58]),c_0_65])]) ).
cnf(c_0_84,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| ssList(esk7_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
fof(c_0_85,plain,
! [X228,X229] :
( hd(app(X228,X229)) = hd(X228)
| nil = X228
| ~ ssList(X229)
| ~ ssList(X228) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_76])])])]) ).
fof(c_0_86,plain,
! [X222,X223,X224] :
( app(app(X222,X223),X224) = app(X222,app(X223,X224))
| ~ ssList(X224)
| ~ ssList(X223)
| ~ ssList(X222) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_87,plain,
! [X130,X131] :
( ssList(app(X130,X131))
| ~ ssList(X131)
| ~ ssList(X130) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_88,negated_conjecture,
esk6_2(esk51_0,nil) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]) ).
cnf(c_0_89,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_90,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_44]) ).
fof(c_0_91,plain,
! [X132,X133,X134] :
( cons(X134,app(X133,X132)) = app(cons(X134,X133),X132)
| ~ ssItem(X134)
| ~ ssList(X133)
| ~ ssList(X132) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_92,plain,
! [X111,X112] :
( ssList(cons(X112,X111))
| ~ ssItem(X112)
| ~ ssList(X111) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_93,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_94,plain,
app(nil,esk6_2(nil,nil)) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_81]),c_0_42])]) ).
cnf(c_0_95,plain,
ssList(esk6_2(nil,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_81]),c_0_42])]) ).
fof(c_0_96,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_97,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
fof(c_0_98,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[ax86]) ).
cnf(c_0_99,negated_conjecture,
app(esk7_2(esk51_0,nil),nil) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_42]),c_0_51])]) ).
cnf(c_0_100,negated_conjecture,
ssList(esk7_2(esk51_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_83]),c_0_42]),c_0_51])]) ).
fof(c_0_101,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_102,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X1,X2)) = hd(X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_103,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_104,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_105,negated_conjecture,
app(nil,esk51_0) = esk51_0,
inference(rw,[status(thm)],[c_0_78,c_0_88]) ).
cnf(c_0_106,negated_conjecture,
( esk51_0 != nil
| esk50_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_35]),c_0_36]) ).
cnf(c_0_107,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_108,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(esk51_0,X2) != X1
| segmentP(X1,esk9_2(esk51_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_64]),c_0_65]),c_0_58])]) ).
cnf(c_0_109,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_110,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_111,plain,
esk6_2(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_42]),c_0_95])]) ).
fof(c_0_112,plain,
! [X213] :
( cons(hd(X213),tl(X213)) = X213
| nil = X213
| ~ ssList(X213) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_96])])]) ).
fof(c_0_113,plain,
! [X127] :
( ssList(tl(X127))
| nil = X127
| ~ ssList(X127) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_97])])]) ).
fof(c_0_114,plain,
! [X230,X231] :
( tl(app(X230,X231)) = app(tl(X230),X231)
| nil = X230
| ~ ssList(X231)
| ~ ssList(X230) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_98])])])]) ).
cnf(c_0_115,negated_conjecture,
esk7_2(esk51_0,nil) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_99]),c_0_100])]) ).
fof(c_0_116,plain,
! [X124] :
( ssItem(hd(X124))
| nil = X124
| ~ ssList(X124) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_101])])]) ).
cnf(c_0_117,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X1,X2) = nil
| hd(app(X1,app(X2,X3))) = hd(app(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]) ).
cnf(c_0_118,negated_conjecture,
( ~ ssList(X1)
| app(nil,app(esk51_0,X1)) = app(esk51_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_105]),c_0_51]),c_0_42])]) ).
cnf(c_0_119,negated_conjecture,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_45])]) ).
cnf(c_0_120,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_103]),c_0_104]) ).
cnf(c_0_121,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X1,app(X2,X3)) != nil
| app(X1,X2) = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_103]),c_0_104]) ).
cnf(c_0_122,negated_conjecture,
( ~ ssList(X1)
| esk51_0 != X1
| segmentP(X1,esk9_2(esk51_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_57]),c_0_42]),c_0_51])]) ).
cnf(c_0_123,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| rearsegP(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
fof(c_0_124,plain,
! [X220,X221] :
( cons(X221,X220) = app(cons(X221,nil),X220)
| ~ ssItem(X221)
| ~ ssList(X220) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_125,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ssList(cons(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_109]),c_0_110]) ).
cnf(c_0_126,plain,
app(nil,nil) = nil,
inference(rw,[status(thm)],[c_0_94,c_0_111]) ).
cnf(c_0_127,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_112]) ).
cnf(c_0_128,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_129,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X1,X2)) = app(tl(X1),X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_130,negated_conjecture,
app(esk51_0,nil) = esk51_0,
inference(rw,[status(thm)],[c_0_99,c_0_115]) ).
cnf(c_0_131,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
cnf(c_0_132,negated_conjecture,
( ~ ssList(X1)
| hd(app(esk51_0,X1)) = hd(esk51_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_105]),c_0_105]),c_0_51]),c_0_42])]),c_0_119]) ).
cnf(c_0_133,negated_conjecture,
( ~ ssList(X1)
| ssList(app(esk51_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_118]),c_0_51]),c_0_42])]) ).
cnf(c_0_134,negated_conjecture,
( ~ ssList(X1)
| app(esk51_0,X1) != nil ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_118]),c_0_105]),c_0_51]),c_0_42])]),c_0_119]) ).
cnf(c_0_135,negated_conjecture,
segmentP(esk51_0,esk9_2(esk51_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_122]),c_0_51])]) ).
fof(c_0_136,plain,
! [X190,X191,X192,X193] :
( segmentP(app(app(X192,X190),X193),X191)
| ~ segmentP(X190,X191)
| ~ ssList(X193)
| ~ ssList(X192)
| ~ ssList(X191)
| ~ ssList(X190) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_137,plain,
! [X189] :
( segmentP(X189,X189)
| ~ ssList(X189) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_138,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_123]),c_0_104]) ).
cnf(c_0_139,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
cnf(c_0_140,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_42])]) ).
cnf(c_0_141,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil = X1
| cons(hd(X1),tl(app(X1,X2))) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_102]),c_0_104]),c_0_107]) ).
cnf(c_0_142,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ssList(app(tl(X1),X2))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_104]),c_0_107]) ).
cnf(c_0_143,negated_conjecture,
app(tl(esk51_0),nil) = tl(esk51_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_42]),c_0_51])]),c_0_119]) ).
cnf(c_0_144,negated_conjecture,
( ~ ssList(X1)
| ssItem(hd(esk51_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133]),c_0_134]) ).
cnf(c_0_145,negated_conjecture,
ssList(esk9_2(esk51_0,esk9_2(esk51_0,nil))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_135]),c_0_65]),c_0_51])]) ).
fof(c_0_146,plain,
! [X214,X215,X216] :
( X216 = X214
| app(X216,X215) != app(X214,X215)
| ~ ssList(X216)
| ~ ssList(X215)
| ~ ssList(X214) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])])]) ).
fof(c_0_147,plain,
! [X194] :
( segmentP(X194,nil)
| ~ ssList(X194) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_148,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_136]) ).
cnf(c_0_149,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_137]) ).
cnf(c_0_150,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| rearsegP(cons(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140]) ).
cnf(c_0_151,negated_conjecture,
cons(hd(esk51_0),tl(esk51_0)) = esk51_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_130]),c_0_42]),c_0_51])]),c_0_119]) ).
cnf(c_0_152,negated_conjecture,
ssList(tl(esk51_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_42]),c_0_51])]),c_0_119]) ).
cnf(c_0_153,negated_conjecture,
ssItem(hd(esk51_0)),
inference(spm,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_154,plain,
( app(X3,X2) != app(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_155,negated_conjecture,
( ~ equalelemsP(X1)
| ~ segmentP(X1,esk50_0)
| ~ segmentP(esk51_0,X1)
| ~ neq(esk50_0,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_156,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_147]) ).
cnf(c_0_157,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| segmentP(app(app(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_148,c_0_149]) ).
cnf(c_0_158,negated_conjecture,
rearsegP(esk51_0,tl(esk51_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_151]),c_0_152]),c_0_153])]) ).
cnf(c_0_159,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(cons(X2,nil))
| app(X1,X3) != cons(X2,X3)
| X1 = cons(X2,nil) ),
inference(spm,[status(thm)],[c_0_154,c_0_139]) ).
cnf(c_0_160,negated_conjecture,
( ~ neq(nil,X1)
| ~ ssList(X1)
| ~ segmentP(esk51_0,X1)
| ~ equalelemsP(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_45]),c_0_45]),c_0_156]) ).
cnf(c_0_161,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(X1,X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_77]),c_0_42])]) ).
cnf(c_0_162,negated_conjecture,
app(esk7_2(esk51_0,tl(esk51_0)),tl(esk51_0)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_158]),c_0_152]),c_0_51])]) ).
cnf(c_0_163,negated_conjecture,
ssList(esk7_2(esk51_0,tl(esk51_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_158]),c_0_152]),c_0_51])]) ).
cnf(c_0_164,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,X3) != cons(X2,X3)
| X1 = cons(X2,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_110]),c_0_42])]) ).
cnf(c_0_165,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk51_0,X1)
| ~ equalelemsP(X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_41]),c_0_42])]) ).
cnf(c_0_166,negated_conjecture,
segmentP(esk51_0,esk7_2(esk51_0,tl(esk51_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_162]),c_0_152]),c_0_163])]) ).
cnf(c_0_167,negated_conjecture,
( ~ ssList(X1)
| app(X1,tl(esk51_0)) != esk51_0
| X1 = cons(hd(esk51_0),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_151]),c_0_152]),c_0_153])]) ).
fof(c_0_168,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_169,negated_conjecture,
( ~ equalelemsP(esk7_2(esk51_0,tl(esk51_0)))
| esk7_2(esk51_0,tl(esk51_0)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_166]),c_0_163])]) ).
cnf(c_0_170,negated_conjecture,
esk7_2(esk51_0,tl(esk51_0)) = cons(hd(esk51_0),nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_162]),c_0_163])]) ).
fof(c_0_171,plain,
! [X206] :
( equalelemsP(cons(X206,nil))
| ~ ssItem(X206) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])])]) ).
fof(c_0_172,plain,
! [X122,X123] :
( nil != cons(X123,X122)
| ~ ssItem(X123)
| ~ ssList(X122) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_168])])])]) ).
cnf(c_0_173,negated_conjecture,
( ~ equalelemsP(cons(hd(esk51_0),nil))
| cons(hd(esk51_0),nil) = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_169,c_0_170]),c_0_170]) ).
cnf(c_0_174,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_171]) ).
cnf(c_0_175,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_172]) ).
cnf(c_0_176,negated_conjecture,
cons(hd(esk51_0),nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_173,c_0_174]),c_0_153])]) ).
cnf(c_0_177,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_175,c_0_176]),c_0_42]),c_0_153])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC117+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n004.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 07:56:34 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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
% 13.03/2.35 % Version: 3.5.1
% 13.03/2.35 % Preprocessing class: FSLSSMSSSSSNFFN.
% 13.03/2.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.03/2.35 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 13.03/2.35 % Starting new_bool_3 with 300s (1) cores
% 13.03/2.35 % Starting new_bool_1 with 300s (1) cores
% 13.03/2.35 % Starting sh5l with 300s (1) cores
% 13.03/2.35 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2650911 completed with status 0
% 13.03/2.35 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 13.03/2.35 % Preprocessing class: FSLSSMSSSSSNFFN.
% 13.03/2.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.03/2.35 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 13.03/2.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.03/2.35 % No SInE strategy applied
% 13.03/2.35 % Search class: FGHSF-FSLM21-MFFFFFNN
% 13.03/2.35 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 13.03/2.35 % Starting SubtermCWHack with 136s (1) cores
% 13.03/2.35 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 13.03/2.35 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 13.03/2.35 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 13.03/2.35 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 13.03/2.35 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 2650919 completed with status 0
% 13.03/2.35 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 13.03/2.35 % Preprocessing class: FSLSSMSSSSSNFFN.
% 13.03/2.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.03/2.35 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 13.03/2.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.03/2.35 % No SInE strategy applied
% 13.03/2.35 % Search class: FGHSF-FSLM21-MFFFFFNN
% 13.03/2.35 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 13.03/2.35 % Starting SubtermCWHack with 136s (1) cores
% 13.03/2.35 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 13.03/2.35 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 13.03/2.35 % Preprocessing time : 0.004 s
% 13.03/2.35
% 13.03/2.35 % Proof found!
% 13.03/2.35 % SZS status Theorem
% 13.03/2.35 % SZS output start CNFRefutation
% See solution above
% 13.03/2.35 % Parsed axioms : 96
% 13.03/2.35 % Removed by relevancy pruning/SinE : 0
% 13.03/2.35 % Initial clauses : 201
% 13.03/2.35 % Removed in clause preprocessing : 2
% 13.03/2.35 % Initial clauses in saturation : 199
% 13.03/2.35 % Processed clauses : 7435
% 13.03/2.35 % ...of these trivial : 81
% 13.03/2.35 % ...subsumed : 5117
% 13.03/2.35 % ...remaining for further processing : 2237
% 13.03/2.35 % Other redundant clauses eliminated : 615
% 13.03/2.35 % Clauses deleted for lack of memory : 0
% 13.03/2.35 % Backward-subsumed : 155
% 13.03/2.35 % Backward-rewritten : 430
% 13.03/2.35 % Generated clauses : 33003
% 13.03/2.35 % ...of the previous two non-redundant : 28837
% 13.03/2.35 % ...aggressively subsumed : 0
% 13.03/2.35 % Contextual simplify-reflections : 812
% 13.03/2.35 % Paramodulations : 32151
% 13.03/2.35 % Factorizations : 0
% 13.03/2.35 % NegExts : 0
% 13.03/2.35 % Equation resolutions : 852
% 13.03/2.35 % Disequality decompositions : 0
% 13.03/2.35 % Total rewrite steps : 27507
% 13.03/2.35 % ...of those cached : 27239
% 13.03/2.35 % Propositional unsat checks : 0
% 13.03/2.35 % Propositional check models : 0
% 13.03/2.35 % Propositional check unsatisfiable : 0
% 13.03/2.35 % Propositional clauses : 0
% 13.03/2.35 % Propositional clauses after purity: 0
% 13.03/2.35 % Propositional unsat core size : 0
% 13.03/2.35 % Propositional preprocessing time : 0.000
% 13.03/2.35 % Propositional encoding time : 0.000
% 13.03/2.35 % Propositional solver time : 0.000
% 13.03/2.35 % Success case prop preproc time : 0.000
% 13.03/2.35 % Success case prop encoding time : 0.000
% 13.03/2.35 % Success case prop solver time : 0.000
% 13.03/2.35 % Current number of processed clauses : 1646
% 13.03/2.35 % Positive orientable unit clauses : 251
% 13.03/2.35 % Positive unorientable unit clauses: 0
% 13.03/2.35 % Negative unit clauses : 20
% 13.03/2.35 % Non-unit-clauses : 1375
% 13.03/2.35 % Current number of unprocessed clauses: 20581
% 13.03/2.35 % ...number of literals in the above : 145526
% 13.03/2.35 % Current number of archived formulas : 0
% 13.03/2.35 % Current number of archived clauses : 585
% 13.03/2.35 % Clause-clause subsumption calls (NU) : 655657
% 13.03/2.35 % Rec. Clause-clause subsumption calls : 189810
% 13.03/2.35 % Non-unit clause-clause subsumptions : 4979
% 13.03/2.35 % Unit Clause-clause subsumption calls : 15712
% 13.03/2.35 % Rewrite failures with RHS unbound : 0
% 13.03/2.35 % BW rewrite match attempts : 313
% 13.03/2.35 % BW rewrite match successes : 157
% 13.03/2.35 % Condensation attempts : 0
% 13.03/2.35 % Condensation successes : 0
% 13.03/2.35 % Termbank termtop insertions : 710459
% 13.03/2.35 % Search garbage collected termcells : 4296
% 13.03/2.35
% 13.03/2.35 % -------------------------------------------------
% 13.03/2.35 % User time : 1.619 s
% 13.03/2.35 % System time : 0.048 s
% 13.03/2.35 % Total time : 1.667 s
% 13.03/2.35 % Maximum resident set size: 4272 pages
% 13.03/2.35
% 13.03/2.35 % -------------------------------------------------
% 13.03/2.35 % User time : 8.881 s
% 13.03/2.35 % System time : 0.241 s
% 13.03/2.35 % Total time : 9.122 s
% 13.03/2.35 % Maximum resident set size: 4864 pages
% 13.03/2.35 % E exiting
%------------------------------------------------------------------------------