TSTP Solution File: SWC059+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC059+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:10:20 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 4
% Syntax : Number of formulae : 59 ( 12 unt; 0 def)
% Number of atoms : 275 ( 81 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 344 ( 128 ~; 124 |; 77 &)
% ( 1 <=>; 14 =>; 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 43 ( 0 sgn 24 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(17,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmp-8gV7l/sel_SWC059+1.p_1',ax58) ).
fof(20,axiom,
ssList(nil),
file('/tmp/tmp-8gV7l/sel_SWC059+1.p_1',ax17) ).
fof(23,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/tmp/tmp-8gV7l/sel_SWC059+1.p_1',ax55) ).
fof(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) ) ) ) ) ) ),
file('/tmp/tmp-8gV7l/sel_SWC059+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 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) ) ) ) ) ) ),
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 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) ) ) ) ) ) ),
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(131,plain,
! [X1] :
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(132,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[131]) ).
cnf(133,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[132]) ).
fof(141,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( nil = X3
| nil != X4 )
& ( ~ neq(X4,nil)
| ( neq(X3,nil)
& segmentP(X4,X3) ) )
& ( ( nil = X2
& nil != X1 )
| ( neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X2,X5)
| ~ segmentP(X1,X5) ) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(142,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& ( nil = X8
| nil != X9 )
& ( ~ neq(X9,nil)
| ( neq(X8,nil)
& segmentP(X9,X8) ) )
& ( ( nil = X7
& nil != X6 )
| ( neq(X7,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(X7,X10)
| ~ segmentP(X6,X10) ) ) ) ) ) ) ),
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 )
& ( ~ neq(esk10_0,nil)
| ( neq(esk9_0,nil)
& segmentP(esk10_0,esk9_0) ) )
& ( ( nil = esk8_0
& nil != esk7_0 )
| ( neq(esk8_0,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk8_0,X10)
| ~ segmentP(esk7_0,X10) ) ) ) ),
inference(skolemize,[status(esa)],[142]) ).
fof(144,negated_conjecture,
! [X10] :
( ( ( ( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk8_0,X10)
| ~ segmentP(esk7_0,X10) )
& neq(esk8_0,nil) )
| ( nil = esk8_0
& nil != esk7_0 ) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( nil = esk9_0
| nil != esk10_0 )
& ( ~ neq(esk10_0,nil)
| ( neq(esk9_0,nil)
& segmentP(esk10_0,esk9_0) ) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(shift_quantors,[status(thm)],[143]) ).
fof(145,negated_conjecture,
! [X10] :
( ( nil = esk8_0
| ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk8_0,X10)
| ~ segmentP(esk7_0,X10) )
& ( nil != esk7_0
| ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk8_0,X10)
| ~ segmentP(esk7_0,X10) )
& ( nil = esk8_0
| neq(esk8_0,nil) )
& ( nil != esk7_0
| neq(esk8_0,nil) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& ( nil = esk9_0
| nil != esk10_0 )
& ( neq(esk9_0,nil)
| ~ neq(esk10_0,nil) )
& ( segmentP(esk10_0,esk9_0)
| ~ neq(esk10_0,nil) )
& ssList(esk10_0)
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0) ),
inference(distribute,[status(thm)],[144]) ).
cnf(146,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(150,negated_conjecture,
( segmentP(esk10_0,esk9_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(151,negated_conjecture,
( neq(esk9_0,nil)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(152,negated_conjecture,
( nil = esk9_0
| nil != esk10_0 ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(153,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[145]) ).
cnf(154,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[145]) ).
cnf(155,negated_conjecture,
( neq(esk8_0,nil)
| nil != esk7_0 ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(156,negated_conjecture,
( neq(esk8_0,nil)
| nil = esk8_0 ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(157,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(158,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(163,negated_conjecture,
( esk7_0 = nil
| esk10_0 != nil ),
inference(rw,[status(thm)],[152,153,theory(equality)]) ).
cnf(164,negated_conjecture,
( esk7_0 = nil
| esk8_0 != nil ),
inference(rw,[status(thm)],[163,154,theory(equality)]) ).
cnf(165,negated_conjecture,
( neq(esk7_0,nil)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[151,153,theory(equality)]) ).
cnf(166,negated_conjecture,
( neq(esk7_0,nil)
| ~ neq(esk8_0,nil) ),
inference(rw,[status(thm)],[165,154,theory(equality)]) ).
cnf(167,negated_conjecture,
( neq(esk7_0,nil)
| esk8_0 = nil ),
inference(spm,[status(thm)],[166,156,theory(equality)]) ).
cnf(168,negated_conjecture,
( segmentP(esk8_0,esk7_0)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[150,154,theory(equality)]),153,theory(equality)]) ).
cnf(169,negated_conjecture,
( segmentP(esk8_0,esk7_0)
| ~ neq(esk8_0,nil) ),
inference(rw,[status(thm)],[168,154,theory(equality)]) ).
cnf(170,negated_conjecture,
( segmentP(esk8_0,esk7_0)
| esk8_0 = nil ),
inference(spm,[status(thm)],[169,156,theory(equality)]) ).
cnf(171,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(er,[status(thm)],[110,theory(equality)]) ).
cnf(172,plain,
( segmentP(nil,nil)
| $false ),
inference(rw,[status(thm)],[171,122,theory(equality)]) ).
cnf(173,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[172,theory(equality)]) ).
cnf(189,negated_conjecture,
( esk8_0 = nil
| ~ segmentP(esk8_0,esk7_0)
| ~ neq(esk7_0,nil)
| ~ ssList(esk7_0) ),
inference(spm,[status(thm)],[158,133,theory(equality)]) ).
cnf(193,negated_conjecture,
( esk8_0 = nil
| ~ segmentP(esk8_0,esk7_0)
| ~ neq(esk7_0,nil)
| $false ),
inference(rw,[status(thm)],[189,146,theory(equality)]) ).
cnf(194,negated_conjecture,
( esk8_0 = nil
| ~ segmentP(esk8_0,esk7_0)
| ~ neq(esk7_0,nil) ),
inference(cn,[status(thm)],[193,theory(equality)]) ).
cnf(393,negated_conjecture,
( esk8_0 = nil
| ~ segmentP(esk8_0,esk7_0) ),
inference(csr,[status(thm)],[194,167]) ).
cnf(394,negated_conjecture,
esk8_0 = nil,
inference(csr,[status(thm)],[393,170]) ).
cnf(406,negated_conjecture,
( esk7_0 != nil
| ~ segmentP(esk7_0,X1)
| ~ segmentP(nil,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[157,394,theory(equality)]) ).
cnf(412,negated_conjecture,
( neq(nil,nil)
| esk7_0 != nil ),
inference(rw,[status(thm)],[155,394,theory(equality)]) ).
cnf(415,negated_conjecture,
( esk7_0 = nil
| $false ),
inference(rw,[status(thm)],[164,394,theory(equality)]) ).
cnf(416,negated_conjecture,
esk7_0 = nil,
inference(cn,[status(thm)],[415,theory(equality)]) ).
cnf(421,negated_conjecture,
( $false
| ~ segmentP(esk7_0,X1)
| ~ segmentP(nil,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[406,416,theory(equality)]) ).
cnf(422,negated_conjecture,
( $false
| ~ segmentP(nil,X1)
| ~ segmentP(nil,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[421,416,theory(equality)]) ).
cnf(423,negated_conjecture,
( ~ segmentP(nil,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[422,theory(equality)]) ).
cnf(424,negated_conjecture,
( ~ neq(nil,nil)
| ~ ssList(nil) ),
inference(spm,[status(thm)],[423,173,theory(equality)]) ).
cnf(427,negated_conjecture,
( ~ neq(nil,nil)
| $false ),
inference(rw,[status(thm)],[424,122,theory(equality)]) ).
cnf(428,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[427,theory(equality)]) ).
cnf(439,negated_conjecture,
( neq(nil,nil)
| $false ),
inference(rw,[status(thm)],[412,416,theory(equality)]) ).
cnf(440,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[439,theory(equality)]) ).
cnf(441,negated_conjecture,
$false,
inference(sr,[status(thm)],[440,428,theory(equality)]) ).
cnf(442,negated_conjecture,
$false,
441,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC059+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp-8gV7l/sel_SWC059+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC059+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC059+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC059+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
%
%------------------------------------------------------------------------------