TSTP Solution File: SWC224+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC224+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 10:53:57 EST 2010
% Result : Theorem 99.96s
% Output : CNFRefutation 99.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 9
% Syntax : Number of formulae : 99 ( 14 unt; 0 def)
% Number of atoms : 545 ( 188 equ)
% Maximal formula atoms : 42 ( 5 avg)
% Number of connectives : 720 ( 274 ~; 288 |; 126 &)
% ( 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 : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 196 ( 0 sgn 98 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmpQgsFjj/sel_SWC224+1.p_2',ax83) ).
fof(4,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/tmp/tmpQgsFjj/sel_SWC224+1.p_2',ax81) ).
fof(7,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/tmp/tmpQgsFjj/sel_SWC224+1.p_2',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/tmpQgsFjj/sel_SWC224+1.p_2',ax27) ).
fof(11,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/tmp/tmpQgsFjj/sel_SWC224+1.p_2',ax20) ).
fof(19,axiom,
ssList(nil),
file('/tmp/tmpQgsFjj/sel_SWC224+1.p_2',ax17) ).
fof(22,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/tmp/tmpQgsFjj/sel_SWC224+1.p_2',ax38) ).
fof(25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/tmp/tmpQgsFjj/sel_SWC224+1.p_2',ax16) ).
fof(27,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)
| ~ leq(X5,X8)
| leq(X8,X5) ) ) ) ) )
| ! [X9] :
( ssList(X9)
=> ( app(X3,X9) != X4
| ~ equalelemsP(X3)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/tmp/tmpQgsFjj/sel_SWC224+1.p_2',co1) ).
fof(28,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)
| ~ leq(X5,X8)
| leq(X8,X5) ) ) ) ) )
| ! [X9] :
( ssList(X9)
=> ( app(X3,X9) != X4
| ~ equalelemsP(X3)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[27]) ).
fof(29,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).
fof(30,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)
| ~ leq(X5,X8)
| leq(X8,X5) ) ) ) ) )
| ! [X9] :
( ssList(X9)
=> ( app(X3,X9) != X4
| ~ equalelemsP(X3)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[28,theory(equality)]) ).
fof(34,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)],[2]) ).
fof(35,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)],[34]) ).
fof(36,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)],[35]) ).
fof(37,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)],[36]) ).
cnf(38,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[37]) ).
fof(45,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| cons(X2,X1) = app(cons(X2,nil),X1) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(46,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ) ),
inference(variable_rename,[status(thm)],[45]) ).
fof(47,plain,
! [X3,X4] :
( ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[46]) ).
cnf(48,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[47]) ).
fof(57,plain,
! [X1] :
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(58,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[57]) ).
cnf(59,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[58]) ).
fof(60,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(61,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)],[60]) ).
fof(62,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)],[61]) ).
cnf(63,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[62]) ).
fof(72,plain,
! [X1] :
( ~ ssList(X1)
| nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(73,plain,
! [X4] :
( ~ ssList(X4)
| nil = X4
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssItem(X6)
& cons(X6,X5) = X4 ) ) ),
inference(variable_rename,[status(thm)],[72]) ).
fof(74,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)],[73]) ).
fof(75,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)],[74]) ).
cnf(76,plain,
( nil = X1
| cons(esk2_1(X1),esk1_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(77,plain,
( nil = X1
| ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(78,plain,
( nil = X1
| ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(117,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[19]) ).
fof(132,plain,
! [X1] :
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_nnf,[status(thm)],[29]) ).
fof(133,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[132]) ).
cnf(134,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[133]) ).
fof(145,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| ssList(cons(X2,X1)) ) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(146,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3)) ) ),
inference(variable_rename,[status(thm)],[145]) ).
fof(147,plain,
! [X3,X4] :
( ~ ssItem(X4)
| ssList(cons(X4,X3))
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[146]) ).
cnf(148,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[147]) ).
fof(152,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)
& leq(X5,X8)
& ~ leq(X8,X5) ) ) ) )
& ? [X9] :
( ssList(X9)
& app(X3,X9) = X4
& equalelemsP(X3)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X9
| ! [X12] :
( ~ ssList(X12)
| app(X12,cons(X10,nil)) != X3 ) ) ) )
& ( nil = X4
| nil != X3 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(153,negated_conjecture,
? [X13] :
( ssList(X13)
& ? [X14] :
( ssList(X14)
& ? [X15] :
( ssList(X15)
& ? [X16] :
( ssList(X16)
& X14 = X16
& X13 = X15
& nil != X13
& ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| ! [X19] :
( ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != X13
| ? [X20] :
( ssItem(X20)
& memberP(X18,X20)
& memberP(X19,X20)
& leq(X17,X20)
& ~ leq(X20,X17) ) ) ) )
& ? [X21] :
( ssList(X21)
& app(X15,X21) = X16
& equalelemsP(X15)
& ! [X22] :
( ~ ssItem(X22)
| ! [X23] :
( ~ ssList(X23)
| app(cons(X22,nil),X23) != X21
| ! [X24] :
( ~ ssList(X24)
| app(X24,cons(X22,nil)) != X15 ) ) ) )
& ( nil = X16
| nil != X15 ) ) ) ) ),
inference(variable_rename,[status(thm)],[152]) ).
fof(154,negated_conjecture,
( ssList(esk11_0)
& ssList(esk12_0)
& ssList(esk13_0)
& ssList(esk14_0)
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& nil != esk11_0
& ! [X17] :
( ~ ssItem(X17)
| ! [X18] :
( ~ ssList(X18)
| ! [X19] :
( ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk11_0
| ( ssItem(esk15_3(X17,X18,X19))
& memberP(X18,esk15_3(X17,X18,X19))
& memberP(X19,esk15_3(X17,X18,X19))
& leq(X17,esk15_3(X17,X18,X19))
& ~ leq(esk15_3(X17,X18,X19),X17) ) ) ) )
& ssList(esk16_0)
& app(esk13_0,esk16_0) = esk14_0
& equalelemsP(esk13_0)
& ! [X22] :
( ~ ssItem(X22)
| ! [X23] :
( ~ ssList(X23)
| app(cons(X22,nil),X23) != esk16_0
| ! [X24] :
( ~ ssList(X24)
| app(X24,cons(X22,nil)) != esk13_0 ) ) )
& ( nil = esk14_0
| nil != esk13_0 ) ),
inference(skolemize,[status(esa)],[153]) ).
fof(155,negated_conjecture,
! [X17,X18,X19,X22,X23,X24] :
( ( ~ ssList(X24)
| app(X24,cons(X22,nil)) != esk13_0
| ~ ssList(X23)
| app(cons(X22,nil),X23) != esk16_0
| ~ ssItem(X22) )
& app(esk13_0,esk16_0) = esk14_0
& equalelemsP(esk13_0)
& ssList(esk16_0)
& ( ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk11_0
| ( ssItem(esk15_3(X17,X18,X19))
& memberP(X18,esk15_3(X17,X18,X19))
& memberP(X19,esk15_3(X17,X18,X19))
& leq(X17,esk15_3(X17,X18,X19))
& ~ leq(esk15_3(X17,X18,X19),X17) )
| ~ ssList(X18)
| ~ ssItem(X17) )
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& nil != esk11_0
& ( nil = esk14_0
| nil != esk13_0 )
& ssList(esk14_0)
& ssList(esk13_0)
& ssList(esk12_0)
& ssList(esk11_0) ),
inference(shift_quantors,[status(thm)],[154]) ).
fof(156,negated_conjecture,
! [X17,X18,X19,X22,X23,X24] :
( ( ~ ssList(X24)
| app(X24,cons(X22,nil)) != esk13_0
| ~ ssList(X23)
| app(cons(X22,nil),X23) != esk16_0
| ~ ssItem(X22) )
& app(esk13_0,esk16_0) = esk14_0
& equalelemsP(esk13_0)
& ssList(esk16_0)
& ( ssItem(esk15_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk11_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X18,esk15_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk11_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X19,esk15_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk11_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( leq(X17,esk15_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk11_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ leq(esk15_3(X17,X18,X19),X17)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk11_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& esk12_0 = esk14_0
& esk11_0 = esk13_0
& nil != esk11_0
& ( nil = esk14_0
| nil != esk13_0 )
& ssList(esk14_0)
& ssList(esk13_0)
& ssList(esk12_0)
& ssList(esk11_0) ),
inference(distribute,[status(thm)],[155]) ).
cnf(157,negated_conjecture,
ssList(esk11_0),
inference(split_conjunct,[status(thm)],[156]) ).
cnf(162,negated_conjecture,
nil != esk11_0,
inference(split_conjunct,[status(thm)],[156]) ).
cnf(163,negated_conjecture,
esk11_0 = esk13_0,
inference(split_conjunct,[status(thm)],[156]) ).
cnf(168,negated_conjecture,
( memberP(X2,esk15_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk11_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[156]) ).
cnf(169,negated_conjecture,
( ssItem(esk15_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk11_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[156]) ).
cnf(174,negated_conjecture,
esk13_0 != nil,
inference(rw,[status(thm)],[162,163,theory(equality)]) ).
cnf(177,negated_conjecture,
ssList(esk13_0),
inference(rw,[status(thm)],[157,163,theory(equality)]) ).
cnf(197,plain,
( app(X1,nil) = nil
| nil != X1
| ~ ssList(nil)
| ~ ssList(X1) ),
inference(er,[status(thm)],[38,theory(equality)]) ).
cnf(198,plain,
( app(X1,nil) = nil
| nil != X1
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[197,117,theory(equality)]) ).
cnf(199,plain,
( app(X1,nil) = nil
| nil != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[198,theory(equality)]) ).
cnf(212,plain,
( app(cons(esk2_1(X1),nil),esk1_1(X1)) = X1
| nil = X1
| ~ ssList(X1)
| ~ ssItem(esk2_1(X1))
| ~ ssList(esk1_1(X1)) ),
inference(spm,[status(thm)],[76,48,theory(equality)]) ).
cnf(218,plain,
( ssList(app(cons(X1,nil),X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[148,48,theory(equality)]) ).
cnf(361,negated_conjecture,
( ssItem(esk15_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk13_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[169,163,theory(equality)]) ).
cnf(363,negated_conjecture,
( ssItem(esk15_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk13_0
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(nil)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[361,59,theory(equality)]) ).
cnf(368,negated_conjecture,
( ssItem(esk15_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk13_0
| ~ ssItem(X1)
| ~ ssList(X2)
| $false
| ~ ssList(cons(X1,nil)) ),
inference(rw,[status(thm)],[363,117,theory(equality)]) ).
cnf(369,negated_conjecture,
( ssItem(esk15_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk13_0
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[368,theory(equality)]) ).
cnf(388,negated_conjecture,
( memberP(X2,esk15_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk13_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[168,163,theory(equality)]) ).
cnf(390,negated_conjecture,
( memberP(nil,esk15_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk13_0
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(nil)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[388,59,theory(equality)]) ).
cnf(395,negated_conjecture,
( memberP(nil,esk15_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk13_0
| ~ ssItem(X1)
| ~ ssList(X2)
| $false
| ~ ssList(cons(X1,nil)) ),
inference(rw,[status(thm)],[390,117,theory(equality)]) ).
cnf(396,negated_conjecture,
( memberP(nil,esk15_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk13_0
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[395,theory(equality)]) ).
cnf(413,plain,
( app(nil,nil) = nil
| ~ ssList(nil) ),
inference(er,[status(thm)],[199,theory(equality)]) ).
cnf(414,plain,
( app(nil,nil) = nil
| $false ),
inference(rw,[status(thm)],[413,117,theory(equality)]) ).
cnf(415,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[414,theory(equality)]) ).
cnf(422,plain,
( cons(X1,nil) = app(cons(X1,nil),nil)
| ~ ssItem(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[63,415,theory(equality)]) ).
cnf(437,plain,
( cons(X1,nil) = app(cons(X1,nil),nil)
| ~ ssItem(X1)
| $false ),
inference(rw,[status(thm)],[422,117,theory(equality)]) ).
cnf(438,plain,
( cons(X1,nil) = app(cons(X1,nil),nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[437,theory(equality)]) ).
cnf(470,plain,
( app(cons(esk2_1(X1),nil),esk1_1(X1)) = X1
| nil = X1
| ~ ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[212,78]) ).
cnf(471,plain,
( app(cons(esk2_1(X1),nil),esk1_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[470,77]) ).
cnf(796,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[218,438,theory(equality)]) ).
cnf(831,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1)
| $false ),
inference(rw,[status(thm)],[796,117,theory(equality)]) ).
cnf(832,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[831,theory(equality)]) ).
cnf(9629,negated_conjecture,
( ssItem(esk15_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk13_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[369,832]) ).
cnf(9632,negated_conjecture,
( ssItem(esk15_3(esk2_1(X1),nil,esk1_1(X1)))
| nil = X1
| X1 != esk13_0
| ~ ssItem(esk2_1(X1))
| ~ ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[9629,471,theory(equality)]) ).
cnf(11957,negated_conjecture,
( memberP(nil,esk15_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk13_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[396,832]) ).
cnf(11960,negated_conjecture,
( memberP(nil,esk15_3(esk2_1(X1),nil,esk1_1(X1)))
| nil = X1
| X1 != esk13_0
| ~ ssItem(esk2_1(X1))
| ~ ssList(esk1_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[11957,471,theory(equality)]) ).
cnf(1200426,negated_conjecture,
( nil = X1
| ssItem(esk15_3(esk2_1(X1),nil,esk1_1(X1)))
| X1 != esk13_0
| ~ ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[9632,78]) ).
cnf(1200427,negated_conjecture,
( nil = X1
| ssItem(esk15_3(esk2_1(X1),nil,esk1_1(X1)))
| X1 != esk13_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[1200426,77]) ).
cnf(1200428,negated_conjecture,
( nil = esk13_0
| ssItem(esk15_3(esk2_1(esk13_0),nil,esk1_1(esk13_0)))
| ~ ssList(esk13_0) ),
inference(er,[status(thm)],[1200427,theory(equality)]) ).
cnf(1200429,negated_conjecture,
( nil = esk13_0
| ssItem(esk15_3(esk2_1(esk13_0),nil,esk1_1(esk13_0)))
| $false ),
inference(rw,[status(thm)],[1200428,177,theory(equality)]) ).
cnf(1200430,negated_conjecture,
( nil = esk13_0
| ssItem(esk15_3(esk2_1(esk13_0),nil,esk1_1(esk13_0))) ),
inference(cn,[status(thm)],[1200429,theory(equality)]) ).
cnf(1200431,negated_conjecture,
ssItem(esk15_3(esk2_1(esk13_0),nil,esk1_1(esk13_0))),
inference(sr,[status(thm)],[1200430,174,theory(equality)]) ).
cnf(1469112,negated_conjecture,
( nil = X1
| memberP(nil,esk15_3(esk2_1(X1),nil,esk1_1(X1)))
| X1 != esk13_0
| ~ ssItem(esk2_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[11960,78]) ).
cnf(1469113,negated_conjecture,
( nil = X1
| memberP(nil,esk15_3(esk2_1(X1),nil,esk1_1(X1)))
| X1 != esk13_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[1469112,77]) ).
cnf(1469114,negated_conjecture,
( nil = esk13_0
| memberP(nil,esk15_3(esk2_1(esk13_0),nil,esk1_1(esk13_0)))
| ~ ssList(esk13_0) ),
inference(er,[status(thm)],[1469113,theory(equality)]) ).
cnf(1469115,negated_conjecture,
( nil = esk13_0
| memberP(nil,esk15_3(esk2_1(esk13_0),nil,esk1_1(esk13_0)))
| $false ),
inference(rw,[status(thm)],[1469114,177,theory(equality)]) ).
cnf(1469116,negated_conjecture,
( nil = esk13_0
| memberP(nil,esk15_3(esk2_1(esk13_0),nil,esk1_1(esk13_0))) ),
inference(cn,[status(thm)],[1469115,theory(equality)]) ).
cnf(1469117,negated_conjecture,
memberP(nil,esk15_3(esk2_1(esk13_0),nil,esk1_1(esk13_0))),
inference(sr,[status(thm)],[1469116,174,theory(equality)]) ).
cnf(1469118,negated_conjecture,
~ ssItem(esk15_3(esk2_1(esk13_0),nil,esk1_1(esk13_0))),
inference(spm,[status(thm)],[134,1469117,theory(equality)]) ).
cnf(1469125,negated_conjecture,
$false,
inference(rw,[status(thm)],[1469118,1200431,theory(equality)]) ).
cnf(1469126,negated_conjecture,
$false,
inference(cn,[status(thm)],[1469125,theory(equality)]) ).
cnf(1469127,negated_conjecture,
$false,
1469126,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC224+1.p
% --creating new selector for [SWC001+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpQgsFjj/sel_SWC224+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpQgsFjj/sel_SWC224+1.p_2 with time limit 80
% -prover status Theorem
% Problem SWC224+1.p solved in phase 1.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC224+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC224+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
%
%------------------------------------------------------------------------------