TSTP Solution File: SWC397+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC397+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:42:56 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 8
% Syntax : Number of formulae : 113 ( 17 unt; 0 def)
% Number of atoms : 569 ( 170 equ)
% Maximal formula atoms : 19 ( 5 avg)
% Number of connectives : 709 ( 253 ~; 322 |; 95 &)
% ( 4 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 147 ( 0 sgn 99 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/tmp/tmpcsvP1W/sel_SWC397+1.p_1',ax81) ).
fof(12,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/tmp/tmpcsvP1W/sel_SWC397+1.p_1',ax3) ).
fof(15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpcsvP1W/sel_SWC397+1.p_1',ax15) ).
fof(16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/tmp/tmpcsvP1W/sel_SWC397+1.p_1',ax16) ).
fof(17,axiom,
ssList(nil),
file('/tmp/tmpcsvP1W/sel_SWC397+1.p_1',ax17) ).
fof(18,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/tmp/tmpcsvP1W/sel_SWC397+1.p_1',ax36) ).
fof(19,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/tmp/tmpcsvP1W/sel_SWC397+1.p_1',ax37) ).
fof(23,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( nil != X3
& nil = X4 )
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X3
| app(X7,cons(X6,nil)) != X4 ) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/tmp/tmpcsvP1W/sel_SWC397+1.p_1',co1) ).
fof(24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( nil != X3
& nil = X4 )
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X3
| app(X7,cons(X6,nil)) != X4 ) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[23]) ).
fof(26,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( nil != X3
& nil = X4 )
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X3
| app(X7,cons(X6,nil)) != X4 ) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[24,theory(equality)]) ).
fof(41,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| cons(X2,X1) = app(cons(X2,nil),X1) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(42,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ) ),
inference(variable_rename,[status(thm)],[41]) ).
fof(43,plain,
! [X3,X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[42]) ).
cnf(44,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[43]) ).
fof(76,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| ( ( ~ memberP(X1,X2)
| ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) )
& ( ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| app(X3,cons(X2,X4)) != X1 ) )
| memberP(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(77,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssItem(X6)
| ( ( ~ memberP(X5,X6)
| ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(X7,cons(X6,X8)) = X5 ) ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(X9,cons(X6,X10)) != X5 ) )
| memberP(X5,X6) ) ) ) ),
inference(variable_rename,[status(thm)],[76]) ).
fof(78,plain,
! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssItem(X6)
| ( ( ~ memberP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(esk5_2(X5,X6),cons(X6,esk6_2(X5,X6))) = X5 ) )
& ( ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(X9,cons(X6,X10)) != X5 ) )
| memberP(X5,X6) ) ) ) ),
inference(skolemize,[status(esa)],[77]) ).
fof(79,plain,
! [X5,X6,X9,X10] :
( ( ( ~ ssList(X10)
| app(X9,cons(X6,X10)) != X5
| ~ ssList(X9)
| memberP(X5,X6) )
& ( ~ memberP(X5,X6)
| ( ssList(esk5_2(X5,X6))
& ssList(esk6_2(X5,X6))
& app(esk5_2(X5,X6),cons(X6,esk6_2(X5,X6))) = X5 ) ) )
| ~ ssItem(X6)
| ~ ssList(X5) ),
inference(shift_quantors,[status(thm)],[78]) ).
fof(80,plain,
! [X5,X6,X9,X10] :
( ( ~ ssList(X10)
| app(X9,cons(X6,X10)) != X5
| ~ ssList(X9)
| memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ssList(esk5_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ssList(esk6_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( app(esk5_2(X5,X6),cons(X6,esk6_2(X5,X6))) = X5
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) ) ),
inference(distribute,[status(thm)],[79]) ).
cnf(84,plain,
( memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(X3,cons(X2,X4)) != X1
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[80]) ).
fof(95,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(96,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[95]) ).
fof(97,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[96]) ).
fof(98,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)],[97]) ).
cnf(99,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[98]) ).
fof(101,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| ssList(cons(X2,X1)) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(102,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3)) ) ),
inference(variable_rename,[status(thm)],[101]) ).
fof(103,plain,
! [X3,X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[102]) ).
cnf(104,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[103]) ).
cnf(105,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[17]) ).
fof(106,plain,
! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| ( ( ~ memberP(app(X2,X3),X1)
| memberP(X2,X1)
| memberP(X3,X1) )
& ( ( ~ memberP(X2,X1)
& ~ memberP(X3,X1) )
| memberP(app(X2,X3),X1) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(107,plain,
! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4) )
& ( ( ~ memberP(X5,X4)
& ~ memberP(X6,X4) )
| memberP(app(X5,X6),X4) ) ) ) ) ),
inference(variable_rename,[status(thm)],[106]) ).
fof(108,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| ( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4) )
& ( ( ~ memberP(X5,X4)
& ~ memberP(X6,X4) )
| memberP(app(X5,X6),X4) ) )
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(shift_quantors,[status(thm)],[107]) ).
fof(109,plain,
! [X4,X5,X6] :
( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X5,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ) ),
inference(distribute,[status(thm)],[108]) ).
cnf(111,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X2,X1) ),
inference(split_conjunct,[status(thm)],[109]) ).
fof(113,plain,
! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| ( ( ~ memberP(cons(X2,X3),X1)
| X1 = X2
| memberP(X3,X1) )
& ( ( X1 != X2
& ~ memberP(X3,X1) )
| memberP(cons(X2,X3),X1) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(114,plain,
! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4) )
& ( ( X4 != X5
& ~ memberP(X6,X4) )
| memberP(cons(X5,X6),X4) ) ) ) ) ),
inference(variable_rename,[status(thm)],[113]) ).
fof(115,plain,
! [X4,X5,X6] :
( ~ ssList(X6)
| ( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4) )
& ( ( X4 != X5
& ~ memberP(X6,X4) )
| memberP(cons(X5,X6),X4) ) )
| ~ ssItem(X5)
| ~ ssItem(X4) ),
inference(shift_quantors,[status(thm)],[114]) ).
fof(116,plain,
! [X4,X5,X6] :
( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( X4 != X5
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) ) ),
inference(distribute,[status(thm)],[115]) ).
cnf(119,plain,
( memberP(X3,X1)
| X1 = X2
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ memberP(cons(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[116]) ).
fof(133,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ? [X5] :
( ssItem(X5)
& memberP(X1,X5)
& ~ memberP(X2,X5) )
& ( nil = X3
| nil != X4 )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X3
& app(X7,cons(X6,nil)) = X4 ) )
| ~ neq(X4,nil) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(134,negated_conjecture,
? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& X9 = X11
& X8 = X10
& ? [X12] :
( ssItem(X12)
& memberP(X8,X12)
& ~ memberP(X9,X12) )
& ( nil = X10
| nil != X11 )
& ( ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(cons(X13,nil),X14) = X10
& app(X14,cons(X13,nil)) = X11 ) )
| ~ neq(X11,nil) ) ) ) ) ),
inference(variable_rename,[status(thm)],[133]) ).
fof(135,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk11_0)
& memberP(esk7_0,esk11_0)
& ~ memberP(esk8_0,esk11_0)
& ( nil = esk9_0
| nil != esk10_0 )
& ( ( ssItem(esk12_0)
& ssList(esk13_0)
& app(cons(esk12_0,nil),esk13_0) = esk9_0
& app(esk13_0,cons(esk12_0,nil)) = esk10_0 )
| ~ neq(esk10_0,nil) ) ),
inference(skolemize,[status(esa)],[134]) ).
fof(136,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssItem(esk11_0)
& memberP(esk7_0,esk11_0)
& ~ memberP(esk8_0,esk11_0)
& ( nil = esk9_0
| nil != esk10_0 )
& ( ssItem(esk12_0)
| ~ neq(esk10_0,nil) )
& ( ssList(esk13_0)
| ~ neq(esk10_0,nil) )
& ( app(cons(esk12_0,nil),esk13_0) = esk9_0
| ~ neq(esk10_0,nil) )
& ( app(esk13_0,cons(esk12_0,nil)) = esk10_0
| ~ neq(esk10_0,nil) ) ),
inference(distribute,[status(thm)],[135]) ).
cnf(137,negated_conjecture,
( app(esk13_0,cons(esk12_0,nil)) = esk10_0
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(138,negated_conjecture,
( app(cons(esk12_0,nil),esk13_0) = esk9_0
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(139,negated_conjecture,
( ssList(esk13_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(140,negated_conjecture,
( ssItem(esk12_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(141,negated_conjecture,
( nil = esk9_0
| nil != esk10_0 ),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(142,negated_conjecture,
~ memberP(esk8_0,esk11_0),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(143,negated_conjecture,
memberP(esk7_0,esk11_0),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(144,negated_conjecture,
ssItem(esk11_0),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(145,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[136]) ).
cnf(146,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[136]) ).
cnf(149,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[136]) ).
cnf(152,negated_conjecture,
ssList(esk10_0),
inference(rw,[status(thm)],[149,146,theory(equality)]) ).
cnf(153,negated_conjecture,
memberP(esk9_0,esk11_0),
inference(rw,[status(thm)],[143,145,theory(equality)]) ).
cnf(154,negated_conjecture,
~ memberP(esk10_0,esk11_0),
inference(rw,[status(thm)],[142,146,theory(equality)]) ).
cnf(161,negated_conjecture,
( ssList(esk13_0)
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[139,99,theory(equality)]) ).
cnf(162,negated_conjecture,
( ssItem(esk12_0)
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[140,99,theory(equality)]) ).
cnf(163,negated_conjecture,
( app(esk13_0,cons(esk12_0,nil)) = esk10_0
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[137,99,theory(equality)]) ).
cnf(164,negated_conjecture,
( app(cons(esk12_0,nil),esk13_0) = esk9_0
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[138,99,theory(equality)]) ).
cnf(165,negated_conjecture,
( ssList(esk13_0)
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[161,105,theory(equality)]) ).
cnf(166,negated_conjecture,
( ssList(esk13_0)
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[165,theory(equality)]) ).
cnf(167,negated_conjecture,
( ssItem(esk12_0)
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[162,105,theory(equality)]) ).
cnf(168,negated_conjecture,
( ssItem(esk12_0)
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[167,theory(equality)]) ).
cnf(169,negated_conjecture,
( app(esk13_0,cons(esk12_0,nil)) = esk10_0
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[163,105,theory(equality)]) ).
cnf(170,negated_conjecture,
( app(esk13_0,cons(esk12_0,nil)) = esk10_0
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[169,theory(equality)]) ).
cnf(171,negated_conjecture,
( app(cons(esk12_0,nil),esk13_0) = esk9_0
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[164,105,theory(equality)]) ).
cnf(172,negated_conjecture,
( app(cons(esk12_0,nil),esk13_0) = esk9_0
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[171,theory(equality)]) ).
cnf(318,negated_conjecture,
( ssList(esk13_0)
| esk10_0 = nil
| $false ),
inference(rw,[status(thm)],[166,152,theory(equality)]) ).
cnf(319,negated_conjecture,
( ssList(esk13_0)
| esk10_0 = nil ),
inference(cn,[status(thm)],[318,theory(equality)]) ).
cnf(320,negated_conjecture,
( ssItem(esk12_0)
| esk10_0 = nil
| $false ),
inference(rw,[status(thm)],[168,152,theory(equality)]) ).
cnf(321,negated_conjecture,
( ssItem(esk12_0)
| esk10_0 = nil ),
inference(cn,[status(thm)],[320,theory(equality)]) ).
cnf(326,negated_conjecture,
( app(esk13_0,cons(esk12_0,nil)) = esk10_0
| esk10_0 = nil
| $false ),
inference(rw,[status(thm)],[170,152,theory(equality)]) ).
cnf(327,negated_conjecture,
( app(esk13_0,cons(esk12_0,nil)) = esk10_0
| esk10_0 = nil ),
inference(cn,[status(thm)],[326,theory(equality)]) ).
cnf(336,negated_conjecture,
( memberP(X1,esk12_0)
| esk10_0 = nil
| esk10_0 != X1
| ~ ssItem(esk12_0)
| ~ ssList(nil)
| ~ ssList(esk13_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[84,327,theory(equality)]) ).
cnf(340,negated_conjecture,
( memberP(X1,esk12_0)
| esk10_0 = nil
| esk10_0 != X1
| ~ ssItem(esk12_0)
| $false
| ~ ssList(esk13_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[336,105,theory(equality)]) ).
cnf(341,negated_conjecture,
( memberP(X1,esk12_0)
| esk10_0 = nil
| esk10_0 != X1
| ~ ssItem(esk12_0)
| ~ ssList(esk13_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[340,theory(equality)]) ).
cnf(402,negated_conjecture,
( app(cons(esk12_0,nil),esk13_0) = esk9_0
| esk10_0 = nil
| $false ),
inference(rw,[status(thm)],[172,152,theory(equality)]) ).
cnf(403,negated_conjecture,
( app(cons(esk12_0,nil),esk13_0) = esk9_0
| esk10_0 = nil ),
inference(cn,[status(thm)],[402,theory(equality)]) ).
cnf(407,negated_conjecture,
( esk9_0 = cons(esk12_0,esk13_0)
| esk10_0 = nil
| ~ ssItem(esk12_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[44,403,theory(equality)]) ).
cnf(431,negated_conjecture,
( cons(esk12_0,esk13_0) = esk9_0
| esk10_0 = nil
| ~ ssItem(esk12_0) ),
inference(csr,[status(thm)],[407,319]) ).
cnf(432,negated_conjecture,
( cons(esk12_0,esk13_0) = esk9_0
| esk10_0 = nil ),
inference(csr,[status(thm)],[431,321]) ).
cnf(438,negated_conjecture,
( X1 = esk12_0
| memberP(esk13_0,X1)
| esk10_0 = nil
| ~ memberP(esk9_0,X1)
| ~ ssItem(esk12_0)
| ~ ssItem(X1)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[119,432,theory(equality)]) ).
cnf(821,negated_conjecture,
( esk10_0 = nil
| memberP(X1,esk12_0)
| esk10_0 != X1
| ~ ssItem(esk12_0)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[341,319]) ).
cnf(822,negated_conjecture,
( esk10_0 = nil
| memberP(X1,esk12_0)
| esk10_0 != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[821,321]) ).
cnf(823,negated_conjecture,
( esk10_0 = nil
| memberP(esk10_0,esk12_0)
| ~ ssList(esk10_0) ),
inference(er,[status(thm)],[822,theory(equality)]) ).
cnf(824,negated_conjecture,
( esk10_0 = nil
| memberP(esk10_0,esk12_0)
| $false ),
inference(rw,[status(thm)],[823,152,theory(equality)]) ).
cnf(825,negated_conjecture,
( esk10_0 = nil
| memberP(esk10_0,esk12_0) ),
inference(cn,[status(thm)],[824,theory(equality)]) ).
cnf(1147,negated_conjecture,
( esk10_0 = nil
| X1 = esk12_0
| memberP(esk13_0,X1)
| ~ memberP(esk9_0,X1)
| ~ ssItem(esk12_0)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[438,319]) ).
cnf(1148,negated_conjecture,
( esk10_0 = nil
| X1 = esk12_0
| memberP(esk13_0,X1)
| ~ memberP(esk9_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[1147,321]) ).
cnf(1149,negated_conjecture,
( esk10_0 = nil
| esk11_0 = esk12_0
| memberP(esk13_0,esk11_0)
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[1148,153,theory(equality)]) ).
cnf(1150,negated_conjecture,
( esk10_0 = nil
| esk11_0 = esk12_0
| memberP(esk13_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[1149,144,theory(equality)]) ).
cnf(1151,negated_conjecture,
( esk10_0 = nil
| esk11_0 = esk12_0
| memberP(esk13_0,esk11_0) ),
inference(cn,[status(thm)],[1150,theory(equality)]) ).
cnf(1155,negated_conjecture,
( memberP(app(esk13_0,X1),esk11_0)
| esk12_0 = esk11_0
| esk10_0 = nil
| ~ ssItem(esk11_0)
| ~ ssList(X1)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[111,1151,theory(equality)]) ).
cnf(1164,negated_conjecture,
( memberP(app(esk13_0,X1),esk11_0)
| esk12_0 = esk11_0
| esk10_0 = nil
| $false
| ~ ssList(X1)
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[1155,144,theory(equality)]) ).
cnf(1165,negated_conjecture,
( memberP(app(esk13_0,X1),esk11_0)
| esk12_0 = esk11_0
| esk10_0 = nil
| ~ ssList(X1)
| ~ ssList(esk13_0) ),
inference(cn,[status(thm)],[1164,theory(equality)]) ).
cnf(1319,negated_conjecture,
( esk12_0 = esk11_0
| esk10_0 = nil
| memberP(app(esk13_0,X1),esk11_0)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[1165,319]) ).
cnf(1328,negated_conjecture,
( esk10_0 = nil
| esk12_0 = esk11_0
| memberP(esk10_0,esk11_0)
| ~ ssList(cons(esk12_0,nil)) ),
inference(spm,[status(thm)],[1319,327,theory(equality)]) ).
cnf(1346,negated_conjecture,
( esk10_0 = nil
| esk12_0 = esk11_0
| ~ ssList(cons(esk12_0,nil)) ),
inference(sr,[status(thm)],[1328,154,theory(equality)]) ).
cnf(1350,negated_conjecture,
( esk12_0 = esk11_0
| esk10_0 = nil
| ~ ssItem(esk12_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[1346,104,theory(equality)]) ).
cnf(1351,negated_conjecture,
( esk12_0 = esk11_0
| esk10_0 = nil
| ~ ssItem(esk12_0)
| $false ),
inference(rw,[status(thm)],[1350,105,theory(equality)]) ).
cnf(1352,negated_conjecture,
( esk12_0 = esk11_0
| esk10_0 = nil
| ~ ssItem(esk12_0) ),
inference(cn,[status(thm)],[1351,theory(equality)]) ).
cnf(1365,negated_conjecture,
( esk12_0 = esk11_0
| esk10_0 = nil ),
inference(csr,[status(thm)],[1352,321]) ).
cnf(1379,negated_conjecture,
( esk10_0 = nil
| memberP(esk10_0,esk11_0) ),
inference(spm,[status(thm)],[825,1365,theory(equality)]) ).
cnf(1391,negated_conjecture,
esk10_0 = nil,
inference(sr,[status(thm)],[1379,154,theory(equality)]) ).
cnf(1396,negated_conjecture,
~ memberP(nil,esk11_0),
inference(rw,[status(thm)],[154,1391,theory(equality)]) ).
cnf(1455,negated_conjecture,
( esk9_0 = nil
| $false ),
inference(rw,[status(thm)],[141,1391,theory(equality)]) ).
cnf(1456,negated_conjecture,
esk9_0 = nil,
inference(cn,[status(thm)],[1455,theory(equality)]) ).
cnf(1463,negated_conjecture,
memberP(nil,esk11_0),
inference(rw,[status(thm)],[153,1456,theory(equality)]) ).
cnf(1475,negated_conjecture,
$false,
inference(sr,[status(thm)],[1463,1396,theory(equality)]) ).
cnf(1476,negated_conjecture,
$false,
1475,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC397+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpcsvP1W/sel_SWC397+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC397+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC397+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC397+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
%
%------------------------------------------------------------------------------