TSTP Solution File: SWC048+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC048+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:09:01 EST 2010
% Result : Theorem 0.29s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 5
% Syntax : Number of formulae : 75 ( 14 unt; 0 def)
% Number of atoms : 336 ( 115 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 410 ( 149 ~; 164 |; 79 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 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 : 57 ( 0 sgn 34 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,X1) ),
file('/tmp/tmpAw6uBQ/sel_SWC048+1.p_1',ax49) ).
fof(18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpAw6uBQ/sel_SWC048+1.p_1',ax15) ).
fof(20,axiom,
ssList(nil),
file('/tmp/tmpAw6uBQ/sel_SWC048+1.p_1',ax17) ).
fof(23,axiom,
! [X1] :
( ssList(X1)
=> ( rearsegP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpAw6uBQ/sel_SWC048+1.p_1',ax52) ).
fof(26,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
file('/tmp/tmpAw6uBQ/sel_SWC048+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 != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(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 != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(51,plain,
! [X1] :
( ~ ssList(X1)
| rearsegP(X1,X1) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(52,plain,
! [X2] :
( ~ ssList(X2)
| rearsegP(X2,X2) ),
inference(variable_rename,[status(thm)],[51]) ).
cnf(53,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[52]) ).
fof(107,plain,
! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ neq(X1,X2)
| X1 != X2 )
& ( X1 = X2
| neq(X1,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(108,plain,
! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) ) ) ),
inference(variable_rename,[status(thm)],[107]) ).
fof(109,plain,
! [X3,X4] :
( ~ ssList(X4)
| ( ( ~ neq(X3,X4)
| X3 != X4 )
& ( X3 = X4
| neq(X3,X4) ) )
| ~ ssList(X3) ),
inference(shift_quantors,[status(thm)],[108]) ).
fof(110,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)],[109]) ).
cnf(112,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[110]) ).
cnf(117,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[20]) ).
fof(125,plain,
! [X1] :
( ~ ssList(X1)
| ( ( ~ rearsegP(nil,X1)
| nil = X1 )
& ( nil != X1
| rearsegP(nil,X1) ) ) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(126,plain,
! [X2] :
( ~ ssList(X2)
| ( ( ~ rearsegP(nil,X2)
| nil = X2 )
& ( nil != X2
| rearsegP(nil,X2) ) ) ),
inference(variable_rename,[status(thm)],[125]) ).
fof(127,plain,
! [X2] :
( ( ~ rearsegP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| rearsegP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[126]) ).
cnf(128,plain,
( rearsegP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(129,plain,
( nil = X1
| ~ ssList(X1)
| ~ rearsegP(nil,X1) ),
inference(split_conjunct,[status(thm)],[127]) ).
fof(140,negated_conjecture,
? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& X2 = X4
& X1 = X3
& ( ( nil = X2
& nil != X1 )
| ( neq(X2,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ rearsegP(X2,X5)
| ~ rearsegP(X1,X5) ) ) )
& ( ( nil = X4
& nil = X3 )
| ( neq(X3,nil)
& rearsegP(X4,X3) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(141,negated_conjecture,
? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& X7 = X9
& X6 = X8
& ( ( nil = X7
& nil != X6 )
| ( neq(X7,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(X7,X10)
| ~ rearsegP(X6,X10) ) ) )
& ( ( nil = X9
& nil = X8 )
| ( neq(X8,nil)
& rearsegP(X9,X8) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[140]) ).
fof(142,negated_conjecture,
( ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ( ( nil = esk7_0
& nil != esk6_0 )
| ( neq(esk7_0,nil)
& ! [X10] :
( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(esk7_0,X10)
| ~ rearsegP(esk6_0,X10) ) ) )
& ( ( nil = esk9_0
& nil = esk8_0 )
| ( neq(esk8_0,nil)
& rearsegP(esk9_0,esk8_0) ) ) ),
inference(skolemize,[status(esa)],[141]) ).
fof(143,negated_conjecture,
! [X10] :
( ( ( ( ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(esk7_0,X10)
| ~ rearsegP(esk6_0,X10) )
& neq(esk7_0,nil) )
| ( nil = esk7_0
& nil != esk6_0 ) )
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ( ( nil = esk9_0
& nil = esk8_0 )
| ( neq(esk8_0,nil)
& rearsegP(esk9_0,esk8_0) ) )
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0) ),
inference(shift_quantors,[status(thm)],[142]) ).
fof(144,negated_conjecture,
! [X10] :
( ( nil = esk7_0
| ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(esk7_0,X10)
| ~ rearsegP(esk6_0,X10) )
& ( nil != esk6_0
| ~ ssList(X10)
| ~ neq(X10,nil)
| ~ rearsegP(esk7_0,X10)
| ~ rearsegP(esk6_0,X10) )
& ( nil = esk7_0
| neq(esk7_0,nil) )
& ( nil != esk6_0
| neq(esk7_0,nil) )
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ( neq(esk8_0,nil)
| nil = esk9_0 )
& ( rearsegP(esk9_0,esk8_0)
| nil = esk9_0 )
& ( neq(esk8_0,nil)
| nil = esk8_0 )
& ( rearsegP(esk9_0,esk8_0)
| nil = esk8_0 )
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0)
& ssList(esk6_0) ),
inference(distribute,[status(thm)],[143]) ).
cnf(145,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(149,negated_conjecture,
( nil = esk8_0
| rearsegP(esk9_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(150,negated_conjecture,
( nil = esk8_0
| neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(151,negated_conjecture,
( nil = esk9_0
| rearsegP(esk9_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(152,negated_conjecture,
( nil = esk9_0
| neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(153,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(154,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[144]) ).
cnf(155,negated_conjecture,
( neq(esk7_0,nil)
| nil != esk6_0 ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(157,negated_conjecture,
( ~ rearsegP(esk6_0,X1)
| ~ rearsegP(esk7_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != esk6_0 ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(158,negated_conjecture,
( nil = esk7_0
| ~ rearsegP(esk6_0,X1)
| ~ rearsegP(esk7_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(159,negated_conjecture,
ssList(esk8_0),
inference(rw,[status(thm)],[145,153,theory(equality)]) ).
cnf(161,negated_conjecture,
( esk8_0 = nil
| rearsegP(esk7_0,esk8_0) ),
inference(rw,[status(thm)],[149,154,theory(equality)]) ).
cnf(162,negated_conjecture,
( esk7_0 = nil
| rearsegP(esk9_0,esk8_0) ),
inference(rw,[status(thm)],[151,154,theory(equality)]) ).
cnf(163,negated_conjecture,
( esk7_0 = nil
| rearsegP(esk7_0,esk8_0) ),
inference(rw,[status(thm)],[162,154,theory(equality)]) ).
cnf(164,negated_conjecture,
( esk7_0 = nil
| neq(esk8_0,nil) ),
inference(rw,[status(thm)],[152,154,theory(equality)]) ).
cnf(165,negated_conjecture,
( neq(esk7_0,nil)
| esk8_0 != nil ),
inference(rw,[status(thm)],[155,153,theory(equality)]) ).
cnf(166,plain,
( rearsegP(nil,nil)
| ~ ssList(nil) ),
inference(er,[status(thm)],[128,theory(equality)]) ).
cnf(167,plain,
( rearsegP(nil,nil)
| $false ),
inference(rw,[status(thm)],[166,117,theory(equality)]) ).
cnf(168,plain,
rearsegP(nil,nil),
inference(cn,[status(thm)],[167,theory(equality)]) ).
cnf(175,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[112,theory(equality)]) ).
cnf(176,negated_conjecture,
( esk7_0 = nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk8_0,X1)
| ~ rearsegP(esk7_0,X1) ),
inference(rw,[status(thm)],[158,153,theory(equality)]) ).
cnf(178,negated_conjecture,
( esk7_0 = nil
| esk8_0 = nil
| ~ rearsegP(esk8_0,esk8_0)
| ~ rearsegP(esk7_0,esk8_0)
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[176,150,theory(equality)]) ).
cnf(205,negated_conjecture,
( esk8_0 != nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk6_0,X1)
| ~ rearsegP(esk7_0,X1) ),
inference(rw,[status(thm)],[157,153,theory(equality)]) ).
cnf(206,negated_conjecture,
( esk8_0 != nil
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk8_0,X1)
| ~ rearsegP(esk7_0,X1) ),
inference(rw,[status(thm)],[205,153,theory(equality)]) ).
cnf(343,negated_conjecture,
( esk7_0 = nil
| esk8_0 = nil
| ~ rearsegP(esk8_0,esk8_0)
| ~ rearsegP(esk7_0,esk8_0)
| $false ),
inference(rw,[status(thm)],[178,159,theory(equality)]) ).
cnf(344,negated_conjecture,
( esk7_0 = nil
| esk8_0 = nil
| ~ rearsegP(esk8_0,esk8_0)
| ~ rearsegP(esk7_0,esk8_0) ),
inference(cn,[status(thm)],[343,theory(equality)]) ).
cnf(345,negated_conjecture,
( esk7_0 = nil
| esk8_0 = nil
| ~ rearsegP(esk8_0,esk8_0) ),
inference(csr,[status(thm)],[344,161]) ).
cnf(346,negated_conjecture,
( esk8_0 = nil
| esk7_0 = nil
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[345,53,theory(equality)]) ).
cnf(347,negated_conjecture,
( esk8_0 = nil
| esk7_0 = nil
| $false ),
inference(rw,[status(thm)],[346,159,theory(equality)]) ).
cnf(348,negated_conjecture,
( esk8_0 = nil
| esk7_0 = nil ),
inference(cn,[status(thm)],[347,theory(equality)]) ).
cnf(365,negated_conjecture,
( esk7_0 = nil
| ~ neq(X1,nil)
| ~ rearsegP(nil,X1)
| ~ rearsegP(esk7_0,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[206,348,theory(equality)]) ).
cnf(399,negated_conjecture,
( esk7_0 = nil
| ~ rearsegP(nil,esk8_0)
| ~ rearsegP(esk7_0,esk8_0)
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[365,164,theory(equality)]) ).
cnf(406,negated_conjecture,
( esk7_0 = nil
| ~ rearsegP(nil,esk8_0)
| ~ rearsegP(esk7_0,esk8_0)
| $false ),
inference(rw,[status(thm)],[399,159,theory(equality)]) ).
cnf(407,negated_conjecture,
( esk7_0 = nil
| ~ rearsegP(nil,esk8_0)
| ~ rearsegP(esk7_0,esk8_0) ),
inference(cn,[status(thm)],[406,theory(equality)]) ).
cnf(410,negated_conjecture,
( esk7_0 = nil
| ~ rearsegP(nil,esk8_0) ),
inference(csr,[status(thm)],[407,163]) ).
cnf(411,negated_conjecture,
( esk7_0 = nil
| ~ rearsegP(nil,nil) ),
inference(spm,[status(thm)],[410,348,theory(equality)]) ).
cnf(412,negated_conjecture,
( esk7_0 = nil
| $false ),
inference(rw,[status(thm)],[411,168,theory(equality)]) ).
cnf(413,negated_conjecture,
esk7_0 = nil,
inference(cn,[status(thm)],[412,theory(equality)]) ).
cnf(438,negated_conjecture,
( neq(nil,nil)
| esk8_0 != nil ),
inference(rw,[status(thm)],[165,413,theory(equality)]) ).
cnf(442,negated_conjecture,
( esk8_0 = nil
| rearsegP(nil,esk8_0) ),
inference(rw,[status(thm)],[161,413,theory(equality)]) ).
cnf(445,negated_conjecture,
( nil = esk8_0
| ~ ssList(esk8_0) ),
inference(spm,[status(thm)],[129,442,theory(equality)]) ).
cnf(451,negated_conjecture,
( nil = esk8_0
| $false ),
inference(rw,[status(thm)],[445,159,theory(equality)]) ).
cnf(452,negated_conjecture,
nil = esk8_0,
inference(cn,[status(thm)],[451,theory(equality)]) ).
cnf(475,negated_conjecture,
( neq(nil,nil)
| $false ),
inference(rw,[status(thm)],[438,452,theory(equality)]) ).
cnf(476,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[475,theory(equality)]) ).
cnf(479,negated_conjecture,
~ ssList(nil),
inference(spm,[status(thm)],[175,476,theory(equality)]) ).
cnf(481,negated_conjecture,
$false,
inference(rw,[status(thm)],[479,117,theory(equality)]) ).
cnf(482,negated_conjecture,
$false,
inference(cn,[status(thm)],[481,theory(equality)]) ).
cnf(483,negated_conjecture,
$false,
482,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC048+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpAw6uBQ/sel_SWC048+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC048+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC048+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC048+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
%
%------------------------------------------------------------------------------