TSTP Solution File: SWC403+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC403+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:40:51 EDT 2023
% Result : Theorem 5.10s 1.13s
% Output : CNFRefutation 5.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of formulae : 85 ( 29 unt; 0 def)
% Number of atoms : 330 ( 36 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 410 ( 165 ~; 164 |; 37 &)
% ( 5 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 132 ( 0 sgn; 71 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X1,X6)
| memberP(X2,X6) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.y3z2iGzK7G/E---3.1_8065.p',co1) ).
fof(ax43,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(X1,X2)
=> frontsegP(app(X1,X3),X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.y3z2iGzK7G/E---3.1_8065.p',ax43) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.y3z2iGzK7G/E---3.1_8065.p',ax45) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.y3z2iGzK7G/E---3.1_8065.p',ax3) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.y3z2iGzK7G/E---3.1_8065.p',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.y3z2iGzK7G/E---3.1_8065.p',ax16) ).
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.y3z2iGzK7G/E---3.1_8065.p',ax50) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.y3z2iGzK7G/E---3.1_8065.p',ax51) ).
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.y3z2iGzK7G/E---3.1_8065.p',ax5) ).
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.y3z2iGzK7G/E---3.1_8065.p',ax6) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.y3z2iGzK7G/E---3.1_8065.p',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.y3z2iGzK7G/E---3.1_8065.p',ax26) ).
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.y3z2iGzK7G/E---3.1_8065.p',ax82) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.y3z2iGzK7G/E---3.1_8065.p',ax36) ).
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.y3z2iGzK7G/E---3.1_8065.p',ax7) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X1,X6)
| memberP(X2,X6) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_16,negated_conjecture,
! [X255] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& segmentP(esk51_0,esk50_0)
& strictorderedP(esk50_0)
& ( ~ ssList(X255)
| ~ neq(esk50_0,X255)
| ~ segmentP(esk51_0,X255)
| ~ segmentP(X255,esk50_0)
| ~ strictorderedP(X255) )
& ssItem(esk52_0)
& memberP(esk48_0,esk52_0)
& ~ memberP(esk49_0,esk52_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_17,plain,
! [X164,X165,X166] :
( ~ ssList(X164)
| ~ ssList(X165)
| ~ ssList(X166)
| ~ frontsegP(X164,X165)
| frontsegP(app(X164,X166),X165) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax43])])]) ).
fof(c_0_18,plain,
! [X171] :
( ~ ssList(X171)
| frontsegP(X171,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
fof(c_0_19,plain,
! [X11,X12,X15,X16] :
( ( ssList(esk3_2(X11,X12))
| ~ memberP(X11,X12)
| ~ ssItem(X12)
| ~ ssList(X11) )
& ( ssList(esk4_2(X11,X12))
| ~ memberP(X11,X12)
| ~ ssItem(X12)
| ~ ssList(X11) )
& ( app(esk3_2(X11,X12),cons(X12,esk4_2(X11,X12))) = X11
| ~ memberP(X11,X12)
| ~ ssItem(X12)
| ~ ssList(X11) )
& ( ~ ssList(X15)
| ~ ssList(X16)
| app(X15,cons(X12,X16)) != X11
| memberP(X11,X12)
| ~ ssItem(X12)
| ~ ssList(X11) ) ),
inference(distribute,[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_20,negated_conjecture,
memberP(esk48_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( frontsegP(app(X1,X3),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,plain,
( app(esk3_2(X1,X2),cons(X2,esk4_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
memberP(esk50_0,esk52_0),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,plain,
( ssList(esk3_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,plain,
( frontsegP(app(X1,X2),nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_32,negated_conjecture,
app(esk3_2(esk50_0,esk52_0),cons(esk52_0,esk4_2(esk50_0,esk52_0))) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk3_2(esk50_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_27]),c_0_28]),c_0_29])]) ).
fof(c_0_34,plain,
! [X111,X112] :
( ~ ssList(X111)
| ~ ssItem(X112)
| ssList(cons(X112,X111)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_35,plain,
( ssList(esk4_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_36,plain,
! [X179,X180,X181] :
( ~ ssList(X179)
| ~ ssList(X180)
| ~ ssList(X181)
| ~ rearsegP(X179,X180)
| rearsegP(app(X181,X179),X180) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])]) ).
fof(c_0_37,plain,
! [X182] :
( ~ ssList(X182)
| rearsegP(X182,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])]) ).
fof(c_0_38,plain,
! [X20,X21,X23] :
( ( ssList(esk6_2(X20,X21))
| ~ frontsegP(X20,X21)
| ~ ssList(X21)
| ~ ssList(X20) )
& ( app(X21,esk6_2(X20,X21)) = X20
| ~ frontsegP(X20,X21)
| ~ ssList(X21)
| ~ ssList(X20) )
& ( ~ ssList(X23)
| app(X21,X23) != X20
| frontsegP(X20,X21)
| ~ ssList(X21)
| ~ ssList(X20) ) ),
inference(distribute,[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_39,negated_conjecture,
( frontsegP(esk50_0,nil)
| ~ ssList(cons(esk52_0,esk4_2(esk50_0,esk52_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_40,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk4_2(esk50_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_42,plain,
( rearsegP(app(X3,X1),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
( app(X1,esk6_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
frontsegP(esk50_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_29])]) ).
cnf(c_0_46,plain,
( ssList(esk6_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_47,plain,
! [X24,X25,X27] :
( ( ssList(esk7_2(X24,X25))
| ~ rearsegP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) )
& ( app(esk7_2(X24,X25),X25) = X24
| ~ rearsegP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) )
& ( ~ ssList(X27)
| app(X27,X25) != X24
| rearsegP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) ) ),
inference(distribute,[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_48,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_25])]) ).
cnf(c_0_49,negated_conjecture,
app(nil,esk6_2(esk50_0,nil)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_28]),c_0_25])]) ).
cnf(c_0_50,negated_conjecture,
ssList(esk6_2(esk50_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_45]),c_0_25]),c_0_28])]) ).
fof(c_0_51,plain,
! [X227] :
( ~ ssList(X227)
| app(X227,nil) = X227 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_52,plain,
( app(esk7_2(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,negated_conjecture,
rearsegP(esk50_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_25]),c_0_50])]) ).
cnf(c_0_54,plain,
( ssList(esk7_2(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
fof(c_0_55,plain,
! [X130,X131] :
( ~ ssList(X130)
| ~ ssList(X131)
| ssList(app(X130,X131)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_56,plain,
! [X222,X223,X224] :
( ~ ssList(X222)
| ~ ssList(X223)
| ~ ssList(X224)
| app(app(X222,X223),X224) = app(X222,app(X223,X224)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_57,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_58,negated_conjecture,
app(esk7_2(esk50_0,nil),nil) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_25]),c_0_28])]) ).
cnf(c_0_59,negated_conjecture,
ssList(esk7_2(esk50_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_53]),c_0_25]),c_0_28])]) ).
fof(c_0_60,plain,
! [X151,X152,X153] :
( ( ~ memberP(app(X152,X153),X151)
| memberP(X152,X151)
| memberP(X153,X151)
| ~ ssList(X153)
| ~ ssList(X152)
| ~ ssItem(X151) )
& ( ~ memberP(X152,X151)
| memberP(app(X152,X153),X151)
| ~ ssList(X153)
| ~ ssList(X152)
| ~ ssItem(X151) )
& ( ~ memberP(X153,X151)
| memberP(app(X152,X153),X151)
| ~ ssList(X153)
| ~ ssList(X152)
| ~ ssItem(X151) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])]) ).
cnf(c_0_61,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_62,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_63,negated_conjecture,
esk7_2(esk50_0,nil) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_64,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_65,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_61]) ).
cnf(c_0_66,negated_conjecture,
app(esk50_0,nil) = esk50_0,
inference(rw,[status(thm)],[c_0_58,c_0_63]) ).
fof(c_0_67,plain,
! [X28,X29,X32,X33] :
( ( ssList(esk8_2(X28,X29))
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( ssList(esk9_2(X28,X29))
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( app(app(esk8_2(X28,X29),X29),esk9_2(X28,X29)) = X28
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( ~ ssList(X32)
| ~ ssList(X33)
| app(app(X32,X29),X33) != X28
| segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) ) ),
inference(distribute,[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_68,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_69,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_70,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_71,negated_conjecture,
( memberP(app(X1,esk50_0),esk52_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_72,negated_conjecture,
( ssList(app(X1,esk50_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_25]),c_0_28])]) ).
cnf(c_0_73,plain,
( app(app(esk8_2(X1,X2),X2),esk9_2(X1,X2)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_74,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_75,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_76,plain,
( ssList(esk9_2(X1,X2))
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_77,plain,
( ssList(esk8_2(X1,X2))
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_78,negated_conjecture,
~ memberP(esk49_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_79,negated_conjecture,
( memberP(app(app(X1,esk50_0),X2),esk52_0)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_29])]),c_0_72]) ).
cnf(c_0_80,negated_conjecture,
app(app(esk8_2(esk51_0,esk50_0),esk50_0),esk9_2(esk51_0,esk50_0)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_28]),c_0_75])]) ).
cnf(c_0_81,negated_conjecture,
ssList(esk9_2(esk51_0,esk50_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_74]),c_0_28]),c_0_75])]) ).
cnf(c_0_82,negated_conjecture,
ssList(esk8_2(esk51_0,esk50_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_74]),c_0_28]),c_0_75])]) ).
cnf(c_0_83,negated_conjecture,
~ memberP(esk51_0,esk52_0),
inference(rw,[status(thm)],[c_0_78,c_0_69]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82])]),c_0_83]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SWC403+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n014.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 : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 01:37:20 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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/tmp/tmp.y3z2iGzK7G/E---3.1_8065.p
% 5.10/1.13 # Version: 3.1pre001
% 5.10/1.13 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.10/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.10/1.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.10/1.13 # Starting new_bool_3 with 300s (1) cores
% 5.10/1.13 # Starting new_bool_1 with 300s (1) cores
% 5.10/1.13 # Starting sh5l with 300s (1) cores
% 5.10/1.13 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 8143 completed with status 0
% 5.10/1.13 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 5.10/1.13 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.10/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.10/1.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.10/1.13 # No SInE strategy applied
% 5.10/1.13 # Search class: FGHSF-FSLM21-MFFFFFNN
% 5.10/1.13 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 5.10/1.13 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 5.10/1.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 5.10/1.13 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 5.10/1.13 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 5.10/1.13 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 5.10/1.13 # G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with pid 8152 completed with status 0
% 5.10/1.13 # Result found by G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S
% 5.10/1.13 # Preprocessing class: FSLSSMSSSSSNFFN.
% 5.10/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.10/1.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.10/1.13 # No SInE strategy applied
% 5.10/1.13 # Search class: FGHSF-FSLM21-MFFFFFNN
% 5.10/1.13 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 5.10/1.13 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 5.10/1.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 5.10/1.13 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 5.10/1.13 # Preprocessing time : 0.003 s
% 5.10/1.13 # Presaturation interreduction done
% 5.10/1.13
% 5.10/1.13 # Proof found!
% 5.10/1.13 # SZS status Theorem
% 5.10/1.13 # SZS output start CNFRefutation
% See solution above
% 5.10/1.13 # Parsed axioms : 96
% 5.10/1.13 # Removed by relevancy pruning/SinE : 0
% 5.10/1.13 # Initial clauses : 202
% 5.10/1.13 # Removed in clause preprocessing : 2
% 5.10/1.13 # Initial clauses in saturation : 200
% 5.10/1.13 # Processed clauses : 3996
% 5.10/1.13 # ...of these trivial : 38
% 5.10/1.13 # ...subsumed : 2231
% 5.10/1.13 # ...remaining for further processing : 1727
% 5.10/1.13 # Other redundant clauses eliminated : 172
% 5.10/1.13 # Clauses deleted for lack of memory : 0
% 5.10/1.13 # Backward-subsumed : 92
% 5.10/1.13 # Backward-rewritten : 84
% 5.10/1.13 # Generated clauses : 20440
% 5.10/1.13 # ...of the previous two non-redundant : 18657
% 5.10/1.13 # ...aggressively subsumed : 0
% 5.10/1.13 # Contextual simplify-reflections : 694
% 5.10/1.13 # Paramodulations : 20257
% 5.10/1.13 # Factorizations : 0
% 5.10/1.13 # NegExts : 0
% 5.10/1.13 # Equation resolutions : 185
% 5.10/1.13 # Total rewrite steps : 15509
% 5.10/1.13 # Propositional unsat checks : 0
% 5.10/1.13 # Propositional check models : 0
% 5.10/1.13 # Propositional check unsatisfiable : 0
% 5.10/1.13 # Propositional clauses : 0
% 5.10/1.13 # Propositional clauses after purity: 0
% 5.10/1.13 # Propositional unsat core size : 0
% 5.10/1.13 # Propositional preprocessing time : 0.000
% 5.10/1.13 # Propositional encoding time : 0.000
% 5.10/1.13 # Propositional solver time : 0.000
% 5.10/1.13 # Success case prop preproc time : 0.000
% 5.10/1.13 # Success case prop encoding time : 0.000
% 5.10/1.13 # Success case prop solver time : 0.000
% 5.10/1.13 # Current number of processed clauses : 1334
% 5.10/1.13 # Positive orientable unit clauses : 177
% 5.10/1.13 # Positive unorientable unit clauses: 0
% 5.10/1.13 # Negative unit clauses : 8
% 5.10/1.13 # Non-unit-clauses : 1149
% 5.10/1.13 # Current number of unprocessed clauses: 14585
% 5.10/1.13 # ...number of literals in the above : 99079
% 5.10/1.13 # Current number of archived formulas : 0
% 5.10/1.13 # Current number of archived clauses : 370
% 5.10/1.13 # Clause-clause subsumption calls (NU) : 361105
% 5.10/1.13 # Rec. Clause-clause subsumption calls : 48385
% 5.10/1.13 # Non-unit clause-clause subsumptions : 2296
% 5.10/1.13 # Unit Clause-clause subsumption calls : 6530
% 5.10/1.13 # Rewrite failures with RHS unbound : 0
% 5.10/1.13 # BW rewrite match attempts : 155
% 5.10/1.13 # BW rewrite match successes : 58
% 5.10/1.13 # Condensation attempts : 0
% 5.10/1.13 # Condensation successes : 0
% 5.10/1.13 # Termbank termtop insertions : 471658
% 5.10/1.13
% 5.10/1.13 # -------------------------------------------------
% 5.10/1.13 # User time : 0.625 s
% 5.10/1.13 # System time : 0.019 s
% 5.10/1.13 # Total time : 0.644 s
% 5.10/1.13 # Maximum resident set size: 2476 pages
% 5.10/1.13
% 5.10/1.13 # -------------------------------------------------
% 5.10/1.13 # User time : 3.075 s
% 5.10/1.13 # System time : 0.095 s
% 5.10/1.13 # Total time : 3.171 s
% 5.10/1.13 # Maximum resident set size: 1796 pages
% 5.10/1.13 % E---3.1 exiting
% 5.10/1.13 % E---3.1 exiting
%------------------------------------------------------------------------------