TSTP Solution File: SWC415+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC415+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:46:33 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 4
% Syntax : Number of formulae : 49 ( 11 unt; 0 def)
% Number of atoms : 284 ( 100 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 384 ( 149 ~; 146 |; 72 &)
% ( 1 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 69 ( 0 sgn 35 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/tmp/tmpIPc99c/sel_SWC415+1.p_1',ax24) ).
fof(24,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpIPc99c/sel_SWC415+1.p_1',ax15) ).
fof(26,axiom,
ssList(nil),
file('/tmp/tmpIPc99c/sel_SWC415+1.p_1',ax17) ).
fof(29,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X3 != X5
& tl(X4) = X5
& neq(nil,X4) )
| ? [X6] :
( ssList(X6)
& tl(X2) = X6
& X1 = X6
& neq(nil,X2) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/tmp/tmpIPc99c/sel_SWC415+1.p_1',co1) ).
fof(30,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X3 != X5
& tl(X4) = X5
& neq(nil,X4) )
| ? [X6] :
( ssList(X6)
& tl(X2) = X6
& X1 = X6
& neq(nil,X2) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[29]) ).
fof(31,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X3 != X5
& tl(X4) = X5
& neq(nil,X4) )
| ? [X6] :
( ssList(X6)
& tl(X2) = X6
& X1 = X6
& neq(nil,X2) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[30,theory(equality)]) ).
fof(69,plain,
! [X1] :
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(70,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[69]) ).
cnf(71,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[70]) ).
fof(132,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(133,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[132]) ).
fof(134,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[133]) ).
fof(135,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)],[134]) ).
cnf(136,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[135]) ).
cnf(137,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[135]) ).
cnf(142,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[26]) ).
fof(153,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( ( neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| X3 = X5
| tl(X4) != X5
| ~ neq(nil,X4) )
& ! [X6] :
( ~ ssList(X6)
| tl(X2) != X6
| X1 != X6
| ~ neq(nil,X2) ) )
| ( neq(X2,nil)
& ~ neq(X4,nil) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(154,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& X8 = X10
& X7 = X9
& ( ( neq(X8,nil)
& ! [X11] :
( ~ ssList(X11)
| X9 = X11
| tl(X10) != X11
| ~ neq(nil,X10) )
& ! [X12] :
( ~ ssList(X12)
| tl(X8) != X12
| X7 != X12
| ~ neq(nil,X8) ) )
| ( neq(X8,nil)
& ~ neq(X10,nil) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[153]) ).
fof(155,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( ( neq(esk8_0,nil)
& ! [X11] :
( ~ ssList(X11)
| esk9_0 = X11
| tl(esk10_0) != X11
| ~ neq(nil,esk10_0) )
& ! [X12] :
( ~ ssList(X12)
| tl(esk8_0) != X12
| esk7_0 != X12
| ~ neq(nil,esk8_0) ) )
| ( neq(esk8_0,nil)
& ~ neq(esk10_0,nil) ) ) ),
inference(skolemize,[status(esa)],[154]) ).
fof(156,negated_conjecture,
! [X11,X12] :
( ( ( ( ~ ssList(X12)
| tl(esk8_0) != X12
| esk7_0 != X12
| ~ neq(nil,esk8_0) )
& ( ~ ssList(X11)
| esk9_0 = X11
| tl(esk10_0) != X11
| ~ neq(nil,esk10_0) )
& neq(esk8_0,nil) )
| ( neq(esk8_0,nil)
& ~ neq(esk10_0,nil) ) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[155]) ).
fof(157,negated_conjecture,
! [X11,X12] :
( ( neq(esk8_0,nil)
| ~ ssList(X12)
| tl(esk8_0) != X12
| esk7_0 != X12
| ~ neq(nil,esk8_0) )
& ( ~ neq(esk10_0,nil)
| ~ ssList(X12)
| tl(esk8_0) != X12
| esk7_0 != X12
| ~ neq(nil,esk8_0) )
& ( neq(esk8_0,nil)
| ~ ssList(X11)
| esk9_0 = X11
| tl(esk10_0) != X11
| ~ neq(nil,esk10_0) )
& ( ~ neq(esk10_0,nil)
| ~ ssList(X11)
| esk9_0 = X11
| tl(esk10_0) != X11
| ~ neq(nil,esk10_0) )
& ( neq(esk8_0,nil)
| neq(esk8_0,nil) )
& ( ~ neq(esk10_0,nil)
| neq(esk8_0,nil) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[156]) ).
cnf(159,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(162,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[157]) ).
cnf(163,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[157]) ).
cnf(165,negated_conjecture,
( neq(esk8_0,nil)
| neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(166,negated_conjecture,
( esk9_0 = X1
| ~ neq(nil,esk10_0)
| tl(esk10_0) != X1
| ~ ssList(X1)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(168,negated_conjecture,
( ~ neq(nil,esk8_0)
| esk7_0 != X1
| tl(esk8_0) != X1
| ~ ssList(X1)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(178,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[137,theory(equality)]) ).
cnf(190,negated_conjecture,
( esk7_0 = X1
| tl(esk10_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk10_0)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[166,162,theory(equality)]) ).
cnf(191,negated_conjecture,
( esk7_0 = X1
| tl(esk8_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk10_0)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[190,163,theory(equality)]) ).
cnf(192,negated_conjecture,
( esk7_0 = X1
| tl(esk8_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk8_0)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[191,163,theory(equality)]) ).
cnf(193,negated_conjecture,
( esk7_0 = X1
| tl(esk8_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk8_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[192,163,theory(equality)]),165,theory(equality)]) ).
cnf(194,negated_conjecture,
( esk7_0 = X1
| tl(esk8_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk8_0) ),
inference(cn,[status(thm)],[193,theory(equality)]) ).
cnf(212,negated_conjecture,
( esk7_0 != X1
| tl(esk8_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk8_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[168,163,theory(equality)]),165,theory(equality)]) ).
cnf(213,negated_conjecture,
( esk7_0 != X1
| tl(esk8_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk8_0) ),
inference(cn,[status(thm)],[212,theory(equality)]) ).
cnf(214,negated_conjecture,
( tl(esk8_0) != X1
| ~ neq(nil,esk8_0)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[213,194]) ).
cnf(215,negated_conjecture,
( nil = esk8_0
| tl(esk8_0) != X1
| ~ ssList(X1)
| ~ ssList(esk8_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[214,136,theory(equality)]) ).
cnf(217,negated_conjecture,
( nil = esk8_0
| tl(esk8_0) != X1
| ~ ssList(X1)
| $false
| ~ ssList(nil) ),
inference(rw,[status(thm)],[215,159,theory(equality)]) ).
cnf(218,negated_conjecture,
( nil = esk8_0
| tl(esk8_0) != X1
| ~ ssList(X1)
| $false
| $false ),
inference(rw,[status(thm)],[217,142,theory(equality)]) ).
cnf(219,negated_conjecture,
( nil = esk8_0
| tl(esk8_0) != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[218,theory(equality)]) ).
cnf(330,negated_conjecture,
( esk8_0 = nil
| ~ ssList(tl(esk8_0)) ),
inference(er,[status(thm)],[219,theory(equality)]) ).
cnf(331,negated_conjecture,
( esk8_0 = nil
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[330,71,theory(equality)]) ).
cnf(332,negated_conjecture,
( esk8_0 = nil
| $false ),
inference(rw,[status(thm)],[331,159,theory(equality)]) ).
cnf(333,negated_conjecture,
esk8_0 = nil,
inference(cn,[status(thm)],[332,theory(equality)]) ).
cnf(334,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[165,333,theory(equality)]) ).
cnf(345,negated_conjecture,
~ ssList(nil),
inference(spm,[status(thm)],[178,334,theory(equality)]) ).
cnf(347,negated_conjecture,
$false,
inference(rw,[status(thm)],[345,142,theory(equality)]) ).
cnf(348,negated_conjecture,
$false,
inference(cn,[status(thm)],[347,theory(equality)]) ).
cnf(349,negated_conjecture,
$false,
348,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC415+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpIPc99c/sel_SWC415+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC415+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC415+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC415+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
%
%------------------------------------------------------------------------------