TSTP Solution File: SWC112+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC112+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 10:18:17 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 7
% Syntax : Number of formulae : 89 ( 16 unt; 0 def)
% Number of atoms : 567 ( 209 equ)
% Maximal formula atoms : 36 ( 6 avg)
% Number of connectives : 781 ( 303 ~; 297 |; 151 &)
% ( 3 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 170 ( 0 sgn 111 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/tmp/tmpl1XXLH/sel_SWC112+1.p_1',ax84) ).
fof(6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmpl1XXLH/sel_SWC112+1.p_1',ax83) ).
fof(13,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/tmp/tmpl1XXLH/sel_SWC112+1.p_1',ax26) ).
fof(20,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/tmp/tmpl1XXLH/sel_SWC112+1.p_1',ax7) ).
fof(39,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpl1XXLH/sel_SWC112+1.p_1',ax15) ).
fof(41,axiom,
ssList(nil),
file('/tmp/tmpl1XXLH/sel_SWC112+1.p_1',ax17) ).
fof(43,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ) ) ),
file('/tmp/tmpl1XXLH/sel_SWC112+1.p_1',co1) ).
fof(44,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[43]) ).
fof(47,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& lt(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& lt(X13,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[44,theory(equality)]) ).
fof(60,plain,
! [X1] :
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(61,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[60]) ).
cnf(62,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[61]) ).
fof(63,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( nil != app(X1,X2)
| ( nil = X2
& nil = X1 ) )
& ( nil != X2
| nil != X1
| nil = app(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(64,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( nil != app(X3,X4)
| ( nil = X4
& nil = X3 ) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[63]) ).
fof(65,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( nil != app(X3,X4)
| ( nil = X4
& nil = X3 ) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[64]) ).
fof(66,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[65]) ).
cnf(69,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(93,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ssList(app(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(94,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ssList(app(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[93]) ).
fof(95,plain,
! [X3,X4] :
( ~ ssList(X4)
| ssList(app(X3,X4))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[94]) ).
cnf(96,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[95]) ).
fof(124,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ segmentP(X1,X2)
| ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) )
& ( ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| app(app(X3,X2),X4) != X1 ) )
| segmentP(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(125,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ segmentP(X5,X6)
| ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,X6),X8) = X5 ) ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X9,X6),X10) != X5 ) )
| segmentP(X5,X6) ) ) ) ),
inference(variable_rename,[status(thm)],[124]) ).
fof(126,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ segmentP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5 ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X9,X6),X10) != X5 ) )
| segmentP(X5,X6) ) ) ) ),
inference(skolemize,[status(esa)],[125]) ).
fof(127,plain,
! [X5,X6,X9,X10] :
( ( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6) )
& ( ~ segmentP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5 ) ) )
| ~ ssList(X6)
| ~ ssList(X5) ),
inference(shift_quantors,[status(thm)],[126]) ).
fof(128,plain,
! [X5,X6,X9,X10] :
( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk5_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk6_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
inference(distribute,[status(thm)],[127]) ).
cnf(132,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[128]) ).
fof(223,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(224,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[223]) ).
fof(225,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[224]) ).
fof(226,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[225]) ).
cnf(227,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[226]) ).
cnf(228,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[226]) ).
cnf(233,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[41]) ).
fof(240,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,X3),X6) = X4
& strictorderedP(X3)
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X5
| ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| app(cons(X9,nil),X10) != X3
| ~ lt(X7,X9) ) ) ) )
& ! [X11] :
( ~ ssItem(X11)
| ! [X12] :
( ~ ssList(X12)
| app(cons(X11,nil),X12) != X6
| ! [X13] :
( ~ ssItem(X13)
| ! [X14] :
( ~ ssList(X14)
| app(X14,cons(X13,nil)) != X3
| ~ lt(X13,X11) ) ) ) ) ) )
& ( nil = X4
| nil != X3 )
& ( ( nil = X2
& nil != X1 )
| ( neq(X2,nil)
& ( ~ neq(X1,nil)
| ~ segmentP(X2,X1) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[47]) ).
fof(241,negated_conjecture,
? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& ? [X17] :
( ssList(X17)
& ? [X18] :
( ssList(X18)
& X16 = X18
& X15 = X17
& ? [X19] :
( ssList(X19)
& ? [X20] :
( ssList(X20)
& app(app(X19,X17),X20) = X18
& strictorderedP(X17)
& ! [X21] :
( ~ ssItem(X21)
| ! [X22] :
( ~ ssList(X22)
| app(X22,cons(X21,nil)) != X19
| ! [X23] :
( ~ ssItem(X23)
| ! [X24] :
( ~ ssList(X24)
| app(cons(X23,nil),X24) != X17
| ~ lt(X21,X23) ) ) ) )
& ! [X25] :
( ~ ssItem(X25)
| ! [X26] :
( ~ ssList(X26)
| app(cons(X25,nil),X26) != X20
| ! [X27] :
( ~ ssItem(X27)
| ! [X28] :
( ~ ssList(X28)
| app(X28,cons(X27,nil)) != X17
| ~ lt(X27,X25) ) ) ) ) ) )
& ( nil = X18
| nil != X17 )
& ( ( nil = X16
& nil != X15 )
| ( neq(X16,nil)
& ( ~ neq(X15,nil)
| ~ segmentP(X16,X15) ) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[240]) ).
fof(242,negated_conjecture,
( ssList(esk13_0)
& ssList(esk14_0)
& ssList(esk15_0)
& ssList(esk16_0)
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& ssList(esk17_0)
& ssList(esk18_0)
& app(app(esk17_0,esk15_0),esk18_0) = esk16_0
& strictorderedP(esk15_0)
& ! [X21] :
( ~ ssItem(X21)
| ! [X22] :
( ~ ssList(X22)
| app(X22,cons(X21,nil)) != esk17_0
| ! [X23] :
( ~ ssItem(X23)
| ! [X24] :
( ~ ssList(X24)
| app(cons(X23,nil),X24) != esk15_0
| ~ lt(X21,X23) ) ) ) )
& ! [X25] :
( ~ ssItem(X25)
| ! [X26] :
( ~ ssList(X26)
| app(cons(X25,nil),X26) != esk18_0
| ! [X27] :
( ~ ssItem(X27)
| ! [X28] :
( ~ ssList(X28)
| app(X28,cons(X27,nil)) != esk15_0
| ~ lt(X27,X25) ) ) ) )
& ( nil = esk16_0
| nil != esk15_0 )
& ( ( nil = esk14_0
& nil != esk13_0 )
| ( neq(esk14_0,nil)
& ( ~ neq(esk13_0,nil)
| ~ segmentP(esk14_0,esk13_0) ) ) ) ),
inference(skolemize,[status(esa)],[241]) ).
fof(243,negated_conjecture,
! [X21,X22,X23,X24,X25,X26,X27,X28] :
( ( ~ ssList(X28)
| app(X28,cons(X27,nil)) != esk15_0
| ~ lt(X27,X25)
| ~ ssItem(X27)
| ~ ssList(X26)
| app(cons(X25,nil),X26) != esk18_0
| ~ ssItem(X25) )
& ( ~ ssList(X24)
| app(cons(X23,nil),X24) != esk15_0
| ~ lt(X21,X23)
| ~ ssItem(X23)
| ~ ssList(X22)
| app(X22,cons(X21,nil)) != esk17_0
| ~ ssItem(X21) )
& app(app(esk17_0,esk15_0),esk18_0) = esk16_0
& strictorderedP(esk15_0)
& ssList(esk18_0)
& ssList(esk17_0)
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& ( nil = esk16_0
| nil != esk15_0 )
& ( ( nil = esk14_0
& nil != esk13_0 )
| ( neq(esk14_0,nil)
& ( ~ neq(esk13_0,nil)
| ~ segmentP(esk14_0,esk13_0) ) ) )
& ssList(esk16_0)
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0) ),
inference(shift_quantors,[status(thm)],[242]) ).
fof(244,negated_conjecture,
! [X21,X22,X23,X24,X25,X26,X27,X28] :
( ( ~ ssList(X28)
| app(X28,cons(X27,nil)) != esk15_0
| ~ lt(X27,X25)
| ~ ssItem(X27)
| ~ ssList(X26)
| app(cons(X25,nil),X26) != esk18_0
| ~ ssItem(X25) )
& ( ~ ssList(X24)
| app(cons(X23,nil),X24) != esk15_0
| ~ lt(X21,X23)
| ~ ssItem(X23)
| ~ ssList(X22)
| app(X22,cons(X21,nil)) != esk17_0
| ~ ssItem(X21) )
& app(app(esk17_0,esk15_0),esk18_0) = esk16_0
& strictorderedP(esk15_0)
& ssList(esk18_0)
& ssList(esk17_0)
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& ( nil = esk16_0
| nil != esk15_0 )
& ( neq(esk14_0,nil)
| nil = esk14_0 )
& ( ~ neq(esk13_0,nil)
| ~ segmentP(esk14_0,esk13_0)
| nil = esk14_0 )
& ( neq(esk14_0,nil)
| nil != esk13_0 )
& ( ~ neq(esk13_0,nil)
| ~ segmentP(esk14_0,esk13_0)
| nil != esk13_0 )
& ssList(esk16_0)
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0) ),
inference(distribute,[status(thm)],[243]) ).
cnf(245,negated_conjecture,
ssList(esk13_0),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(246,negated_conjecture,
ssList(esk14_0),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(250,negated_conjecture,
( neq(esk14_0,nil)
| nil != esk13_0 ),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(251,negated_conjecture,
( nil = esk14_0
| ~ segmentP(esk14_0,esk13_0)
| ~ neq(esk13_0,nil) ),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(253,negated_conjecture,
( nil = esk16_0
| nil != esk15_0 ),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(254,negated_conjecture,
esk13_0 = esk15_0,
inference(split_conjunct,[status(thm)],[244]) ).
cnf(255,negated_conjecture,
esk14_0 = esk16_0,
inference(split_conjunct,[status(thm)],[244]) ).
cnf(256,negated_conjecture,
ssList(esk17_0),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(257,negated_conjecture,
ssList(esk18_0),
inference(split_conjunct,[status(thm)],[244]) ).
cnf(259,negated_conjecture,
app(app(esk17_0,esk15_0),esk18_0) = esk16_0,
inference(split_conjunct,[status(thm)],[244]) ).
cnf(267,negated_conjecture,
( esk14_0 = nil
| esk15_0 != nil ),
inference(rw,[status(thm)],[253,255,theory(equality)]) ).
cnf(268,negated_conjecture,
( esk14_0 = nil
| esk13_0 != nil ),
inference(rw,[status(thm)],[267,254,theory(equality)]) ).
cnf(271,negated_conjecture,
( neq(nil,nil)
| esk13_0 != nil ),
inference(spm,[status(thm)],[250,268,theory(equality)]) ).
cnf(272,negated_conjecture,
app(app(esk17_0,esk13_0),esk18_0) = esk16_0,
inference(rw,[status(thm)],[259,254,theory(equality)]) ).
cnf(273,negated_conjecture,
app(app(esk17_0,esk13_0),esk18_0) = esk14_0,
inference(rw,[status(thm)],[272,255,theory(equality)]) ).
cnf(285,negated_conjecture,
( esk14_0 = nil
| esk13_0 = nil
| ~ segmentP(esk14_0,esk13_0)
| ~ ssList(nil)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[251,227,theory(equality)]) ).
cnf(286,negated_conjecture,
( esk14_0 = nil
| esk13_0 = nil
| ~ segmentP(esk14_0,esk13_0)
| $false
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[285,233,theory(equality)]) ).
cnf(287,negated_conjecture,
( esk14_0 = nil
| esk13_0 = nil
| ~ segmentP(esk14_0,esk13_0)
| $false
| $false ),
inference(rw,[status(thm)],[286,245,theory(equality)]) ).
cnf(288,negated_conjecture,
( esk14_0 = nil
| esk13_0 = nil
| ~ segmentP(esk14_0,esk13_0) ),
inference(cn,[status(thm)],[287,theory(equality)]) ).
cnf(308,negated_conjecture,
( nil = esk18_0
| esk14_0 != nil
| ~ ssList(esk18_0)
| ~ ssList(app(esk17_0,esk13_0)) ),
inference(spm,[status(thm)],[69,273,theory(equality)]) ).
cnf(324,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[228,theory(equality)]) ).
cnf(407,negated_conjecture,
( segmentP(X1,esk13_0)
| esk14_0 != X1
| ~ ssList(esk18_0)
| ~ ssList(esk17_0)
| ~ ssList(esk13_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[132,273,theory(equality)]) ).
cnf(414,negated_conjecture,
( segmentP(X1,esk13_0)
| esk14_0 != X1
| ~ ssList(esk18_0)
| ~ ssList(esk17_0)
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[407,245,theory(equality)]) ).
cnf(415,negated_conjecture,
( segmentP(X1,esk13_0)
| esk14_0 != X1
| ~ ssList(esk18_0)
| ~ ssList(esk17_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[414,theory(equality)]) ).
cnf(561,negated_conjecture,
( esk14_0 = nil
| ~ segmentP(esk14_0,esk13_0) ),
inference(csr,[status(thm)],[288,268]) ).
cnf(567,negated_conjecture,
( ~ ssList(nil)
| esk13_0 != nil ),
inference(spm,[status(thm)],[324,271,theory(equality)]) ).
cnf(568,negated_conjecture,
( $false
| esk13_0 != nil ),
inference(rw,[status(thm)],[567,233,theory(equality)]) ).
cnf(569,negated_conjecture,
esk13_0 != nil,
inference(cn,[status(thm)],[568,theory(equality)]) ).
cnf(570,negated_conjecture,
( esk18_0 = nil
| esk14_0 != nil
| ~ ssList(esk18_0)
| ~ ssList(esk13_0)
| ~ ssList(esk17_0) ),
inference(spm,[status(thm)],[308,96,theory(equality)]) ).
cnf(572,negated_conjecture,
( esk18_0 = nil
| esk14_0 != nil
| ~ ssList(esk18_0)
| $false
| ~ ssList(esk17_0) ),
inference(rw,[status(thm)],[570,245,theory(equality)]) ).
cnf(573,negated_conjecture,
( esk18_0 = nil
| esk14_0 != nil
| ~ ssList(esk18_0)
| ~ ssList(esk17_0) ),
inference(cn,[status(thm)],[572,theory(equality)]) ).
cnf(577,negated_conjecture,
( esk18_0 = nil
| esk14_0 != nil
| ~ ssList(esk17_0) ),
inference(spm,[status(thm)],[573,257,theory(equality)]) ).
cnf(578,negated_conjecture,
( esk18_0 = nil
| esk14_0 != nil ),
inference(spm,[status(thm)],[577,256,theory(equality)]) ).
cnf(580,negated_conjecture,
( app(app(esk17_0,esk13_0),nil) = esk14_0
| esk14_0 != nil ),
inference(spm,[status(thm)],[273,578,theory(equality)]) ).
cnf(599,negated_conjecture,
( esk14_0 = app(esk17_0,esk13_0)
| ~ ssList(app(esk17_0,esk13_0))
| esk14_0 != nil ),
inference(spm,[status(thm)],[62,580,theory(equality)]) ).
cnf(652,negated_conjecture,
( app(esk17_0,esk13_0) = esk14_0
| esk14_0 != nil
| ~ ssList(esk13_0)
| ~ ssList(esk17_0) ),
inference(spm,[status(thm)],[599,96,theory(equality)]) ).
cnf(654,negated_conjecture,
( app(esk17_0,esk13_0) = esk14_0
| esk14_0 != nil
| $false
| ~ ssList(esk17_0) ),
inference(rw,[status(thm)],[652,245,theory(equality)]) ).
cnf(655,negated_conjecture,
( app(esk17_0,esk13_0) = esk14_0
| esk14_0 != nil
| ~ ssList(esk17_0) ),
inference(cn,[status(thm)],[654,theory(equality)]) ).
cnf(681,negated_conjecture,
( nil = esk13_0
| esk14_0 != nil
| ~ ssList(esk13_0)
| ~ ssList(esk17_0) ),
inference(spm,[status(thm)],[69,655,theory(equality)]) ).
cnf(699,negated_conjecture,
( nil = esk13_0
| esk14_0 != nil
| $false
| ~ ssList(esk17_0) ),
inference(rw,[status(thm)],[681,245,theory(equality)]) ).
cnf(700,negated_conjecture,
( nil = esk13_0
| esk14_0 != nil
| ~ ssList(esk17_0) ),
inference(cn,[status(thm)],[699,theory(equality)]) ).
cnf(701,negated_conjecture,
( esk14_0 != nil
| ~ ssList(esk17_0) ),
inference(sr,[status(thm)],[700,569,theory(equality)]) ).
cnf(734,negated_conjecture,
esk14_0 != nil,
inference(spm,[status(thm)],[701,256,theory(equality)]) ).
cnf(985,negated_conjecture,
( esk14_0 = nil
| ~ ssList(esk18_0)
| ~ ssList(esk17_0)
| ~ ssList(esk14_0) ),
inference(spm,[status(thm)],[561,415,theory(equality)]) ).
cnf(994,negated_conjecture,
( esk14_0 = nil
| ~ ssList(esk18_0)
| ~ ssList(esk17_0)
| $false ),
inference(rw,[status(thm)],[985,246,theory(equality)]) ).
cnf(995,negated_conjecture,
( esk14_0 = nil
| ~ ssList(esk18_0)
| ~ ssList(esk17_0) ),
inference(cn,[status(thm)],[994,theory(equality)]) ).
cnf(996,negated_conjecture,
( ~ ssList(esk18_0)
| ~ ssList(esk17_0) ),
inference(sr,[status(thm)],[995,734,theory(equality)]) ).
cnf(1008,negated_conjecture,
~ ssList(esk17_0),
inference(spm,[status(thm)],[996,257,theory(equality)]) ).
cnf(1022,negated_conjecture,
$false,
inference(sr,[status(thm)],[256,1008,theory(equality)]) ).
cnf(1023,negated_conjecture,
$false,
1022,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC112+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpl1XXLH/sel_SWC112+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC112+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC112+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC112+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------