%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC386+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:25 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 5
% Syntax : Number of formulae : 59 ( 11 unt; 0 def)
% Number of atoms : 279 ( 125 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 338 ( 118 ~; 119 |; 79 &)
% ( 1 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 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 : 63 ( 0 sgn 42 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/tmp/tmpZyrLHR/sel_SWC386+1.p_1',ax21) ).
fof(15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpZyrLHR/sel_SWC386+1.p_1',ax15) ).
fof(17,axiom,
ssList(nil),
file('/tmp/tmpZyrLHR/sel_SWC386+1.p_1',ax17) ).
fof(20,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/tmp/tmpZyrLHR/sel_SWC386+1.p_1',ax38) ).
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) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X1
& memberP(X2,X6) ) ) ) ) ) ) ) ),
file('/tmp/tmpZyrLHR/sel_SWC386+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) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X1
& memberP(X2,X6) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[23]) ).
fof(25,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[20,theory(equality)]) ).
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) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X1
& memberP(X2,X6) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[24,theory(equality)]) ).
fof(60,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| nil != cons(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(61,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3) ) ),
inference(variable_rename,[status(thm)],[60]) ).
fof(62,plain,
! [X3,X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[61]) ).
cnf(63,plain,
( ~ ssList(X1)
| nil != cons(X2,X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[62]) ).
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(100,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[98]) ).
cnf(105,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[17]) ).
fof(120,plain,
! [X1] :
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(121,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[120]) ).
cnf(122,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[121]) ).
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) = X3
& memberP(X4,X5) )
| ( nil = X4
& nil = X3 ) )
& ( ( nil = X2
& nil != X1 )
| ( neq(X2,nil)
& ! [X6] :
( ~ ssItem(X6)
| cons(X6,nil) != X1
| ~ memberP(X2,X6) ) ) ) ) ) ) ),
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) = X9
& memberP(X10,X11) )
| ( nil = X10
& nil = X9 ) )
& ( ( nil = X8
& nil != X7 )
| ( neq(X8,nil)
& ! [X12] :
( ~ ssItem(X12)
| cons(X12,nil) != X7
| ~ memberP(X8,X12) ) ) ) ) ) ) ),
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)
& cons(esk11_0,nil) = esk9_0
& memberP(esk10_0,esk11_0) )
| ( nil = esk10_0
& nil = esk9_0 ) )
& ( ( nil = esk8_0
& nil != esk7_0 )
| ( neq(esk8_0,nil)
& ! [X12] :
( ~ ssItem(X12)
| cons(X12,nil) != esk7_0
| ~ memberP(esk8_0,X12) ) ) ) ),
inference(skolemize,[status(esa)],[134]) ).
fof(136,negated_conjecture,
! [X12] :
( ( ( ( ~ ssItem(X12)
| cons(X12,nil) != esk7_0
| ~ memberP(esk8_0,X12) )
& neq(esk8_0,nil) )
| ( nil = esk8_0
& nil != esk7_0 ) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( ( ssItem(esk11_0)
& cons(esk11_0,nil) = esk9_0
& memberP(esk10_0,esk11_0) )
| ( nil = esk10_0
& nil = esk9_0 ) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[135]) ).
fof(137,negated_conjecture,
! [X12] :
( ( nil = esk8_0
| ~ ssItem(X12)
| cons(X12,nil) != esk7_0
| ~ memberP(esk8_0,X12) )
& ( nil != esk7_0
| ~ ssItem(X12)
| cons(X12,nil) != esk7_0
| ~ memberP(esk8_0,X12) )
& ( nil = esk8_0
| neq(esk8_0,nil) )
& ( nil != esk7_0
| neq(esk8_0,nil) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( nil = esk10_0
| ssItem(esk11_0) )
& ( nil = esk9_0
| ssItem(esk11_0) )
& ( nil = esk10_0
| cons(esk11_0,nil) = esk9_0 )
& ( nil = esk9_0
| cons(esk11_0,nil) = esk9_0 )
& ( nil = esk10_0
| memberP(esk10_0,esk11_0) )
& ( nil = esk9_0
| memberP(esk10_0,esk11_0) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[136]) ).
cnf(142,negated_conjecture,
( memberP(esk10_0,esk11_0)
| nil = esk9_0 ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(144,negated_conjecture,
( cons(esk11_0,nil) = esk9_0
| nil = esk9_0 ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(145,negated_conjecture,
( cons(esk11_0,nil) = esk9_0
| nil = esk10_0 ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(146,negated_conjecture,
( ssItem(esk11_0)
| nil = esk9_0 ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(147,negated_conjecture,
( ssItem(esk11_0)
| nil = esk10_0 ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(148,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[137]) ).
cnf(149,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[137]) ).
cnf(150,negated_conjecture,
( neq(esk8_0,nil)
| nil != esk7_0 ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(153,negated_conjecture,
( nil = esk8_0
| ~ memberP(esk8_0,X1)
| cons(X1,nil) != esk7_0
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[137]) ).
cnf(156,negated_conjecture,
( esk8_0 = nil
| ssItem(esk11_0) ),
inference(rw,[status(thm)],[147,149,theory(equality)]) ).
cnf(157,negated_conjecture,
( esk9_0 = nil
| memberP(esk8_0,esk11_0) ),
inference(rw,[status(thm)],[142,149,theory(equality)]) ).
cnf(160,negated_conjecture,
( neq(esk8_0,nil)
| esk9_0 != nil ),
inference(rw,[status(thm)],[150,148,theory(equality)]) ).
cnf(161,negated_conjecture,
( esk8_0 = nil
| cons(esk11_0,nil) = esk9_0 ),
inference(rw,[status(thm)],[145,149,theory(equality)]) ).
cnf(168,negated_conjecture,
( esk8_0 = nil
| cons(X1,nil) != esk9_0
| ~ ssItem(X1)
| ~ memberP(esk8_0,X1) ),
inference(rw,[status(thm)],[153,148,theory(equality)]) ).
cnf(169,negated_conjecture,
( esk8_0 = nil
| esk9_0 = nil
| ~ memberP(esk8_0,esk11_0)
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[168,144,theory(equality)]) ).
cnf(178,negated_conjecture,
( esk8_0 = nil
| esk9_0 != nil
| ~ ssItem(esk11_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[63,161,theory(equality)]) ).
cnf(181,negated_conjecture,
( esk8_0 = nil
| esk9_0 != nil
| ~ ssItem(esk11_0)
| $false ),
inference(rw,[status(thm)],[178,105,theory(equality)]) ).
cnf(182,negated_conjecture,
( esk8_0 = nil
| esk9_0 != nil
| ~ ssItem(esk11_0) ),
inference(cn,[status(thm)],[181,theory(equality)]) ).
cnf(189,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[100,theory(equality)]) ).
cnf(351,negated_conjecture,
( esk8_0 = nil
| esk9_0 != nil ),
inference(csr,[status(thm)],[182,156]) ).
cnf(357,negated_conjecture,
( esk8_0 = nil
| esk9_0 = nil
| ~ memberP(esk8_0,esk11_0) ),
inference(csr,[status(thm)],[169,146]) ).
cnf(358,negated_conjecture,
( esk8_0 = nil
| esk9_0 = nil ),
inference(csr,[status(thm)],[357,157]) ).
cnf(359,negated_conjecture,
esk8_0 = nil,
inference(csr,[status(thm)],[358,351]) ).
cnf(369,negated_conjecture,
( neq(nil,nil)
| esk9_0 != nil ),
inference(rw,[status(thm)],[160,359,theory(equality)]) ).
cnf(372,negated_conjecture,
( esk9_0 = nil
| memberP(nil,esk11_0) ),
inference(rw,[status(thm)],[157,359,theory(equality)]) ).
cnf(376,negated_conjecture,
( esk9_0 = nil
| ~ ssItem(esk11_0) ),
inference(spm,[status(thm)],[122,372,theory(equality)]) ).
cnf(395,negated_conjecture,
esk9_0 = nil,
inference(csr,[status(thm)],[376,146]) ).
cnf(401,negated_conjecture,
( neq(nil,nil)
| $false ),
inference(rw,[status(thm)],[369,395,theory(equality)]) ).
cnf(402,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[401,theory(equality)]) ).
cnf(406,negated_conjecture,
~ ssList(nil),
inference(spm,[status(thm)],[189,402,theory(equality)]) ).
cnf(408,negated_conjecture,
$false,
inference(rw,[status(thm)],[406,105,theory(equality)]) ).
cnf(409,negated_conjecture,
$false,
inference(cn,[status(thm)],[408,theory(equality)]) ).
cnf(410,negated_conjecture,
$false,
409,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC386+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpZyrLHR/sel_SWC386+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC386+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC386+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC386+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
%
%------------------------------------------------------------------------------