TSTP Solution File: SWC030+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC030+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 10:11:33 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 4
% Syntax : Number of formulae : 59 ( 21 unt; 0 def)
% Number of atoms : 231 ( 139 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 268 ( 96 ~; 96 |; 60 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 25 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/tmp/tmpiHKqQL/sel_SWC030+1.p_1',ax84) ).
fof(6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/tmp/tmpiHKqQL/sel_SWC030+1.p_1',ax83) ).
fof(11,axiom,
ssList(nil),
file('/tmp/tmpiHKqQL/sel_SWC030+1.p_1',ax17) ).
fof(17,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(X5,X6) != X4
| app(X6,X5) != X3 ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
file('/tmp/tmpiHKqQL/sel_SWC030+1.p_1',co1) ).
fof(18,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(X5,X6) != X4
| app(X6,X5) != X3 ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[17]) ).
fof(36,plain,
! [X1] :
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(37,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[36]) ).
cnf(38,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
fof(39,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)],[6]) ).
fof(40,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)],[39]) ).
fof(41,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)],[40]) ).
fof(42,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)],[41]) ).
cnf(43,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(44,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(45,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(65,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[11]) ).
fof(87,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(X5,X6) = X4
& app(X6,X5) = X3 ) )
& ( ( nil = X2
& nil != X1 )
| ( nil = X1
& nil != X2 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(88,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& X8 = X10
& X7 = X9
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& app(X11,X12) = X10
& app(X12,X11) = X9 ) )
& ( ( nil = X8
& nil != X7 )
| ( nil = X7
& nil != X8 ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[87]) ).
fof(89,negated_conjecture,
( ssList(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ssList(esk9_0)
& ssList(esk10_0)
& app(esk9_0,esk10_0) = esk8_0
& app(esk10_0,esk9_0) = esk7_0
& ( ( nil = esk6_0
& nil != esk5_0 )
| ( nil = esk5_0
& nil != esk6_0 ) ) ),
inference(skolemize,[status(esa)],[88]) ).
fof(90,negated_conjecture,
( ssList(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ssList(esk9_0)
& ssList(esk10_0)
& app(esk9_0,esk10_0) = esk8_0
& app(esk10_0,esk9_0) = esk7_0
& ( nil = esk5_0
| nil = esk6_0 )
& ( nil != esk6_0
| nil = esk6_0 )
& ( nil = esk5_0
| nil != esk5_0 )
& ( nil != esk6_0
| nil != esk5_0 ) ),
inference(distribute,[status(thm)],[89]) ).
cnf(91,negated_conjecture,
( nil != esk5_0
| nil != esk6_0 ),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(94,negated_conjecture,
( nil = esk6_0
| nil = esk5_0 ),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(95,negated_conjecture,
app(esk10_0,esk9_0) = esk7_0,
inference(split_conjunct,[status(thm)],[90]) ).
cnf(96,negated_conjecture,
app(esk9_0,esk10_0) = esk8_0,
inference(split_conjunct,[status(thm)],[90]) ).
cnf(97,negated_conjecture,
ssList(esk10_0),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(98,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(99,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[90]) ).
cnf(100,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[90]) ).
cnf(104,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(111,negated_conjecture,
app(esk9_0,esk10_0) = esk6_0,
inference(rw,[status(thm)],[96,100,theory(equality)]) ).
cnf(112,negated_conjecture,
app(esk10_0,esk9_0) = esk5_0,
inference(rw,[status(thm)],[95,99,theory(equality)]) ).
cnf(123,negated_conjecture,
( nil = esk10_0
| esk6_0 != nil
| ~ ssList(esk10_0)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[45,111,theory(equality)]) ).
cnf(124,negated_conjecture,
( nil = esk9_0
| esk5_0 != nil
| ~ ssList(esk9_0)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[45,112,theory(equality)]) ).
cnf(128,negated_conjecture,
( nil = esk9_0
| esk6_0 != nil
| ~ ssList(esk10_0)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[44,111,theory(equality)]) ).
cnf(133,plain,
( app(X1,nil) = nil
| nil != X1
| ~ ssList(nil)
| ~ ssList(X1) ),
inference(er,[status(thm)],[43,theory(equality)]) ).
cnf(134,plain,
( app(X1,nil) = nil
| nil != X1
| $false
| ~ ssList(X1) ),
inference(rw,[status(thm)],[133,65,theory(equality)]) ).
cnf(135,plain,
( app(X1,nil) = nil
| nil != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[134,theory(equality)]) ).
cnf(238,plain,
( app(nil,nil) = nil
| ~ ssList(nil) ),
inference(er,[status(thm)],[135,theory(equality)]) ).
cnf(239,plain,
( app(nil,nil) = nil
| $false ),
inference(rw,[status(thm)],[238,65,theory(equality)]) ).
cnf(240,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[239,theory(equality)]) ).
cnf(281,negated_conjecture,
( esk9_0 = nil
| esk5_0 = nil
| ~ ssList(esk10_0)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[128,94,theory(equality)]) ).
cnf(291,negated_conjecture,
( esk9_0 = nil
| ~ ssList(esk10_0)
| ~ ssList(esk9_0) ),
inference(csr,[status(thm)],[281,124]) ).
cnf(292,negated_conjecture,
( esk9_0 = nil
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[291,97,theory(equality)]) ).
cnf(293,negated_conjecture,
esk9_0 = nil,
inference(spm,[status(thm)],[292,98,theory(equality)]) ).
cnf(294,negated_conjecture,
app(esk10_0,nil) = esk5_0,
inference(rw,[status(thm)],[112,293,theory(equality)]) ).
cnf(295,negated_conjecture,
app(nil,esk10_0) = esk6_0,
inference(rw,[status(thm)],[111,293,theory(equality)]) ).
cnf(301,negated_conjecture,
( esk10_0 = nil
| esk6_0 != nil
| ~ ssList(esk10_0)
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[123,293,theory(equality)]),65,theory(equality)]) ).
cnf(302,negated_conjecture,
( esk10_0 = nil
| esk6_0 != nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[301,theory(equality)]) ).
cnf(308,negated_conjecture,
( esk5_0 = esk10_0
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[38,294,theory(equality)]) ).
cnf(355,negated_conjecture,
esk10_0 = esk5_0,
inference(spm,[status(thm)],[308,97,theory(equality)]) ).
cnf(362,negated_conjecture,
( esk5_0 = nil
| esk6_0 != nil
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[302,355,theory(equality)]) ).
cnf(363,negated_conjecture,
( esk5_0 = nil
| esk6_0 != nil
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[362,355,theory(equality)]),104,theory(equality)]) ).
cnf(364,negated_conjecture,
( esk5_0 = nil
| esk6_0 != nil ),
inference(cn,[status(thm)],[363,theory(equality)]) ).
cnf(365,negated_conjecture,
esk5_0 = nil,
inference(csr,[status(thm)],[364,94]) ).
cnf(372,negated_conjecture,
( $false
| esk6_0 != nil ),
inference(rw,[status(thm)],[91,365,theory(equality)]) ).
cnf(373,negated_conjecture,
esk6_0 != nil,
inference(cn,[status(thm)],[372,theory(equality)]) ).
cnf(375,negated_conjecture,
nil = esk6_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[295,355,theory(equality)]),365,theory(equality)]),240,theory(equality)]) ).
cnf(376,negated_conjecture,
$false,
inference(sr,[status(thm)],[375,373,theory(equality)]) ).
cnf(377,negated_conjecture,
$false,
376,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC030+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpiHKqQL/sel_SWC030+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC030+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC030+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC030+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
%
%------------------------------------------------------------------------------