TSTP Solution File: SWC105+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWC105+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:17:37 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 48 ( 12 unt; 0 def)
% Number of atoms : 219 ( 84 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 256 ( 85 ~; 92 |; 62 &)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 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 : 38 ( 0 sgn 26 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/tmp/tmpB4nlTF/sel_SWC105+1.p_1',ax15) ).
fof(20,axiom,
ssList(nil),
file('/tmp/tmpB4nlTF/sel_SWC105+1.p_1',ax17) ).
fof(23,axiom,
! [X1] :
( ssList(X1)
=> ( rearsegP(nil,X1)
<=> nil = X1 ) ),
file('/tmp/tmpB4nlTF/sel_SWC105+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)
| ( neq(X1,nil)
& rearsegP(X2,X1) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
file('/tmp/tmpB4nlTF/sel_SWC105+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)
| ( neq(X1,nil)
& rearsegP(X2,X1) ) ) )
| ( ( 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)
| ( neq(X1,nil)
& rearsegP(X2,X1) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
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(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)
& ( ~ neq(X1,nil)
| ~ rearsegP(X2,X1) ) ) )
& ( ( nil = X4
& nil = X3 )
| ( neq(X3,nil)
& rearsegP(X4,X3) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[28]) ).
fof(141,negated_conjecture,
? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& X6 = X8
& X5 = X7
& ( ( nil = X6
& nil != X5 )
| ( neq(X6,nil)
& ( ~ neq(X5,nil)
| ~ rearsegP(X6,X5) ) ) )
& ( ( nil = X8
& nil = X7 )
| ( neq(X7,nil)
& rearsegP(X8,X7) ) ) ) ) ) ),
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)
& ( ~ neq(esk6_0,nil)
| ~ rearsegP(esk7_0,esk6_0) ) ) )
& ( ( nil = esk9_0
& nil = esk8_0 )
| ( neq(esk8_0,nil)
& rearsegP(esk9_0,esk8_0) ) ) ),
inference(skolemize,[status(esa)],[141]) ).
fof(143,negated_conjecture,
( ssList(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& esk7_0 = esk9_0
& esk6_0 = esk8_0
& ( neq(esk7_0,nil)
| nil = esk7_0 )
& ( ~ neq(esk6_0,nil)
| ~ rearsegP(esk7_0,esk6_0)
| nil = esk7_0 )
& ( neq(esk7_0,nil)
| nil != esk6_0 )
& ( ~ neq(esk6_0,nil)
| ~ rearsegP(esk7_0,esk6_0)
| nil != esk6_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 ) ),
inference(distribute,[status(thm)],[142]) ).
cnf(144,negated_conjecture,
( nil = esk8_0
| rearsegP(esk9_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(146,negated_conjecture,
( nil = esk9_0
| rearsegP(esk9_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(147,negated_conjecture,
( nil = esk9_0
| neq(esk8_0,nil) ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(149,negated_conjecture,
( neq(esk7_0,nil)
| nil != esk6_0 ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(150,negated_conjecture,
( nil = esk7_0
| ~ rearsegP(esk7_0,esk6_0)
| ~ neq(esk6_0,nil) ),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(152,negated_conjecture,
esk6_0 = esk8_0,
inference(split_conjunct,[status(thm)],[143]) ).
cnf(153,negated_conjecture,
esk7_0 = esk9_0,
inference(split_conjunct,[status(thm)],[143]) ).
cnf(157,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[143]) ).
cnf(162,negated_conjecture,
( esk6_0 = nil
| rearsegP(esk9_0,esk8_0) ),
inference(rw,[status(thm)],[144,152,theory(equality)]) ).
cnf(163,negated_conjecture,
( esk6_0 = nil
| rearsegP(esk7_0,esk6_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[162,153,theory(equality)]),152,theory(equality)]) ).
cnf(166,negated_conjecture,
( esk7_0 = nil
| rearsegP(esk9_0,esk8_0) ),
inference(rw,[status(thm)],[146,153,theory(equality)]) ).
cnf(167,negated_conjecture,
( esk7_0 = nil
| rearsegP(esk7_0,esk6_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[166,153,theory(equality)]),152,theory(equality)]) ).
cnf(168,negated_conjecture,
( esk7_0 = nil
| neq(esk8_0,nil) ),
inference(rw,[status(thm)],[147,153,theory(equality)]) ).
cnf(169,negated_conjecture,
( esk7_0 = nil
| neq(esk6_0,nil) ),
inference(rw,[status(thm)],[168,152,theory(equality)]) ).
cnf(173,negated_conjecture,
( esk7_0 = nil
| ~ rearsegP(esk7_0,esk6_0) ),
inference(csr,[status(thm)],[150,169]) ).
cnf(174,negated_conjecture,
esk7_0 = nil,
inference(csr,[status(thm)],[173,167]) ).
cnf(179,negated_conjecture,
( neq(nil,nil)
| esk6_0 != nil ),
inference(rw,[status(thm)],[149,174,theory(equality)]) ).
cnf(183,negated_conjecture,
( esk6_0 = nil
| rearsegP(nil,esk6_0) ),
inference(rw,[status(thm)],[163,174,theory(equality)]) ).
cnf(187,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[112,theory(equality)]) ).
cnf(322,negated_conjecture,
( nil = esk6_0
| ~ ssList(esk6_0) ),
inference(spm,[status(thm)],[129,183,theory(equality)]) ).
cnf(328,negated_conjecture,
( nil = esk6_0
| $false ),
inference(rw,[status(thm)],[322,157,theory(equality)]) ).
cnf(329,negated_conjecture,
nil = esk6_0,
inference(cn,[status(thm)],[328,theory(equality)]) ).
cnf(367,negated_conjecture,
( neq(nil,nil)
| $false ),
inference(rw,[status(thm)],[179,329,theory(equality)]) ).
cnf(368,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[367,theory(equality)]) ).
cnf(375,negated_conjecture,
~ ssList(nil),
inference(spm,[status(thm)],[187,368,theory(equality)]) ).
cnf(377,negated_conjecture,
$false,
inference(rw,[status(thm)],[375,117,theory(equality)]) ).
cnf(378,negated_conjecture,
$false,
inference(cn,[status(thm)],[377,theory(equality)]) ).
cnf(379,negated_conjecture,
$false,
378,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWC/SWC105+1.p
% --creating new selector for [SWC001+0.ax]
% -running prover on /tmp/tmpB4nlTF/sel_SWC105+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWC105+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWC/SWC105+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWC/SWC105+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
%
%------------------------------------------------------------------------------