TSTP Solution File: SWC399+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC399+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 11:43:16 EST 2010
% Result : Theorem 0.62s
% Output : CNFRefutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 8
% Syntax : Number of formulae : 101 ( 21 unt; 0 def)
% Number of atoms : 508 ( 102 equ)
% Maximal formula atoms : 25 ( 5 avg)
% Number of connectives : 668 ( 261 ~; 268 |; 112 &)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 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 : 200 ( 0 sgn 113 !; 38 ?)
% 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/tmpGNhae2/sel_SWC399+1.p_1',ax82) ).
fof(6,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmpGNhae2/sel_SWC399+1.p_1',ax28) ).
fof(8,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/tmp/tmpGNhae2/sel_SWC399+1.p_1',ax26) ).
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/tmpGNhae2/sel_SWC399+1.p_1',ax3) ).
fof(17,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/tmp/tmpGNhae2/sel_SWC399+1.p_1',ax16) ).
fof(18,axiom,
ssList(nil),
file('/tmp/tmpGNhae2/sel_SWC399+1.p_1',ax17) ).
fof(19,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/tmp/tmpGNhae2/sel_SWC399+1.p_1',ax36) ).
fof(24,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(app(X5,X3),X6) != X4
| ~ equalelemsP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssList(X9)
& app(cons(X7,nil),X9) = X3 ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X6
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) ) )
| ! [X13] :
( ~ ssItem(X13)
| ~ memberP(X1,X13)
| memberP(X2,X13) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
file('/tmp/tmpGNhae2/sel_SWC399+1.p_1',co1) ).
fof(25,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(app(X5,X3),X6) != X4
| ~ equalelemsP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssList(X9)
& app(cons(X7,nil),X9) = X3 ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X6
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) ) )
| ! [X13] :
( ~ ssItem(X13)
| ~ memberP(X1,X13)
| memberP(X2,X13) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(assume_negation,[status(cth)],[24]) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(app(X5,X3),X6) != X4
| ~ equalelemsP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssList(X9)
& app(cons(X7,nil),X9) = X3 ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X6
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) ) )
| ! [X13] :
( ~ ssItem(X13)
| ~ memberP(X1,X13)
| memberP(X2,X13) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[25,theory(equality)]) ).
fof(38,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(39,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)],[38]) ).
fof(40,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)],[39]) ).
cnf(41,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[40]) ).
fof(50,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(51,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[50]) ).
cnf(52,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[51]) ).
fof(57,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ssList(app(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(58,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ssList(app(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[57]) ).
fof(59,plain,
! [X3,X4] :
( ~ ssList(X4)
| ssList(app(X3,X4))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[58]) ).
cnf(60,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[59]) ).
fof(77,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(78,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)],[77]) ).
fof(79,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)],[78]) ).
fof(80,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)],[79]) ).
fof(81,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)],[80]) ).
cnf(82,plain,
( app(esk5_2(X1,X2),cons(X2,esk6_2(X1,X2))) = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[81]) ).
cnf(83,plain,
( ssList(esk6_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[81]) ).
cnf(84,plain,
( ssList(esk5_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[81]) ).
fof(106,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| ssList(cons(X2,X1)) ) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(107,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3)) ) ),
inference(variable_rename,[status(thm)],[106]) ).
fof(108,plain,
! [X3,X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[107]) ).
cnf(109,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[108]) ).
cnf(110,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[18]) ).
fof(111,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)],[19]) ).
fof(112,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)],[111]) ).
fof(113,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)],[112]) ).
fof(114,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)],[113]) ).
cnf(115,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X3,X1) ),
inference(split_conjunct,[status(thm)],[114]) ).
cnf(116,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X2,X1) ),
inference(split_conjunct,[status(thm)],[114]) ).
fof(138,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,X3),X6) = X4
& equalelemsP(X3)
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X5
| ! [X9] :
( ~ ssList(X9)
| app(cons(X7,nil),X9) != X3 ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X6
| ! [X12] :
( ~ ssList(X12)
| app(X12,cons(X10,nil)) != X3 ) ) ) ) )
& ? [X13] :
( ssItem(X13)
& memberP(X1,X13)
& ~ memberP(X2,X13) )
& ( nil = X4
| nil != X3 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(139,negated_conjecture,
? [X14] :
( ssList(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& ? [X17] :
( ssList(X17)
& X15 = X17
& X14 = X16
& ? [X18] :
( ssList(X18)
& ? [X19] :
( ssList(X19)
& app(app(X18,X16),X19) = X17
& equalelemsP(X16)
& ! [X20] :
( ~ ssItem(X20)
| ! [X21] :
( ~ ssList(X21)
| app(X21,cons(X20,nil)) != X18
| ! [X22] :
( ~ ssList(X22)
| app(cons(X20,nil),X22) != X16 ) ) )
& ! [X23] :
( ~ ssItem(X23)
| ! [X24] :
( ~ ssList(X24)
| app(cons(X23,nil),X24) != X19
| ! [X25] :
( ~ ssList(X25)
| app(X25,cons(X23,nil)) != X16 ) ) ) ) )
& ? [X26] :
( ssItem(X26)
& memberP(X14,X26)
& ~ memberP(X15,X26) )
& ( nil = X17
| nil != X16 ) ) ) ) ),
inference(variable_rename,[status(thm)],[138]) ).
fof(140,negated_conjecture,
( ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& ssList(esk14_0)
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& ssList(esk15_0)
& ssList(esk16_0)
& app(app(esk15_0,esk13_0),esk16_0) = esk14_0
& equalelemsP(esk13_0)
& ! [X20] :
( ~ ssItem(X20)
| ! [X21] :
( ~ ssList(X21)
| app(X21,cons(X20,nil)) != esk15_0
| ! [X22] :
( ~ ssList(X22)
| app(cons(X20,nil),X22) != esk13_0 ) ) )
& ! [X23] :
( ~ ssItem(X23)
| ! [X24] :
( ~ ssList(X24)
| app(cons(X23,nil),X24) != esk16_0
| ! [X25] :
( ~ ssList(X25)
| app(X25,cons(X23,nil)) != esk13_0 ) ) )
& ssItem(esk17_0)
& memberP(esk11_0,esk17_0)
& ~ memberP(esk12_0,esk17_0)
& ( nil = esk14_0
| nil != esk13_0 ) ),
inference(skolemize,[status(esa)],[139]) ).
fof(141,negated_conjecture,
! [X20,X21,X22,X23,X24,X25] :
( ( ~ ssList(X25)
| app(X25,cons(X23,nil)) != esk13_0
| ~ ssList(X24)
| app(cons(X23,nil),X24) != esk16_0
| ~ ssItem(X23) )
& ( ~ ssList(X22)
| app(cons(X20,nil),X22) != esk13_0
| ~ ssList(X21)
| app(X21,cons(X20,nil)) != esk15_0
| ~ ssItem(X20) )
& ssList(esk16_0)
& app(app(esk15_0,esk13_0),esk16_0) = esk14_0
& equalelemsP(esk13_0)
& ssList(esk15_0)
& ssList(esk14_0)
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& ssItem(esk17_0)
& memberP(esk11_0,esk17_0)
& ~ memberP(esk12_0,esk17_0)
& ( nil = esk14_0
| nil != esk13_0 )
& ssList(esk13_0)
& ssList(esk12_0)
& ssList(esk11_0) ),
inference(shift_quantors,[status(thm)],[140]) ).
cnf(142,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(146,negated_conjecture,
~ memberP(esk12_0,esk17_0),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(147,negated_conjecture,
memberP(esk11_0,esk17_0),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(148,negated_conjecture,
ssItem(esk17_0),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(149,negated_conjecture,
esk11_0 = esk13_0,
inference(split_conjunct,[status(thm)],[141]) ).
cnf(150,negated_conjecture,
esk12_0 = esk14_0,
inference(split_conjunct,[status(thm)],[141]) ).
cnf(152,negated_conjecture,
ssList(esk15_0),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(154,negated_conjecture,
app(app(esk15_0,esk13_0),esk16_0) = esk14_0,
inference(split_conjunct,[status(thm)],[141]) ).
cnf(155,negated_conjecture,
ssList(esk16_0),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(158,negated_conjecture,
ssList(esk13_0),
inference(rw,[status(thm)],[142,149,theory(equality)]) ).
cnf(160,negated_conjecture,
memberP(esk13_0,esk17_0),
inference(rw,[status(thm)],[147,149,theory(equality)]) ).
cnf(161,negated_conjecture,
~ memberP(esk14_0,esk17_0),
inference(rw,[status(thm)],[146,150,theory(equality)]) ).
cnf(180,negated_conjecture,
( ssList(esk5_2(esk13_0,esk17_0))
| ~ ssItem(esk17_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[84,160,theory(equality)]) ).
cnf(181,negated_conjecture,
( ssList(esk5_2(esk13_0,esk17_0))
| $false
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[180,148,theory(equality)]) ).
cnf(182,negated_conjecture,
( ssList(esk5_2(esk13_0,esk17_0))
| ~ ssList(esk13_0) ),
inference(cn,[status(thm)],[181,theory(equality)]) ).
cnf(183,negated_conjecture,
( ssList(esk6_2(esk13_0,esk17_0))
| ~ ssItem(esk17_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[83,160,theory(equality)]) ).
cnf(184,negated_conjecture,
( ssList(esk6_2(esk13_0,esk17_0))
| $false
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[183,148,theory(equality)]) ).
cnf(185,negated_conjecture,
( ssList(esk6_2(esk13_0,esk17_0))
| ~ ssList(esk13_0) ),
inference(cn,[status(thm)],[184,theory(equality)]) ).
cnf(190,negated_conjecture,
( memberP(app(X1,esk13_0),esk17_0)
| ~ ssItem(esk17_0)
| ~ ssList(esk13_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[115,160,theory(equality)]) ).
cnf(191,negated_conjecture,
( memberP(app(X1,esk13_0),esk17_0)
| $false
| ~ ssList(esk13_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[190,148,theory(equality)]) ).
cnf(192,negated_conjecture,
( memberP(app(X1,esk13_0),esk17_0)
| ~ ssList(esk13_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[191,theory(equality)]) ).
cnf(249,plain,
( app(X1,X2) = app(nil,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[41,52,theory(equality)]) ).
cnf(250,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[60,41,theory(equality)]) ).
cnf(265,plain,
( app(X1,X2) = app(nil,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| $false ),
inference(rw,[status(thm)],[249,110,theory(equality)]) ).
cnf(266,plain,
( app(X1,X2) = app(nil,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[265,theory(equality)]) ).
cnf(320,negated_conjecture,
( app(esk5_2(esk13_0,esk17_0),cons(esk17_0,esk6_2(esk13_0,esk17_0))) = esk13_0
| ~ ssItem(esk17_0)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[82,160,theory(equality)]) ).
cnf(321,negated_conjecture,
( app(esk5_2(esk13_0,esk17_0),cons(esk17_0,esk6_2(esk13_0,esk17_0))) = esk13_0
| $false
| ~ ssList(esk13_0) ),
inference(rw,[status(thm)],[320,148,theory(equality)]) ).
cnf(322,negated_conjecture,
( app(esk5_2(esk13_0,esk17_0),cons(esk17_0,esk6_2(esk13_0,esk17_0))) = esk13_0
| ~ ssList(esk13_0) ),
inference(cn,[status(thm)],[321,theory(equality)]) ).
cnf(335,negated_conjecture,
( ssList(esk5_2(esk13_0,esk17_0))
| $false ),
inference(rw,[status(thm)],[182,158,theory(equality)]) ).
cnf(336,negated_conjecture,
ssList(esk5_2(esk13_0,esk17_0)),
inference(cn,[status(thm)],[335,theory(equality)]) ).
cnf(350,negated_conjecture,
( ssList(esk6_2(esk13_0,esk17_0))
| $false ),
inference(rw,[status(thm)],[185,158,theory(equality)]) ).
cnf(351,negated_conjecture,
ssList(esk6_2(esk13_0,esk17_0)),
inference(cn,[status(thm)],[350,theory(equality)]) ).
cnf(374,negated_conjecture,
( memberP(app(X1,esk13_0),esk17_0)
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[192,158,theory(equality)]) ).
cnf(375,negated_conjecture,
( memberP(app(X1,esk13_0),esk17_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[374,theory(equality)]) ).
cnf(381,negated_conjecture,
( memberP(app(app(X1,esk13_0),X2),esk17_0)
| ~ ssItem(esk17_0)
| ~ ssList(X2)
| ~ ssList(app(X1,esk13_0))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[116,375,theory(equality)]) ).
cnf(398,negated_conjecture,
( memberP(app(app(X1,esk13_0),X2),esk17_0)
| $false
| ~ ssList(X2)
| ~ ssList(app(X1,esk13_0))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[381,148,theory(equality)]) ).
cnf(399,negated_conjecture,
( memberP(app(app(X1,esk13_0),X2),esk17_0)
| ~ ssList(X2)
| ~ ssList(app(X1,esk13_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[398,theory(equality)]) ).
cnf(1302,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[250,60]) ).
cnf(7140,negated_conjecture,
( app(esk5_2(esk13_0,esk17_0),cons(esk17_0,esk6_2(esk13_0,esk17_0))) = esk13_0
| $false ),
inference(rw,[status(thm)],[322,158,theory(equality)]) ).
cnf(7141,negated_conjecture,
app(esk5_2(esk13_0,esk17_0),cons(esk17_0,esk6_2(esk13_0,esk17_0))) = esk13_0,
inference(cn,[status(thm)],[7140,theory(equality)]) ).
cnf(7158,negated_conjecture,
( app(nil,esk13_0) = esk13_0
| ~ ssList(cons(esk17_0,esk6_2(esk13_0,esk17_0)))
| ~ ssList(esk5_2(esk13_0,esk17_0)) ),
inference(spm,[status(thm)],[266,7141,theory(equality)]) ).
cnf(7207,negated_conjecture,
( app(nil,esk13_0) = esk13_0
| ~ ssList(cons(esk17_0,esk6_2(esk13_0,esk17_0)))
| $false ),
inference(rw,[status(thm)],[7158,336,theory(equality)]) ).
cnf(7208,negated_conjecture,
( app(nil,esk13_0) = esk13_0
| ~ ssList(cons(esk17_0,esk6_2(esk13_0,esk17_0))) ),
inference(cn,[status(thm)],[7207,theory(equality)]) ).
cnf(7391,negated_conjecture,
( app(nil,esk13_0) = esk13_0
| ~ ssItem(esk17_0)
| ~ ssList(esk6_2(esk13_0,esk17_0)) ),
inference(spm,[status(thm)],[7208,109,theory(equality)]) ).
cnf(7392,negated_conjecture,
( app(nil,esk13_0) = esk13_0
| $false
| ~ ssList(esk6_2(esk13_0,esk17_0)) ),
inference(rw,[status(thm)],[7391,148,theory(equality)]) ).
cnf(7393,negated_conjecture,
( app(nil,esk13_0) = esk13_0
| $false
| $false ),
inference(rw,[status(thm)],[7392,351,theory(equality)]) ).
cnf(7394,negated_conjecture,
app(nil,esk13_0) = esk13_0,
inference(cn,[status(thm)],[7393,theory(equality)]) ).
cnf(7446,negated_conjecture,
( ssList(app(X1,esk13_0))
| ~ ssList(esk13_0)
| ~ ssList(nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[1302,7394,theory(equality)]) ).
cnf(7550,negated_conjecture,
( ssList(app(X1,esk13_0))
| $false
| ~ ssList(nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[7446,158,theory(equality)]) ).
cnf(7551,negated_conjecture,
( ssList(app(X1,esk13_0))
| $false
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[7550,110,theory(equality)]) ).
cnf(7552,negated_conjecture,
( ssList(app(X1,esk13_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[7551,theory(equality)]) ).
cnf(9539,negated_conjecture,
( memberP(app(app(X1,esk13_0),X2),esk17_0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[399,7552]) ).
cnf(9540,negated_conjecture,
( memberP(esk14_0,esk17_0)
| ~ ssList(esk16_0)
| ~ ssList(esk15_0) ),
inference(spm,[status(thm)],[9539,154,theory(equality)]) ).
cnf(9562,negated_conjecture,
( ~ ssList(esk16_0)
| ~ ssList(esk15_0) ),
inference(sr,[status(thm)],[9540,161,theory(equality)]) ).
cnf(9600,negated_conjecture,
~ ssList(esk15_0),
inference(spm,[status(thm)],[9562,155,theory(equality)]) ).
cnf(9601,negated_conjecture,
$false,
inference(sr,[status(thm)],[152,9600,theory(equality)]) ).
cnf(9602,negated_conjecture,
$false,
9601,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC399+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpGNhae2/sel_SWC399+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC399+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC399+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC399+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
%
%------------------------------------------------------------------------------