TSTP Solution File: SWC322+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC322+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:27:59 EST 2010
% Result : Theorem 0.31s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 1
% Syntax : Number of formulae : 47 ( 11 unt; 0 def)
% Number of atoms : 221 ( 129 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 256 ( 82 ~; 89 |; 73 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 22 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(17,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) != X3
& app(X6,cons(X5,nil)) = X4 ) )
| ( nil != X3
& nil = X4 )
| ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(X8,cons(X7,nil)) != X2
| app(cons(X7,nil),X8) = X1 ) ) )
& ( nil != X2
| nil = X1 ) ) ) ) ) ) ),
file('/tmp/tmpYxnli8/sel_SWC322+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] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) != X3
& app(X6,cons(X5,nil)) = X4 ) )
| ( nil != X3
& nil = X4 )
| ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(X8,cons(X7,nil)) != X2
| app(cons(X7,nil),X8) = X1 ) ) )
& ( nil != X2
| nil = X1 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[17]) ).
fof(87,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) = X3
| app(X6,cons(X5,nil)) != X4 ) )
& ( nil = X3
| nil != X4 )
& ( ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& app(cons(X7,nil),X8) != X1 ) )
| ( nil = X2
& nil != X1 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(88,negated_conjecture,
? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssList(X12)
& X10 = X12
& X9 = X11
& ! [X13] :
( ~ ssItem(X13)
| ! [X14] :
( ~ ssList(X14)
| app(cons(X13,nil),X14) = X11
| app(X14,cons(X13,nil)) != X12 ) )
& ( nil = X11
| nil != X12 )
& ( ? [X15] :
( ssItem(X15)
& ? [X16] :
( ssList(X16)
& app(X16,cons(X15,nil)) = X10
& app(cons(X15,nil),X16) != X9 ) )
| ( nil = X10
& nil != X9 ) ) ) ) ) ),
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
& ! [X13] :
( ~ ssItem(X13)
| ! [X14] :
( ~ ssList(X14)
| app(cons(X13,nil),X14) = esk7_0
| app(X14,cons(X13,nil)) != esk8_0 ) )
& ( nil = esk7_0
| nil != esk8_0 )
& ( ( ssItem(esk9_0)
& ssList(esk10_0)
& app(esk10_0,cons(esk9_0,nil)) = esk6_0
& app(cons(esk9_0,nil),esk10_0) != esk5_0 )
| ( nil = esk6_0
& nil != esk5_0 ) ) ),
inference(skolemize,[status(esa)],[88]) ).
fof(90,negated_conjecture,
! [X13,X14] :
( ( ~ ssList(X14)
| app(cons(X13,nil),X14) = esk7_0
| app(X14,cons(X13,nil)) != esk8_0
| ~ ssItem(X13) )
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ( nil = esk7_0
| nil != esk8_0 )
& ( ( ssItem(esk9_0)
& ssList(esk10_0)
& app(esk10_0,cons(esk9_0,nil)) = esk6_0
& app(cons(esk9_0,nil),esk10_0) != esk5_0 )
| ( nil = esk6_0
& nil != esk5_0 ) )
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0)
& ssList(esk5_0) ),
inference(shift_quantors,[status(thm)],[89]) ).
fof(91,negated_conjecture,
! [X13,X14] :
( ( ~ ssList(X14)
| app(cons(X13,nil),X14) = esk7_0
| app(X14,cons(X13,nil)) != esk8_0
| ~ ssItem(X13) )
& esk6_0 = esk8_0
& esk5_0 = esk7_0
& ( nil = esk7_0
| nil != esk8_0 )
& ( nil = esk6_0
| ssItem(esk9_0) )
& ( nil != esk5_0
| ssItem(esk9_0) )
& ( nil = esk6_0
| ssList(esk10_0) )
& ( nil != esk5_0
| ssList(esk10_0) )
& ( nil = esk6_0
| app(esk10_0,cons(esk9_0,nil)) = esk6_0 )
& ( nil != esk5_0
| app(esk10_0,cons(esk9_0,nil)) = esk6_0 )
& ( nil = esk6_0
| app(cons(esk9_0,nil),esk10_0) != esk5_0 )
& ( nil != esk5_0
| app(cons(esk9_0,nil),esk10_0) != esk5_0 )
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0)
& ssList(esk5_0) ),
inference(distribute,[status(thm)],[90]) ).
cnf(96,negated_conjecture,
( app(cons(esk9_0,nil),esk10_0) != esk5_0
| nil != esk5_0 ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(97,negated_conjecture,
( nil = esk6_0
| app(cons(esk9_0,nil),esk10_0) != esk5_0 ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(98,negated_conjecture,
( app(esk10_0,cons(esk9_0,nil)) = esk6_0
| nil != esk5_0 ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(99,negated_conjecture,
( app(esk10_0,cons(esk9_0,nil)) = esk6_0
| nil = esk6_0 ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(100,negated_conjecture,
( ssList(esk10_0)
| nil != esk5_0 ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(101,negated_conjecture,
( ssList(esk10_0)
| nil = esk6_0 ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(102,negated_conjecture,
( ssItem(esk9_0)
| nil != esk5_0 ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(103,negated_conjecture,
( ssItem(esk9_0)
| nil = esk6_0 ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(104,negated_conjecture,
( nil = esk7_0
| nil != esk8_0 ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(105,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[91]) ).
cnf(106,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[91]) ).
cnf(107,negated_conjecture,
( app(cons(X1,nil),X2) = esk7_0
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) != esk8_0
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[91]) ).
cnf(112,negated_conjecture,
( esk5_0 = nil
| esk8_0 != nil ),
inference(rw,[status(thm)],[104,105,theory(equality)]) ).
cnf(113,negated_conjecture,
( esk5_0 = nil
| esk6_0 != nil ),
inference(rw,[status(thm)],[112,106,theory(equality)]) ).
cnf(140,negated_conjecture,
( app(cons(X1,nil),X2) = esk5_0
| app(X2,cons(X1,nil)) != esk8_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[107,105,theory(equality)]) ).
cnf(141,negated_conjecture,
( app(cons(X1,nil),X2) = esk5_0
| app(X2,cons(X1,nil)) != esk6_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[140,106,theory(equality)]) ).
cnf(142,negated_conjecture,
( app(cons(esk9_0,nil),esk10_0) = esk5_0
| esk6_0 = nil
| ~ ssList(esk10_0)
| ~ ssItem(esk9_0) ),
inference(spm,[status(thm)],[141,99,theory(equality)]) ).
cnf(328,negated_conjecture,
( app(cons(esk9_0,nil),esk10_0) = esk5_0
| esk6_0 = nil
| ~ ssList(esk10_0) ),
inference(csr,[status(thm)],[142,103]) ).
cnf(329,negated_conjecture,
( app(cons(esk9_0,nil),esk10_0) = esk5_0
| esk6_0 = nil ),
inference(csr,[status(thm)],[328,101]) ).
cnf(330,negated_conjecture,
esk6_0 = nil,
inference(csr,[status(thm)],[329,97]) ).
cnf(336,negated_conjecture,
( app(cons(X1,nil),X2) = esk5_0
| app(X2,cons(X1,nil)) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[141,330,theory(equality)]) ).
cnf(338,negated_conjecture,
( app(esk10_0,cons(esk9_0,nil)) = nil
| esk5_0 != nil ),
inference(rw,[status(thm)],[98,330,theory(equality)]) ).
cnf(341,negated_conjecture,
( esk5_0 = nil
| $false ),
inference(rw,[status(thm)],[113,330,theory(equality)]) ).
cnf(342,negated_conjecture,
esk5_0 = nil,
inference(cn,[status(thm)],[341,theory(equality)]) ).
cnf(349,negated_conjecture,
( app(cons(esk9_0,nil),esk10_0) != nil
| esk5_0 != nil ),
inference(rw,[status(thm)],[96,342,theory(equality)]) ).
cnf(350,negated_conjecture,
( app(cons(esk9_0,nil),esk10_0) != nil
| $false ),
inference(rw,[status(thm)],[349,342,theory(equality)]) ).
cnf(351,negated_conjecture,
app(cons(esk9_0,nil),esk10_0) != nil,
inference(cn,[status(thm)],[350,theory(equality)]) ).
cnf(352,negated_conjecture,
( ssList(esk10_0)
| $false ),
inference(rw,[status(thm)],[100,342,theory(equality)]) ).
cnf(353,negated_conjecture,
ssList(esk10_0),
inference(cn,[status(thm)],[352,theory(equality)]) ).
cnf(354,negated_conjecture,
( ssItem(esk9_0)
| $false ),
inference(rw,[status(thm)],[102,342,theory(equality)]) ).
cnf(355,negated_conjecture,
ssItem(esk9_0),
inference(cn,[status(thm)],[354,theory(equality)]) ).
cnf(356,negated_conjecture,
( app(cons(X1,nil),X2) = nil
| app(X2,cons(X1,nil)) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[336,342,theory(equality)]) ).
cnf(371,negated_conjecture,
( app(esk10_0,cons(esk9_0,nil)) = nil
| $false ),
inference(rw,[status(thm)],[338,342,theory(equality)]) ).
cnf(372,negated_conjecture,
app(esk10_0,cons(esk9_0,nil)) = nil,
inference(cn,[status(thm)],[371,theory(equality)]) ).
cnf(382,negated_conjecture,
( app(cons(esk9_0,nil),esk10_0) = nil
| ~ ssList(esk10_0)
| ~ ssItem(esk9_0) ),
inference(spm,[status(thm)],[356,372,theory(equality)]) ).
cnf(402,negated_conjecture,
( app(cons(esk9_0,nil),esk10_0) = nil
| $false
| ~ ssItem(esk9_0) ),
inference(rw,[status(thm)],[382,353,theory(equality)]) ).
cnf(403,negated_conjecture,
( app(cons(esk9_0,nil),esk10_0) = nil
| $false
| $false ),
inference(rw,[status(thm)],[402,355,theory(equality)]) ).
cnf(404,negated_conjecture,
app(cons(esk9_0,nil),esk10_0) = nil,
inference(cn,[status(thm)],[403,theory(equality)]) ).
cnf(405,negated_conjecture,
$false,
inference(sr,[status(thm)],[404,351,theory(equality)]) ).
cnf(406,negated_conjecture,
$false,
405,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC322+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpYxnli8/sel_SWC322+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC322+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC322+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC322+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
%
%------------------------------------------------------------------------------