%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC252+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:05:30 EST 2010
% Result : Theorem 1.59s
% Output : CNFRefutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 8
% Syntax : Number of formulae : 88 ( 12 unt; 0 def)
% Number of atoms : 462 ( 138 equ)
% Maximal formula atoms : 44 ( 5 avg)
% Number of connectives : 611 ( 237 ~; 241 |; 101 &)
% ( 1 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 174 ( 0 sgn 86 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/tmp/tmpLR-Mxt/sel_SWC252+1.p_1',ax82) ).
fof(4,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/tmp/tmpLR-Mxt/sel_SWC252+1.p_1',ax81) ).
fof(7,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmpLR-Mxt/sel_SWC252+1.p_1',ax28) ).
fof(8,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/tmp/tmpLR-Mxt/sel_SWC252+1.p_1',ax27) ).
fof(9,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/tmp/tmpLR-Mxt/sel_SWC252+1.p_1',ax26) ).
fof(20,axiom,
ssList(nil),
file('/tmp/tmpLR-Mxt/sel_SWC252+1.p_1',ax17) ).
fof(25,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/tmp/tmpLR-Mxt/sel_SWC252+1.p_1',ax93) ).
fof(30,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) ) )
| ( ! [X9] :
( ssItem(X9)
=> ( cons(X9,nil) != X3
| ~ memberP(X4,X9) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/tmp/tmpLR-Mxt/sel_SWC252+1.p_1',co1) ).
fof(31,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) ) )
| ( ! [X9] :
( ssItem(X9)
=> ( cons(X9,nil) != X3
| ~ memberP(X4,X9) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[30]) ).
fof(35,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) ) )
| ( ! [X9] :
( ssItem(X9)
=> ( cons(X9,nil) != X3
| ~ memberP(X4,X9) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[31,theory(equality)]) ).
fof(46,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(47,plain,
! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6)) ) ) ),
inference(variable_rename,[status(thm)],[46]) ).
fof(48,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6))
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(shift_quantors,[status(thm)],[47]) ).
cnf(49,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(50,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| cons(X2,X1) = app(cons(X2,nil),X1) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(51,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ) ),
inference(variable_rename,[status(thm)],[50]) ).
fof(52,plain,
! [X3,X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[51]) ).
cnf(53,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[52]) ).
fof(62,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[7]) ).
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] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssItem(X3)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(66,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)],[65]) ).
fof(67,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)],[66]) ).
cnf(68,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[67]) ).
fof(69,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ssList(app(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(70,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ssList(app(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[69]) ).
fof(71,plain,
! [X3,X4] :
( ~ ssList(X4)
| ssList(app(X3,X4))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[70]) ).
cnf(72,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[71]) ).
cnf(121,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[20]) ).
fof(143,plain,
! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ( ( ~ lt(X1,X2)
| ( X1 != X2
& leq(X1,X2) ) )
& ( X1 = X2
| ~ leq(X1,X2)
| lt(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(144,plain,
! [X3] :
( ~ ssItem(X3)
| ! [X4] :
( ~ ssItem(X4)
| ( ( ~ lt(X3,X4)
| ( X3 != X4
& leq(X3,X4) ) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[143]) ).
fof(145,plain,
! [X3,X4] :
( ~ ssItem(X4)
| ( ( ~ lt(X3,X4)
| ( X3 != X4
& leq(X3,X4) ) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4) ) )
| ~ ssItem(X3) ),
inference(shift_quantors,[status(thm)],[144]) ).
fof(146,plain,
! [X3,X4] :
( ( X3 != X4
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( leq(X3,X4)
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) ) ),
inference(distribute,[status(thm)],[145]) ).
cnf(148,plain,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2) ),
inference(split_conjunct,[status(thm)],[146]) ).
fof(167,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& nil != X1
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != X1
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& memberP(X7,X8)
& lt(X5,X8)
& ~ leq(X5,X8) ) ) ) )
& ( ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X3
& memberP(X4,X9) )
| ( nil = X4
& nil = X3 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[35]) ).
fof(168,negated_conjecture,
? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& ? [X13] :
( ssList(X13)
& X11 = X13
& X10 = X12
& nil != X10
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| app(app(X15,cons(X14,nil)),X16) != X10
| ? [X17] :
( ssItem(X17)
& memberP(X15,X17)
& memberP(X16,X17)
& lt(X14,X17)
& ~ leq(X14,X17) ) ) ) )
& ( ? [X18] :
( ssItem(X18)
& cons(X18,nil) = X12
& memberP(X13,X18) )
| ( nil = X13
& nil = X12 ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[167]) ).
fof(169,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& nil != esk7_0
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| app(app(X15,cons(X14,nil)),X16) != esk7_0
| ( ssItem(esk11_3(X14,X15,X16))
& memberP(X15,esk11_3(X14,X15,X16))
& memberP(X16,esk11_3(X14,X15,X16))
& lt(X14,esk11_3(X14,X15,X16))
& ~ leq(X14,esk11_3(X14,X15,X16)) ) ) ) )
& ( ( ssItem(esk12_0)
& cons(esk12_0,nil) = esk9_0
& memberP(esk10_0,esk12_0) )
| ( nil = esk10_0
& nil = esk9_0 ) ) ),
inference(skolemize,[status(esa)],[168]) ).
fof(170,negated_conjecture,
! [X14,X15,X16] :
( ( ~ ssList(X16)
| app(app(X15,cons(X14,nil)),X16) != esk7_0
| ( ssItem(esk11_3(X14,X15,X16))
& memberP(X15,esk11_3(X14,X15,X16))
& memberP(X16,esk11_3(X14,X15,X16))
& lt(X14,esk11_3(X14,X15,X16))
& ~ leq(X14,esk11_3(X14,X15,X16)) )
| ~ ssList(X15)
| ~ ssItem(X14) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& nil != esk7_0
& ( ( ssItem(esk12_0)
& cons(esk12_0,nil) = esk9_0
& memberP(esk10_0,esk12_0) )
| ( nil = esk10_0
& nil = esk9_0 ) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[169]) ).
fof(171,negated_conjecture,
! [X14,X15,X16] :
( ( ssItem(esk11_3(X14,X15,X16))
| ~ ssList(X16)
| app(app(X15,cons(X14,nil)),X16) != esk7_0
| ~ ssList(X15)
| ~ ssItem(X14) )
& ( memberP(X15,esk11_3(X14,X15,X16))
| ~ ssList(X16)
| app(app(X15,cons(X14,nil)),X16) != esk7_0
| ~ ssList(X15)
| ~ ssItem(X14) )
& ( memberP(X16,esk11_3(X14,X15,X16))
| ~ ssList(X16)
| app(app(X15,cons(X14,nil)),X16) != esk7_0
| ~ ssList(X15)
| ~ ssItem(X14) )
& ( lt(X14,esk11_3(X14,X15,X16))
| ~ ssList(X16)
| app(app(X15,cons(X14,nil)),X16) != esk7_0
| ~ ssList(X15)
| ~ ssItem(X14) )
& ( ~ leq(X14,esk11_3(X14,X15,X16))
| ~ ssList(X16)
| app(app(X15,cons(X14,nil)),X16) != esk7_0
| ~ ssList(X15)
| ~ ssItem(X14) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& nil != esk7_0
& ( nil = esk10_0
| ssItem(esk12_0) )
& ( nil = esk9_0
| ssItem(esk12_0) )
& ( nil = esk10_0
| cons(esk12_0,nil) = esk9_0 )
& ( nil = esk9_0
| cons(esk12_0,nil) = esk9_0 )
& ( nil = esk10_0
| memberP(esk10_0,esk12_0) )
& ( nil = esk9_0
| memberP(esk10_0,esk12_0) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[170]) ).
cnf(172,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(178,negated_conjecture,
( cons(esk12_0,nil) = esk9_0
| nil = esk9_0 ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(180,negated_conjecture,
( ssItem(esk12_0)
| nil = esk9_0 ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(182,negated_conjecture,
nil != esk7_0,
inference(split_conjunct,[status(thm)],[171]) ).
cnf(183,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[171]) ).
cnf(185,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk7_0
| ~ ssList(X3)
| ~ leq(X1,esk11_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(186,negated_conjecture,
( lt(X1,esk11_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk7_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(189,negated_conjecture,
( ssItem(esk11_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk7_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[171]) ).
cnf(193,negated_conjecture,
( esk7_0 = nil
| ssItem(esk12_0) ),
inference(rw,[status(thm)],[180,183,theory(equality)]) ).
cnf(194,negated_conjecture,
ssItem(esk12_0),
inference(sr,[status(thm)],[193,182,theory(equality)]) ).
cnf(196,negated_conjecture,
( esk7_0 = nil
| cons(esk12_0,nil) = esk9_0 ),
inference(rw,[status(thm)],[178,183,theory(equality)]) ).
cnf(197,negated_conjecture,
( esk7_0 = nil
| cons(esk12_0,nil) = esk7_0 ),
inference(rw,[status(thm)],[196,183,theory(equality)]) ).
cnf(198,negated_conjecture,
cons(esk12_0,nil) = esk7_0,
inference(sr,[status(thm)],[197,182,theory(equality)]) ).
cnf(240,negated_conjecture,
( app(esk7_0,X1) = cons(esk12_0,X1)
| ~ ssItem(esk12_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[53,198,theory(equality)]) ).
cnf(245,negated_conjecture,
( app(esk7_0,X1) = cons(esk12_0,X1)
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[240,194,theory(equality)]) ).
cnf(246,negated_conjecture,
( app(esk7_0,X1) = cons(esk12_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[245,theory(equality)]) ).
cnf(312,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk7_0
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ lt(X2,esk11_3(X2,X1,X3))
| ~ ssItem(esk11_3(X2,X1,X3)) ),
inference(spm,[status(thm)],[185,148,theory(equality)]) ).
cnf(326,plain,
( app(X1,X2) = app(nil,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[49,64,theory(equality)]) ).
cnf(345,plain,
( app(X1,X2) = app(nil,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[326,121,theory(equality)]) ).
cnf(346,plain,
( app(X1,X2) = app(nil,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[345,theory(equality)]) ).
cnf(433,negated_conjecture,
( app(esk7_0,nil) = esk7_0
| ~ ssList(nil) ),
inference(spm,[status(thm)],[198,246,theory(equality)]) ).
cnf(441,negated_conjecture,
( app(esk7_0,app(X1,X2)) = app(cons(esk12_0,X1),X2)
| ~ ssItem(esk12_0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(app(X1,X2)) ),
inference(spm,[status(thm)],[68,246,theory(equality)]) ).
cnf(447,negated_conjecture,
( app(esk7_0,nil) = esk7_0
| $false ),
inference(rw,[status(thm)],[433,121,theory(equality)]) ).
cnf(448,negated_conjecture,
app(esk7_0,nil) = esk7_0,
inference(cn,[status(thm)],[447,theory(equality)]) ).
cnf(464,negated_conjecture,
( app(esk7_0,app(X1,X2)) = app(cons(esk12_0,X1),X2)
| $false
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(app(X1,X2)) ),
inference(rw,[status(thm)],[441,194,theory(equality)]) ).
cnf(465,negated_conjecture,
( app(esk7_0,app(X1,X2)) = app(cons(esk12_0,X1),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(app(X1,X2)) ),
inference(cn,[status(thm)],[464,theory(equality)]) ).
cnf(2522,plain,
( app(nil,app(X1,app(X2,X3))) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[346,49,theory(equality)]) ).
cnf(3861,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk7_0
| ~ lt(X2,esk11_3(X2,X1,X3))
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[312,189]) ).
cnf(3862,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk7_0
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[3861,186]) ).
cnf(13549,negated_conjecture,
( app(cons(esk12_0,X1),X2) = app(esk7_0,app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[465,72]) ).
cnf(13557,negated_conjecture,
( app(esk7_0,app(nil,X1)) = cons(esk12_0,X1)
| ~ ssItem(esk12_0)
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[53,13549,theory(equality)]) ).
cnf(13669,negated_conjecture,
( app(esk7_0,app(nil,X1)) = cons(esk12_0,X1)
| $false
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(rw,[status(thm)],[13557,194,theory(equality)]) ).
cnf(13670,negated_conjecture,
( app(esk7_0,app(nil,X1)) = cons(esk12_0,X1)
| $false
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[13669,121,theory(equality)]) ).
cnf(13671,negated_conjecture,
( app(esk7_0,app(nil,X1)) = cons(esk12_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[13670,theory(equality)]) ).
cnf(37546,plain,
( app(nil,app(X1,app(X2,X3))) = app(X1,app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[2522,72]) ).
cnf(37707,negated_conjecture,
( app(nil,cons(esk12_0,X1)) = cons(esk12_0,X1)
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(esk7_0) ),
inference(spm,[status(thm)],[37546,13671,theory(equality)]) ).
cnf(38073,negated_conjecture,
( app(nil,cons(esk12_0,X1)) = cons(esk12_0,X1)
| ~ ssList(X1)
| $false
| ~ ssList(esk7_0) ),
inference(rw,[status(thm)],[37707,121,theory(equality)]) ).
cnf(38074,negated_conjecture,
( app(nil,cons(esk12_0,X1)) = cons(esk12_0,X1)
| ~ ssList(X1)
| $false
| $false ),
inference(rw,[status(thm)],[38073,172,theory(equality)]) ).
cnf(38075,negated_conjecture,
( app(nil,cons(esk12_0,X1)) = cons(esk12_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[38074,theory(equality)]) ).
cnf(38798,negated_conjecture,
( app(cons(esk12_0,nil),X1) != esk7_0
| ~ ssItem(esk12_0)
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[3862,38075,theory(equality)]) ).
cnf(38903,negated_conjecture,
( app(esk7_0,X1) != esk7_0
| ~ ssItem(esk12_0)
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(rw,[status(thm)],[38798,198,theory(equality)]) ).
cnf(38904,negated_conjecture,
( app(esk7_0,X1) != esk7_0
| $false
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(rw,[status(thm)],[38903,194,theory(equality)]) ).
cnf(38905,negated_conjecture,
( app(esk7_0,X1) != esk7_0
| $false
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[38904,121,theory(equality)]) ).
cnf(38906,negated_conjecture,
( app(esk7_0,X1) != esk7_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[38905,theory(equality)]) ).
cnf(38985,negated_conjecture,
~ ssList(nil),
inference(spm,[status(thm)],[38906,448,theory(equality)]) ).
cnf(39008,negated_conjecture,
$false,
inference(rw,[status(thm)],[38985,121,theory(equality)]) ).
cnf(39009,negated_conjecture,
$false,
inference(cn,[status(thm)],[39008,theory(equality)]) ).
cnf(39010,negated_conjecture,
$false,
39009,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC252+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpLR-Mxt/sel_SWC252+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC252+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC252+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC252+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
%
%------------------------------------------------------------------------------