TSTP Solution File: SWC387+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC387+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:41:32 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 54 ( 12 unt; 0 def)
% Number of atoms : 257 ( 104 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 313 ( 110 ~; 111 |; 74 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 30 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpi4laCA/sel_SWC387+1.p_1',ax15) ).
fof(17,axiom,
ssList(nil),
file('/tmp/tmpi4laCA/sel_SWC387+1.p_1',ax17) ).
fof(23,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& memberP(X2,X5) )
| ( nil != X3
& nil = X4 )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/tmp/tmpi4laCA/sel_SWC387+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)
& cons(X5,nil) = X1
& memberP(X2,X5) )
| ( nil != X3
& nil = X4 )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& 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)
& cons(X5,nil) = X1
& memberP(X2,X5) )
| ( nil != X3
& nil = X4 )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[24,theory(equality)]) ).
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]) ).
cnf(105,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[17]) ).
fof(133,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X1
| ~ memberP(X2,X5) )
& ( nil = X3
| nil != X4 )
& ( nil != X2
| nil != X1 )
& ( ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X3
& memberP(X4,X6) )
| ~ neq(X4,nil) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(134,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& X8 = X10
& X7 = X9
& ! [X11] :
( ~ ssItem(X11)
| cons(X11,nil) != X7
| ~ memberP(X8,X11) )
& ( nil = X9
| nil != X10 )
& ( nil != X8
| nil != X7 )
& ( ? [X12] :
( ssItem(X12)
& cons(X12,nil) = X9
& memberP(X10,X12) )
| ~ neq(X10,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
& ! [X11] :
( ~ ssItem(X11)
| cons(X11,nil) != esk7_0
| ~ memberP(esk8_0,X11) )
& ( nil = esk9_0
| nil != esk10_0 )
& ( nil != esk8_0
| nil != esk7_0 )
& ( ( ssItem(esk11_0)
& cons(esk11_0,nil) = esk9_0
& memberP(esk10_0,esk11_0) )
| ~ neq(esk10_0,nil) ) ),
inference(skolemize,[status(esa)],[134]) ).
fof(136,negated_conjecture,
! [X11] :
( ( ~ ssItem(X11)
| cons(X11,nil) != esk7_0
| ~ memberP(esk8_0,X11) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( nil = esk9_0
| nil != esk10_0 )
& ( nil != esk8_0
| nil != esk7_0 )
& ( ( ssItem(esk11_0)
& cons(esk11_0,nil) = esk9_0
& memberP(esk10_0,esk11_0) )
| ~ neq(esk10_0,nil) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[135]) ).
fof(137,negated_conjecture,
! [X11] :
( ( ~ ssItem(X11)
| cons(X11,nil) != esk7_0
| ~ memberP(esk8_0,X11) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( nil = esk9_0
| nil != esk10_0 )
& ( nil != esk8_0
| nil != esk7_0 )
& ( ssItem(esk11_0)
| ~ neq(esk10_0,nil) )
& ( cons(esk11_0,nil) = esk9_0
| ~ neq(esk10_0,nil) )
& ( memberP(esk10_0,esk11_0)
| ~ neq(esk10_0,nil) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[136]) ).
cnf(139,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(142,negated_conjecture,
( memberP(esk10_0,esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(143,negated_conjecture,
( cons(esk11_0,nil) = esk9_0
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(144,negated_conjecture,
( ssItem(esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(145,negated_conjecture,
( nil != esk7_0
| nil != esk8_0 ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(146,negated_conjecture,
( nil = esk9_0
| nil != esk10_0 ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(147,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[137]) ).
cnf(148,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[137]) ).
cnf(149,negated_conjecture,
( ~ memberP(esk8_0,X1)
| cons(X1,nil) != esk7_0
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(152,negated_conjecture,
ssList(esk10_0),
inference(rw,[status(thm)],[139,148,theory(equality)]) ).
cnf(153,negated_conjecture,
( esk7_0 = nil
| esk10_0 != nil ),
inference(rw,[status(thm)],[146,147,theory(equality)]) ).
cnf(154,negated_conjecture,
( cons(esk11_0,nil) = esk7_0
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[143,147,theory(equality)]) ).
cnf(155,negated_conjecture,
( esk7_0 != nil
| esk10_0 != nil ),
inference(rw,[status(thm)],[145,148,theory(equality)]) ).
cnf(156,negated_conjecture,
esk10_0 != nil,
inference(csr,[status(thm)],[155,153]) ).
cnf(157,negated_conjecture,
( ssItem(esk11_0)
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[144,99,theory(equality)]) ).
cnf(158,negated_conjecture,
( memberP(esk10_0,esk11_0)
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[142,99,theory(equality)]) ).
cnf(159,negated_conjecture,
( cons(esk11_0,nil) = esk7_0
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[154,99,theory(equality)]) ).
cnf(160,negated_conjecture,
( ssItem(esk11_0)
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[157,105,theory(equality)]) ).
cnf(161,negated_conjecture,
( ssItem(esk11_0)
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[160,theory(equality)]) ).
cnf(162,negated_conjecture,
( ssItem(esk11_0)
| ~ ssList(esk10_0) ),
inference(sr,[status(thm)],[161,156,theory(equality)]) ).
cnf(163,negated_conjecture,
( memberP(esk10_0,esk11_0)
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[158,105,theory(equality)]) ).
cnf(164,negated_conjecture,
( memberP(esk10_0,esk11_0)
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[163,theory(equality)]) ).
cnf(165,negated_conjecture,
( memberP(esk10_0,esk11_0)
| ~ ssList(esk10_0) ),
inference(sr,[status(thm)],[164,156,theory(equality)]) ).
cnf(166,negated_conjecture,
( cons(esk11_0,nil) = esk7_0
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[159,105,theory(equality)]) ).
cnf(167,negated_conjecture,
( cons(esk11_0,nil) = esk7_0
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[166,theory(equality)]) ).
cnf(168,negated_conjecture,
( cons(esk11_0,nil) = esk7_0
| ~ ssList(esk10_0) ),
inference(sr,[status(thm)],[167,156,theory(equality)]) ).
cnf(186,negated_conjecture,
( cons(X1,nil) != esk7_0
| ~ ssItem(X1)
| ~ memberP(esk10_0,X1) ),
inference(rw,[status(thm)],[149,148,theory(equality)]) ).
cnf(289,negated_conjecture,
( ssItem(esk11_0)
| $false ),
inference(rw,[status(thm)],[162,152,theory(equality)]) ).
cnf(290,negated_conjecture,
ssItem(esk11_0),
inference(cn,[status(thm)],[289,theory(equality)]) ).
cnf(292,negated_conjecture,
( memberP(esk10_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[165,152,theory(equality)]) ).
cnf(293,negated_conjecture,
memberP(esk10_0,esk11_0),
inference(cn,[status(thm)],[292,theory(equality)]) ).
cnf(319,negated_conjecture,
( cons(esk11_0,nil) = esk7_0
| $false ),
inference(rw,[status(thm)],[168,152,theory(equality)]) ).
cnf(320,negated_conjecture,
cons(esk11_0,nil) = esk7_0,
inference(cn,[status(thm)],[319,theory(equality)]) ).
cnf(324,negated_conjecture,
( ~ memberP(esk10_0,esk11_0)
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[186,320,theory(equality)]) ).
cnf(343,negated_conjecture,
( $false
| ~ ssItem(esk11_0) ),
inference(rw,[status(thm)],[324,293,theory(equality)]) ).
cnf(344,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[343,290,theory(equality)]) ).
cnf(345,negated_conjecture,
$false,
inference(cn,[status(thm)],[344,theory(equality)]) ).
cnf(346,negated_conjecture,
$false,
345,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC387+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpi4laCA/sel_SWC387+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC387+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC387+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC387+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
%
%------------------------------------------------------------------------------