TSTP Solution File: SWC073+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC073+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:39:11 EDT 2023
% Result : Theorem 1.03s 0.64s
% Output : CNFRefutation 1.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of formulae : 93 ( 16 unt; 0 def)
% Number of atoms : 353 ( 114 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 429 ( 169 ~; 179 |; 49 &)
% ( 3 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn; 51 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil != X3
& nil = X4 )
| ( nil = X2
& nil = X1 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssList(X6)
& X4 != X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X3) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X3) = X9
& neq(nil,X3) )
& neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',co1) ).
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.m92KiGR0TK/E---3.1_16975.p',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax26) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax15) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax24) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax81) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax22) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax28) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax16) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax55) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax58) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.m92KiGR0TK/E---3.1_16975.p',ax57) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil != X3
& nil = X4 )
| ( nil = X2
& nil = X1 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssList(X6)
& X4 != X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X3) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X3) = X9
& neq(nil,X3) )
& neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_16,plain,
! [X75,X76,X79,X80] :
( ( ssList(esk11_2(X75,X76))
| ~ segmentP(X75,X76)
| ~ ssList(X76)
| ~ ssList(X75) )
& ( ssList(esk12_2(X75,X76))
| ~ segmentP(X75,X76)
| ~ ssList(X76)
| ~ ssList(X75) )
& ( app(app(esk11_2(X75,X76),X76),esk12_2(X75,X76)) = X75
| ~ segmentP(X75,X76)
| ~ ssList(X76)
| ~ ssList(X75) )
& ( ~ ssList(X79)
| ~ ssList(X80)
| app(app(X79,X76),X80) != X75
| segmentP(X75,X76)
| ~ ssList(X76)
| ~ ssList(X75) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
fof(c_0_17,negated_conjecture,
! [X14,X15,X16,X17,X18] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(esk2_0,X14)
| ~ segmentP(esk1_0,X14) )
& ( nil = esk3_0
| nil != esk4_0 )
& ( nil != esk2_0
| nil != esk1_0 )
& ( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) )
& ( ~ ssList(X15)
| esk4_0 = X15
| ~ ssList(X16)
| ~ ssList(X17)
| tl(esk3_0) != X16
| app(X16,X17) != X15
| ~ ssItem(X18)
| cons(X18,nil) != X17
| hd(esk3_0) != X18
| ~ neq(nil,esk3_0)
| ~ neq(nil,esk3_0)
| ~ neq(esk4_0,nil) ) ),
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_15])])])])]) ).
cnf(c_0_18,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_19,plain,
! [X67] :
( ~ ssList(X67)
| app(X67,nil) = X67 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_20,plain,
! [X53,X54] :
( ~ ssList(X53)
| ~ ssList(X54)
| ssList(app(X53,X54)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_21,plain,
! [X21,X22] :
( ( ~ neq(X21,X22)
| X21 != X22
| ~ ssList(X22)
| ~ ssList(X21) )
& ( X21 = X22
| neq(X21,X22)
| ~ ssList(X22)
| ~ ssList(X21) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_22,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_25,plain,
! [X68] :
( ~ ssList(X68)
| nil = X68
| ssList(tl(X68)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,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_18]) ).
cnf(c_0_28,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_30,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_31,plain,
! [X49,X50] :
( ~ ssList(X49)
| ~ ssItem(X50)
| cons(X50,X49) = app(cons(X50,nil),X49) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
fof(c_0_32,plain,
! [X35] :
( ~ ssList(X35)
| nil = X35
| cons(hd(X35),tl(X35)) = X35 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_33,plain,
! [X28] :
( ~ ssList(X28)
| nil = X28
| ssItem(hd(X28)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_34,negated_conjecture,
( esk4_0 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(esk3_0) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(esk3_0) != X4
| ~ neq(nil,esk3_0)
| ~ neq(nil,esk3_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_35,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_37,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_38,negated_conjecture,
( esk3_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_39,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_40,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_41,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_27,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_42,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_45,plain,
! [X55] :
( ~ ssList(X55)
| app(nil,X55) = X55 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_46,negated_conjecture,
( esk4_0 = X1
| hd(esk3_0) != X4
| tl(esk3_0) != X2
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssItem(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk3_0)
| ~ neq(esk4_0,nil) ),
inference(cn,[status(thm)],[c_0_34]) ).
cnf(c_0_47,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_48,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_36,c_0_24]) ).
cnf(c_0_49,negated_conjecture,
esk4_0 != nil,
inference(csr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_51,negated_conjecture,
( esk3_0 = nil
| ssList(tl(esk3_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_52,plain,
( segmentP(cons(X1,X2),X2)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_53,negated_conjecture,
( cons(hd(esk3_0),tl(esk3_0)) = esk3_0
| esk3_0 = nil ),
inference(spm,[status(thm)],[c_0_43,c_0_40]) ).
cnf(c_0_54,negated_conjecture,
( esk3_0 = nil
| ssItem(hd(esk3_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_40]) ).
fof(c_0_55,plain,
! [X38,X39] :
( ~ ssList(X38)
| ~ ssItem(X39)
| ssList(cons(X39,X38)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_56,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_57,negated_conjecture,
( app(tl(esk3_0),cons(hd(esk3_0),nil)) = esk4_0
| ~ ssList(cons(hd(esk3_0),nil))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ neq(esk4_0,nil)
| ~ ssItem(hd(esk3_0)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_46])])])]),c_0_30]) ).
cnf(c_0_58,negated_conjecture,
neq(esk4_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_59,negated_conjecture,
( ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_23]),c_0_24]) ).
cnf(c_0_60,negated_conjecture,
( tl(esk3_0) = nil
| esk3_0 = nil
| neq(tl(esk3_0),nil) ),
inference(spm,[status(thm)],[c_0_47,c_0_51]) ).
cnf(c_0_61,negated_conjecture,
( esk3_0 = nil
| segmentP(esk3_0,tl(esk3_0))
| ~ ssList(cons(hd(esk3_0),nil)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_51]) ).
cnf(c_0_62,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_63,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_56]),c_0_29])]),c_0_30]) ).
cnf(c_0_64,negated_conjecture,
( app(tl(esk3_0),cons(hd(esk3_0),nil)) = esk4_0
| ~ ssList(cons(hd(esk3_0),nil))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_65,negated_conjecture,
( tl(esk3_0) = nil
| esk3_0 = nil
| ~ segmentP(esk3_0,tl(esk3_0))
| ~ segmentP(esk4_0,tl(esk3_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_51]) ).
cnf(c_0_66,negated_conjecture,
( esk3_0 = nil
| segmentP(esk3_0,tl(esk3_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_29])]),c_0_54]) ).
cnf(c_0_67,negated_conjecture,
( segmentP(esk4_0,tl(esk3_0))
| ~ ssList(cons(hd(esk3_0),nil))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
( X1 = esk3_0
| neq(X1,esk3_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_40]) ).
cnf(c_0_69,negated_conjecture,
( tl(esk3_0) = nil
| esk3_0 = nil
| ~ segmentP(esk4_0,tl(esk3_0)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,negated_conjecture,
( segmentP(esk4_0,tl(esk3_0))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_62]),c_0_29])]) ).
cnf(c_0_71,negated_conjecture,
( esk3_0 = nil
| neq(nil,esk3_0) ),
inference(spm,[status(thm)],[c_0_68,c_0_29]) ).
cnf(c_0_72,negated_conjecture,
( tl(esk3_0) = nil
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_54]),c_0_71]),c_0_51]) ).
cnf(c_0_73,negated_conjecture,
( cons(hd(esk3_0),nil) = esk3_0
| esk3_0 = nil ),
inference(spm,[status(thm)],[c_0_53,c_0_72]) ).
fof(c_0_74,plain,
! [X86] :
( ~ ssList(X86)
| segmentP(X86,X86) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_75,negated_conjecture,
( app(tl(esk3_0),esk3_0) = esk4_0
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_73]),c_0_40])]),c_0_54]),c_0_71]),c_0_51]) ).
cnf(c_0_76,negated_conjecture,
( ~ segmentP(esk3_0,esk4_0)
| ~ segmentP(esk4_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_58]),c_0_48])]) ).
cnf(c_0_77,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_78,negated_conjecture,
( app(nil,esk3_0) = esk4_0
| esk3_0 = nil ),
inference(spm,[status(thm)],[c_0_75,c_0_72]) ).
cnf(c_0_79,negated_conjecture,
( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_80,negated_conjecture,
~ segmentP(esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_48])]) ).
cnf(c_0_81,negated_conjecture,
( esk3_0 = nil
| esk4_0 = esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_78]),c_0_40])]) ).
fof(c_0_82,plain,
! [X92] :
( ( ~ segmentP(nil,X92)
| nil = X92
| ~ ssList(X92) )
& ( nil != X92
| segmentP(nil,X92)
| ~ ssList(X92) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_83,negated_conjecture,
neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_58])]) ).
cnf(c_0_84,negated_conjecture,
( esk3_0 = nil
| ~ segmentP(esk3_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_86,negated_conjecture,
( ~ segmentP(esk3_0,esk3_0)
| ~ segmentP(esk4_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_83]),c_0_40])]) ).
cnf(c_0_87,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_77]),c_0_40])]) ).
cnf(c_0_88,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_85]),c_0_29])]) ).
fof(c_0_89,plain,
! [X91] :
( ~ ssList(X91)
| segmentP(X91,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_90,negated_conjecture,
~ segmentP(esk4_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87]),c_0_87]),c_0_88]),c_0_87])]) ).
cnf(c_0_91,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_92,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SWC073+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n014.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Oct 3 01:40:35 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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.m92KiGR0TK/E---3.1_16975.p
% 1.03/0.64 # Version: 3.1pre001
% 1.03/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.03/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.03/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.03/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.03/0.64 # Starting sh5l with 300s (1) cores
% 1.03/0.64 # new_bool_3 with pid 17055 completed with status 0
% 1.03/0.64 # Result found by new_bool_3
% 1.03/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.03/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.03/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.03/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.64 # Search class: FGHSF-FFMM21-MFFFFFNN
% 1.03/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.03/0.64 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17058 completed with status 0
% 1.03/0.64 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.03/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.03/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.03/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.03/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.64 # Search class: FGHSF-FFMM21-MFFFFFNN
% 1.03/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.03/0.64 # Preprocessing time : 0.002 s
% 1.03/0.64 # Presaturation interreduction done
% 1.03/0.64
% 1.03/0.64 # Proof found!
% 1.03/0.64 # SZS status Theorem
% 1.03/0.64 # SZS output start CNFRefutation
% See solution above
% 1.03/0.64 # Parsed axioms : 96
% 1.03/0.64 # Removed by relevancy pruning/SinE : 60
% 1.03/0.64 # Initial clauses : 61
% 1.03/0.64 # Removed in clause preprocessing : 0
% 1.03/0.64 # Initial clauses in saturation : 61
% 1.03/0.64 # Processed clauses : 748
% 1.03/0.64 # ...of these trivial : 13
% 1.03/0.64 # ...subsumed : 264
% 1.03/0.64 # ...remaining for further processing : 471
% 1.03/0.64 # Other redundant clauses eliminated : 16
% 1.03/0.64 # Clauses deleted for lack of memory : 0
% 1.03/0.64 # Backward-subsumed : 60
% 1.03/0.64 # Backward-rewritten : 126
% 1.03/0.64 # Generated clauses : 2727
% 1.03/0.64 # ...of the previous two non-redundant : 2598
% 1.03/0.64 # ...aggressively subsumed : 0
% 1.03/0.64 # Contextual simplify-reflections : 119
% 1.03/0.64 # Paramodulations : 2710
% 1.03/0.64 # Factorizations : 0
% 1.03/0.64 # NegExts : 0
% 1.03/0.64 # Equation resolutions : 21
% 1.03/0.64 # Total rewrite steps : 1001
% 1.03/0.64 # Propositional unsat checks : 0
% 1.03/0.64 # Propositional check models : 0
% 1.03/0.64 # Propositional check unsatisfiable : 0
% 1.03/0.64 # Propositional clauses : 0
% 1.03/0.64 # Propositional clauses after purity: 0
% 1.03/0.64 # Propositional unsat core size : 0
% 1.03/0.64 # Propositional preprocessing time : 0.000
% 1.03/0.64 # Propositional encoding time : 0.000
% 1.03/0.64 # Propositional solver time : 0.000
% 1.03/0.64 # Success case prop preproc time : 0.000
% 1.03/0.64 # Success case prop encoding time : 0.000
% 1.03/0.64 # Success case prop solver time : 0.000
% 1.03/0.64 # Current number of processed clauses : 221
% 1.03/0.64 # Positive orientable unit clauses : 31
% 1.03/0.64 # Positive unorientable unit clauses: 0
% 1.03/0.64 # Negative unit clauses : 12
% 1.03/0.64 # Non-unit-clauses : 178
% 1.03/0.64 # Current number of unprocessed clauses: 1922
% 1.03/0.64 # ...number of literals in the above : 9137
% 1.03/0.64 # Current number of archived formulas : 0
% 1.03/0.64 # Current number of archived clauses : 244
% 1.03/0.64 # Clause-clause subsumption calls (NU) : 21190
% 1.03/0.64 # Rec. Clause-clause subsumption calls : 6000
% 1.03/0.64 # Non-unit clause-clause subsumptions : 395
% 1.03/0.64 # Unit Clause-clause subsumption calls : 903
% 1.03/0.64 # Rewrite failures with RHS unbound : 0
% 1.03/0.64 # BW rewrite match attempts : 6
% 1.03/0.64 # BW rewrite match successes : 6
% 1.03/0.64 # Condensation attempts : 0
% 1.03/0.64 # Condensation successes : 0
% 1.03/0.64 # Termbank termtop insertions : 50197
% 1.03/0.64
% 1.03/0.64 # -------------------------------------------------
% 1.03/0.64 # User time : 0.084 s
% 1.03/0.64 # System time : 0.006 s
% 1.03/0.64 # Total time : 0.090 s
% 1.03/0.64 # Maximum resident set size: 2056 pages
% 1.03/0.64
% 1.03/0.64 # -------------------------------------------------
% 1.03/0.64 # User time : 0.087 s
% 1.03/0.64 # System time : 0.008 s
% 1.03/0.64 # Total time : 0.096 s
% 1.03/0.64 # Maximum resident set size: 1804 pages
% 1.03/0.64 % E---3.1 exiting
% 1.03/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------