TSTP Solution File: SWC014+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC014+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:05:26 EST 2010
% Result : Theorem 0.51s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 50
% Number of leaves : 10
% Syntax : Number of formulae : 121 ( 21 unt; 0 def)
% Number of atoms : 540 ( 238 equ)
% Maximal formula atoms : 40 ( 4 avg)
% Number of connectives : 685 ( 266 ~; 287 |; 96 &)
% ( 2 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 136 ( 0 sgn 81 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/tmp/tmpG_cV-G/sel_SWC014+1.p_1',ax86) ).
fof(4,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmpG_cV-G/sel_SWC014+1.p_1',ax83) ).
fof(8,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmpG_cV-G/sel_SWC014+1.p_1',ax28) ).
fof(9,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/tmp/tmpG_cV-G/sel_SWC014+1.p_1',ax25) ).
fof(13,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/tmp/tmpG_cV-G/sel_SWC014+1.p_1',ax21) ).
fof(16,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/tmp/tmpG_cV-G/sel_SWC014+1.p_1',ax22) ).
fof(22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/tmp/tmpG_cV-G/sel_SWC014+1.p_1',ax78) ).
fof(24,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpG_cV-G/sel_SWC014+1.p_1',ax15) ).
fof(26,axiom,
ssList(nil),
file('/tmp/tmpG_cV-G/sel_SWC014+1.p_1',ax17) ).
fof(29,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X2 = X5
& ? [X6] :
( ssList(X6)
& tl(X2) = X6
& app(X1,X6) = X5
& neq(nil,X2) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( cons(X7,nil) != X3
| app(cons(X7,nil),X8) != X4 ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/tmp/tmpG_cV-G/sel_SWC014+1.p_1',co1) ).
fof(30,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X2 = X5
& ? [X6] :
( ssList(X6)
& tl(X2) = X6
& app(X1,X6) = X5
& neq(nil,X2) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( cons(X7,nil) != X3
| app(cons(X7,nil),X8) != X4 ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[29]) ).
fof(31,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X2 = X5
& ? [X6] :
( ssList(X6)
& tl(X2) = X6
& app(X1,X6) = X5
& neq(nil,X2) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( cons(X7,nil) != X3
| app(cons(X7,nil),X8) != X4 ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[30,theory(equality)]) ).
fof(32,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(33,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| nil = X3
| tl(app(X3,X4)) = app(tl(X3),X4) ) ),
inference(variable_rename,[status(thm)],[32]) ).
fof(34,plain,
! [X3,X4] :
( ~ ssList(X4)
| nil = X3
| tl(app(X3,X4)) = app(tl(X3),X4)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[33]) ).
cnf(35,plain,
( tl(app(X1,X2)) = app(tl(X1),X2)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[34]) ).
fof(43,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)],[4]) ).
fof(44,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)],[43]) ).
fof(45,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)],[44]) ).
fof(46,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)],[45]) ).
cnf(48,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[46]) ).
fof(62,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(63,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[62]) ).
cnf(64,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[63]) ).
fof(65,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| tl(cons(X2,X1)) = X1 ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(66,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| tl(cons(X4,X3)) = X3 ) ),
inference(variable_rename,[status(thm)],[65]) ).
fof(67,plain,
! [X3,X4] :
( ~ ssItem(X4)
| tl(cons(X4,X3)) = X3
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[66]) ).
cnf(68,plain,
( tl(cons(X2,X1)) = X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[67]) ).
fof(80,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| nil != cons(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(81,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3) ) ),
inference(variable_rename,[status(thm)],[80]) ).
fof(82,plain,
! [X3,X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[81]) ).
cnf(83,plain,
( ~ ssList(X1)
| nil != cons(X2,X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[82]) ).
fof(95,plain,
! [X1] :
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(96,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[95]) ).
cnf(97,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[96]) ).
fof(125,plain,
! [X1] :
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(126,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| cons(hd(X2),tl(X2)) = X2 ),
inference(variable_rename,[status(thm)],[125]) ).
cnf(127,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[126]) ).
fof(132,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(133,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[132]) ).
fof(134,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[133]) ).
fof(135,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)],[134]) ).
cnf(136,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[135]) ).
cnf(142,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[26]) ).
fof(153,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( ( neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| X2 != X5
| ! [X6] :
( ~ ssList(X6)
| tl(X2) != X6
| app(X1,X6) != X5
| ~ neq(nil,X2) ) )
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& cons(X7,nil) = X3
& app(cons(X7,nil),X8) = X4 ) ) )
| ( neq(X2,nil)
& ~ neq(X4,nil) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(154,negated_conjecture,
? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& X10 = X12
& X9 = X11
& ( ( neq(X10,nil)
& ! [X13] :
( ~ ssList(X13)
| X10 != X13
| ! [X14] :
( ~ ssList(X14)
| tl(X10) != X14
| app(X9,X14) != X13
| ~ neq(nil,X10) ) )
& ? [X15] :
( ssItem(X15)
& ? [X16] :
( ssList(X16)
& cons(X15,nil) = X11
& app(cons(X15,nil),X16) = X12 ) ) )
| ( neq(X10,nil)
& ~ neq(X12,nil) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[153]) ).
fof(155,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( ( neq(esk8_0,nil)
& ! [X13] :
( ~ ssList(X13)
| esk8_0 != X13
| ! [X14] :
( ~ ssList(X14)
| tl(esk8_0) != X14
| app(esk7_0,X14) != X13
| ~ neq(nil,esk8_0) ) )
& ssItem(esk11_0)
& ssList(esk12_0)
& cons(esk11_0,nil) = esk9_0
& app(cons(esk11_0,nil),esk12_0) = esk10_0 )
| ( neq(esk8_0,nil)
& ~ neq(esk10_0,nil) ) ) ),
inference(skolemize,[status(esa)],[154]) ).
fof(156,negated_conjecture,
! [X13,X14] :
( ( ( ( ~ ssList(X14)
| tl(esk8_0) != X14
| app(esk7_0,X14) != X13
| ~ neq(nil,esk8_0)
| ~ ssList(X13)
| esk8_0 != X13 )
& neq(esk8_0,nil)
& ssItem(esk11_0)
& ssList(esk12_0)
& cons(esk11_0,nil) = esk9_0
& app(cons(esk11_0,nil),esk12_0) = esk10_0 )
| ( neq(esk8_0,nil)
& ~ neq(esk10_0,nil) ) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[155]) ).
fof(157,negated_conjecture,
! [X13,X14] :
( ( neq(esk8_0,nil)
| ~ ssList(X14)
| tl(esk8_0) != X14
| app(esk7_0,X14) != X13
| ~ neq(nil,esk8_0)
| ~ ssList(X13)
| esk8_0 != X13 )
& ( ~ neq(esk10_0,nil)
| ~ ssList(X14)
| tl(esk8_0) != X14
| app(esk7_0,X14) != X13
| ~ neq(nil,esk8_0)
| ~ ssList(X13)
| esk8_0 != X13 )
& ( neq(esk8_0,nil)
| neq(esk8_0,nil) )
& ( ~ neq(esk10_0,nil)
| neq(esk8_0,nil) )
& ( neq(esk8_0,nil)
| ssItem(esk11_0) )
& ( ~ neq(esk10_0,nil)
| ssItem(esk11_0) )
& ( neq(esk8_0,nil)
| ssList(esk12_0) )
& ( ~ neq(esk10_0,nil)
| ssList(esk12_0) )
& ( neq(esk8_0,nil)
| cons(esk11_0,nil) = esk9_0 )
& ( ~ neq(esk10_0,nil)
| cons(esk11_0,nil) = esk9_0 )
& ( neq(esk8_0,nil)
| app(cons(esk11_0,nil),esk12_0) = esk10_0 )
& ( ~ neq(esk10_0,nil)
| app(cons(esk11_0,nil),esk12_0) = esk10_0 )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[156]) ).
cnf(158,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(159,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(162,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[157]) ).
cnf(163,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[157]) ).
cnf(164,negated_conjecture,
( app(cons(esk11_0,nil),esk12_0) = esk10_0
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(166,negated_conjecture,
( cons(esk11_0,nil) = esk9_0
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(168,negated_conjecture,
( ssList(esk12_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(170,negated_conjecture,
( ssItem(esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(173,negated_conjecture,
( neq(esk8_0,nil)
| neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(174,negated_conjecture,
( esk8_0 != X1
| ~ ssList(X1)
| ~ neq(nil,esk8_0)
| app(esk7_0,X2) != X1
| tl(esk8_0) != X2
| ~ ssList(X2)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(182,negated_conjecture,
( ssList(esk12_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[168,163,theory(equality)]),173,theory(equality)]) ).
cnf(183,negated_conjecture,
ssList(esk12_0),
inference(cn,[status(thm)],[182,theory(equality)]) ).
cnf(184,negated_conjecture,
( ssItem(esk11_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[170,163,theory(equality)]),173,theory(equality)]) ).
cnf(185,negated_conjecture,
ssItem(esk11_0),
inference(cn,[status(thm)],[184,theory(equality)]) ).
cnf(197,negated_conjecture,
( cons(esk11_0,nil) = esk7_0
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[166,162,theory(equality)]) ).
cnf(198,negated_conjecture,
( cons(esk11_0,nil) = esk7_0
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[197,163,theory(equality)]),173,theory(equality)]) ).
cnf(199,negated_conjecture,
cons(esk11_0,nil) = esk7_0,
inference(cn,[status(thm)],[198,theory(equality)]) ).
cnf(210,negated_conjecture,
( app(esk7_0,esk12_0) = esk10_0
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[164,199,theory(equality)]) ).
cnf(211,negated_conjecture,
( app(esk7_0,esk12_0) = esk8_0
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[210,163,theory(equality)]) ).
cnf(212,negated_conjecture,
( app(esk7_0,esk12_0) = esk8_0
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[211,163,theory(equality)]),173,theory(equality)]) ).
cnf(213,negated_conjecture,
app(esk7_0,esk12_0) = esk8_0,
inference(cn,[status(thm)],[212,theory(equality)]) ).
cnf(219,negated_conjecture,
( tl(esk7_0) = nil
| ~ ssItem(esk11_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[68,199,theory(equality)]) ).
cnf(221,negated_conjecture,
( tl(esk7_0) = nil
| $false
| ~ ssList(nil) ),
inference(rw,[status(thm)],[219,185,theory(equality)]) ).
cnf(222,negated_conjecture,
( tl(esk7_0) = nil
| $false
| $false ),
inference(rw,[status(thm)],[221,142,theory(equality)]) ).
cnf(223,negated_conjecture,
tl(esk7_0) = nil,
inference(cn,[status(thm)],[222,theory(equality)]) ).
cnf(224,negated_conjecture,
( esk7_0 != nil
| ~ ssItem(esk11_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[83,199,theory(equality)]) ).
cnf(225,negated_conjecture,
( esk7_0 != nil
| $false
| ~ ssList(nil) ),
inference(rw,[status(thm)],[224,185,theory(equality)]) ).
cnf(226,negated_conjecture,
( esk7_0 != nil
| $false
| $false ),
inference(rw,[status(thm)],[225,142,theory(equality)]) ).
cnf(227,negated_conjecture,
esk7_0 != nil,
inference(cn,[status(thm)],[226,theory(equality)]) ).
cnf(241,negated_conjecture,
( nil = esk7_0
| esk8_0 != nil
| ~ ssList(esk12_0)
| ~ ssList(esk7_0) ),
inference(spm,[status(thm)],[48,213,theory(equality)]) ).
cnf(243,negated_conjecture,
( nil = esk7_0
| esk8_0 != nil
| $false
| ~ ssList(esk7_0) ),
inference(rw,[status(thm)],[241,183,theory(equality)]) ).
cnf(244,negated_conjecture,
( nil = esk7_0
| esk8_0 != nil
| $false
| $false ),
inference(rw,[status(thm)],[243,158,theory(equality)]) ).
cnf(245,negated_conjecture,
( nil = esk7_0
| esk8_0 != nil ),
inference(cn,[status(thm)],[244,theory(equality)]) ).
cnf(325,negated_conjecture,
( tl(esk8_0) = app(tl(esk7_0),esk12_0)
| nil = esk7_0
| ~ ssList(esk12_0)
| ~ ssList(esk7_0) ),
inference(spm,[status(thm)],[35,213,theory(equality)]) ).
cnf(330,negated_conjecture,
( tl(esk8_0) = app(tl(esk7_0),esk12_0)
| nil = esk7_0
| $false
| ~ ssList(esk7_0) ),
inference(rw,[status(thm)],[325,183,theory(equality)]) ).
cnf(331,negated_conjecture,
( tl(esk8_0) = app(tl(esk7_0),esk12_0)
| nil = esk7_0
| $false
| $false ),
inference(rw,[status(thm)],[330,158,theory(equality)]) ).
cnf(332,negated_conjecture,
( tl(esk8_0) = app(tl(esk7_0),esk12_0)
| nil = esk7_0 ),
inference(cn,[status(thm)],[331,theory(equality)]) ).
cnf(413,negated_conjecture,
( esk8_0 != X1
| tl(esk8_0) != X2
| app(esk7_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk8_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[174,163,theory(equality)]),173,theory(equality)]) ).
cnf(414,negated_conjecture,
( esk8_0 != X1
| tl(esk8_0) != X2
| app(esk7_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk8_0) ),
inference(cn,[status(thm)],[413,theory(equality)]) ).
cnf(436,negated_conjecture,
esk8_0 != nil,
inference(sr,[status(thm)],[245,227,theory(equality)]) ).
cnf(478,negated_conjecture,
( app(nil,esk12_0) = tl(esk8_0)
| esk7_0 = nil ),
inference(rw,[status(thm)],[332,223,theory(equality)]) ).
cnf(479,negated_conjecture,
tl(esk8_0) = app(nil,esk12_0),
inference(sr,[status(thm)],[478,227,theory(equality)]) ).
cnf(481,negated_conjecture,
( cons(hd(esk8_0),app(nil,esk12_0)) = esk8_0
| nil = esk8_0
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[127,479,theory(equality)]) ).
cnf(484,negated_conjecture,
( app(esk7_0,X1) != X2
| app(nil,esk12_0) != X1
| esk8_0 != X2
| ~ neq(nil,esk8_0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[414,479,theory(equality)]) ).
cnf(488,negated_conjecture,
( cons(hd(esk8_0),app(nil,esk12_0)) = esk8_0
| nil = esk8_0
| $false ),
inference(rw,[status(thm)],[481,159,theory(equality)]) ).
cnf(489,negated_conjecture,
( cons(hd(esk8_0),app(nil,esk12_0)) = esk8_0
| nil = esk8_0 ),
inference(cn,[status(thm)],[488,theory(equality)]) ).
cnf(490,negated_conjecture,
cons(hd(esk8_0),app(nil,esk12_0)) = esk8_0,
inference(sr,[status(thm)],[489,436,theory(equality)]) ).
cnf(508,negated_conjecture,
( cons(hd(esk8_0),esk12_0) = esk8_0
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[490,64,theory(equality)]) ).
cnf(518,negated_conjecture,
( cons(hd(esk8_0),esk12_0) = esk8_0
| $false ),
inference(rw,[status(thm)],[508,183,theory(equality)]) ).
cnf(519,negated_conjecture,
cons(hd(esk8_0),esk12_0) = esk8_0,
inference(cn,[status(thm)],[518,theory(equality)]) ).
cnf(542,negated_conjecture,
( tl(esk8_0) = esk12_0
| ~ ssItem(hd(esk8_0))
| ~ ssList(esk12_0) ),
inference(spm,[status(thm)],[68,519,theory(equality)]) ).
cnf(552,negated_conjecture,
( app(nil,esk12_0) = esk12_0
| ~ ssItem(hd(esk8_0))
| ~ ssList(esk12_0) ),
inference(rw,[status(thm)],[542,479,theory(equality)]) ).
cnf(553,negated_conjecture,
( app(nil,esk12_0) = esk12_0
| ~ ssItem(hd(esk8_0))
| $false ),
inference(rw,[status(thm)],[552,183,theory(equality)]) ).
cnf(554,negated_conjecture,
( app(nil,esk12_0) = esk12_0
| ~ ssItem(hd(esk8_0)) ),
inference(cn,[status(thm)],[553,theory(equality)]) ).
cnf(567,negated_conjecture,
( app(nil,esk12_0) = esk12_0
| nil = esk8_0
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[554,97,theory(equality)]) ).
cnf(568,negated_conjecture,
( app(nil,esk12_0) = esk12_0
| nil = esk8_0
| $false ),
inference(rw,[status(thm)],[567,159,theory(equality)]) ).
cnf(569,negated_conjecture,
( app(nil,esk12_0) = esk12_0
| nil = esk8_0 ),
inference(cn,[status(thm)],[568,theory(equality)]) ).
cnf(570,negated_conjecture,
app(nil,esk12_0) = esk12_0,
inference(sr,[status(thm)],[569,436,theory(equality)]) ).
cnf(585,negated_conjecture,
( esk12_0 != X1
| app(esk7_0,X1) != X2
| esk8_0 != X2
| ~ neq(nil,esk8_0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[484,570,theory(equality)]) ).
cnf(638,negated_conjecture,
( nil = esk8_0
| app(esk7_0,X1) != X2
| esk12_0 != X1
| esk8_0 != X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(esk8_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[585,136,theory(equality)]) ).
cnf(640,negated_conjecture,
( nil = esk8_0
| app(esk7_0,X1) != X2
| esk12_0 != X1
| esk8_0 != X2
| ~ ssList(X1)
| ~ ssList(X2)
| $false
| ~ ssList(nil) ),
inference(rw,[status(thm)],[638,159,theory(equality)]) ).
cnf(641,negated_conjecture,
( nil = esk8_0
| app(esk7_0,X1) != X2
| esk12_0 != X1
| esk8_0 != X2
| ~ ssList(X1)
| ~ ssList(X2)
| $false
| $false ),
inference(rw,[status(thm)],[640,142,theory(equality)]) ).
cnf(642,negated_conjecture,
( nil = esk8_0
| app(esk7_0,X1) != X2
| esk12_0 != X1
| esk8_0 != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[641,theory(equality)]) ).
cnf(643,negated_conjecture,
( app(esk7_0,X1) != X2
| esk12_0 != X1
| esk8_0 != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(sr,[status(thm)],[642,436,theory(equality)]) ).
cnf(9728,negated_conjecture,
( app(esk7_0,esk12_0) != X1
| esk8_0 != X1
| ~ ssList(esk12_0)
| ~ ssList(X1) ),
inference(er,[status(thm)],[643,theory(equality)]) ).
cnf(9729,negated_conjecture,
( esk8_0 != X1
| esk8_0 != X1
| ~ ssList(esk12_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[9728,213,theory(equality)]) ).
cnf(9730,negated_conjecture,
( esk8_0 != X1
| esk8_0 != X1
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[9729,183,theory(equality)]) ).
cnf(9731,negated_conjecture,
( esk8_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[9730,theory(equality)]) ).
cnf(9732,negated_conjecture,
~ ssList(esk8_0),
inference(er,[status(thm)],[9731,theory(equality)]) ).
cnf(9733,negated_conjecture,
$false,
inference(rw,[status(thm)],[9732,159,theory(equality)]) ).
cnf(9734,negated_conjecture,
$false,
inference(cn,[status(thm)],[9733,theory(equality)]) ).
cnf(9735,negated_conjecture,
$false,
9734,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC014+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpG_cV-G/sel_SWC014+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC014+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC014+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC014+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
%
%------------------------------------------------------------------------------