TSTP Solution File: SWC045+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC045+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:41:12 EDT 2023
% Result : Theorem 9.02s 1.58s
% Output : CNFRefutation 9.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 85 ( 16 unt; 0 def)
% Number of atoms : 343 ( 77 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 444 ( 186 ~; 180 |; 33 &)
% ( 3 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 156 ( 0 sgn; 74 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax26) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax83) ).
fof(ax54,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax54) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax16) ).
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/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax27) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax81) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax18) ).
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/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax56) ).
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/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax82) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax28) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ? [X6] :
( ssList(X6)
& segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) ) )
| ( ! [X6] :
( ssList(X6)
=> ~ segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) )
& memberP(X3,X5) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',co1) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax37) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p',ax20) ).
fof(c_0_16,plain,
! [X27,X28,X31,X32] :
( ( ssList(esk8_2(X27,X28))
| ~ segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) )
& ( ssList(esk9_2(X27,X28))
| ~ segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) )
& ( app(app(esk8_2(X27,X28),X28),esk9_2(X27,X28)) = X27
| ~ segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) )
& ( ~ ssList(X31)
| ~ ssList(X32)
| app(app(X31,X28),X32) != X27
| segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) ) ),
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_17,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_16]) ).
fof(c_0_18,plain,
! [X64] :
( ~ ssList(X64)
| app(X64,nil) = X64 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_19,plain,
! [X45,X46] :
( ~ ssList(X45)
| ~ ssList(X46)
| ssList(app(X45,X46)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_20,plain,
! [X62,X63] :
( ( nil = X63
| nil != app(X62,X63)
| ~ ssList(X63)
| ~ ssList(X62) )
& ( nil = X62
| nil != app(X62,X63)
| ~ ssList(X63)
| ~ ssList(X62) )
& ( nil != X63
| nil != X62
| nil = app(X62,X63)
| ~ ssList(X63)
| ~ ssList(X62) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
fof(c_0_21,plain,
! [X36,X37] :
( ~ ssList(X36)
| ~ ssList(X37)
| ~ segmentP(X36,X37)
| ~ segmentP(X37,X36)
| X36 = X37 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])])]) ).
cnf(c_0_22,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_17]) ).
cnf(c_0_23,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_25,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,plain,
! [X65,X66] :
( ~ ssList(X65)
| ~ ssItem(X66)
| ssList(cons(X66,X65)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
fof(c_0_27,plain,
! [X47,X48,X49] :
( ~ ssList(X47)
| ~ ssList(X48)
| ~ ssItem(X49)
| cons(X49,app(X48,X47)) = app(cons(X49,X48),X47) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
cnf(c_0_28,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]) ).
fof(c_0_31,plain,
! [X57,X58] :
( ~ ssList(X57)
| ~ ssItem(X58)
| cons(X58,X57) = app(cons(X58,nil),X57) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
fof(c_0_32,plain,
! [X67,X68] :
( ~ ssList(X67)
| ~ ssItem(X68)
| cons(X68,X67) != X67 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_33,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_28])]),c_0_24])]) ).
cnf(c_0_36,plain,
( app(X1,X2) = X2
| ~ segmentP(X2,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25]) ).
cnf(c_0_37,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_39,plain,
! [X39,X40,X41,X42] :
( ~ ssList(X39)
| ~ ssList(X40)
| ~ ssList(X41)
| ~ ssList(X42)
| ~ segmentP(X39,X40)
| segmentP(app(app(X41,X39),X42),X40) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])]) ).
cnf(c_0_40,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_25]) ).
cnf(c_0_41,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_24])]) ).
fof(c_0_42,plain,
! [X59,X60,X61] :
( ~ ssList(X59)
| ~ ssList(X60)
| ~ ssList(X61)
| app(app(X59,X60),X61) = app(X59,app(X60,X61)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
fof(c_0_43,plain,
! [X50] :
( ~ ssList(X50)
| app(nil,X50) = X50 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_44,plain,
( ~ segmentP(X1,cons(X2,X1))
| ~ ssList(cons(X2,nil))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_45,plain,
( segmentP(app(app(X3,X1),X4),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_24])]) ).
cnf(c_0_47,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_49,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ? [X6] :
( ssList(X6)
& segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) ) )
| ( ! [X6] :
( ssList(X6)
=> ~ segmentP(X4,app(app(cons(X5,nil),X6),cons(X5,nil))) )
& memberP(X3,X5) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_50,plain,
( ~ segmentP(X1,cons(X2,app(app(X3,X1),X4)))
| ~ ssList(app(app(X3,X1),X4))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_33]) ).
cnf(c_0_51,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_24])]) ).
cnf(c_0_52,plain,
( app(X1,app(X2,nil)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_47]),c_0_24])]),c_0_25]) ).
fof(c_0_53,negated_conjecture,
! [X11,X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& nil = esk2_0
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& nil != esk1_0
& ( memberP(esk3_0,X11)
| ~ ssList(X12)
| ~ segmentP(esk4_0,app(app(cons(X11,nil),X12),cons(X11,nil)))
| ~ ssItem(X11) )
& ( ssList(esk5_1(X11))
| ~ memberP(esk3_0,X11)
| ~ ssItem(X11) )
& ( segmentP(esk4_0,app(app(cons(X11,nil),esk5_1(X11)),cons(X11,nil)))
| ~ memberP(esk3_0,X11)
| ~ ssItem(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])])])])]) ).
cnf(c_0_54,plain,
( ~ segmentP(X1,cons(X2,app(X1,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_48]),c_0_24])]),c_0_25]) ).
cnf(c_0_55,plain,
( app(nil,X1) = app(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_24])]) ).
cnf(c_0_56,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_57,negated_conjecture,
nil = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,plain,
( ~ segmentP(nil,cons(X1,app(X2,nil)))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_24])]) ).
cnf(c_0_59,negated_conjecture,
( segmentP(esk4_0,app(app(cons(X1,nil),esk5_1(X1)),cons(X1,nil)))
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,negated_conjecture,
esk4_0 = nil,
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
( ~ segmentP(nil,cons(X1,app(nil,X2)))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_55]) ).
cnf(c_0_62,negated_conjecture,
( segmentP(nil,app(app(cons(X1,nil),esk5_1(X1)),cons(X1,nil)))
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
( ssList(esk5_1(X1))
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
fof(c_0_64,plain,
! [X23,X24,X25] :
( ( ~ memberP(cons(X24,X25),X23)
| X23 = X24
| memberP(X25,X23)
| ~ ssList(X25)
| ~ ssItem(X24)
| ~ ssItem(X23) )
& ( X23 != X24
| memberP(cons(X24,X25),X23)
| ~ ssList(X25)
| ~ ssItem(X24)
| ~ ssItem(X23) )
& ( ~ memberP(X25,X23)
| memberP(cons(X24,X25),X23)
| ~ ssList(X25)
| ~ ssItem(X24)
| ~ ssItem(X23) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])]) ).
fof(c_0_65,plain,
! [X73] :
( ( ssList(esk10_1(X73))
| nil = X73
| ~ ssList(X73) )
& ( ssItem(esk11_1(X73))
| nil = X73
| ~ ssList(X73) )
& ( cons(esk11_1(X73),esk10_1(X73)) = X73
| nil = X73
| ~ ssList(X73) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_66,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_67,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_68,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_69,plain,
( ~ segmentP(nil,app(cons(X1,nil),X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_34]),c_0_24])]) ).
cnf(c_0_70,negated_conjecture,
( segmentP(nil,app(cons(X1,nil),app(esk5_1(X1),cons(X1,nil))))
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_47]),c_0_63]),c_0_46]) ).
cnf(c_0_71,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_72,plain,
( cons(esk11_1(X1),esk10_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_73,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_74,negated_conjecture,
esk3_0 != nil,
inference(rw,[status(thm)],[c_0_68,c_0_67]) ).
cnf(c_0_75,plain,
( ssList(esk10_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_76,plain,
( ssItem(esk11_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_77,negated_conjecture,
( ~ memberP(esk3_0,X1)
| ~ ssList(app(esk5_1(X1),cons(X1,nil)))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_78,plain,
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_71]) ).
cnf(c_0_79,negated_conjecture,
cons(esk11_1(esk3_0),esk10_1(esk3_0)) = esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]) ).
cnf(c_0_80,negated_conjecture,
ssList(esk10_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_73]),c_0_74]) ).
cnf(c_0_81,negated_conjecture,
ssItem(esk11_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_73]),c_0_74]) ).
cnf(c_0_82,negated_conjecture,
( ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_25]),c_0_63]),c_0_46]) ).
cnf(c_0_83,negated_conjecture,
memberP(esk3_0,esk11_1(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]),c_0_81])]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_81])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC045+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:13:52 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.y7y5PYuycz/E---3.1_27487.p
% 9.02/1.58 # Version: 3.1pre001
% 9.02/1.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 9.02/1.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.02/1.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.02/1.58 # Starting new_bool_3 with 300s (1) cores
% 9.02/1.58 # Starting new_bool_1 with 300s (1) cores
% 9.02/1.58 # Starting sh5l with 300s (1) cores
% 9.02/1.58 # new_bool_1 with pid 27566 completed with status 0
% 9.02/1.58 # Result found by new_bool_1
% 9.02/1.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 9.02/1.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.02/1.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.02/1.58 # Starting new_bool_3 with 300s (1) cores
% 9.02/1.58 # Starting new_bool_1 with 300s (1) cores
% 9.02/1.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 9.02/1.58 # Search class: FGHSF-FFMM21-MFFFFFNN
% 9.02/1.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 9.02/1.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 9.02/1.58 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27569 completed with status 0
% 9.02/1.58 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 9.02/1.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 9.02/1.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.02/1.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.02/1.58 # Starting new_bool_3 with 300s (1) cores
% 9.02/1.58 # Starting new_bool_1 with 300s (1) cores
% 9.02/1.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 9.02/1.58 # Search class: FGHSF-FFMM21-MFFFFFNN
% 9.02/1.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 9.02/1.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 9.02/1.58 # Preprocessing time : 0.001 s
% 9.02/1.58 # Presaturation interreduction done
% 9.02/1.58
% 9.02/1.58 # Proof found!
% 9.02/1.58 # SZS status Theorem
% 9.02/1.58 # SZS output start CNFRefutation
% See solution above
% 9.02/1.58 # Parsed axioms : 96
% 9.02/1.58 # Removed by relevancy pruning/SinE : 68
% 9.02/1.58 # Initial clauses : 56
% 9.02/1.58 # Removed in clause preprocessing : 0
% 9.02/1.58 # Initial clauses in saturation : 56
% 9.02/1.58 # Processed clauses : 7764
% 9.02/1.58 # ...of these trivial : 48
% 9.02/1.58 # ...subsumed : 5950
% 9.02/1.58 # ...remaining for further processing : 1766
% 9.02/1.58 # Other redundant clauses eliminated : 56
% 9.02/1.58 # Clauses deleted for lack of memory : 0
% 9.02/1.58 # Backward-subsumed : 106
% 9.02/1.58 # Backward-rewritten : 96
% 9.02/1.58 # Generated clauses : 53886
% 9.02/1.58 # ...of the previous two non-redundant : 51894
% 9.02/1.58 # ...aggressively subsumed : 0
% 9.02/1.58 # Contextual simplify-reflections : 523
% 9.02/1.58 # Paramodulations : 53789
% 9.02/1.58 # Factorizations : 0
% 9.02/1.58 # NegExts : 0
% 9.02/1.58 # Equation resolutions : 77
% 9.02/1.58 # Total rewrite steps : 25708
% 9.02/1.58 # Propositional unsat checks : 0
% 9.02/1.58 # Propositional check models : 0
% 9.02/1.58 # Propositional check unsatisfiable : 0
% 9.02/1.58 # Propositional clauses : 0
% 9.02/1.58 # Propositional clauses after purity: 0
% 9.02/1.58 # Propositional unsat core size : 0
% 9.02/1.58 # Propositional preprocessing time : 0.000
% 9.02/1.58 # Propositional encoding time : 0.000
% 9.02/1.58 # Propositional solver time : 0.000
% 9.02/1.58 # Success case prop preproc time : 0.000
% 9.02/1.58 # Success case prop encoding time : 0.000
% 9.02/1.58 # Success case prop solver time : 0.000
% 9.02/1.58 # Current number of processed clauses : 1485
% 9.02/1.58 # Positive orientable unit clauses : 40
% 9.02/1.58 # Positive unorientable unit clauses: 0
% 9.02/1.58 # Negative unit clauses : 35
% 9.02/1.58 # Non-unit-clauses : 1410
% 9.02/1.58 # Current number of unprocessed clauses: 43822
% 9.02/1.58 # ...number of literals in the above : 213425
% 9.02/1.58 # Current number of archived formulas : 0
% 9.02/1.58 # Current number of archived clauses : 276
% 9.02/1.58 # Clause-clause subsumption calls (NU) : 317939
% 9.02/1.58 # Rec. Clause-clause subsumption calls : 90736
% 9.02/1.58 # Non-unit clause-clause subsumptions : 4562
% 9.02/1.58 # Unit Clause-clause subsumption calls : 9486
% 9.02/1.58 # Rewrite failures with RHS unbound : 0
% 9.02/1.58 # BW rewrite match attempts : 471
% 9.02/1.58 # BW rewrite match successes : 12
% 9.02/1.58 # Condensation attempts : 0
% 9.02/1.58 # Condensation successes : 0
% 9.02/1.58 # Termbank termtop insertions : 1391904
% 9.02/1.58
% 9.02/1.58 # -------------------------------------------------
% 9.02/1.58 # User time : 1.061 s
% 9.02/1.58 # System time : 0.040 s
% 9.02/1.58 # Total time : 1.101 s
% 9.02/1.58 # Maximum resident set size: 2032 pages
% 9.02/1.58
% 9.02/1.58 # -------------------------------------------------
% 9.02/1.58 # User time : 1.065 s
% 9.02/1.58 # System time : 0.042 s
% 9.02/1.58 # Total time : 1.106 s
% 9.02/1.58 # Maximum resident set size: 1800 pages
% 9.02/1.58 % E---3.1 exiting
%------------------------------------------------------------------------------