TSTP Solution File: SWC061+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC061+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:07 EDT 2023
% Result : Theorem 0.17s 0.51s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 14
% Syntax : Number of formulae : 96 ( 26 unt; 0 def)
% Number of atoms : 339 ( 111 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 416 ( 173 ~; 170 |; 37 &)
% ( 3 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 108 ( 0 sgn; 63 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| app(X6,cons(X5,nil)) != X3 ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssList(X7)
& neq(X7,nil)
& segmentP(X2,X7)
& segmentP(X1,X7) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',ax83) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',ax16) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',ax18) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',ax17) ).
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/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',ax19) ).
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.EQxRcSx6Xt/E---3.1_31167.p',ax27) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',ax26) ).
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.EQxRcSx6Xt/E---3.1_31167.p',ax7) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',ax81) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',ax15) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',ax84) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',ax55) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p',ax28) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| app(X6,cons(X5,nil)) != X3 ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssList(X7)
& neq(X7,nil)
& segmentP(X2,X7)
& segmentP(X1,X7) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_15,negated_conjecture,
! [X14] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( ssList(esk6_0)
| ~ neq(esk4_0,nil) )
& ( app(cons(esk5_0,nil),esk6_0) = esk4_0
| ~ neq(esk4_0,nil) )
& ( app(esk6_0,cons(esk5_0,nil)) = esk3_0
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(esk2_0,X14)
| ~ segmentP(esk1_0,X14)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(esk2_0,X14)
| ~ segmentP(esk1_0,X14)
| nil != esk1_0 ) ),
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_14])])])])]) ).
cnf(c_0_16,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X59,X60] :
( ( nil = X60
| nil != app(X59,X60)
| ~ ssList(X60)
| ~ ssList(X59) )
& ( nil = X59
| nil != app(X59,X60)
| ~ ssList(X60)
| ~ ssList(X59) )
& ( nil != X60
| nil != X59
| nil = app(X59,X60)
| ~ ssList(X60)
| ~ ssList(X59) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_19,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( ssList(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( neq(esk4_0,nil)
| esk1_0 != nil ),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk1_0
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ssList(esk6_0)
| esk1_0 != nil ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_26,plain,
! [X62,X63] :
( ~ ssList(X62)
| ~ ssItem(X63)
| ssList(cons(X63,X62)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_27,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_28,plain,
! [X64,X65] :
( ~ ssList(X64)
| ~ ssItem(X65)
| cons(X65,X64) != X64 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_29,negated_conjecture,
( cons(esk5_0,nil) = nil
| esk1_0 != nil
| ~ ssList(cons(esk5_0,nil)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]),c_0_25]) ).
cnf(c_0_30,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_32,negated_conjecture,
( ssItem(esk5_0)
| esk1_0 != nil ),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( cons(esk5_0,nil) = nil
| esk1_0 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,negated_conjecture,
( neq(esk2_0,nil)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_37,negated_conjecture,
esk1_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31])]),c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( esk1_0 = nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[c_0_35,c_0_20]) ).
fof(c_0_39,plain,
! [X66,X67,X68,X69] :
( ( X68 = X69
| cons(X68,X66) != cons(X69,X67)
| ~ ssItem(X69)
| ~ ssItem(X68)
| ~ ssList(X67)
| ~ ssList(X66) )
& ( X67 = X66
| cons(X68,X66) != cons(X69,X67)
| ~ ssItem(X69)
| ~ ssItem(X68)
| ~ ssList(X67)
| ~ ssList(X66) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax19])])])]) ).
fof(c_0_40,plain,
! [X44,X45,X46] :
( ~ ssList(X44)
| ~ ssList(X45)
| ~ ssItem(X46)
| cons(X46,app(X45,X44)) = app(cons(X46,X45),X44) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
fof(c_0_41,plain,
! [X42,X43] :
( ~ ssList(X42)
| ~ ssList(X43)
| ssList(app(X42,X43)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_42,negated_conjecture,
( esk4_0 = nil
| neq(esk4_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_17]),c_0_17]) ).
cnf(c_0_43,negated_conjecture,
esk4_0 != nil,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_44,plain,
! [X15,X16,X19,X20] :
( ( ssList(esk7_2(X15,X16))
| ~ segmentP(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) )
& ( ssList(esk8_2(X15,X16))
| ~ segmentP(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) )
& ( app(app(esk7_2(X15,X16),X16),esk8_2(X15,X16)) = X15
| ~ segmentP(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) )
& ( ~ ssList(X19)
| ~ ssList(X20)
| app(app(X19,X16),X20) != X15
| segmentP(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) ) ),
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_45,plain,
( X1 = X2
| cons(X3,X2) != cons(X4,X1)
| ~ ssItem(X4)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_49,negated_conjecture,
neq(esk4_0,nil),
inference(sr,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
( esk4_0 = nil
| ssList(esk6_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( esk4_0 = nil
| ssItem(esk5_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_42]) ).
fof(c_0_52,plain,
! [X54,X55] :
( ~ ssList(X54)
| ~ ssItem(X55)
| cons(X55,X54) = app(cons(X55,nil),X54) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
fof(c_0_53,plain,
! [X35,X36] :
( ( ~ neq(X35,X36)
| X35 != X36
| ~ ssList(X36)
| ~ ssList(X35) )
& ( X35 = X36
| neq(X35,X36)
| ~ ssList(X36)
| ~ ssList(X35) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_54,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_44]) ).
cnf(c_0_55,plain,
( X1 = app(X2,X3)
| app(cons(X4,X2),X3) != cons(X5,X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X5)
| ~ ssItem(X4) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_56,negated_conjecture,
app(cons(esk5_0,nil),esk6_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_57,negated_conjecture,
ssList(esk6_0),
inference(sr,[status(thm)],[c_0_50,c_0_43]) ).
cnf(c_0_58,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_51,c_0_43]) ).
cnf(c_0_59,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_60,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_61,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_54]) ).
fof(c_0_62,plain,
! [X61] :
( ~ ssList(X61)
| app(X61,nil) = X61 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_63,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_64,negated_conjecture,
( X1 = app(nil,esk6_0)
| cons(X2,X1) != esk4_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_31]),c_0_57]),c_0_58])]) ).
cnf(c_0_65,negated_conjecture,
cons(esk5_0,esk6_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_56]),c_0_57]),c_0_58])]) ).
cnf(c_0_66,negated_conjecture,
( nil = esk2_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_67,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_31]) ).
cnf(c_0_68,negated_conjecture,
( segmentP(app(esk4_0,X1),esk6_0)
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(app(esk4_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_56]),c_0_57])]) ).
cnf(c_0_69,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_70,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_63,c_0_17]) ).
cnf(c_0_71,negated_conjecture,
app(nil,esk6_0) = esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_57]),c_0_58])]) ).
cnf(c_0_72,negated_conjecture,
( esk4_0 = nil
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_17]),c_0_17]) ).
cnf(c_0_73,negated_conjecture,
( esk6_0 = nil
| neq(esk6_0,nil) ),
inference(spm,[status(thm)],[c_0_67,c_0_57]) ).
cnf(c_0_74,negated_conjecture,
( segmentP(esk4_0,esk6_0)
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_31])]) ).
cnf(c_0_75,negated_conjecture,
( segmentP(app(esk6_0,X1),esk6_0)
| ~ ssList(app(esk6_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_71]),c_0_57]),c_0_31])]) ).
cnf(c_0_76,negated_conjecture,
app(esk6_0,cons(esk5_0,nil)) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_49])]) ).
cnf(c_0_77,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_78,negated_conjecture,
( esk6_0 = nil
| ~ segmentP(esk1_0,esk6_0)
| ~ segmentP(esk4_0,esk6_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_57])]),c_0_43]) ).
cnf(c_0_79,negated_conjecture,
segmentP(esk4_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_30]),c_0_31]),c_0_58])]) ).
cnf(c_0_80,negated_conjecture,
( segmentP(esk1_0,esk6_0)
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77])]) ).
cnf(c_0_81,negated_conjecture,
( esk6_0 = nil
| ~ segmentP(esk1_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]) ).
cnf(c_0_82,negated_conjecture,
segmentP(esk1_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_30]),c_0_31]),c_0_58])]) ).
cnf(c_0_83,negated_conjecture,
esk6_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]) ).
cnf(c_0_84,negated_conjecture,
neq(esk1_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_77]),c_0_37]) ).
fof(c_0_85,plain,
! [X26] :
( ~ ssList(X26)
| segmentP(X26,X26) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
fof(c_0_86,plain,
! [X47] :
( ~ ssList(X47)
| app(nil,X47) = X47 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_87,negated_conjecture,
cons(esk5_0,nil) = esk4_0,
inference(rw,[status(thm)],[c_0_65,c_0_83]) ).
cnf(c_0_88,negated_conjecture,
( ~ segmentP(esk1_0,esk1_0)
| ~ segmentP(esk4_0,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_84]),c_0_77])]),c_0_43]) ).
cnf(c_0_89,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_90,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_91,negated_conjecture,
app(nil,esk4_0) = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_83]),c_0_87]) ).
cnf(c_0_92,negated_conjecture,
~ segmentP(esk4_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_77])]) ).
cnf(c_0_93,negated_conjecture,
esk1_0 = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_70])]) ).
cnf(c_0_94,negated_conjecture,
~ segmentP(esk4_0,esk4_0),
inference(rw,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_95,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_89]),c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC061+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n021.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 02:02:59 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.EQxRcSx6Xt/E---3.1_31167.p
% 0.17/0.50 # Version: 3.1pre001
% 0.17/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 # Starting sh5l with 300s (1) cores
% 0.17/0.50 # new_bool_3 with pid 31247 completed with status 0
% 0.17/0.50 # Result found by new_bool_3
% 0.17/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.50 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31251 completed with status 0
% 0.17/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.51 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.51 # Preprocessing time : 0.002 s
% 0.17/0.51 # Presaturation interreduction done
% 0.17/0.51
% 0.17/0.51 # Proof found!
% 0.17/0.51 # SZS status Theorem
% 0.17/0.51 # SZS output start CNFRefutation
% See solution above
% 0.17/0.51 # Parsed axioms : 96
% 0.17/0.51 # Removed by relevancy pruning/SinE : 70
% 0.17/0.51 # Initial clauses : 53
% 0.17/0.51 # Removed in clause preprocessing : 0
% 0.17/0.51 # Initial clauses in saturation : 53
% 0.17/0.51 # Processed clauses : 503
% 0.17/0.51 # ...of these trivial : 4
% 0.17/0.51 # ...subsumed : 157
% 0.17/0.51 # ...remaining for further processing : 342
% 0.17/0.51 # Other redundant clauses eliminated : 12
% 0.17/0.51 # Clauses deleted for lack of memory : 0
% 0.17/0.51 # Backward-subsumed : 23
% 0.17/0.51 # Backward-rewritten : 144
% 0.17/0.51 # Generated clauses : 1116
% 0.17/0.51 # ...of the previous two non-redundant : 1069
% 0.17/0.51 # ...aggressively subsumed : 0
% 0.17/0.51 # Contextual simplify-reflections : 25
% 0.17/0.51 # Paramodulations : 1092
% 0.17/0.51 # Factorizations : 0
% 0.17/0.51 # NegExts : 0
% 0.17/0.51 # Equation resolutions : 16
% 0.17/0.51 # Total rewrite steps : 1216
% 0.17/0.51 # Propositional unsat checks : 0
% 0.17/0.51 # Propositional check models : 0
% 0.17/0.51 # Propositional check unsatisfiable : 0
% 0.17/0.51 # Propositional clauses : 0
% 0.17/0.51 # Propositional clauses after purity: 0
% 0.17/0.51 # Propositional unsat core size : 0
% 0.17/0.51 # Propositional preprocessing time : 0.000
% 0.17/0.51 # Propositional encoding time : 0.000
% 0.17/0.51 # Propositional solver time : 0.000
% 0.17/0.51 # Success case prop preproc time : 0.000
% 0.17/0.51 # Success case prop encoding time : 0.000
% 0.17/0.51 # Success case prop solver time : 0.000
% 0.17/0.51 # Current number of processed clauses : 110
% 0.17/0.51 # Positive orientable unit clauses : 23
% 0.17/0.51 # Positive unorientable unit clauses: 0
% 0.17/0.51 # Negative unit clauses : 5
% 0.17/0.51 # Non-unit-clauses : 82
% 0.17/0.51 # Current number of unprocessed clauses: 607
% 0.17/0.51 # ...number of literals in the above : 2656
% 0.17/0.51 # Current number of archived formulas : 0
% 0.17/0.51 # Current number of archived clauses : 227
% 0.17/0.51 # Clause-clause subsumption calls (NU) : 4306
% 0.17/0.51 # Rec. Clause-clause subsumption calls : 1995
% 0.17/0.51 # Non-unit clause-clause subsumptions : 126
% 0.17/0.51 # Unit Clause-clause subsumption calls : 433
% 0.17/0.51 # Rewrite failures with RHS unbound : 0
% 0.17/0.51 # BW rewrite match attempts : 12
% 0.17/0.51 # BW rewrite match successes : 12
% 0.17/0.51 # Condensation attempts : 0
% 0.17/0.51 # Condensation successes : 0
% 0.17/0.51 # Termbank termtop insertions : 21633
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.032 s
% 0.17/0.51 # System time : 0.005 s
% 0.17/0.51 # Total time : 0.036 s
% 0.17/0.51 # Maximum resident set size: 2032 pages
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.034 s
% 0.17/0.51 # System time : 0.007 s
% 0.17/0.51 # Total time : 0.041 s
% 0.17/0.51 # Maximum resident set size: 1800 pages
% 0.17/0.51 % E---3.1 exiting
% 0.17/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------