%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC054+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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 10:09:35 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of formulae : 59 ( 11 unt; 0 def)
% Number of atoms : 301 ( 86 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 388 ( 146 ~; 144 |; 87 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 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 24 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(17,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpKi4ksJ/sel_SWC054+1.p_1',ax58) ).
fof(20,axiom,
ssList(nil),
file('/tmp/tmpKi4ksJ/sel_SWC054+1.p_1',ax17) ).
fof(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X4,X5)
| ~ segmentP(X3,X5) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ),
file('/tmp/tmpKi4ksJ/sel_SWC054+1.p_1',co1) ).
fof(27,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X4,X5)
| ~ segmentP(X3,X5) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ),
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
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X4,X5)
| ~ segmentP(X3,X5) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X2,X6)
& segmentP(X1,X6) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(107,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(nil,X1)
| nil = X1 )
& ( nil != X1
| segmentP(nil,X1) ) ) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(108,plain,
! [X2] :
( ~ ssList(X2)
| ( ( ~ segmentP(nil,X2)
| nil = X2 )
& ( nil != X2
| segmentP(nil,X2) ) ) ),
inference(variable_rename,[status(thm)],[107]) ).
fof(109,plain,
! [X2] :
( ( ~ segmentP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| segmentP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[108]) ).
cnf(110,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[109]) ).
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
& ( nil = X3
| nil != X4 )
& ( ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X4,X5)
& segmentP(X3,X5) )
| ~ neq(X4,nil) )
& ( ( nil = X2
& nil != X1 )
| ( neq(X2,nil)
& ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(X2,X6)
| ~ segmentP(X1,X6) ) ) ) ) ) ) ),
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
& ( nil = X9
| nil != X10 )
& ( ? [X11] :
( ssList(X11)
& neq(X11,nil)
& segmentP(X10,X11)
& segmentP(X9,X11) )
| ~ neq(X10,nil) )
& ( ( nil = X8
& nil != X7 )
| ( neq(X8,nil)
& ! [X12] :
( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(X8,X12)
| ~ segmentP(X7,X12) ) ) ) ) ) ) ),
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
& ( nil = esk9_0
| nil != esk10_0 )
& ( ( ssList(esk11_0)
& neq(esk11_0,nil)
& segmentP(esk10_0,esk11_0)
& segmentP(esk9_0,esk11_0) )
| ~ neq(esk10_0,nil) )
& ( ( nil = esk8_0
& nil != esk7_0 )
| ( neq(esk8_0,nil)
& ! [X12] :
( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk8_0,X12)
| ~ segmentP(esk7_0,X12) ) ) ) ),
inference(skolemize,[status(esa)],[142]) ).
fof(144,negated_conjecture,
! [X12] :
( ( ( ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk8_0,X12)
| ~ segmentP(esk7_0,X12) )
& neq(esk8_0,nil) )
| ( nil = esk8_0
& nil != esk7_0 ) )
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( nil = esk9_0
| nil != esk10_0 )
& ( ( ssList(esk11_0)
& neq(esk11_0,nil)
& segmentP(esk10_0,esk11_0)
& segmentP(esk9_0,esk11_0) )
| ~ neq(esk10_0,nil) )
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[143]) ).
fof(145,negated_conjecture,
! [X12] :
( ( nil = esk8_0
| ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk8_0,X12)
| ~ segmentP(esk7_0,X12) )
& ( nil != esk7_0
| ~ ssList(X12)
| ~ neq(X12,nil)
| ~ segmentP(esk8_0,X12)
| ~ segmentP(esk7_0,X12) )
& ( nil = esk8_0
| neq(esk8_0,nil) )
& ( nil != esk7_0
| neq(esk8_0,nil) )
& ssList(esk10_0)
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( nil = esk9_0
| nil != esk10_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(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[144]) ).
cnf(149,negated_conjecture,
( segmentP(esk9_0,esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(150,negated_conjecture,
( segmentP(esk10_0,esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(151,negated_conjecture,
( neq(esk11_0,nil)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(152,negated_conjecture,
( ssList(esk11_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(153,negated_conjecture,
( nil = esk9_0
| nil != esk10_0 ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(154,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[145]) ).
cnf(155,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[145]) ).
cnf(157,negated_conjecture,
( neq(esk8_0,nil)
| nil != esk7_0 ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(158,negated_conjecture,
( neq(esk8_0,nil)
| nil = esk8_0 ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(159,negated_conjecture,
( ~ segmentP(esk7_0,X1)
| ~ segmentP(esk8_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != esk7_0 ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(160,negated_conjecture,
( nil = esk8_0
| ~ segmentP(esk7_0,X1)
| ~ segmentP(esk8_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(164,negated_conjecture,
( esk7_0 = nil
| esk10_0 != nil ),
inference(rw,[status(thm)],[153,154,theory(equality)]) ).
cnf(165,negated_conjecture,
( esk10_0 = nil
| neq(esk8_0,nil) ),
inference(rw,[status(thm)],[158,155,theory(equality)]) ).
cnf(166,negated_conjecture,
( esk10_0 = nil
| neq(esk10_0,nil) ),
inference(rw,[status(thm)],[165,155,theory(equality)]) ).
cnf(167,negated_conjecture,
( ssList(esk11_0)
| esk10_0 = nil ),
inference(spm,[status(thm)],[152,166,theory(equality)]) ).
cnf(168,negated_conjecture,
( neq(esk10_0,nil)
| esk7_0 != nil ),
inference(rw,[status(thm)],[157,155,theory(equality)]) ).
cnf(169,negated_conjecture,
( neq(esk11_0,nil)
| esk10_0 = nil ),
inference(spm,[status(thm)],[151,166,theory(equality)]) ).
cnf(170,negated_conjecture,
( segmentP(esk7_0,esk11_0)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[149,154,theory(equality)]) ).
cnf(171,negated_conjecture,
( segmentP(esk7_0,esk11_0)
| esk10_0 = nil ),
inference(spm,[status(thm)],[170,166,theory(equality)]) ).
cnf(172,negated_conjecture,
( segmentP(esk10_0,esk11_0)
| esk10_0 = nil ),
inference(spm,[status(thm)],[150,166,theory(equality)]) ).
cnf(173,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(er,[status(thm)],[110,theory(equality)]) ).
cnf(174,plain,
( segmentP(nil,nil)
| $false ),
inference(rw,[status(thm)],[173,122,theory(equality)]) ).
cnf(175,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[174,theory(equality)]) ).
cnf(199,negated_conjecture,
( esk10_0 = nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk7_0,X1)
| ~ segmentP(esk8_0,X1) ),
inference(rw,[status(thm)],[160,155,theory(equality)]) ).
cnf(200,negated_conjecture,
( esk10_0 = nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk7_0,X1)
| ~ segmentP(esk10_0,X1) ),
inference(rw,[status(thm)],[199,155,theory(equality)]) ).
cnf(228,negated_conjecture,
( esk7_0 != nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk7_0,X1)
| ~ segmentP(esk10_0,X1) ),
inference(rw,[status(thm)],[159,155,theory(equality)]) ).
cnf(362,negated_conjecture,
( esk10_0 = nil
| ~ segmentP(esk10_0,esk11_0)
| ~ neq(esk11_0,nil)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[200,171,theory(equality)]) ).
cnf(474,negated_conjecture,
( esk10_0 = nil
| ~ segmentP(esk10_0,esk11_0)
| ~ neq(esk11_0,nil) ),
inference(csr,[status(thm)],[362,167]) ).
cnf(475,negated_conjecture,
( esk10_0 = nil
| ~ segmentP(esk10_0,esk11_0) ),
inference(csr,[status(thm)],[474,169]) ).
cnf(476,negated_conjecture,
esk10_0 = nil,
inference(csr,[status(thm)],[475,172]) ).
cnf(493,negated_conjecture,
( esk7_0 != nil
| ~ segmentP(esk7_0,X1)
| ~ segmentP(nil,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[228,476,theory(equality)]) ).
cnf(500,negated_conjecture,
( neq(nil,nil)
| esk7_0 != nil ),
inference(rw,[status(thm)],[168,476,theory(equality)]) ).
cnf(503,negated_conjecture,
( esk7_0 = nil
| $false ),
inference(rw,[status(thm)],[164,476,theory(equality)]) ).
cnf(504,negated_conjecture,
esk7_0 = nil,
inference(cn,[status(thm)],[503,theory(equality)]) ).
cnf(518,negated_conjecture,
( $false
| ~ segmentP(esk7_0,X1)
| ~ segmentP(nil,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[493,504,theory(equality)]) ).
cnf(519,negated_conjecture,
( $false
| ~ segmentP(nil,X1)
| ~ segmentP(nil,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[518,504,theory(equality)]) ).
cnf(520,negated_conjecture,
( ~ segmentP(nil,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[519,theory(equality)]) ).
cnf(521,negated_conjecture,
( ~ neq(nil,nil)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[520,175,theory(equality)]) ).
cnf(524,negated_conjecture,
( ~ neq(nil,nil)
| $false ),
inference(rw,[status(thm)],[521,122,theory(equality)]) ).
cnf(525,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[524,theory(equality)]) ).
cnf(534,negated_conjecture,
( neq(nil,nil)
| $false ),
inference(rw,[status(thm)],[500,504,theory(equality)]) ).
cnf(535,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[534,theory(equality)]) ).
cnf(536,negated_conjecture,
$false,
inference(sr,[status(thm)],[535,525,theory(equality)]) ).
cnf(537,negated_conjecture,
$false,
536,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC054+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpKi4ksJ/sel_SWC054+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC054+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC054+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC054+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
%
%------------------------------------------------------------------------------