TSTP Solution File: SWC214+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWC214+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 16:20:14 EDT 2024
% Result : Theorem 1.42s 0.68s
% Output : CNFRefutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 30
% Syntax : Number of formulae : 176 ( 41 unt; 0 def)
% Number of atoms : 604 ( 154 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 727 ( 299 ~; 298 |; 43 &)
% ( 8 <=>; 79 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 230 ( 0 sgn 124 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| neq(X1,nil) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax17) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax5) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax28) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax84) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax6) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax26) ).
fof(ax50,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( rearsegP(X1,X2)
=> rearsegP(app(X3,X1),X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax50) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax51) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax78) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax85) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax21) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax83) ).
fof(ax19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssItem(X4)
=> ( cons(X3,X1) = cons(X4,X2)
=> ( X3 = X4
& X2 = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax19) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax20) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax16) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax24) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax22) ).
fof(ax44,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( frontsegP(cons(X1,X3),cons(X2,X4))
<=> ( X1 = X2
& frontsegP(X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax44) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax45) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax57) ).
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/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax82) ).
fof(ax52,axiom,
! [X1] :
( ssList(X1)
=> ( rearsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax52) ).
fof(ax68,axiom,
! [X1] :
( ssItem(X1)
=> strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax68) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax18) ).
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/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax27) ).
fof(ax49,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax49) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p',ax55) ).
fof(c_0_30,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| neq(X1,nil) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_31,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& frontsegP(esk4_0,esk3_0)
& strictorderedP(esk3_0)
& ( ~ ssList(X11)
| ~ neq(esk3_0,X11)
| ~ frontsegP(esk4_0,X11)
| ~ segmentP(X11,esk3_0)
| ~ strictorderedP(X11) )
& ~ neq(esk1_0,nil) ),
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_30])])])])]) ).
fof(c_0_32,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_33,negated_conjecture,
~ neq(esk1_0,nil),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_34,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_35,plain,
! [X14,X15] :
( ( ~ neq(X14,X15)
| X14 != X15
| ~ ssList(X15)
| ~ ssList(X14) )
& ( X14 = X15
| neq(X14,X15)
| ~ ssList(X15)
| ~ ssList(X14) ) ),
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_32])])])])]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
~ neq(esk3_0,nil),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_40,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_36,c_0_34]) ).
fof(c_0_41,plain,
! [X61,X62,X64] :
( ( ssList(esk14_2(X61,X62))
| ~ frontsegP(X61,X62)
| ~ ssList(X62)
| ~ ssList(X61) )
& ( app(X62,esk14_2(X61,X62)) = X61
| ~ frontsegP(X61,X62)
| ~ ssList(X62)
| ~ ssList(X61) )
& ( ~ ssList(X64)
| app(X62,X64) != X61
| frontsegP(X61,X62)
| ~ ssList(X62)
| ~ ssList(X61) ) ),
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_42,negated_conjecture,
frontsegP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_45,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_46,plain,
! [X21] :
( ~ ssList(X21)
| app(nil,X21) = X21 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_47,plain,
( app(X1,esk14_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
frontsegP(esk4_0,nil),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
( ssList(esk14_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_51,plain,
! [X43,X44,X47,X48] :
( ( ssList(esk12_2(X43,X44))
| ~ segmentP(X43,X44)
| ~ ssList(X44)
| ~ ssList(X43) )
& ( ssList(esk13_2(X43,X44))
| ~ segmentP(X43,X44)
| ~ ssList(X44)
| ~ ssList(X43) )
& ( app(app(esk12_2(X43,X44),X44),esk13_2(X43,X44)) = X43
| ~ segmentP(X43,X44)
| ~ ssList(X44)
| ~ ssList(X43) )
& ( ~ ssList(X47)
| ~ ssList(X48)
| app(app(X47,X44),X48) != X43
| segmentP(X43,X44)
| ~ ssList(X44)
| ~ ssList(X43) ) ),
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(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
app(nil,esk14_2(esk4_0,nil)) = esk4_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_49]),c_0_39])]) ).
cnf(c_0_54,negated_conjecture,
ssList(esk14_2(esk4_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_48]),c_0_39]),c_0_49])]) ).
cnf(c_0_55,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_56,negated_conjecture,
esk14_2(esk4_0,nil) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_57,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_58,negated_conjecture,
app(nil,esk4_0) = esk4_0,
inference(rw,[status(thm)],[c_0_53,c_0_56]) ).
fof(c_0_59,plain,
! [X28] :
( ~ ssList(X28)
| app(X28,nil) = X28 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_60,plain,
! [X113,X114,X116] :
( ( ssList(esk17_2(X113,X114))
| ~ rearsegP(X113,X114)
| ~ ssList(X114)
| ~ ssList(X113) )
& ( app(esk17_2(X113,X114),X114) = X113
| ~ rearsegP(X113,X114)
| ~ ssList(X114)
| ~ ssList(X113) )
& ( ~ ssList(X116)
| app(X116,X114) != X113
| rearsegP(X113,X114)
| ~ ssList(X114)
| ~ ssList(X113) ) ),
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_61,plain,
! [X86,X87] :
( ~ ssList(X86)
| ~ ssList(X87)
| ssList(app(X86,X87)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_62,negated_conjecture,
( segmentP(app(esk4_0,X1),esk4_0)
| ~ ssList(app(esk4_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_49]),c_0_39])]) ).
cnf(c_0_63,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_64,plain,
( rearsegP(X3,X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_65,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_66,plain,
( app(app(esk12_2(X1,X2),X2),esk13_2(X1,X2)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_67,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_62,c_0_63]),c_0_49]),c_0_39])]) ).
cnf(c_0_68,plain,
( ssList(esk13_2(X1,X2))
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_69,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_64]),c_0_65]) ).
cnf(c_0_70,negated_conjecture,
app(app(esk12_2(esk4_0,esk4_0),esk4_0),esk13_2(esk4_0,esk4_0)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_49])]) ).
cnf(c_0_71,negated_conjecture,
ssList(esk13_2(esk4_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_67]),c_0_49])]) ).
cnf(c_0_72,plain,
( ssList(esk12_2(X1,X2))
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_73,plain,
! [X117,X118,X119] :
( ~ ssList(X117)
| ~ ssList(X118)
| ~ ssList(X119)
| ~ rearsegP(X117,X118)
| rearsegP(app(X119,X117),X118) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])])]) ).
fof(c_0_74,plain,
! [X201] :
( ~ ssList(X201)
| rearsegP(X201,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])])]) ).
cnf(c_0_75,negated_conjecture,
( rearsegP(esk4_0,esk13_2(esk4_0,esk4_0))
| ~ ssList(app(esk12_2(esk4_0,esk4_0),esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71])]) ).
cnf(c_0_76,negated_conjecture,
ssList(esk12_2(esk4_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_67]),c_0_49])]) ).
cnf(c_0_77,plain,
( rearsegP(app(X3,X1),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_78,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_79,plain,
( app(esk17_2(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_80,negated_conjecture,
rearsegP(esk4_0,esk13_2(esk4_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_65]),c_0_49]),c_0_76])]) ).
cnf(c_0_81,plain,
( ssList(esk17_2(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_82,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_39])]) ).
cnf(c_0_83,negated_conjecture,
app(esk17_2(esk4_0,esk13_2(esk4_0,esk4_0)),esk13_2(esk4_0,esk4_0)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_71]),c_0_49])]) ).
cnf(c_0_84,negated_conjecture,
ssList(esk17_2(esk4_0,esk13_2(esk4_0,esk4_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_80]),c_0_71]),c_0_49])]) ).
fof(c_0_85,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_86,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax85]) ).
cnf(c_0_87,negated_conjecture,
rearsegP(esk4_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_71])]) ).
fof(c_0_88,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
fof(c_0_89,plain,
! [X112] :
( ~ ssList(X112)
| nil = X112
| cons(hd(X112),tl(X112)) = X112 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_85])])]) ).
fof(c_0_90,plain,
! [X120,X121] :
( ~ ssList(X120)
| ~ ssList(X121)
| nil = X120
| hd(app(X120,X121)) = hd(X120) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_86])])])]) ).
fof(c_0_91,plain,
! [X26,X27] :
( ( nil = X27
| nil != app(X26,X27)
| ~ ssList(X27)
| ~ ssList(X26) )
& ( nil = X26
| nil != app(X26,X27)
| ~ ssList(X27)
| ~ ssList(X26) )
& ( nil != X27
| nil != X26
| nil = app(X26,X27)
| ~ ssList(X27)
| ~ ssList(X26) ) ),
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_92,negated_conjecture,
app(esk17_2(esk4_0,nil),nil) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_87]),c_0_39]),c_0_49])]) ).
cnf(c_0_93,negated_conjecture,
ssList(esk17_2(esk4_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_87]),c_0_39]),c_0_49])]) ).
fof(c_0_94,plain,
! [X82,X83,X84,X85] :
( ( X84 = X85
| cons(X84,X82) != cons(X85,X83)
| ~ ssItem(X85)
| ~ ssItem(X84)
| ~ ssList(X83)
| ~ ssList(X82) )
& ( X83 = X82
| cons(X84,X82) != cons(X85,X83)
| ~ ssItem(X85)
| ~ ssItem(X84)
| ~ ssList(X83)
| ~ ssList(X82) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax19])])])])]) ).
fof(c_0_95,plain,
! [X16] :
( ( ssList(esk5_1(X16))
| nil = X16
| ~ ssList(X16) )
& ( ssItem(esk6_1(X16))
| nil = X16
| ~ ssList(X16) )
& ( cons(esk6_1(X16),esk5_1(X16)) = X16
| nil = X16
| ~ ssList(X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
fof(c_0_96,plain,
! [X78,X79] :
( ~ ssList(X78)
| ~ ssItem(X79)
| ssList(cons(X79,X78)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_97,plain,
! [X19,X20] :
( ~ ssList(X19)
| ~ ssItem(X20)
| nil != cons(X20,X19) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_88])])])]) ).
cnf(c_0_98,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_99,plain,
( nil = X1
| hd(app(X1,X2)) = hd(X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_100,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_101,negated_conjecture,
esk17_2(esk4_0,nil) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_92]),c_0_93])]) ).
cnf(c_0_102,plain,
( X1 = X2
| cons(X3,X2) != cons(X4,X1)
| ~ ssItem(X4)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_103,plain,
( cons(esk6_1(X1),esk5_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_104,plain,
( ssItem(esk6_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_105,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_106,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_107,plain,
( cons(hd(X1),tl(app(X1,X2))) = app(X1,X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_65]),c_0_100]) ).
cnf(c_0_108,negated_conjecture,
app(esk4_0,nil) = esk4_0,
inference(rw,[status(thm)],[c_0_92,c_0_101]) ).
cnf(c_0_109,plain,
( esk5_1(cons(X1,X2)) = X2
| ~ ssList(esk5_1(cons(X1,X2)))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103])]),c_0_104]),c_0_105]),c_0_106]) ).
cnf(c_0_110,negated_conjecture,
( cons(hd(esk4_0),tl(esk4_0)) = esk4_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_39]),c_0_49])]) ).
fof(c_0_111,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_112,negated_conjecture,
( esk5_1(esk4_0) = tl(esk4_0)
| esk4_0 = nil
| ~ ssList(esk5_1(esk4_0))
| ~ ssList(tl(esk4_0))
| ~ ssItem(hd(esk4_0)) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_113,plain,
( ssList(esk5_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
fof(c_0_114,plain,
! [X192] :
( ~ ssList(X192)
| nil = X192
| ssList(tl(X192)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_111])])]) ).
fof(c_0_115,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
fof(c_0_116,plain,
! [X74,X75,X76,X77] :
( ( X74 = X75
| ~ frontsegP(cons(X74,X76),cons(X75,X77))
| ~ ssList(X77)
| ~ ssList(X76)
| ~ ssItem(X75)
| ~ ssItem(X74) )
& ( frontsegP(X76,X77)
| ~ frontsegP(cons(X74,X76),cons(X75,X77))
| ~ ssList(X77)
| ~ ssList(X76)
| ~ ssItem(X75)
| ~ ssItem(X74) )
& ( X74 != X75
| ~ frontsegP(X76,X77)
| frontsegP(cons(X74,X76),cons(X75,X77))
| ~ ssList(X77)
| ~ ssList(X76)
| ~ ssItem(X75)
| ~ ssItem(X74) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])])])]) ).
cnf(c_0_117,negated_conjecture,
( esk5_1(esk4_0) = tl(esk4_0)
| esk4_0 = nil
| ~ ssList(tl(esk4_0))
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_49])]) ).
cnf(c_0_118,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_114]) ).
fof(c_0_119,plain,
! [X150] :
( ~ ssList(X150)
| nil = X150
| ssItem(hd(X150)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_115])])]) ).
cnf(c_0_120,plain,
( frontsegP(cons(X1,X3),cons(X2,X4))
| X1 != X2
| ~ frontsegP(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_116]) ).
fof(c_0_121,plain,
! [X22] :
( ~ ssList(X22)
| frontsegP(X22,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])])]) ).
cnf(c_0_122,negated_conjecture,
( esk5_1(esk4_0) = tl(esk4_0)
| esk4_0 = nil
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_49])]) ).
cnf(c_0_123,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_119]) ).
cnf(c_0_124,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_120]) ).
cnf(c_0_125,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
cnf(c_0_126,negated_conjecture,
( esk5_1(esk4_0) = tl(esk4_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_49])]) ).
fof(c_0_127,plain,
! [X59] :
( ~ ssList(X59)
| segmentP(X59,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_128,plain,
( frontsegP(cons(X1,X2),cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_39])]) ).
cnf(c_0_129,negated_conjecture,
( cons(esk6_1(esk4_0),tl(esk4_0)) = esk4_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_126]),c_0_49])]) ).
cnf(c_0_130,negated_conjecture,
( esk4_0 = nil
| ssList(tl(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_126]),c_0_49])]) ).
cnf(c_0_131,negated_conjecture,
( ~ ssList(X1)
| ~ neq(esk3_0,X1)
| ~ frontsegP(esk4_0,X1)
| ~ segmentP(X1,esk3_0)
| ~ strictorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_132,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_133,negated_conjecture,
( esk4_0 = nil
| frontsegP(esk4_0,cons(esk6_1(esk4_0),nil))
| ~ ssItem(esk6_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_130]) ).
fof(c_0_134,plain,
! [X97,X98,X99] :
( ~ ssList(X97)
| ~ ssList(X98)
| ~ ssList(X99)
| app(app(X97,X98),X99) = app(X97,app(X98,X99)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_135,plain,
! [X202] :
( ( ~ rearsegP(nil,X202)
| nil = X202
| ~ ssList(X202) )
& ( nil != X202
| rearsegP(nil,X202)
| ~ ssList(X202) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax52])])])]) ).
cnf(c_0_136,negated_conjecture,
( ~ strictorderedP(X1)
| ~ frontsegP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(nil,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_43]),c_0_43]),c_0_132]) ).
cnf(c_0_137,negated_conjecture,
( esk4_0 = nil
| frontsegP(esk4_0,cons(esk6_1(esk4_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_104]),c_0_49])]) ).
fof(c_0_138,plain,
! [X40] :
( ~ ssItem(X40)
| strictorderedP(cons(X40,nil)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])])]) ).
fof(c_0_139,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
fof(c_0_140,plain,
! [X88,X89,X90] :
( ~ ssList(X88)
| ~ ssList(X89)
| ~ ssItem(X90)
| cons(X90,app(X89,X88)) = app(cons(X90,X89),X88) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_141,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_142,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_143,plain,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_135]) ).
cnf(c_0_144,negated_conjecture,
( esk4_0 = nil
| ~ strictorderedP(cons(esk6_1(esk4_0),nil))
| ~ ssList(cons(esk6_1(esk4_0),nil))
| ~ neq(nil,cons(esk6_1(esk4_0),nil)) ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_145,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_138]) ).
fof(c_0_146,plain,
! [X80,X81] :
( ~ ssList(X80)
| ~ ssItem(X81)
| cons(X81,X80) != X80 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_139])])])]) ).
cnf(c_0_147,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_140]) ).
cnf(c_0_148,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_141]),c_0_65]) ).
cnf(c_0_149,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_142])]),c_0_39])]) ).
fof(c_0_150,plain,
! [X200] :
( ~ ssList(X200)
| rearsegP(X200,X200) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])])]) ).
cnf(c_0_151,plain,
rearsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_143]),c_0_39])]) ).
cnf(c_0_152,negated_conjecture,
( esk4_0 = nil
| ~ neq(nil,cons(esk6_1(esk4_0),nil))
| ~ ssItem(esk6_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_105]),c_0_39])]),c_0_145]) ).
cnf(c_0_153,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_146]) ).
cnf(c_0_154,plain,
( cons(X1,app(X2,nil)) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_147]),c_0_39])]),c_0_105]) ).
cnf(c_0_155,plain,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_39])]) ).
cnf(c_0_156,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_150]) ).
cnf(c_0_157,plain,
app(esk17_2(nil,nil),nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_151]),c_0_39])]) ).
cnf(c_0_158,plain,
ssList(esk17_2(nil,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_151]),c_0_39])]) ).
cnf(c_0_159,negated_conjecture,
( esk4_0 = nil
| ~ neq(nil,cons(esk6_1(esk4_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_104]),c_0_49])]) ).
cnf(c_0_160,plain,
( cons(X1,X2) != app(X2,nil)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_155]) ).
cnf(c_0_161,plain,
( app(esk17_2(X1,X1),X1) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_156]) ).
cnf(c_0_162,plain,
esk17_2(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_157]),c_0_39]),c_0_158])]) ).
cnf(c_0_163,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_164,plain,
! [X54] :
( ~ ssList(X54)
| segmentP(X54,X54) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_165,negated_conjecture,
( cons(esk6_1(esk4_0),nil) = nil
| esk4_0 = nil
| ~ ssList(cons(esk6_1(esk4_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_38]),c_0_39])]) ).
cnf(c_0_166,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
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_160,c_0_161]),c_0_162]),c_0_162]),c_0_39]),c_0_39])]) ).
cnf(c_0_167,negated_conjecture,
( ~ segmentP(esk3_0,esk3_0)
| ~ neq(esk3_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_42]),c_0_163]),c_0_40])]) ).
cnf(c_0_168,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_164]) ).
cnf(c_0_169,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_170,negated_conjecture,
( esk4_0 = nil
| ~ ssItem(esk6_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_105]),c_0_39])]),c_0_166]) ).
cnf(c_0_171,negated_conjecture,
~ neq(esk3_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_40])]) ).
cnf(c_0_172,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_169,c_0_45]) ).
cnf(c_0_173,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_104]),c_0_49])]) ).
cnf(c_0_174,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_171,c_0_43]),c_0_43]) ).
cnf(c_0_175,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_172,c_0_173]),c_0_174]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC214+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.12 % Command : run_E %s %d SAT
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 04:56:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.qlWqniGfCW/E---3.1_4648.p
% 1.42/0.68 # Version: 3.2.0
% 1.42/0.68 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.42/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.42/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.42/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.42/0.68 # Starting sh5l with 300s (1) cores
% 1.42/0.68 # sh5l with pid 4814 completed with status 0
% 1.42/0.68 # Result found by sh5l
% 1.42/0.68 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.42/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.42/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.42/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.42/0.68 # Starting sh5l with 300s (1) cores
% 1.42/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.42/0.68 # Search class: FGHSF-FSLM21-MFFFFFNN
% 1.42/0.68 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.42/0.68 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 1.42/0.68 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 4823 completed with status 0
% 1.42/0.68 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 1.42/0.68 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.42/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.42/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.42/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.42/0.68 # Starting sh5l with 300s (1) cores
% 1.42/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.42/0.68 # Search class: FGHSF-FSLM21-MFFFFFNN
% 1.42/0.68 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.42/0.68 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 1.42/0.68 # Preprocessing time : 0.002 s
% 1.42/0.68 # Presaturation interreduction done
% 1.42/0.68
% 1.42/0.68 # Proof found!
% 1.42/0.68 # SZS status Theorem
% 1.42/0.68 # SZS output start CNFRefutation
% See solution above
% 1.42/0.68 # Parsed axioms : 96
% 1.42/0.68 # Removed by relevancy pruning/SinE : 12
% 1.42/0.68 # Initial clauses : 167
% 1.42/0.68 # Removed in clause preprocessing : 2
% 1.42/0.68 # Initial clauses in saturation : 165
% 1.42/0.68 # Processed clauses : 2053
% 1.42/0.68 # ...of these trivial : 17
% 1.42/0.68 # ...subsumed : 1053
% 1.42/0.68 # ...remaining for further processing : 983
% 1.42/0.68 # Other redundant clauses eliminated : 103
% 1.42/0.68 # Clauses deleted for lack of memory : 0
% 1.42/0.68 # Backward-subsumed : 74
% 1.42/0.68 # Backward-rewritten : 274
% 1.42/0.68 # Generated clauses : 8671
% 1.42/0.68 # ...of the previous two non-redundant : 7351
% 1.42/0.68 # ...aggressively subsumed : 0
% 1.42/0.68 # Contextual simplify-reflections : 265
% 1.42/0.68 # Paramodulations : 8560
% 1.42/0.68 # Factorizations : 0
% 1.42/0.68 # NegExts : 0
% 1.42/0.68 # Equation resolutions : 112
% 1.42/0.68 # Disequality decompositions : 0
% 1.42/0.68 # Total rewrite steps : 8315
% 1.42/0.68 # ...of those cached : 8223
% 1.42/0.68 # Propositional unsat checks : 0
% 1.42/0.68 # Propositional check models : 0
% 1.42/0.68 # Propositional check unsatisfiable : 0
% 1.42/0.68 # Propositional clauses : 0
% 1.42/0.68 # Propositional clauses after purity: 0
% 1.42/0.68 # Propositional unsat core size : 0
% 1.42/0.68 # Propositional preprocessing time : 0.000
% 1.42/0.68 # Propositional encoding time : 0.000
% 1.42/0.68 # Propositional solver time : 0.000
% 1.42/0.68 # Success case prop preproc time : 0.000
% 1.42/0.68 # Success case prop encoding time : 0.000
% 1.42/0.68 # Success case prop solver time : 0.000
% 1.42/0.68 # Current number of processed clauses : 458
% 1.42/0.68 # Positive orientable unit clauses : 53
% 1.42/0.68 # Positive unorientable unit clauses: 0
% 1.42/0.68 # Negative unit clauses : 2
% 1.42/0.68 # Non-unit-clauses : 403
% 1.42/0.68 # Current number of unprocessed clauses: 5448
% 1.42/0.68 # ...number of literals in the above : 32722
% 1.42/0.68 # Current number of archived formulas : 0
% 1.42/0.68 # Current number of archived clauses : 507
% 1.42/0.68 # Clause-clause subsumption calls (NU) : 121803
% 1.42/0.68 # Rec. Clause-clause subsumption calls : 40205
% 1.42/0.68 # Non-unit clause-clause subsumptions : 1376
% 1.42/0.68 # Unit Clause-clause subsumption calls : 2678
% 1.42/0.68 # Rewrite failures with RHS unbound : 0
% 1.42/0.68 # BW rewrite match attempts : 44
% 1.42/0.68 # BW rewrite match successes : 33
% 1.42/0.68 # Condensation attempts : 0
% 1.42/0.68 # Condensation successes : 0
% 1.42/0.68 # Termbank termtop insertions : 178666
% 1.42/0.68 # Search garbage collected termcells : 3667
% 1.42/0.68
% 1.42/0.68 # -------------------------------------------------
% 1.42/0.68 # User time : 0.167 s
% 1.42/0.68 # System time : 0.014 s
% 1.42/0.68 # Total time : 0.181 s
% 1.42/0.68 # Maximum resident set size: 2464 pages
% 1.42/0.68
% 1.42/0.68 # -------------------------------------------------
% 1.42/0.68 # User time : 0.168 s
% 1.42/0.68 # System time : 0.017 s
% 1.42/0.68 # Total time : 0.185 s
% 1.42/0.68 # Maximum resident set size: 1804 pages
% 1.42/0.68 % E---3.1 exiting
% 1.42/0.68 % E exiting
%------------------------------------------------------------------------------