TSTP Solution File: SWC389+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC389+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 11:41:45 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 7
% Syntax : Number of formulae : 92 ( 20 unt; 0 def)
% Number of atoms : 504 ( 143 equ)
% Maximal formula atoms : 46 ( 5 avg)
% Number of connectives : 661 ( 249 ~; 251 |; 134 &)
% ( 4 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 133 ( 0 sgn 86 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/tmp/tmpYtDBpo/sel_SWC389+1.p_1',ax21) ).
fof(15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/tmp/tmpYtDBpo/sel_SWC389+1.p_1',ax7) ).
fof(16,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/tmp/tmpYtDBpo/sel_SWC389+1.p_1',ax4) ).
fof(24,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpYtDBpo/sel_SWC389+1.p_1',ax58) ).
fof(27,axiom,
ssList(nil),
file('/tmp/tmpYtDBpo/sel_SWC389+1.p_1',ax17) ).
fof(37,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpYtDBpo/sel_SWC389+1.p_1',ax15) ).
fof(41,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( segmentP(X2,X1)
& ( ~ neq(X2,nil)
| singletonP(X1) ) ) ) ) ) ),
file('/tmp/tmpYtDBpo/sel_SWC389+1.p_1',co1) ).
fof(42,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( segmentP(X2,X1)
& ( ~ neq(X2,nil)
| singletonP(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[41]) ).
fof(47,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| cons(X5,nil) != X3
| app(app(X6,X3),X7) != X4
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X5,X8) )
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& lt(X9,X5) ) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( segmentP(X2,X1)
& ( ~ neq(X2,nil)
| singletonP(X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[42,theory(equality)]) ).
fof(85,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| nil != cons(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(86,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3) ) ),
inference(variable_rename,[status(thm)],[85]) ).
fof(87,plain,
! [X3,X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[86]) ).
cnf(88,plain,
( ~ ssList(X1)
| nil != cons(X2,X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[87]) ).
fof(114,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)],[15]) ).
fof(115,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)],[114]) ).
fof(116,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ segmentP(X5,X6)
| ( ssList(esk7_2(X5,X6))
& ssList(esk8_2(X5,X6))
& app(app(esk7_2(X5,X6),X6),esk8_2(X5,X6)) = X5 ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X9,X6),X10) != X5 ) )
| segmentP(X5,X6) ) ) ) ),
inference(skolemize,[status(esa)],[115]) ).
fof(117,plain,
! [X5,X6,X9,X10] :
( ( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6) )
& ( ~ segmentP(X5,X6)
| ( ssList(esk7_2(X5,X6))
& ssList(esk8_2(X5,X6))
& app(app(esk7_2(X5,X6),X6),esk8_2(X5,X6)) = X5 ) ) )
| ~ ssList(X6)
| ~ ssList(X5) ),
inference(shift_quantors,[status(thm)],[116]) ).
fof(118,plain,
! [X5,X6,X9,X10] :
( ( ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| ~ ssList(X9)
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk7_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk8_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk7_2(X5,X6),X6),esk8_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
inference(distribute,[status(thm)],[117]) ).
cnf(122,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[118]) ).
fof(123,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ singletonP(X1)
| ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) )
& ( ! [X2] :
( ~ ssItem(X2)
| cons(X2,nil) != X1 )
| singletonP(X1) ) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(124,plain,
! [X3] :
( ~ ssList(X3)
| ( ( ~ singletonP(X3)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X3 ) )
& ( ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X3 )
| singletonP(X3) ) ) ),
inference(variable_rename,[status(thm)],[123]) ).
fof(125,plain,
! [X3] :
( ~ ssList(X3)
| ( ( ~ singletonP(X3)
| ( ssItem(esk9_1(X3))
& cons(esk9_1(X3),nil) = X3 ) )
& ( ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X3 )
| singletonP(X3) ) ) ),
inference(skolemize,[status(esa)],[124]) ).
fof(126,plain,
! [X3,X5] :
( ( ( ~ ssItem(X5)
| cons(X5,nil) != X3
| singletonP(X3) )
& ( ~ singletonP(X3)
| ( ssItem(esk9_1(X3))
& cons(esk9_1(X3),nil) = X3 ) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[125]) ).
fof(127,plain,
! [X3,X5] :
( ( ~ ssItem(X5)
| cons(X5,nil) != X3
| singletonP(X3)
| ~ ssList(X3) )
& ( ssItem(esk9_1(X3))
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( cons(esk9_1(X3),nil) = X3
| ~ singletonP(X3)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[126]) ).
cnf(130,plain,
( singletonP(X1)
| ~ ssList(X1)
| cons(X2,nil) != X1
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[127]) ).
fof(154,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(nil,X1)
| nil = X1 )
& ( nil != X1
| segmentP(nil,X1) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(155,plain,
! [X2] :
( ~ ssList(X2)
| ( ( ~ segmentP(nil,X2)
| nil = X2 )
& ( nil != X2
| segmentP(nil,X2) ) ) ),
inference(variable_rename,[status(thm)],[154]) ).
fof(156,plain,
! [X2] :
( ( ~ segmentP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| segmentP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[155]) ).
cnf(157,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[156]) ).
cnf(167,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[27]) ).
fof(213,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(214,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[213]) ).
fof(215,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[214]) ).
fof(216,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)],[215]) ).
cnf(218,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[216]) ).
fof(232,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& cons(X5,nil) = X3
& app(app(X6,X3),X7) = X4
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X5,X8) )
& ! [X9] :
( ~ ssItem(X9)
| ~ memberP(X7,X9)
| ~ lt(X9,X5) ) ) ) )
| ( nil = X4
& nil = X3 ) )
& ( ~ segmentP(X2,X1)
| ( neq(X2,nil)
& ~ singletonP(X1) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[47]) ).
fof(233,negated_conjecture,
? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& X11 = X13
& X10 = X12
& ( ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& cons(X14,nil) = X12
& app(app(X15,X12),X16) = X13
& ! [X17] :
( ~ ssItem(X17)
| ~ memberP(X15,X17)
| ~ lt(X14,X17) )
& ! [X18] :
( ~ ssItem(X18)
| ~ memberP(X16,X18)
| ~ lt(X18,X14) ) ) ) )
| ( nil = X13
& nil = X12 ) )
& ( ~ segmentP(X11,X10)
| ( neq(X11,nil)
& ~ singletonP(X10) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[232]) ).
fof(234,negated_conjecture,
( ssList(esk10_0)
& ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& esk11_0 = esk13_0
& esk10_0 = esk12_0
& ( ( ssItem(esk14_0)
& ssList(esk15_0)
& ssList(esk16_0)
& cons(esk14_0,nil) = esk12_0
& app(app(esk15_0,esk12_0),esk16_0) = esk13_0
& ! [X17] :
( ~ ssItem(X17)
| ~ memberP(esk15_0,X17)
| ~ lt(esk14_0,X17) )
& ! [X18] :
( ~ ssItem(X18)
| ~ memberP(esk16_0,X18)
| ~ lt(X18,esk14_0) ) )
| ( nil = esk13_0
& nil = esk12_0 ) )
& ( ~ segmentP(esk11_0,esk10_0)
| ( neq(esk11_0,nil)
& ~ singletonP(esk10_0) ) ) ),
inference(skolemize,[status(esa)],[233]) ).
fof(235,negated_conjecture,
! [X17,X18] :
( ( ( ( ~ ssItem(X18)
| ~ memberP(esk16_0,X18)
| ~ lt(X18,esk14_0) )
& ( ~ ssItem(X17)
| ~ memberP(esk15_0,X17)
| ~ lt(esk14_0,X17) )
& ssList(esk16_0)
& cons(esk14_0,nil) = esk12_0
& app(app(esk15_0,esk12_0),esk16_0) = esk13_0
& ssList(esk15_0)
& ssItem(esk14_0) )
| ( nil = esk13_0
& nil = esk12_0 ) )
& ssList(esk13_0)
& esk11_0 = esk13_0
& esk10_0 = esk12_0
& ( ~ segmentP(esk11_0,esk10_0)
| ( neq(esk11_0,nil)
& ~ singletonP(esk10_0) ) )
& ssList(esk12_0)
& ssList(esk11_0)
& ssList(esk10_0) ),
inference(shift_quantors,[status(thm)],[234]) ).
fof(236,negated_conjecture,
! [X17,X18] :
( ( nil = esk13_0
| ~ ssItem(X18)
| ~ memberP(esk16_0,X18)
| ~ lt(X18,esk14_0) )
& ( nil = esk12_0
| ~ ssItem(X18)
| ~ memberP(esk16_0,X18)
| ~ lt(X18,esk14_0) )
& ( nil = esk13_0
| ~ ssItem(X17)
| ~ memberP(esk15_0,X17)
| ~ lt(esk14_0,X17) )
& ( nil = esk12_0
| ~ ssItem(X17)
| ~ memberP(esk15_0,X17)
| ~ lt(esk14_0,X17) )
& ( nil = esk13_0
| ssList(esk16_0) )
& ( nil = esk12_0
| ssList(esk16_0) )
& ( nil = esk13_0
| cons(esk14_0,nil) = esk12_0 )
& ( nil = esk12_0
| cons(esk14_0,nil) = esk12_0 )
& ( nil = esk13_0
| app(app(esk15_0,esk12_0),esk16_0) = esk13_0 )
& ( nil = esk12_0
| app(app(esk15_0,esk12_0),esk16_0) = esk13_0 )
& ( nil = esk13_0
| ssList(esk15_0) )
& ( nil = esk12_0
| ssList(esk15_0) )
& ( nil = esk13_0
| ssItem(esk14_0) )
& ( nil = esk12_0
| ssItem(esk14_0) )
& ssList(esk13_0)
& esk11_0 = esk13_0
& esk10_0 = esk12_0
& ( neq(esk11_0,nil)
| ~ segmentP(esk11_0,esk10_0) )
& ( ~ singletonP(esk10_0)
| ~ segmentP(esk11_0,esk10_0) )
& ssList(esk12_0)
& ssList(esk11_0)
& ssList(esk10_0) ),
inference(distribute,[status(thm)],[235]) ).
cnf(237,negated_conjecture,
ssList(esk10_0),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(238,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(240,negated_conjecture,
( ~ segmentP(esk11_0,esk10_0)
| ~ singletonP(esk10_0) ),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(241,negated_conjecture,
( neq(esk11_0,nil)
| ~ segmentP(esk11_0,esk10_0) ),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(242,negated_conjecture,
esk10_0 = esk12_0,
inference(split_conjunct,[status(thm)],[236]) ).
cnf(243,negated_conjecture,
esk11_0 = esk13_0,
inference(split_conjunct,[status(thm)],[236]) ).
cnf(245,negated_conjecture,
( ssItem(esk14_0)
| nil = esk12_0 ),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(246,negated_conjecture,
( ssItem(esk14_0)
| nil = esk13_0 ),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(247,negated_conjecture,
( ssList(esk15_0)
| nil = esk12_0 ),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(249,negated_conjecture,
( app(app(esk15_0,esk12_0),esk16_0) = esk13_0
| nil = esk12_0 ),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(251,negated_conjecture,
( cons(esk14_0,nil) = esk12_0
| nil = esk12_0 ),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(252,negated_conjecture,
( cons(esk14_0,nil) = esk12_0
| nil = esk13_0 ),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(253,negated_conjecture,
( ssList(esk16_0)
| nil = esk12_0 ),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(259,negated_conjecture,
ssList(esk12_0),
inference(rw,[status(thm)],[237,242,theory(equality)]) ).
cnf(260,negated_conjecture,
ssList(esk13_0),
inference(rw,[status(thm)],[238,243,theory(equality)]) ).
cnf(261,negated_conjecture,
( ~ singletonP(esk12_0)
| ~ segmentP(esk11_0,esk10_0) ),
inference(rw,[status(thm)],[240,242,theory(equality)]) ).
cnf(262,negated_conjecture,
( ~ singletonP(esk12_0)
| ~ segmentP(esk13_0,esk12_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[261,243,theory(equality)]),242,theory(equality)]) ).
cnf(263,negated_conjecture,
( neq(esk13_0,nil)
| ~ segmentP(esk11_0,esk10_0) ),
inference(rw,[status(thm)],[241,243,theory(equality)]) ).
cnf(264,negated_conjecture,
( neq(esk13_0,nil)
| ~ segmentP(esk13_0,esk12_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[263,243,theory(equality)]),242,theory(equality)]) ).
cnf(281,negated_conjecture,
( esk13_0 = nil
| esk12_0 != nil
| ~ ssItem(esk14_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[88,252,theory(equality)]) ).
cnf(284,negated_conjecture,
( esk13_0 = nil
| esk12_0 != nil
| ~ ssItem(esk14_0)
| $false ),
inference(rw,[status(thm)],[281,167,theory(equality)]) ).
cnf(285,negated_conjecture,
( esk13_0 = nil
| esk12_0 != nil
| ~ ssItem(esk14_0) ),
inference(cn,[status(thm)],[284,theory(equality)]) ).
cnf(304,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[218,theory(equality)]) ).
cnf(307,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[130,theory(equality)]) ).
cnf(652,negated_conjecture,
( esk13_0 = nil
| esk12_0 != nil ),
inference(csr,[status(thm)],[285,246]) ).
cnf(654,negated_conjecture,
( neq(nil,nil)
| ~ segmentP(nil,esk12_0)
| esk12_0 != nil ),
inference(spm,[status(thm)],[264,652,theory(equality)]) ).
cnf(659,negated_conjecture,
( ~ ssList(nil)
| esk12_0 != nil
| ~ segmentP(nil,esk12_0) ),
inference(spm,[status(thm)],[304,654,theory(equality)]) ).
cnf(661,negated_conjecture,
( $false
| esk12_0 != nil
| ~ segmentP(nil,esk12_0) ),
inference(rw,[status(thm)],[659,167,theory(equality)]) ).
cnf(662,negated_conjecture,
( esk12_0 != nil
| ~ segmentP(nil,esk12_0) ),
inference(cn,[status(thm)],[661,theory(equality)]) ).
cnf(663,negated_conjecture,
( esk12_0 != nil
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[662,157,theory(equality)]) ).
cnf(664,negated_conjecture,
( esk12_0 != nil
| $false ),
inference(rw,[status(thm)],[663,259,theory(equality)]) ).
cnf(665,negated_conjecture,
esk12_0 != nil,
inference(cn,[status(thm)],[664,theory(equality)]) ).
cnf(667,negated_conjecture,
ssList(esk15_0),
inference(sr,[status(thm)],[247,665,theory(equality)]) ).
cnf(668,negated_conjecture,
ssList(esk16_0),
inference(sr,[status(thm)],[253,665,theory(equality)]) ).
cnf(669,negated_conjecture,
ssItem(esk14_0),
inference(sr,[status(thm)],[245,665,theory(equality)]) ).
cnf(670,negated_conjecture,
cons(esk14_0,nil) = esk12_0,
inference(sr,[status(thm)],[251,665,theory(equality)]) ).
cnf(671,negated_conjecture,
app(app(esk15_0,esk12_0),esk16_0) = esk13_0,
inference(sr,[status(thm)],[249,665,theory(equality)]) ).
cnf(745,negated_conjecture,
( segmentP(X1,esk12_0)
| esk13_0 != X1
| ~ ssList(esk16_0)
| ~ ssList(esk15_0)
| ~ ssList(esk12_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[122,671,theory(equality)]) ).
cnf(785,negated_conjecture,
( segmentP(X1,esk12_0)
| esk13_0 != X1
| $false
| ~ ssList(esk15_0)
| ~ ssList(esk12_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[745,668,theory(equality)]) ).
cnf(786,negated_conjecture,
( segmentP(X1,esk12_0)
| esk13_0 != X1
| $false
| $false
| ~ ssList(esk12_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[785,667,theory(equality)]) ).
cnf(787,negated_conjecture,
( segmentP(X1,esk12_0)
| esk13_0 != X1
| $false
| $false
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[786,259,theory(equality)]) ).
cnf(788,negated_conjecture,
( segmentP(X1,esk12_0)
| esk13_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[787,theory(equality)]) ).
cnf(795,negated_conjecture,
( singletonP(esk12_0)
| ~ ssItem(esk14_0)
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[307,670,theory(equality)]) ).
cnf(797,negated_conjecture,
( singletonP(esk12_0)
| $false
| ~ ssList(esk12_0) ),
inference(rw,[status(thm)],[795,669,theory(equality)]) ).
cnf(798,negated_conjecture,
( singletonP(esk12_0)
| $false
| $false ),
inference(rw,[status(thm)],[797,259,theory(equality)]) ).
cnf(799,negated_conjecture,
singletonP(esk12_0),
inference(cn,[status(thm)],[798,theory(equality)]) ).
cnf(800,negated_conjecture,
( $false
| ~ segmentP(esk13_0,esk12_0) ),
inference(rw,[status(thm)],[262,799,theory(equality)]) ).
cnf(801,negated_conjecture,
~ segmentP(esk13_0,esk12_0),
inference(cn,[status(thm)],[800,theory(equality)]) ).
cnf(903,negated_conjecture,
~ ssList(esk13_0),
inference(spm,[status(thm)],[801,788,theory(equality)]) ).
cnf(908,negated_conjecture,
$false,
inference(rw,[status(thm)],[903,260,theory(equality)]) ).
cnf(909,negated_conjecture,
$false,
inference(cn,[status(thm)],[908,theory(equality)]) ).
cnf(910,negated_conjecture,
$false,
909,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC389+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpYtDBpo/sel_SWC389+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC389+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC389+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC389+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
%
%------------------------------------------------------------------------------