TSTP Solution File: SWC086+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC086+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:14:09 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 4
% Syntax : Number of formulae : 50 ( 16 unt; 0 def)
% Number of atoms : 206 ( 43 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 243 ( 87 ~; 79 |; 63 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 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 : 39 ( 0 sgn 23 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(20,axiom,
ssList(nil),
file('/tmp/tmpGtIBy9/sel_SWC086+1.p_1',ax17) ).
fof(23,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/tmp/tmpGtIBy9/sel_SWC086+1.p_1',ax55) ).
fof(25,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/tmp/tmpGtIBy9/sel_SWC086+1.p_1',ax57) ).
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 != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) ) ) ) ) ) ),
file('/tmp/tmpGtIBy9/sel_SWC086+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 != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) ) ) ) ) ) ),
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 != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
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(138,plain,
! [X1] :
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(139,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[138]) ).
cnf(140,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[139]) ).
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 = X4
& nil = X3 )
| ( neq(X3,nil)
& segmentP(X4,X3) ) ) ) ) ) ),
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
& neq(X7,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(X7,X10)
| ~ segmentP(X6,X10) )
& ( ( nil = X9
& nil = X8 )
| ( neq(X8,nil)
& segmentP(X9,X8) ) ) ) ) ) ),
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)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk8_0,X10)
| ~ segmentP(esk7_0,X10) )
& ( ( nil = esk10_0
& nil = esk9_0 )
| ( neq(esk9_0,nil)
& segmentP(esk10_0,esk9_0) ) ) ),
inference(skolemize,[status(esa)],[142]) ).
fof(144,negated_conjecture,
! [X10] :
( ( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk8_0,X10)
| ~ segmentP(esk7_0,X10) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& neq(esk8_0,nil)
& ( ( nil = esk10_0
& nil = esk9_0 )
| ( 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] :
( ( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ segmentP(esk8_0,X10)
| ~ segmentP(esk7_0,X10) )
& esk8_0 = esk10_0
& esk7_0 = esk9_0
& neq(esk8_0,nil)
& ( neq(esk9_0,nil)
| nil = esk10_0 )
& ( segmentP(esk10_0,esk9_0)
| nil = esk10_0 )
& ( neq(esk9_0,nil)
| nil = esk9_0 )
& ( segmentP(esk10_0,esk9_0)
| nil = esk9_0 )
& 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(147,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(150,negated_conjecture,
( nil = esk9_0
| segmentP(esk10_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(151,negated_conjecture,
( nil = esk9_0
| neq(esk9_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(153,negated_conjecture,
( nil = esk10_0
| neq(esk9_0,nil) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(154,negated_conjecture,
neq(esk8_0,nil),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(155,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[145]) ).
cnf(156,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[145]) ).
cnf(157,negated_conjecture,
( ~ segmentP(esk7_0,X1)
| ~ segmentP(esk8_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(158,negated_conjecture,
ssList(esk9_0),
inference(rw,[status(thm)],[146,155,theory(equality)]) ).
cnf(159,negated_conjecture,
ssList(esk10_0),
inference(rw,[status(thm)],[147,156,theory(equality)]) ).
cnf(160,negated_conjecture,
neq(esk10_0,nil),
inference(rw,[status(thm)],[154,156,theory(equality)]) ).
cnf(171,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk9_0,X1)
| ~ segmentP(esk8_0,X1) ),
inference(rw,[status(thm)],[157,155,theory(equality)]) ).
cnf(172,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk9_0,X1)
| ~ segmentP(esk10_0,X1) ),
inference(rw,[status(thm)],[171,156,theory(equality)]) ).
cnf(173,negated_conjecture,
( ~ segmentP(esk10_0,nil)
| ~ neq(nil,nil)
| ~ ssList(nil)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[172,140,theory(equality)]) ).
cnf(174,negated_conjecture,
( ~ segmentP(esk10_0,esk9_0)
| ~ neq(esk9_0,nil)
| ~ ssList(esk9_0) ),
inference(spm,[status(thm)],[172,133,theory(equality)]) ).
cnf(175,negated_conjecture,
( ~ segmentP(esk10_0,nil)
| ~ neq(nil,nil)
| $false
| ~ ssList(esk9_0) ),
inference(rw,[status(thm)],[173,122,theory(equality)]) ).
cnf(176,negated_conjecture,
( ~ segmentP(esk10_0,nil)
| ~ neq(nil,nil)
| ~ ssList(esk9_0) ),
inference(cn,[status(thm)],[175,theory(equality)]) ).
cnf(332,negated_conjecture,
( ~ segmentP(esk10_0,nil)
| ~ neq(nil,nil)
| $false ),
inference(rw,[status(thm)],[176,158,theory(equality)]) ).
cnf(333,negated_conjecture,
( ~ segmentP(esk10_0,nil)
| ~ neq(nil,nil) ),
inference(cn,[status(thm)],[332,theory(equality)]) ).
cnf(334,negated_conjecture,
( ~ neq(nil,nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[333,140,theory(equality)]) ).
cnf(335,negated_conjecture,
( ~ neq(nil,nil)
| $false ),
inference(rw,[status(thm)],[334,159,theory(equality)]) ).
cnf(336,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[335,theory(equality)]) ).
cnf(341,negated_conjecture,
( ~ segmentP(esk10_0,esk9_0)
| ~ neq(esk9_0,nil)
| $false ),
inference(rw,[status(thm)],[174,158,theory(equality)]) ).
cnf(342,negated_conjecture,
( ~ segmentP(esk10_0,esk9_0)
| ~ neq(esk9_0,nil) ),
inference(cn,[status(thm)],[341,theory(equality)]) ).
cnf(343,negated_conjecture,
( esk9_0 = nil
| ~ neq(esk9_0,nil) ),
inference(spm,[status(thm)],[342,150,theory(equality)]) ).
cnf(345,negated_conjecture,
esk9_0 = nil,
inference(csr,[status(thm)],[343,151]) ).
cnf(354,negated_conjecture,
( esk10_0 = nil
| neq(nil,nil) ),
inference(rw,[status(thm)],[153,345,theory(equality)]) ).
cnf(355,negated_conjecture,
esk10_0 = nil,
inference(sr,[status(thm)],[354,336,theory(equality)]) ).
cnf(362,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[160,355,theory(equality)]) ).
cnf(363,negated_conjecture,
$false,
inference(sr,[status(thm)],[362,336,theory(equality)]) ).
cnf(364,negated_conjecture,
$false,
363,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC086+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpGtIBy9/sel_SWC086+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC086+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC086+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC086+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
%
%------------------------------------------------------------------------------