%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC416+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:46:38 EST 2010
% Result : Theorem 10.18s
% Output : CNFRefutation 10.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 14
% Syntax : Number of formulae : 181 ( 19 unt; 0 def)
% Number of atoms : 850 ( 324 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 1154 ( 485 ~; 517 |; 105 &)
% ( 2 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 304 ( 0 sgn 147 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax85) ).
fof(3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax83) ).
fof(5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax81) ).
fof(8,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax27) ).
fof(9,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax26) ).
fof(10,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax21) ).
fof(11,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax20) ).
fof(12,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax23) ).
fof(17,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax79) ).
fof(18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax15) ).
fof(19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax16) ).
fof(20,axiom,
ssList(nil),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax17) ).
fof(22,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssItem(X4)
=> ( cons(X3,X1) = cons(X4,X2)
=> ( X3 = X4
& X2 = X1 ) ) ) ) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',ax19) ).
fof(23,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)
& app(X6,X1) = X5
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X2) = X7
& neq(nil,X2) ) ) )
| ! [X8] :
( ssItem(X8)
=> app(cons(X8,nil),X3) != X4 ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/tmp/tmpe_8i8X/sel_SWC416+1.p_1',co1) ).
fof(24,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)
& app(X6,X1) = X5
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X2) = X7
& neq(nil,X2) ) ) )
| ! [X8] :
( ssItem(X8)
=> app(cons(X8,nil),X3) != X4 ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[23]) ).
fof(25,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)
& app(X6,X1) = X5
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X2) = X7
& neq(nil,X2) ) ) )
| ! [X8] :
( ssItem(X8)
=> app(cons(X8,nil),X3) != X4 ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[24,theory(equality)]) ).
fof(26,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| nil = X1
| hd(app(X1,X2)) = hd(X1) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(27,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| nil = X3
| hd(app(X3,X4)) = hd(X3) ) ),
inference(variable_rename,[status(thm)],[26]) ).
fof(28,plain,
! [X3,X4] :
( ~ ssList(X4)
| nil = X3
| hd(app(X3,X4)) = hd(X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[27]) ).
cnf(29,plain,
( hd(app(X1,X2)) = hd(X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[28]) ).
fof(33,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)],[3]) ).
fof(34,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)],[33]) ).
fof(35,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)],[34]) ).
fof(36,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)],[35]) ).
cnf(37,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(44,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| cons(X2,X1) = app(cons(X2,nil),X1) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(45,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ) ),
inference(variable_rename,[status(thm)],[44]) ).
fof(46,plain,
! [X3,X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[45]) ).
cnf(47,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[46]) ).
fof(55,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssItem(X3)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(56,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),X4) ) ) ),
inference(variable_rename,[status(thm)],[55]) ).
fof(57,plain,
! [X4,X5,X6] :
( ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),X4)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[56]) ).
cnf(58,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(59,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ssList(app(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(60,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ssList(app(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[59]) ).
fof(61,plain,
! [X3,X4] :
( ~ ssList(X4)
| ssList(app(X3,X4))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[60]) ).
cnf(62,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[61]) ).
fof(63,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| nil != cons(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(64,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3) ) ),
inference(variable_rename,[status(thm)],[63]) ).
fof(65,plain,
! [X3,X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[64]) ).
cnf(66,plain,
( ~ ssList(X1)
| nil != cons(X2,X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[65]) ).
fof(67,plain,
! [X1] :
( ~ ssList(X1)
| nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(68,plain,
! [X4] :
( ~ ssList(X4)
| nil = X4
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssItem(X6)
& cons(X6,X5) = X4 ) ) ),
inference(variable_rename,[status(thm)],[67]) ).
fof(69,plain,
! [X4] :
( ~ ssList(X4)
| nil = X4
| ( ssList(esk1_1(X4))
& ssItem(esk2_1(X4))
& cons(esk2_1(X4),esk1_1(X4)) = X4 ) ),
inference(skolemize,[status(esa)],[68]) ).
fof(70,plain,
! [X4] :
( ( ssList(esk1_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( ssItem(esk2_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( cons(esk2_1(X4),esk1_1(X4)) = X4
| nil = X4
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[69]) ).
cnf(71,plain,
( nil = X1
| cons(esk2_1(X1),esk1_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[70]) ).
cnf(72,plain,
( nil = X1
| ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[70]) ).
cnf(73,plain,
( nil = X1
| ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[70]) ).
fof(74,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| hd(cons(X2,X1)) = X2 ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(75,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| hd(cons(X4,X3)) = X4 ) ),
inference(variable_rename,[status(thm)],[74]) ).
fof(76,plain,
! [X3,X4] :
( ~ ssItem(X4)
| hd(cons(X4,X3)) = X4
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[75]) ).
cnf(77,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[76]) ).
fof(98,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X3,X2) != app(X1,X2)
| X3 = X1 ) ) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(99,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(X6,X5) != app(X4,X5)
| X6 = X4 ) ) ),
inference(variable_rename,[status(thm)],[98]) ).
fof(100,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| app(X6,X5) != app(X4,X5)
| X6 = X4
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[99]) ).
cnf(101,plain,
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| app(X3,X2) != app(X1,X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[100]) ).
fof(102,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(103,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[102]) ).
fof(104,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[103]) ).
fof(105,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)],[104]) ).
cnf(106,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[105]) ).
fof(108,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| ssList(cons(X2,X1)) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(109,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3)) ) ),
inference(variable_rename,[status(thm)],[108]) ).
fof(110,plain,
! [X3,X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[109]) ).
cnf(111,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[110]) ).
cnf(112,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[20]) ).
fof(117,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssItem(X3)
| ! [X4] :
( ~ ssItem(X4)
| cons(X3,X1) != cons(X4,X2)
| ( X3 = X4
& X2 = X1 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(118,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssItem(X8)
| cons(X7,X5) != cons(X8,X6)
| ( X7 = X8
& X6 = X5 ) ) ) ) ),
inference(variable_rename,[status(thm)],[117]) ).
fof(119,plain,
! [X5,X6,X7,X8] :
( ~ ssItem(X8)
| cons(X7,X5) != cons(X8,X6)
| ( X7 = X8
& X6 = X5 )
| ~ ssItem(X7)
| ~ ssList(X6)
| ~ ssList(X5) ),
inference(shift_quantors,[status(thm)],[118]) ).
fof(120,plain,
! [X5,X6,X7,X8] :
( ( X7 = X8
| cons(X7,X5) != cons(X8,X6)
| ~ ssItem(X8)
| ~ ssItem(X7)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( X6 = X5
| cons(X7,X5) != cons(X8,X6)
| ~ ssItem(X8)
| ~ ssItem(X7)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
inference(distribute,[status(thm)],[119]) ).
cnf(121,plain,
( X2 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X4)
| cons(X3,X1) != cons(X4,X2) ),
inference(split_conjunct,[status(thm)],[120]) ).
fof(123,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)
| app(X6,X1) != X5
| ! [X7] :
( ~ ssItem(X7)
| cons(X7,nil) != X6
| hd(X2) != X7
| ~ neq(nil,X2) ) ) )
& ? [X8] :
( ssItem(X8)
& app(cons(X8,nil),X3) = X4 ) )
| ( neq(X2,nil)
& ~ neq(X4,nil) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(124,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)
| app(X14,X9) != X13
| ! [X15] :
( ~ ssItem(X15)
| cons(X15,nil) != X14
| hd(X10) != X15
| ~ neq(nil,X10) ) ) )
& ? [X16] :
( ssItem(X16)
& app(cons(X16,nil),X11) = X12 ) )
| ( neq(X10,nil)
& ~ neq(X12,nil) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[123]) ).
fof(125,negated_conjecture,
( ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ( ( neq(esk7_0,nil)
& ! [X13] :
( ~ ssList(X13)
| esk7_0 != X13
| ! [X14] :
( ~ ssList(X14)
| app(X14,esk6_0) != X13
| ! [X15] :
( ~ ssItem(X15)
| cons(X15,nil) != X14
| hd(esk7_0) != X15
| ~ neq(nil,esk7_0) ) ) )
& ssItem(esk10_0)
& app(cons(esk10_0,nil),esk8_0) = esk9_0 )
| ( neq(esk7_0,nil)
& ~ neq(esk9_0,nil) ) ) ),
inference(skolemize,[status(esa)],[124]) ).
fof(126,negated_conjecture,
! [X13,X14,X15] :
( ( ( ( ~ ssItem(X15)
| cons(X15,nil) != X14
| hd(esk7_0) != X15
| ~ neq(nil,esk7_0)
| ~ ssList(X14)
| app(X14,esk6_0) != X13
| ~ ssList(X13)
| esk7_0 != X13 )
& neq(esk7_0,nil)
& ssItem(esk10_0)
& app(cons(esk10_0,nil),esk8_0) = esk9_0 )
| ( neq(esk7_0,nil)
& ~ neq(esk9_0,nil) ) )
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0) ),
inference(shift_quantors,[status(thm)],[125]) ).
fof(127,negated_conjecture,
! [X13,X14,X15] :
( ( neq(esk7_0,nil)
| ~ ssItem(X15)
| cons(X15,nil) != X14
| hd(esk7_0) != X15
| ~ neq(nil,esk7_0)
| ~ ssList(X14)
| app(X14,esk6_0) != X13
| ~ ssList(X13)
| esk7_0 != X13 )
& ( ~ neq(esk9_0,nil)
| ~ ssItem(X15)
| cons(X15,nil) != X14
| hd(esk7_0) != X15
| ~ neq(nil,esk7_0)
| ~ ssList(X14)
| app(X14,esk6_0) != X13
| ~ ssList(X13)
| esk7_0 != X13 )
& ( neq(esk7_0,nil)
| neq(esk7_0,nil) )
& ( ~ neq(esk9_0,nil)
| neq(esk7_0,nil) )
& ( neq(esk7_0,nil)
| ssItem(esk10_0) )
& ( ~ neq(esk9_0,nil)
| ssItem(esk10_0) )
& ( neq(esk7_0,nil)
| app(cons(esk10_0,nil),esk8_0) = esk9_0 )
& ( ~ neq(esk9_0,nil)
| app(cons(esk10_0,nil),esk8_0) = esk9_0 )
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0) ),
inference(distribute,[status(thm)],[126]) ).
cnf(128,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(129,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(132,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[127]) ).
cnf(133,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[127]) ).
cnf(134,negated_conjecture,
( app(cons(esk10_0,nil),esk8_0) = esk9_0
| ~ neq(esk9_0,nil) ),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(136,negated_conjecture,
( ssItem(esk10_0)
| ~ neq(esk9_0,nil) ),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(139,negated_conjecture,
( neq(esk7_0,nil)
| neq(esk7_0,nil) ),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(140,negated_conjecture,
( esk7_0 != X1
| ~ ssList(X1)
| app(X2,esk6_0) != X1
| ~ ssList(X2)
| ~ neq(nil,esk7_0)
| hd(esk7_0) != X3
| cons(X3,nil) != X2
| ~ ssItem(X3)
| ~ neq(esk9_0,nil) ),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(147,negated_conjecture,
( ssItem(esk10_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[136,133,theory(equality)]),139,theory(equality)]) ).
cnf(148,negated_conjecture,
ssItem(esk10_0),
inference(cn,[status(thm)],[147,theory(equality)]) ).
cnf(161,negated_conjecture,
( app(cons(esk10_0,nil),esk6_0) = esk9_0
| ~ neq(esk9_0,nil) ),
inference(rw,[status(thm)],[134,132,theory(equality)]) ).
cnf(162,negated_conjecture,
( app(cons(esk10_0,nil),esk6_0) = esk7_0
| ~ neq(esk9_0,nil) ),
inference(rw,[status(thm)],[161,133,theory(equality)]) ).
cnf(163,negated_conjecture,
( app(cons(esk10_0,nil),esk6_0) = esk7_0
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[162,133,theory(equality)]),139,theory(equality)]) ).
cnf(164,negated_conjecture,
app(cons(esk10_0,nil),esk6_0) = esk7_0,
inference(cn,[status(thm)],[163,theory(equality)]) ).
cnf(188,plain,
( hd(X1) = esk2_1(X1)
| nil = X1
| ~ ssItem(esk2_1(X1))
| ~ ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[77,71,theory(equality)]) ).
cnf(189,plain,
( app(X1,nil) = nil
| nil != X1
| ~ ssList(nil)
| ~ ssList(X1) ),
inference(er,[status(thm)],[37,theory(equality)]) ).
cnf(190,plain,
( app(X1,nil) = nil
| nil != X1
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[189,112,theory(equality)]) ).
cnf(191,plain,
( app(X1,nil) = nil
| nil != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[190,theory(equality)]) ).
cnf(196,negated_conjecture,
( cons(esk10_0,esk6_0) = esk7_0
| ~ ssItem(esk10_0)
| ~ ssList(esk6_0) ),
inference(spm,[status(thm)],[164,47,theory(equality)]) ).
cnf(200,plain,
( hd(cons(X1,X2)) = hd(cons(X1,nil))
| nil = cons(X1,nil)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[29,47,theory(equality)]) ).
cnf(201,negated_conjecture,
( cons(esk10_0,esk6_0) = esk7_0
| $false
| ~ ssList(esk6_0) ),
inference(rw,[status(thm)],[196,148,theory(equality)]) ).
cnf(202,negated_conjecture,
( cons(esk10_0,esk6_0) = esk7_0
| $false
| $false ),
inference(rw,[status(thm)],[201,128,theory(equality)]) ).
cnf(203,negated_conjecture,
cons(esk10_0,esk6_0) = esk7_0,
inference(cn,[status(thm)],[202,theory(equality)]) ).
cnf(226,negated_conjecture,
( cons(esk10_0,nil) = X1
| esk7_0 != app(X1,esk6_0)
| ~ ssList(X1)
| ~ ssList(esk6_0)
| ~ ssList(cons(esk10_0,nil)) ),
inference(spm,[status(thm)],[101,164,theory(equality)]) ).
cnf(234,negated_conjecture,
( cons(esk10_0,nil) = X1
| esk7_0 != app(X1,esk6_0)
| ~ ssList(X1)
| $false
| ~ ssList(cons(esk10_0,nil)) ),
inference(rw,[status(thm)],[226,128,theory(equality)]) ).
cnf(235,negated_conjecture,
( cons(esk10_0,nil) = X1
| esk7_0 != app(X1,esk6_0)
| ~ ssList(X1)
| ~ ssList(cons(esk10_0,nil)) ),
inference(cn,[status(thm)],[234,theory(equality)]) ).
cnf(272,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssItem(X1)
| ~ ssList(app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[111,58,theory(equality)]) ).
cnf(273,plain,
( app(cons(X1,X2),X3) != nil
| ~ ssItem(X1)
| ~ ssList(app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[66,58,theory(equality)]) ).
cnf(290,plain,
( esk1_1(X1) = X2
| nil = X1
| X1 != cons(X3,X2)
| ~ ssItem(X3)
| ~ ssItem(esk2_1(X1))
| ~ ssList(X2)
| ~ ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[121,71,theory(equality)]) ).
cnf(295,negated_conjecture,
( esk7_0 != X1
| hd(esk7_0) != X3
| app(X2,esk6_0) != X1
| cons(X3,nil) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ neq(nil,esk7_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[140,133,theory(equality)]),139,theory(equality)]) ).
cnf(296,negated_conjecture,
( esk7_0 != X1
| hd(esk7_0) != X3
| app(X2,esk6_0) != X1
| cons(X3,nil) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ neq(nil,esk7_0) ),
inference(cn,[status(thm)],[295,theory(equality)]) ).
cnf(309,negated_conjecture,
( esk7_0 != nil
| ~ ssItem(esk10_0)
| ~ ssList(esk6_0) ),
inference(spm,[status(thm)],[66,203,theory(equality)]) ).
cnf(311,negated_conjecture,
( hd(esk7_0) = esk10_0
| ~ ssItem(esk10_0)
| ~ ssList(esk6_0) ),
inference(spm,[status(thm)],[77,203,theory(equality)]) ).
cnf(320,negated_conjecture,
( esk7_0 != nil
| $false
| ~ ssList(esk6_0) ),
inference(rw,[status(thm)],[309,148,theory(equality)]) ).
cnf(321,negated_conjecture,
( esk7_0 != nil
| $false
| $false ),
inference(rw,[status(thm)],[320,128,theory(equality)]) ).
cnf(322,negated_conjecture,
esk7_0 != nil,
inference(cn,[status(thm)],[321,theory(equality)]) ).
cnf(326,negated_conjecture,
( hd(esk7_0) = esk10_0
| $false
| ~ ssList(esk6_0) ),
inference(rw,[status(thm)],[311,148,theory(equality)]) ).
cnf(327,negated_conjecture,
( hd(esk7_0) = esk10_0
| $false
| $false ),
inference(rw,[status(thm)],[326,128,theory(equality)]) ).
cnf(328,negated_conjecture,
hd(esk7_0) = esk10_0,
inference(cn,[status(thm)],[327,theory(equality)]) ).
cnf(342,negated_conjecture,
( app(X1,esk6_0) != X2
| cons(X3,nil) != X1
| esk10_0 != X3
| esk7_0 != X2
| ~ neq(nil,esk7_0)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[296,328,theory(equality)]) ).
cnf(346,negated_conjecture,
( nil = esk7_0
| app(X1,esk6_0) != X2
| cons(X3,nil) != X1
| esk10_0 != X3
| esk7_0 != X2
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(esk7_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[342,106,theory(equality)]) ).
cnf(348,negated_conjecture,
( nil = esk7_0
| app(X1,esk6_0) != X2
| cons(X3,nil) != X1
| esk10_0 != X3
| esk7_0 != X2
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| $false
| ~ ssList(nil) ),
inference(rw,[status(thm)],[346,129,theory(equality)]) ).
cnf(349,negated_conjecture,
( nil = esk7_0
| app(X1,esk6_0) != X2
| cons(X3,nil) != X1
| esk10_0 != X3
| esk7_0 != X2
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| $false
| $false ),
inference(rw,[status(thm)],[348,112,theory(equality)]) ).
cnf(350,negated_conjecture,
( nil = esk7_0
| app(X1,esk6_0) != X2
| cons(X3,nil) != X1
| esk10_0 != X3
| esk7_0 != X2
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[349,theory(equality)]) ).
cnf(351,plain,
( app(cons(X1,X2),X3) != nil
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[273,62]) ).
cnf(369,plain,
( app(nil,nil) = nil
| ~ ssList(nil) ),
inference(er,[status(thm)],[191,theory(equality)]) ).
cnf(370,plain,
( app(nil,nil) = nil
| $false ),
inference(rw,[status(thm)],[369,112,theory(equality)]) ).
cnf(371,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[370,theory(equality)]) ).
cnf(378,plain,
( cons(X1,nil) = app(cons(X1,nil),nil)
| ~ ssItem(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[58,371,theory(equality)]) ).
cnf(392,plain,
( cons(X1,nil) = app(cons(X1,nil),nil)
| ~ ssItem(X1)
| $false ),
inference(rw,[status(thm)],[378,112,theory(equality)]) ).
cnf(393,plain,
( cons(X1,nil) = app(cons(X1,nil),nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[392,theory(equality)]) ).
cnf(398,plain,
( esk2_1(X1) = hd(X1)
| nil = X1
| ~ ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[188,73]) ).
cnf(399,plain,
( esk2_1(X1) = hd(X1)
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[398,72]) ).
cnf(401,plain,
( cons(hd(X1),esk1_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[71,399,theory(equality)]) ).
cnf(509,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[351,393,theory(equality)]) ).
cnf(528,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1)
| $false ),
inference(rw,[status(thm)],[509,112,theory(equality)]) ).
cnf(529,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[528,theory(equality)]) ).
cnf(612,plain,
( hd(cons(X1,X2)) = hd(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(csr,[status(thm)],[200,529]) ).
cnf(613,plain,
( hd(cons(X1,X2)) = hd(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[612,111,theory(equality)]) ).
cnf(614,plain,
( hd(cons(X1,X2)) = hd(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2)
| $false ),
inference(rw,[status(thm)],[613,112,theory(equality)]) ).
cnf(615,plain,
( hd(cons(X1,X2)) = hd(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[614,theory(equality)]) ).
cnf(673,negated_conjecture,
( hd(esk7_0) = hd(cons(esk10_0,nil))
| ~ ssItem(esk10_0)
| ~ ssList(esk6_0) ),
inference(spm,[status(thm)],[615,203,theory(equality)]) ).
cnf(685,negated_conjecture,
( esk10_0 = hd(cons(esk10_0,nil))
| ~ ssItem(esk10_0)
| ~ ssList(esk6_0) ),
inference(rw,[status(thm)],[673,328,theory(equality)]) ).
cnf(686,negated_conjecture,
( esk10_0 = hd(cons(esk10_0,nil))
| $false
| ~ ssList(esk6_0) ),
inference(rw,[status(thm)],[685,148,theory(equality)]) ).
cnf(687,negated_conjecture,
( esk10_0 = hd(cons(esk10_0,nil))
| $false
| $false ),
inference(rw,[status(thm)],[686,128,theory(equality)]) ).
cnf(688,negated_conjecture,
esk10_0 = hd(cons(esk10_0,nil)),
inference(cn,[status(thm)],[687,theory(equality)]) ).
cnf(779,plain,
( cons(hd(cons(X1,X2)),esk1_1(cons(X1,nil))) = cons(X1,nil)
| nil = cons(X1,nil)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[401,615,theory(equality)]) ).
cnf(785,negated_conjecture,
( cons(esk10_0,nil) = X1
| app(X1,esk6_0) != esk7_0
| ~ ssList(X1)
| ~ ssItem(esk10_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[235,111,theory(equality)]) ).
cnf(786,negated_conjecture,
( cons(esk10_0,nil) = X1
| app(X1,esk6_0) != esk7_0
| ~ ssList(X1)
| $false
| ~ ssList(nil) ),
inference(rw,[status(thm)],[785,148,theory(equality)]) ).
cnf(787,negated_conjecture,
( cons(esk10_0,nil) = X1
| app(X1,esk6_0) != esk7_0
| ~ ssList(X1)
| $false
| $false ),
inference(rw,[status(thm)],[786,112,theory(equality)]) ).
cnf(788,negated_conjecture,
( cons(esk10_0,nil) = X1
| app(X1,esk6_0) != esk7_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[787,theory(equality)]) ).
cnf(3006,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[272,62]) ).
cnf(3013,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[3006,393,theory(equality)]) ).
cnf(3033,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1)
| $false ),
inference(rw,[status(thm)],[3013,112,theory(equality)]) ).
cnf(3034,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[3033,theory(equality)]) ).
cnf(3643,plain,
( esk1_1(X1) = X2
| nil = X1
| X1 != cons(X3,X2)
| ~ ssItem(esk2_1(X1))
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[290,73]) ).
cnf(3644,plain,
( esk1_1(X1) = X2
| nil = X1
| X1 != cons(X3,X2)
| ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[3643,72]) ).
cnf(3645,plain,
( esk1_1(cons(X1,X2)) = X2
| nil = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,X2)) ),
inference(er,[status(thm)],[3644,theory(equality)]) ).
cnf(3867,negated_conjecture,
( app(X1,esk6_0) != X2
| cons(X3,nil) != X1
| esk10_0 != X3
| esk7_0 != X2
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(sr,[status(thm)],[350,322,theory(equality)]) ).
cnf(3868,negated_conjecture,
( app(X1,esk6_0) != X2
| cons(esk10_0,nil) != X1
| esk7_0 != X2
| ~ ssItem(esk10_0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[3867,theory(equality)]) ).
cnf(3869,negated_conjecture,
( app(X1,esk6_0) != X2
| cons(esk10_0,nil) != X1
| esk7_0 != X2
| $false
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[3868,148,theory(equality)]) ).
cnf(3870,negated_conjecture,
( app(X1,esk6_0) != X2
| cons(esk10_0,nil) != X1
| esk7_0 != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[3869,theory(equality)]) ).
cnf(9138,plain,
( cons(hd(cons(X1,X2)),esk1_1(cons(X1,nil))) = cons(X1,nil)
| cons(X1,nil) = nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[779,3034]) ).
cnf(9139,plain,
( cons(hd(cons(X1,X2)),esk1_1(cons(X1,nil))) = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[9138,529]) ).
cnf(9140,negated_conjecture,
( cons(esk10_0,esk1_1(cons(esk10_0,nil))) = cons(esk10_0,nil)
| ~ ssItem(esk10_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[9139,688,theory(equality)]) ).
cnf(9219,negated_conjecture,
( cons(esk10_0,esk1_1(cons(esk10_0,nil))) = cons(esk10_0,nil)
| $false
| ~ ssList(nil) ),
inference(rw,[status(thm)],[9140,148,theory(equality)]) ).
cnf(9220,negated_conjecture,
( cons(esk10_0,esk1_1(cons(esk10_0,nil))) = cons(esk10_0,nil)
| $false
| $false ),
inference(rw,[status(thm)],[9219,112,theory(equality)]) ).
cnf(9221,negated_conjecture,
cons(esk10_0,esk1_1(cons(esk10_0,nil))) = cons(esk10_0,nil),
inference(cn,[status(thm)],[9220,theory(equality)]) ).
cnf(9253,negated_conjecture,
( ssList(cons(esk10_0,nil))
| ~ ssItem(esk10_0)
| ~ ssList(esk1_1(cons(esk10_0,nil))) ),
inference(spm,[status(thm)],[111,9221,theory(equality)]) ).
cnf(9305,negated_conjecture,
( ssList(cons(esk10_0,nil))
| $false
| ~ ssList(esk1_1(cons(esk10_0,nil))) ),
inference(rw,[status(thm)],[9253,148,theory(equality)]) ).
cnf(9306,negated_conjecture,
( ssList(cons(esk10_0,nil))
| ~ ssList(esk1_1(cons(esk10_0,nil))) ),
inference(cn,[status(thm)],[9305,theory(equality)]) ).
cnf(177787,plain,
( esk1_1(cons(X1,X2)) = X2
| cons(X1,X2) = nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[3645,111]) ).
cnf(177788,plain,
( esk1_1(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[177787,66]) ).
cnf(177805,negated_conjecture,
( ssList(cons(esk10_0,nil))
| ~ ssList(nil)
| ~ ssItem(esk10_0) ),
inference(spm,[status(thm)],[9306,177788,theory(equality)]) ).
cnf(177844,negated_conjecture,
( ssList(cons(esk10_0,nil))
| $false
| ~ ssItem(esk10_0) ),
inference(rw,[status(thm)],[177805,112,theory(equality)]) ).
cnf(177845,negated_conjecture,
( ssList(cons(esk10_0,nil))
| $false
| $false ),
inference(rw,[status(thm)],[177844,148,theory(equality)]) ).
cnf(177846,negated_conjecture,
ssList(cons(esk10_0,nil)),
inference(cn,[status(thm)],[177845,theory(equality)]) ).
cnf(204790,negated_conjecture,
( cons(esk10_0,nil) != X1
| app(X1,esk6_0) != esk7_0
| ~ ssList(X1)
| ~ ssList(esk7_0) ),
inference(er,[status(thm)],[3870,theory(equality)]) ).
cnf(204791,negated_conjecture,
( cons(esk10_0,nil) != X1
| app(X1,esk6_0) != esk7_0
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[204790,129,theory(equality)]) ).
cnf(204792,negated_conjecture,
( cons(esk10_0,nil) != X1
| app(X1,esk6_0) != esk7_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[204791,theory(equality)]) ).
cnf(225852,negated_conjecture,
( app(X1,esk6_0) != esk7_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[204792,788]) ).
cnf(225853,negated_conjecture,
~ ssList(cons(esk10_0,nil)),
inference(spm,[status(thm)],[225852,164,theory(equality)]) ).
cnf(225884,negated_conjecture,
$false,
inference(rw,[status(thm)],[225853,177846,theory(equality)]) ).
cnf(225885,negated_conjecture,
$false,
inference(cn,[status(thm)],[225884,theory(equality)]) ).
cnf(225886,negated_conjecture,
$false,
225885,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC416+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpe_8i8X/sel_SWC416+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC416+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC416+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC416+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
%
%------------------------------------------------------------------------------