TSTP Solution File: SWC116+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC116+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:19:49 EST 2010
% Result : Theorem 0.27s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 46 ( 12 unt; 0 def)
% Number of atoms : 204 ( 69 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 248 ( 90 ~; 87 |; 56 &)
% ( 1 <=>; 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 : 32 ( 0 sgn 22 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmp-nF3Q0/sel_SWC116+1.p_1',ax15) ).
fof(20,axiom,
ssList(nil),
file('/tmp/tmp-nF3Q0/sel_SWC116+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 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& segmentP(X2,X1) )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) ) ) ) ) ) ),
file('/tmp/tmp-nF3Q0/sel_SWC116+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 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& segmentP(X2,X1) )
| ( neq(X4,nil)
& ( ~ 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
| ( nil != X3
& nil = X4 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& segmentP(X2,X1) )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(112,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(113,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[112]) ).
fof(114,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[113]) ).
fof(115,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)],[114]) ).
cnf(116,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[115]) ).
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 )
& ( nil != X2
| nil != X1 )
& ( ~ neq(X1,nil)
| ~ segmentP(X2,X1) )
& ( ~ neq(X4,nil)
| ( neq(X3,nil)
& segmentP(X4,X3) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(142,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X6 = X8
& X5 = X7
& ( nil = X7
| nil != X8 )
& ( nil != X6
| nil != X5 )
& ( ~ neq(X5,nil)
| ~ segmentP(X6,X5) )
& ( ~ neq(X8,nil)
| ( neq(X7,nil)
& segmentP(X8,X7) ) ) ) ) ) ),
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 )
& ( nil != esk8_0
| nil != esk7_0 )
& ( ~ neq(esk7_0,nil)
| ~ segmentP(esk8_0,esk7_0) )
& ( ~ neq(esk10_0,nil)
| ( neq(esk9_0,nil)
& segmentP(esk10_0,esk9_0) ) ) ),
inference(skolemize,[status(esa)],[142]) ).
fof(144,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 )
& ( nil != esk8_0
| nil != esk7_0 )
& ( ~ neq(esk7_0,nil)
| ~ segmentP(esk8_0,esk7_0) )
& ( neq(esk9_0,nil)
| ~ neq(esk10_0,nil) )
& ( segmentP(esk10_0,esk9_0)
| ~ neq(esk10_0,nil) ) ),
inference(distribute,[status(thm)],[143]) ).
cnf(145,negated_conjecture,
( segmentP(esk10_0,esk9_0)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(146,negated_conjecture,
( neq(esk9_0,nil)
| ~ neq(esk10_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(147,negated_conjecture,
( ~ segmentP(esk8_0,esk7_0)
| ~ neq(esk7_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(148,negated_conjecture,
( nil != esk7_0
| nil != esk8_0 ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(149,negated_conjecture,
( nil = esk9_0
| nil != esk10_0 ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(150,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(151,negated_conjecture,
esk8_0 = esk10_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(154,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(158,negated_conjecture,
ssList(esk10_0),
inference(rw,[status(thm)],[154,151,theory(equality)]) ).
cnf(159,negated_conjecture,
( esk7_0 = nil
| esk10_0 != nil ),
inference(rw,[status(thm)],[149,150,theory(equality)]) ).
cnf(160,negated_conjecture,
( esk7_0 != nil
| esk10_0 != nil ),
inference(rw,[status(thm)],[148,151,theory(equality)]) ).
cnf(161,negated_conjecture,
esk10_0 != nil,
inference(csr,[status(thm)],[160,159]) ).
cnf(162,negated_conjecture,
( neq(esk7_0,nil)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[146,150,theory(equality)]) ).
cnf(163,negated_conjecture,
( segmentP(esk10_0,esk7_0)
| ~ neq(esk10_0,nil) ),
inference(rw,[status(thm)],[145,150,theory(equality)]) ).
cnf(164,negated_conjecture,
( ~ neq(esk7_0,nil)
| ~ segmentP(esk10_0,esk7_0) ),
inference(rw,[status(thm)],[147,151,theory(equality)]) ).
cnf(168,negated_conjecture,
( neq(esk7_0,nil)
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[162,116,theory(equality)]) ).
cnf(169,negated_conjecture,
( segmentP(esk10_0,esk7_0)
| esk10_0 = nil
| ~ ssList(nil)
| ~ ssList(esk10_0) ),
inference(spm,[status(thm)],[163,116,theory(equality)]) ).
cnf(170,negated_conjecture,
( neq(esk7_0,nil)
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[168,122,theory(equality)]) ).
cnf(171,negated_conjecture,
( neq(esk7_0,nil)
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[170,theory(equality)]) ).
cnf(172,negated_conjecture,
( neq(esk7_0,nil)
| ~ ssList(esk10_0) ),
inference(sr,[status(thm)],[171,161,theory(equality)]) ).
cnf(173,negated_conjecture,
( segmentP(esk10_0,esk7_0)
| esk10_0 = nil
| $false
| ~ ssList(esk10_0) ),
inference(rw,[status(thm)],[169,122,theory(equality)]) ).
cnf(174,negated_conjecture,
( segmentP(esk10_0,esk7_0)
| esk10_0 = nil
| ~ ssList(esk10_0) ),
inference(cn,[status(thm)],[173,theory(equality)]) ).
cnf(175,negated_conjecture,
( segmentP(esk10_0,esk7_0)
| ~ ssList(esk10_0) ),
inference(sr,[status(thm)],[174,161,theory(equality)]) ).
cnf(325,negated_conjecture,
( neq(esk7_0,nil)
| $false ),
inference(rw,[status(thm)],[172,158,theory(equality)]) ).
cnf(326,negated_conjecture,
neq(esk7_0,nil),
inference(cn,[status(thm)],[325,theory(equality)]) ).
cnf(327,negated_conjecture,
( ~ segmentP(esk10_0,esk7_0)
| $false ),
inference(rw,[status(thm)],[164,326,theory(equality)]) ).
cnf(328,negated_conjecture,
~ segmentP(esk10_0,esk7_0),
inference(cn,[status(thm)],[327,theory(equality)]) ).
cnf(330,negated_conjecture,
( segmentP(esk10_0,esk7_0)
| $false ),
inference(rw,[status(thm)],[175,158,theory(equality)]) ).
cnf(331,negated_conjecture,
segmentP(esk10_0,esk7_0),
inference(cn,[status(thm)],[330,theory(equality)]) ).
cnf(332,negated_conjecture,
$false,
inference(sr,[status(thm)],[331,328,theory(equality)]) ).
cnf(333,negated_conjecture,
$false,
332,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC116+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmp-nF3Q0/sel_SWC116+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC116+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC116+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC116+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
%
%------------------------------------------------------------------------------