TSTP Solution File: SWC207+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC207+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:55:57 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 4
% Syntax : Number of formulae : 45 ( 16 unt; 0 def)
% Number of atoms : 238 ( 87 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 287 ( 94 ~; 94 |; 79 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 38 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/tmp/tmpSmj1Rv/sel_SWC207+1.p_1',ax21) ).
fof(16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpSmj1Rv/sel_SWC207+1.p_1',ax15) ).
fof(18,axiom,
ssList(nil),
file('/tmp/tmpSmj1Rv/sel_SWC207+1.p_1',ax17) ).
fof(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/tmp/tmpSmj1Rv/sel_SWC207+1.p_1',co1) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[26]) ).
fof(29,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(67,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| nil != cons(X2,X1) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(68,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3) ) ),
inference(variable_rename,[status(thm)],[67]) ).
fof(69,plain,
! [X3,X4] :
( ~ ssItem(X4)
| nil != cons(X4,X3)
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[68]) ).
cnf(70,plain,
( ~ ssList(X1)
| nil != cons(X2,X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[69]) ).
fof(102,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(103,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[102]) ).
fof(104,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[103]) ).
fof(105,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)],[104]) ).
cnf(106,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[105]) ).
cnf(112,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[18]) ).
fof(147,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& neq(X2,nil)
& ~ neq(X1,nil)
& ( ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X3
& memberP(X4,X5)
& ! [X6] :
( ~ ssItem(X6)
| X5 = X6
| ~ memberP(X4,X6)
| ~ leq(X5,X6) ) )
| ( nil = X4
& nil = X3 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[29]) ).
fof(148,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& X8 = X10
& X7 = X9
& neq(X8,nil)
& ~ neq(X7,nil)
& ( ? [X11] :
( ssItem(X11)
& cons(X11,nil) = X9
& memberP(X10,X11)
& ! [X12] :
( ~ ssItem(X12)
| X11 = X12
| ~ memberP(X10,X12)
| ~ leq(X11,X12) ) )
| ( nil = X10
& nil = X9 ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[147]) ).
fof(149,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)
& ~ neq(esk7_0,nil)
& ( ( ssItem(esk11_0)
& cons(esk11_0,nil) = esk9_0
& memberP(esk10_0,esk11_0)
& ! [X12] :
( ~ ssItem(X12)
| esk11_0 = X12
| ~ memberP(esk10_0,X12)
| ~ leq(esk11_0,X12) ) )
| ( nil = esk10_0
& nil = esk9_0 ) ) ),
inference(skolemize,[status(esa)],[148]) ).
fof(150,negated_conjecture,
! [X12] :
( ( ( ( ~ ssItem(X12)
| esk11_0 = X12
| ~ memberP(esk10_0,X12)
| ~ leq(esk11_0,X12) )
& cons(esk11_0,nil) = esk9_0
& memberP(esk10_0,esk11_0)
& ssItem(esk11_0) )
| ( nil = esk10_0
& nil = esk9_0 ) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& neq(esk8_0,nil)
& ~ neq(esk7_0,nil)
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[149]) ).
fof(151,negated_conjecture,
! [X12] :
( ( nil = esk10_0
| ~ ssItem(X12)
| esk11_0 = X12
| ~ memberP(esk10_0,X12)
| ~ leq(esk11_0,X12) )
& ( nil = esk9_0
| ~ ssItem(X12)
| esk11_0 = X12
| ~ memberP(esk10_0,X12)
| ~ leq(esk11_0,X12) )
& ( 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) )
& ( nil = esk10_0
| ssItem(esk11_0) )
& ( nil = esk9_0
| ssItem(esk11_0) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& neq(esk8_0,nil)
& ~ neq(esk7_0,nil)
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[150]) ).
cnf(152,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(156,negated_conjecture,
~ neq(esk7_0,nil),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(157,negated_conjecture,
neq(esk8_0,nil),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(158,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[151]) ).
cnf(159,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[151]) ).
cnf(161,negated_conjecture,
( ssItem(esk11_0)
| nil = esk10_0 ),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(165,negated_conjecture,
( cons(esk11_0,nil) = esk9_0
| nil = esk10_0 ),
inference(split_conjunct,[status(thm)],[151]) ).
cnf(168,negated_conjecture,
ssList(esk9_0),
inference(rw,[status(thm)],[152,158,theory(equality)]) ).
cnf(170,negated_conjecture,
neq(esk10_0,nil),
inference(rw,[status(thm)],[157,159,theory(equality)]) ).
cnf(171,negated_conjecture,
~ neq(esk9_0,nil),
inference(rw,[status(thm)],[156,158,theory(equality)]) ).
cnf(184,negated_conjecture,
( esk9_0 = nil
| ~ ssList(nil)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[171,106,theory(equality)]) ).
cnf(185,negated_conjecture,
( esk9_0 = nil
| $false
| ~ ssList(esk9_0) ),
inference(rw,[status(thm)],[184,112,theory(equality)]) ).
cnf(186,negated_conjecture,
( esk9_0 = nil
| ~ ssList(esk9_0) ),
inference(cn,[status(thm)],[185,theory(equality)]) ).
cnf(359,negated_conjecture,
( esk9_0 = nil
| $false ),
inference(rw,[status(thm)],[186,168,theory(equality)]) ).
cnf(360,negated_conjecture,
esk9_0 = nil,
inference(cn,[status(thm)],[359,theory(equality)]) ).
cnf(366,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[171,360,theory(equality)]) ).
cnf(368,negated_conjecture,
( cons(esk11_0,nil) = nil
| esk10_0 = nil ),
inference(rw,[status(thm)],[165,360,theory(equality)]) ).
cnf(378,negated_conjecture,
( esk10_0 = nil
| ~ ssItem(esk11_0)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[70,368,theory(equality)]) ).
cnf(390,negated_conjecture,
( esk10_0 = nil
| ~ ssItem(esk11_0)
| $false ),
inference(rw,[status(thm)],[378,112,theory(equality)]) ).
cnf(391,negated_conjecture,
( esk10_0 = nil
| ~ ssItem(esk11_0) ),
inference(cn,[status(thm)],[390,theory(equality)]) ).
cnf(406,negated_conjecture,
esk10_0 = nil,
inference(csr,[status(thm)],[391,161]) ).
cnf(409,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[170,406,theory(equality)]) ).
cnf(410,negated_conjecture,
$false,
inference(sr,[status(thm)],[409,366,theory(equality)]) ).
cnf(411,negated_conjecture,
$false,
410,
[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/SWC207+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpSmj1Rv/sel_SWC207+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC207+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC207+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC207+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
%
%------------------------------------------------------------------------------