TSTP Solution File: SWC333+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC333+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 11:31:08 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 2
% Syntax : Number of formulae : 67 ( 17 unt; 0 def)
% Number of atoms : 342 ( 36 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 434 ( 159 ~; 170 |; 87 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 52 ( 0 sgn 30 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmppqkQu6/sel_SWC333+1.p_1',ax15) ).
fof(37,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X1,X6)
| ~ segmentP(X2,X6)
| ~ segmentP(X6,X1)
| ~ totalorderedP(X6) ) )
& segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
file('/tmp/tmppqkQu6/sel_SWC333+1.p_1',co1) ).
fof(38,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X1,X6)
| ~ segmentP(X2,X6)
| ~ segmentP(X6,X1)
| ~ totalorderedP(X6) ) )
& segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[37]) ).
fof(39,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X1,X6)
| ~ segmentP(X2,X6)
| ~ segmentP(X6,X1)
| ~ totalorderedP(X6) ) )
& segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[38,theory(equality)]) ).
fof(154,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(155,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[154]) ).
fof(156,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[155]) ).
fof(157,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)],[156]) ).
cnf(158,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[157]) ).
fof(206,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& segmentP(X4,X3)
& totalorderedP(X3)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X3,X5)
| ~ segmentP(X4,X5)
| ~ segmentP(X5,X3)
| ~ totalorderedP(X5) )
& ( ? [X6] :
( ssList(X6)
& neq(X1,X6)
& segmentP(X2,X6)
& segmentP(X6,X1)
& totalorderedP(X6) )
| ~ segmentP(X2,X1)
| ~ totalorderedP(X1) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(207,negated_conjecture,
? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& X8 = X10
& X7 = X9
& segmentP(X10,X9)
& totalorderedP(X9)
& ! [X11] :
( ~ ssList(X11)
| ~ neq(X9,X11)
| ~ segmentP(X10,X11)
| ~ segmentP(X11,X9)
| ~ totalorderedP(X11) )
& ( ? [X12] :
( ssList(X12)
& neq(X7,X12)
& segmentP(X8,X12)
& segmentP(X12,X7)
& totalorderedP(X12) )
| ~ segmentP(X8,X7)
| ~ totalorderedP(X7) ) ) ) ) ),
inference(variable_rename,[status(thm)],[206]) ).
fof(208,negated_conjecture,
( ssList(esk13_0)
& ssList(esk14_0)
& ssList(esk15_0)
& ssList(esk16_0)
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& segmentP(esk16_0,esk15_0)
& totalorderedP(esk15_0)
& ! [X11] :
( ~ ssList(X11)
| ~ neq(esk15_0,X11)
| ~ segmentP(esk16_0,X11)
| ~ segmentP(X11,esk15_0)
| ~ totalorderedP(X11) )
& ( ( ssList(esk17_0)
& neq(esk13_0,esk17_0)
& segmentP(esk14_0,esk17_0)
& segmentP(esk17_0,esk13_0)
& totalorderedP(esk17_0) )
| ~ segmentP(esk14_0,esk13_0)
| ~ totalorderedP(esk13_0) ) ),
inference(skolemize,[status(esa)],[207]) ).
fof(209,negated_conjecture,
! [X11] :
( ( ~ ssList(X11)
| ~ neq(esk15_0,X11)
| ~ segmentP(esk16_0,X11)
| ~ segmentP(X11,esk15_0)
| ~ totalorderedP(X11) )
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& segmentP(esk16_0,esk15_0)
& totalorderedP(esk15_0)
& ( ( ssList(esk17_0)
& neq(esk13_0,esk17_0)
& segmentP(esk14_0,esk17_0)
& segmentP(esk17_0,esk13_0)
& totalorderedP(esk17_0) )
| ~ segmentP(esk14_0,esk13_0)
| ~ totalorderedP(esk13_0) )
& ssList(esk16_0)
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0) ),
inference(shift_quantors,[status(thm)],[208]) ).
fof(210,negated_conjecture,
! [X11] :
( ( ~ ssList(X11)
| ~ neq(esk15_0,X11)
| ~ segmentP(esk16_0,X11)
| ~ segmentP(X11,esk15_0)
| ~ totalorderedP(X11) )
& esk14_0 = esk16_0
& esk13_0 = esk15_0
& segmentP(esk16_0,esk15_0)
& totalorderedP(esk15_0)
& ( ssList(esk17_0)
| ~ segmentP(esk14_0,esk13_0)
| ~ totalorderedP(esk13_0) )
& ( neq(esk13_0,esk17_0)
| ~ segmentP(esk14_0,esk13_0)
| ~ totalorderedP(esk13_0) )
& ( segmentP(esk14_0,esk17_0)
| ~ segmentP(esk14_0,esk13_0)
| ~ totalorderedP(esk13_0) )
& ( segmentP(esk17_0,esk13_0)
| ~ segmentP(esk14_0,esk13_0)
| ~ totalorderedP(esk13_0) )
& ( totalorderedP(esk17_0)
| ~ segmentP(esk14_0,esk13_0)
| ~ totalorderedP(esk13_0) )
& ssList(esk16_0)
& ssList(esk15_0)
& ssList(esk14_0)
& ssList(esk13_0) ),
inference(distribute,[status(thm)],[209]) ).
cnf(211,negated_conjecture,
ssList(esk13_0),
inference(split_conjunct,[status(thm)],[210]) ).
cnf(215,negated_conjecture,
( totalorderedP(esk17_0)
| ~ totalorderedP(esk13_0)
| ~ segmentP(esk14_0,esk13_0) ),
inference(split_conjunct,[status(thm)],[210]) ).
cnf(216,negated_conjecture,
( segmentP(esk17_0,esk13_0)
| ~ totalorderedP(esk13_0)
| ~ segmentP(esk14_0,esk13_0) ),
inference(split_conjunct,[status(thm)],[210]) ).
cnf(217,negated_conjecture,
( segmentP(esk14_0,esk17_0)
| ~ totalorderedP(esk13_0)
| ~ segmentP(esk14_0,esk13_0) ),
inference(split_conjunct,[status(thm)],[210]) ).
cnf(218,negated_conjecture,
( neq(esk13_0,esk17_0)
| ~ totalorderedP(esk13_0)
| ~ segmentP(esk14_0,esk13_0) ),
inference(split_conjunct,[status(thm)],[210]) ).
cnf(219,negated_conjecture,
( ssList(esk17_0)
| ~ totalorderedP(esk13_0)
| ~ segmentP(esk14_0,esk13_0) ),
inference(split_conjunct,[status(thm)],[210]) ).
cnf(220,negated_conjecture,
totalorderedP(esk15_0),
inference(split_conjunct,[status(thm)],[210]) ).
cnf(221,negated_conjecture,
segmentP(esk16_0,esk15_0),
inference(split_conjunct,[status(thm)],[210]) ).
cnf(222,negated_conjecture,
esk13_0 = esk15_0,
inference(split_conjunct,[status(thm)],[210]) ).
cnf(223,negated_conjecture,
esk14_0 = esk16_0,
inference(split_conjunct,[status(thm)],[210]) ).
cnf(224,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,esk15_0)
| ~ segmentP(esk16_0,X1)
| ~ neq(esk15_0,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[210]) ).
cnf(227,negated_conjecture,
totalorderedP(esk13_0),
inference(rw,[status(thm)],[220,222,theory(equality)]) ).
cnf(230,negated_conjecture,
segmentP(esk14_0,esk13_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[221,223,theory(equality)]),222,theory(equality)]) ).
cnf(231,negated_conjecture,
( totalorderedP(esk17_0)
| ~ totalorderedP(esk13_0)
| $false ),
inference(rw,[status(thm)],[215,230,theory(equality)]) ).
cnf(232,negated_conjecture,
( totalorderedP(esk17_0)
| ~ totalorderedP(esk13_0) ),
inference(cn,[status(thm)],[231,theory(equality)]) ).
cnf(233,negated_conjecture,
( ssList(esk17_0)
| ~ totalorderedP(esk13_0)
| $false ),
inference(rw,[status(thm)],[219,230,theory(equality)]) ).
cnf(234,negated_conjecture,
( ssList(esk17_0)
| ~ totalorderedP(esk13_0) ),
inference(cn,[status(thm)],[233,theory(equality)]) ).
cnf(235,negated_conjecture,
( neq(esk13_0,esk17_0)
| ~ totalorderedP(esk13_0)
| $false ),
inference(rw,[status(thm)],[218,230,theory(equality)]) ).
cnf(236,negated_conjecture,
( neq(esk13_0,esk17_0)
| ~ totalorderedP(esk13_0) ),
inference(cn,[status(thm)],[235,theory(equality)]) ).
cnf(237,negated_conjecture,
( segmentP(esk14_0,esk17_0)
| ~ totalorderedP(esk13_0)
| $false ),
inference(rw,[status(thm)],[217,230,theory(equality)]) ).
cnf(238,negated_conjecture,
( segmentP(esk14_0,esk17_0)
| ~ totalorderedP(esk13_0) ),
inference(cn,[status(thm)],[237,theory(equality)]) ).
cnf(239,negated_conjecture,
( segmentP(esk17_0,esk13_0)
| ~ totalorderedP(esk13_0)
| $false ),
inference(rw,[status(thm)],[216,230,theory(equality)]) ).
cnf(240,negated_conjecture,
( segmentP(esk17_0,esk13_0)
| ~ totalorderedP(esk13_0) ),
inference(cn,[status(thm)],[239,theory(equality)]) ).
cnf(260,negated_conjecture,
( ~ totalorderedP(X1)
| ~ ssList(X1)
| ~ segmentP(X1,esk13_0)
| ~ neq(esk15_0,X1)
| ~ segmentP(esk16_0,X1) ),
inference(rw,[status(thm)],[224,222,theory(equality)]) ).
cnf(261,negated_conjecture,
( ~ totalorderedP(X1)
| ~ ssList(X1)
| ~ segmentP(X1,esk13_0)
| ~ neq(esk13_0,X1)
| ~ segmentP(esk16_0,X1) ),
inference(rw,[status(thm)],[260,222,theory(equality)]) ).
cnf(262,negated_conjecture,
( ~ totalorderedP(X1)
| ~ ssList(X1)
| ~ segmentP(X1,esk13_0)
| ~ neq(esk13_0,X1)
| ~ segmentP(esk14_0,X1) ),
inference(rw,[status(thm)],[261,223,theory(equality)]) ).
cnf(264,negated_conjecture,
( esk13_0 = X1
| ~ segmentP(X1,esk13_0)
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1)
| ~ totalorderedP(X1)
| ~ ssList(esk13_0) ),
inference(spm,[status(thm)],[262,158,theory(equality)]) ).
cnf(266,negated_conjecture,
( esk13_0 = X1
| ~ segmentP(X1,esk13_0)
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1)
| ~ totalorderedP(X1)
| $false ),
inference(rw,[status(thm)],[264,211,theory(equality)]) ).
cnf(267,negated_conjecture,
( esk13_0 = X1
| ~ segmentP(X1,esk13_0)
| ~ segmentP(esk14_0,X1)
| ~ ssList(X1)
| ~ totalorderedP(X1) ),
inference(cn,[status(thm)],[266,theory(equality)]) ).
cnf(492,negated_conjecture,
( segmentP(esk17_0,esk13_0)
| $false ),
inference(rw,[status(thm)],[240,227,theory(equality)]) ).
cnf(493,negated_conjecture,
segmentP(esk17_0,esk13_0),
inference(cn,[status(thm)],[492,theory(equality)]) ).
cnf(494,negated_conjecture,
( segmentP(esk14_0,esk17_0)
| $false ),
inference(rw,[status(thm)],[238,227,theory(equality)]) ).
cnf(495,negated_conjecture,
segmentP(esk14_0,esk17_0),
inference(cn,[status(thm)],[494,theory(equality)]) ).
cnf(496,negated_conjecture,
( neq(esk13_0,esk17_0)
| $false ),
inference(rw,[status(thm)],[236,227,theory(equality)]) ).
cnf(497,negated_conjecture,
neq(esk13_0,esk17_0),
inference(cn,[status(thm)],[496,theory(equality)]) ).
cnf(498,negated_conjecture,
( ssList(esk17_0)
| $false ),
inference(rw,[status(thm)],[234,227,theory(equality)]) ).
cnf(499,negated_conjecture,
ssList(esk17_0),
inference(cn,[status(thm)],[498,theory(equality)]) ).
cnf(500,negated_conjecture,
( totalorderedP(esk17_0)
| $false ),
inference(rw,[status(thm)],[232,227,theory(equality)]) ).
cnf(501,negated_conjecture,
totalorderedP(esk17_0),
inference(cn,[status(thm)],[500,theory(equality)]) ).
cnf(519,negated_conjecture,
( esk13_0 = esk17_0
| ~ segmentP(esk17_0,esk13_0)
| ~ segmentP(esk14_0,esk17_0)
| ~ ssList(esk17_0) ),
inference(spm,[status(thm)],[267,501,theory(equality)]) ).
cnf(524,negated_conjecture,
( esk13_0 = esk17_0
| $false
| ~ segmentP(esk14_0,esk17_0)
| ~ ssList(esk17_0) ),
inference(rw,[status(thm)],[519,493,theory(equality)]) ).
cnf(525,negated_conjecture,
( esk13_0 = esk17_0
| $false
| $false
| ~ ssList(esk17_0) ),
inference(rw,[status(thm)],[524,495,theory(equality)]) ).
cnf(526,negated_conjecture,
( esk13_0 = esk17_0
| $false
| $false
| $false ),
inference(rw,[status(thm)],[525,499,theory(equality)]) ).
cnf(527,negated_conjecture,
esk13_0 = esk17_0,
inference(cn,[status(thm)],[526,theory(equality)]) ).
cnf(530,negated_conjecture,
segmentP(esk13_0,esk13_0),
inference(rw,[status(thm)],[493,527,theory(equality)]) ).
cnf(541,negated_conjecture,
neq(esk13_0,esk13_0),
inference(rw,[status(thm)],[497,527,theory(equality)]) ).
cnf(542,negated_conjecture,
( ~ segmentP(esk13_0,esk13_0)
| ~ segmentP(esk14_0,esk13_0)
| ~ ssList(esk13_0)
| ~ totalorderedP(esk13_0) ),
inference(spm,[status(thm)],[262,541,theory(equality)]) ).
cnf(545,negated_conjecture,
( $false
| ~ segmentP(esk14_0,esk13_0)
| ~ ssList(esk13_0)
| ~ totalorderedP(esk13_0) ),
inference(rw,[status(thm)],[542,530,theory(equality)]) ).
cnf(546,negated_conjecture,
( $false
| $false
| ~ ssList(esk13_0)
| ~ totalorderedP(esk13_0) ),
inference(rw,[status(thm)],[545,230,theory(equality)]) ).
cnf(547,negated_conjecture,
( $false
| $false
| $false
| ~ totalorderedP(esk13_0) ),
inference(rw,[status(thm)],[546,211,theory(equality)]) ).
cnf(548,negated_conjecture,
( $false
| $false
| $false
| $false ),
inference(rw,[status(thm)],[547,227,theory(equality)]) ).
cnf(549,negated_conjecture,
$false,
inference(cn,[status(thm)],[548,theory(equality)]) ).
cnf(550,negated_conjecture,
$false,
549,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC333+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmppqkQu6/sel_SWC333+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC333+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC333+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC333+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
%
%------------------------------------------------------------------------------