TSTP Solution File: SWC069+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC069+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:16:01 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of formulae : 62 ( 14 unt; 0 def)
% Number of atoms : 298 ( 81 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 367 ( 131 ~; 136 |; 82 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 47 ( 0 sgn 30 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpbd5798/sel_SWC069+1.p_1',ax15) ).
fof(20,axiom,
ssList(nil),
file('/tmp/tmpbd5798/sel_SWC069+1.p_1',ax17) ).
fof(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil != X3
& nil = X4 )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ segmentP(X4,X6)
| ~ segmentP(X3,X6) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/tmp/tmpbd5798/sel_SWC069+1.p_1',co1) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil != X3
& nil = X4 )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ segmentP(X4,X6)
| ~ segmentP(X3,X6) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[26]) ).
fof(28,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil != X3
& nil = X4 )
| ( nil = X2
& nil = X1 )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ segmentP(X4,X6)
| ~ segmentP(X3,X6) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(112,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(113,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[112]) ).
fof(114,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[113]) ).
fof(115,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)],[114]) ).
cnf(116,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[115]) ).
cnf(122,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[20]) ).
fof(141,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X2,X5)
| ~ segmentP(X1,X5) )
& ( nil = X3
| nil != X4 )
& ( nil != X2
| nil != X1 )
& ( ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X4,X6)
& segmentP(X3,X6) )
| ~ neq(X4,nil) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(142,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& X8 = X10
& X7 = X9
& ! [X11] :
( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(X8,X11)
| ~ segmentP(X7,X11) )
& ( nil = X9
| nil != X10 )
& ( nil != X8
| nil != X7 )
& ( ? [X12] :
( ssList(X12)
& neq(X12,nil)
& segmentP(X10,X12)
& segmentP(X9,X12) )
| ~ neq(X10,nil) ) ) ) ) ),
inference(variable_rename,[status(thm)],[141]) ).
fof(143,negated_conjecture,
( ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ! [X11] :
( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk8_0,X11)
| ~ segmentP(esk7_0,X11) )
& ( nil = esk9_0
| nil != esk10_0 )
& ( nil != esk8_0
| nil != esk7_0 )
& ( ( ssList(esk11_0)
& neq(esk11_0,nil)
& segmentP(esk10_0,esk11_0)
& segmentP(esk9_0,esk11_0) )
| ~ neq(esk10_0,nil) ) ),
inference(skolemize,[status(esa)],[142]) ).
fof(144,negated_conjecture,
! [X11] :
( ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk8_0,X11)
| ~ segmentP(esk7_0,X11) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( nil = esk9_0
| nil != esk10_0 )
& ( nil != esk8_0
| nil != esk7_0 )
& ( ( ssList(esk11_0)
& neq(esk11_0,nil)
& segmentP(esk10_0,esk11_0)
& segmentP(esk9_0,esk11_0) )
| ~ neq(esk10_0,nil) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[143]) ).
fof(145,negated_conjecture,
! [X11] :
( ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk8_0,X11)
| ~ segmentP(esk7_0,X11) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( nil = esk9_0
| nil != esk10_0 )
& ( nil != esk8_0
| nil != esk7_0 )
& ( ssList(esk11_0)
| ~ neq(esk10_0,nil) )
& ( neq(esk11_0,nil)
| ~ neq(esk10_0,nil) )
& ( segmentP(esk10_0,esk11_0)
| ~ neq(esk10_0,nil) )
& ( segmentP(esk9_0,esk11_0)
| ~ neq(esk10_0,nil) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[144]) ).
cnf(147,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(150,negated_conjecture,
( segmentP(esk9_0,esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(151,negated_conjecture,
( segmentP(esk10_0,esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(152,negated_conjecture,
( neq(esk11_0,nil)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(153,negated_conjecture,
( ssList(esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(154,negated_conjecture,
( nil != esk7_0
| nil != esk8_0 ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(155,negated_conjecture,
( nil = esk9_0
| nil != esk10_0 ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(156,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[145]) ).
cnf(157,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[145]) ).
cnf(158,negated_conjecture,
( ~ segmentP(esk7_0,X1)
| ~ segmentP(esk8_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(161,negated_conjecture,
ssList(esk10_0),
inference(rw,[status(thm)],[147,157,theory(equality)]) ).
cnf(162,negated_conjecture,
( esk7_0 = nil
| esk10_0 != nil ),
inference(rw,[status(thm)],[155,156,theory(equality)]) ).
cnf(163,negated_conjecture,
( segmentP(esk7_0,esk11_0)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[150,156,theory(equality)]) ).
cnf(164,negated_conjecture,
( esk7_0 != nil
| esk10_0 != nil ),
inference(rw,[status(thm)],[154,157,theory(equality)]) ).
cnf(165,negated_conjecture,
esk10_0 != nil,
inference(csr,[status(thm)],[164,162]) ).
cnf(169,negated_conjecture,
( ssList(esk11_0)
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[153,116,theory(equality)]) ).
cnf(170,negated_conjecture,
( neq(esk11_0,nil)
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[152,116,theory(equality)]) ).
cnf(171,negated_conjecture,
( segmentP(esk7_0,esk11_0)
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[163,116,theory(equality)]) ).
cnf(172,negated_conjecture,
( segmentP(esk10_0,esk11_0)
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[151,116,theory(equality)]) ).
cnf(173,negated_conjecture,
( ssList(esk11_0)
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[169,122,theory(equality)]) ).
cnf(174,negated_conjecture,
( ssList(esk11_0)
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[173,theory(equality)]) ).
cnf(175,negated_conjecture,
( ssList(esk11_0)
| ~ ssList(esk10_0) ),
inference(sr,[status(thm)],[174,165,theory(equality)]) ).
cnf(176,negated_conjecture,
( neq(esk11_0,nil)
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[170,122,theory(equality)]) ).
cnf(177,negated_conjecture,
( neq(esk11_0,nil)
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[176,theory(equality)]) ).
cnf(178,negated_conjecture,
( neq(esk11_0,nil)
| ~ ssList(esk10_0) ),
inference(sr,[status(thm)],[177,165,theory(equality)]) ).
cnf(179,negated_conjecture,
( segmentP(esk7_0,esk11_0)
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[171,122,theory(equality)]) ).
cnf(180,negated_conjecture,
( segmentP(esk7_0,esk11_0)
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[179,theory(equality)]) ).
cnf(181,negated_conjecture,
( segmentP(esk7_0,esk11_0)
| ~ ssList(esk10_0) ),
inference(sr,[status(thm)],[180,165,theory(equality)]) ).
cnf(182,negated_conjecture,
( segmentP(esk10_0,esk11_0)
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[172,122,theory(equality)]) ).
cnf(183,negated_conjecture,
( segmentP(esk10_0,esk11_0)
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[182,theory(equality)]) ).
cnf(184,negated_conjecture,
( segmentP(esk10_0,esk11_0)
| ~ ssList(esk10_0) ),
inference(sr,[status(thm)],[183,165,theory(equality)]) ).
cnf(200,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk7_0,X1)
| ~ segmentP(esk10_0,X1) ),
inference(rw,[status(thm)],[158,157,theory(equality)]) ).
cnf(346,negated_conjecture,
( ssList(esk11_0)
| $false ),
inference(rw,[status(thm)],[175,161,theory(equality)]) ).
cnf(347,negated_conjecture,
ssList(esk11_0),
inference(cn,[status(thm)],[346,theory(equality)]) ).
cnf(349,negated_conjecture,
( neq(esk11_0,nil)
| $false ),
inference(rw,[status(thm)],[178,161,theory(equality)]) ).
cnf(350,negated_conjecture,
neq(esk11_0,nil),
inference(cn,[status(thm)],[349,theory(equality)]) ).
cnf(352,negated_conjecture,
( segmentP(esk7_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[181,161,theory(equality)]) ).
cnf(353,negated_conjecture,
segmentP(esk7_0,esk11_0),
inference(cn,[status(thm)],[352,theory(equality)]) ).
cnf(354,negated_conjecture,
( ~ segmentP(esk10_0,esk11_0)
| ~ neq(esk11_0,nil)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[200,353,theory(equality)]) ).
cnf(362,negated_conjecture,
( ~ segmentP(esk10_0,esk11_0)
| $false
| ~ ssList(esk11_0) ),
inference(rw,[status(thm)],[354,350,theory(equality)]) ).
cnf(363,negated_conjecture,
( ~ segmentP(esk10_0,esk11_0)
| $false
| $false ),
inference(rw,[status(thm)],[362,347,theory(equality)]) ).
cnf(364,negated_conjecture,
~ segmentP(esk10_0,esk11_0),
inference(cn,[status(thm)],[363,theory(equality)]) ).
cnf(383,negated_conjecture,
( segmentP(esk10_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[184,161,theory(equality)]) ).
cnf(384,negated_conjecture,
segmentP(esk10_0,esk11_0),
inference(cn,[status(thm)],[383,theory(equality)]) ).
cnf(385,negated_conjecture,
$false,
inference(sr,[status(thm)],[384,364,theory(equality)]) ).
cnf(386,negated_conjecture,
$false,
385,
[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/SWC069+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpbd5798/sel_SWC069+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC069+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC069+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC069+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
%
%------------------------------------------------------------------------------