TSTP Solution File: SWC082+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC082+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:13:27 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 1
% Syntax : Number of formulae : 33 ( 10 unt; 0 def)
% Number of atoms : 197 ( 34 equ)
% Maximal formula atoms : 21 ( 5 avg)
% Number of connectives : 242 ( 78 ~; 74 |; 75 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 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 : 36 ( 0 sgn 20 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil != X3
& nil = X4 )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ segmentP(X4,X6)
| ~ segmentP(X3,X6) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/tmp/tmp-O5f3E/sel_SWC082+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)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil != X3
& nil = X4 )
| ( ! [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
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ( nil != X3
& nil = X4 )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ segmentP(X4,X6)
| ~ segmentP(X3,X6) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(141,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X2,X5)
| ~ segmentP(X1,X5) )
& ( nil = X3
| nil != X4 )
& ( ? [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
& neq(X8,nil)
& ! [X11] :
( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(X8,X11)
| ~ segmentP(X7,X11) )
& ( nil = X9
| nil != X10 )
& ( ? [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
& neq(esk8_0,nil)
& ! [X11] :
( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk8_0,X11)
| ~ segmentP(esk7_0,X11) )
& ( 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) ) ),
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
& neq(esk8_0,nil)
& ( 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(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
& neq(esk8_0,nil)
& ( 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(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[144]) ).
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(155,negated_conjecture,
neq(esk8_0,nil),
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,
neq(esk10_0,nil),
inference(rw,[status(thm)],[155,157,theory(equality)]) ).
cnf(162,negated_conjecture,
( ssList(esk11_0)
| $false ),
inference(rw,[status(thm)],[153,161,theory(equality)]) ).
cnf(163,negated_conjecture,
ssList(esk11_0),
inference(cn,[status(thm)],[162,theory(equality)]) ).
cnf(164,negated_conjecture,
( neq(esk11_0,nil)
| $false ),
inference(rw,[status(thm)],[152,161,theory(equality)]) ).
cnf(165,negated_conjecture,
neq(esk11_0,nil),
inference(cn,[status(thm)],[164,theory(equality)]) ).
cnf(166,negated_conjecture,
( segmentP(esk9_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[150,161,theory(equality)]) ).
cnf(167,negated_conjecture,
segmentP(esk9_0,esk11_0),
inference(cn,[status(thm)],[166,theory(equality)]) ).
cnf(168,negated_conjecture,
( segmentP(esk10_0,esk11_0)
| $false ),
inference(rw,[status(thm)],[151,161,theory(equality)]) ).
cnf(169,negated_conjecture,
segmentP(esk10_0,esk11_0),
inference(cn,[status(thm)],[168,theory(equality)]) ).
cnf(180,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk9_0,X1)
| ~ segmentP(esk8_0,X1) ),
inference(rw,[status(thm)],[158,156,theory(equality)]) ).
cnf(181,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk9_0,X1)
| ~ segmentP(esk10_0,X1) ),
inference(rw,[status(thm)],[180,157,theory(equality)]) ).
cnf(182,negated_conjecture,
( ~ segmentP(esk10_0,esk11_0)
| ~ neq(esk11_0,nil)
| ~ ssList(esk11_0) ),
inference(spm,[status(thm)],[181,167,theory(equality)]) ).
cnf(185,negated_conjecture,
( $false
| ~ neq(esk11_0,nil)
| ~ ssList(esk11_0) ),
inference(rw,[status(thm)],[182,169,theory(equality)]) ).
cnf(186,negated_conjecture,
( $false
| $false
| ~ ssList(esk11_0) ),
inference(rw,[status(thm)],[185,165,theory(equality)]) ).
cnf(187,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[186,163,theory(equality)]) ).
cnf(188,negated_conjecture,
$false,
inference(cn,[status(thm)],[187,theory(equality)]) ).
cnf(189,negated_conjecture,
$false,
188,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC082+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp-O5f3E/sel_SWC082+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC082+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC082+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC082+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
%
%------------------------------------------------------------------------------