%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU146+2 : TPTP v5.0.0. Released v3.3.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 04:52:17 EST 2010
% Result : Theorem 0.66s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 12
% Syntax : Number of formulae : 87 ( 12 unt; 0 def)
% Number of atoms : 316 ( 137 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 357 ( 128 ~; 158 |; 58 &)
% ( 10 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 147 ( 6 sgn 98 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( in(X3,X1)
| subset(X1,set_difference(X2,singleton(X3))) ) ),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',l3_zfmisc_1) ).
fof(9,axiom,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',t69_enumset1) ).
fof(11,conjecture,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',l4_zfmisc_1) ).
fof(15,axiom,
! [X1,X2] : subset(X1,X1),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',reflexivity_r1_tarski) ).
fof(18,axiom,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',t3_xboole_1) ).
fof(27,axiom,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',t37_xboole_1) ).
fof(44,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',d1_xboole_0) ).
fof(49,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',d10_xboole_0) ).
fof(60,axiom,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',l2_zfmisc_1) ).
fof(65,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',d3_tarski) ).
fof(66,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',d2_tarski) ).
fof(67,axiom,
! [X1] : subset(empty_set,X1),
file('/tmp/tmpiON84y/sel_SEU146+2.p_1',t2_xboole_1) ).
fof(68,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
inference(assume_negation,[status(cth)],[11]) ).
fof(76,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[44,theory(equality)]) ).
fof(79,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| in(X3,X1)
| subset(X1,set_difference(X2,singleton(X3))) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(80,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| in(X6,X4)
| subset(X4,set_difference(X5,singleton(X6))) ),
inference(variable_rename,[status(thm)],[79]) ).
cnf(81,plain,
( subset(X1,set_difference(X2,singleton(X3)))
| in(X3,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[80]) ).
fof(101,plain,
! [X2] : unordered_pair(X2,X2) = singleton(X2),
inference(variable_rename,[status(thm)],[9]) ).
cnf(102,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[101]) ).
fof(105,negated_conjecture,
? [X1,X2] :
( ( ~ subset(X1,singleton(X2))
| ( X1 != empty_set
& X1 != singleton(X2) ) )
& ( subset(X1,singleton(X2))
| X1 = empty_set
| X1 = singleton(X2) ) ),
inference(fof_nnf,[status(thm)],[68]) ).
fof(106,negated_conjecture,
? [X3,X4] :
( ( ~ subset(X3,singleton(X4))
| ( X3 != empty_set
& X3 != singleton(X4) ) )
& ( subset(X3,singleton(X4))
| X3 = empty_set
| X3 = singleton(X4) ) ),
inference(variable_rename,[status(thm)],[105]) ).
fof(107,negated_conjecture,
( ( ~ subset(esk2_0,singleton(esk3_0))
| ( esk2_0 != empty_set
& esk2_0 != singleton(esk3_0) ) )
& ( subset(esk2_0,singleton(esk3_0))
| esk2_0 = empty_set
| esk2_0 = singleton(esk3_0) ) ),
inference(skolemize,[status(esa)],[106]) ).
fof(108,negated_conjecture,
( ( esk2_0 != empty_set
| ~ subset(esk2_0,singleton(esk3_0)) )
& ( esk2_0 != singleton(esk3_0)
| ~ subset(esk2_0,singleton(esk3_0)) )
& ( subset(esk2_0,singleton(esk3_0))
| esk2_0 = empty_set
| esk2_0 = singleton(esk3_0) ) ),
inference(distribute,[status(thm)],[107]) ).
cnf(109,negated_conjecture,
( esk2_0 = singleton(esk3_0)
| esk2_0 = empty_set
| subset(esk2_0,singleton(esk3_0)) ),
inference(split_conjunct,[status(thm)],[108]) ).
cnf(110,negated_conjecture,
( ~ subset(esk2_0,singleton(esk3_0))
| esk2_0 != singleton(esk3_0) ),
inference(split_conjunct,[status(thm)],[108]) ).
cnf(111,negated_conjecture,
( ~ subset(esk2_0,singleton(esk3_0))
| esk2_0 != empty_set ),
inference(split_conjunct,[status(thm)],[108]) ).
fof(121,plain,
! [X3,X4] : subset(X3,X3),
inference(variable_rename,[status(thm)],[15]) ).
cnf(122,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[121]) ).
fof(127,plain,
! [X1] :
( ~ subset(X1,empty_set)
| X1 = empty_set ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(128,plain,
! [X2] :
( ~ subset(X2,empty_set)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[127]) ).
cnf(129,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[128]) ).
fof(157,plain,
! [X1,X2] :
( ( set_difference(X1,X2) != empty_set
| subset(X1,X2) )
& ( ~ subset(X1,X2)
| set_difference(X1,X2) = empty_set ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(158,plain,
! [X3,X4] :
( ( set_difference(X3,X4) != empty_set
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| set_difference(X3,X4) = empty_set ) ),
inference(variable_rename,[status(thm)],[157]) ).
cnf(159,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[158]) ).
fof(220,plain,
! [X1] :
( ( X1 != empty_set
| ! [X2] : ~ in(X2,X1) )
& ( ? [X2] : in(X2,X1)
| X1 = empty_set ) ),
inference(fof_nnf,[status(thm)],[76]) ).
fof(221,plain,
! [X3] :
( ( X3 != empty_set
| ! [X4] : ~ in(X4,X3) )
& ( ? [X5] : in(X5,X3)
| X3 = empty_set ) ),
inference(variable_rename,[status(thm)],[220]) ).
fof(222,plain,
! [X3] :
( ( X3 != empty_set
| ! [X4] : ~ in(X4,X3) )
& ( in(esk9_1(X3),X3)
| X3 = empty_set ) ),
inference(skolemize,[status(esa)],[221]) ).
fof(223,plain,
! [X3,X4] :
( ( ~ in(X4,X3)
| X3 != empty_set )
& ( in(esk9_1(X3),X3)
| X3 = empty_set ) ),
inference(shift_quantors,[status(thm)],[222]) ).
cnf(225,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[223]) ).
fof(239,plain,
! [X1,X2] :
( ( X1 != X2
| ( subset(X1,X2)
& subset(X2,X1) ) )
& ( ~ subset(X1,X2)
| ~ subset(X2,X1)
| X1 = X2 ) ),
inference(fof_nnf,[status(thm)],[49]) ).
fof(240,plain,
! [X3,X4] :
( ( X3 != X4
| ( subset(X3,X4)
& subset(X4,X3) ) )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(variable_rename,[status(thm)],[239]) ).
fof(241,plain,
! [X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[240]) ).
cnf(242,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[241]) ).
fof(269,plain,
! [X1,X2] :
( ( ~ subset(singleton(X1),X2)
| in(X1,X2) )
& ( ~ in(X1,X2)
| subset(singleton(X1),X2) ) ),
inference(fof_nnf,[status(thm)],[60]) ).
fof(270,plain,
! [X3,X4] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X3,X4)
| subset(singleton(X3),X4) ) ),
inference(variable_rename,[status(thm)],[269]) ).
cnf(271,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[270]) ).
fof(297,plain,
! [X1,X2] :
( ( ~ subset(X1,X2)
| ! [X3] :
( ~ in(X3,X1)
| in(X3,X2) ) )
& ( ? [X3] :
( in(X3,X1)
& ~ in(X3,X2) )
| subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[65]) ).
fof(298,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ? [X7] :
( in(X7,X4)
& ~ in(X7,X5) )
| subset(X4,X5) ) ),
inference(variable_rename,[status(thm)],[297]) ).
fof(299,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ( in(esk13_2(X4,X5),X4)
& ~ in(esk13_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[298]) ).
fof(300,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( ( in(esk13_2(X4,X5),X4)
& ~ in(esk13_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[299]) ).
fof(301,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( in(esk13_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk13_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[300]) ).
cnf(302,plain,
( subset(X1,X2)
| ~ in(esk13_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[301]) ).
cnf(303,plain,
( subset(X1,X2)
| in(esk13_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[301]) ).
cnf(304,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[301]) ).
fof(305,plain,
! [X1,X2,X3] :
( ( X3 != unordered_pair(X1,X2)
| ! [X4] :
( ( ~ in(X4,X3)
| X4 = X1
| X4 = X2 )
& ( ( X4 != X1
& X4 != X2 )
| in(X4,X3) ) ) )
& ( ? [X4] :
( ( ~ in(X4,X3)
| ( X4 != X1
& X4 != X2 ) )
& ( in(X4,X3)
| X4 = X1
| X4 = X2 ) )
| X3 = unordered_pair(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[66]) ).
fof(306,plain,
! [X5,X6,X7] :
( ( X7 != unordered_pair(X5,X6)
| ! [X8] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6 )
& ( ( X8 != X5
& X8 != X6 )
| in(X8,X7) ) ) )
& ( ? [X9] :
( ( ~ in(X9,X7)
| ( X9 != X5
& X9 != X6 ) )
& ( in(X9,X7)
| X9 = X5
| X9 = X6 ) )
| X7 = unordered_pair(X5,X6) ) ),
inference(variable_rename,[status(thm)],[305]) ).
fof(307,plain,
! [X5,X6,X7] :
( ( X7 != unordered_pair(X5,X6)
| ! [X8] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6 )
& ( ( X8 != X5
& X8 != X6 )
| in(X8,X7) ) ) )
& ( ( ( ~ in(esk14_3(X5,X6,X7),X7)
| ( esk14_3(X5,X6,X7) != X5
& esk14_3(X5,X6,X7) != X6 ) )
& ( in(esk14_3(X5,X6,X7),X7)
| esk14_3(X5,X6,X7) = X5
| esk14_3(X5,X6,X7) = X6 ) )
| X7 = unordered_pair(X5,X6) ) ),
inference(skolemize,[status(esa)],[306]) ).
fof(308,plain,
! [X5,X6,X7,X8] :
( ( ( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6 )
& ( ( X8 != X5
& X8 != X6 )
| in(X8,X7) ) )
| X7 != unordered_pair(X5,X6) )
& ( ( ( ~ in(esk14_3(X5,X6,X7),X7)
| ( esk14_3(X5,X6,X7) != X5
& esk14_3(X5,X6,X7) != X6 ) )
& ( in(esk14_3(X5,X6,X7),X7)
| esk14_3(X5,X6,X7) = X5
| esk14_3(X5,X6,X7) = X6 ) )
| X7 = unordered_pair(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[307]) ).
fof(309,plain,
! [X5,X6,X7,X8] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6
| X7 != unordered_pair(X5,X6) )
& ( X8 != X5
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( X8 != X6
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( esk14_3(X5,X6,X7) != X5
| ~ in(esk14_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( esk14_3(X5,X6,X7) != X6
| ~ in(esk14_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( in(esk14_3(X5,X6,X7),X7)
| esk14_3(X5,X6,X7) = X5
| esk14_3(X5,X6,X7) = X6
| X7 = unordered_pair(X5,X6) ) ),
inference(distribute,[status(thm)],[308]) ).
cnf(313,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[309]) ).
fof(316,plain,
! [X2] : subset(empty_set,X2),
inference(variable_rename,[status(thm)],[67]) ).
cnf(317,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[316]) ).
cnf(319,negated_conjecture,
( esk2_0 = empty_set
| unordered_pair(esk3_0,esk3_0) = esk2_0
| subset(esk2_0,unordered_pair(esk3_0,esk3_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[109,102,theory(equality)]),102,theory(equality)]),
[unfolding] ).
cnf(321,plain,
( subset(unordered_pair(X1,X1),X2)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[271,102,theory(equality)]),
[unfolding] ).
cnf(322,plain,
( in(X3,X1)
| subset(X1,set_difference(X2,unordered_pair(X3,X3)))
| ~ subset(X1,X2) ),
inference(rw,[status(thm)],[81,102,theory(equality)]),
[unfolding] ).
cnf(327,negated_conjecture,
( esk2_0 != empty_set
| ~ subset(esk2_0,unordered_pair(esk3_0,esk3_0)) ),
inference(rw,[status(thm)],[111,102,theory(equality)]),
[unfolding] ).
cnf(328,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) != esk2_0
| ~ subset(esk2_0,unordered_pair(esk3_0,esk3_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[110,102,theory(equality)]),102,theory(equality)]),
[unfolding] ).
cnf(509,plain,
( in(X1,X2)
| unordered_pair(X3,X1) != X2 ),
inference(er,[status(thm)],[313,theory(equality)]) ).
cnf(556,plain,
( in(X1,X2)
| subset(X2,set_difference(X2,unordered_pair(X1,X1))) ),
inference(spm,[status(thm)],[322,122,theory(equality)]) ).
cnf(615,negated_conjecture,
( in(X1,unordered_pair(esk3_0,esk3_0))
| unordered_pair(esk3_0,esk3_0) = esk2_0
| esk2_0 = empty_set
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[304,319,theory(equality)]) ).
cnf(1627,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) = esk2_0
| in(X1,unordered_pair(esk3_0,esk3_0))
| ~ in(X1,esk2_0) ),
inference(csr,[status(thm)],[615,225]) ).
cnf(1629,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) = esk2_0
| in(esk13_2(esk2_0,X1),unordered_pair(esk3_0,esk3_0))
| subset(esk2_0,X1) ),
inference(spm,[status(thm)],[1627,303,theory(equality)]) ).
cnf(2480,negated_conjecture,
( subset(esk2_0,unordered_pair(esk3_0,esk3_0))
| unordered_pair(esk3_0,esk3_0) = esk2_0 ),
inference(spm,[status(thm)],[302,1629,theory(equality)]) ).
cnf(2489,negated_conjecture,
( set_difference(esk2_0,unordered_pair(esk3_0,esk3_0)) = empty_set
| unordered_pair(esk3_0,esk3_0) = esk2_0 ),
inference(spm,[status(thm)],[159,2480,theory(equality)]) ).
cnf(2494,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) = esk2_0
| ~ subset(unordered_pair(esk3_0,esk3_0),esk2_0) ),
inference(spm,[status(thm)],[242,2480,theory(equality)]) ).
cnf(7296,negated_conjecture,
( in(esk3_0,esk2_0)
| subset(esk2_0,empty_set)
| unordered_pair(esk3_0,esk3_0) = esk2_0 ),
inference(spm,[status(thm)],[556,2489,theory(equality)]) ).
cnf(7313,negated_conjecture,
( in(esk3_0,esk2_0)
| subset(esk2_0,empty_set) ),
inference(csr,[status(thm)],[7296,509]) ).
cnf(7314,negated_conjecture,
( empty_set = esk2_0
| in(esk3_0,esk2_0) ),
inference(spm,[status(thm)],[129,7313,theory(equality)]) ).
cnf(7345,negated_conjecture,
( subset(unordered_pair(esk3_0,esk3_0),esk2_0)
| esk2_0 = empty_set ),
inference(spm,[status(thm)],[321,7314,theory(equality)]) ).
cnf(7368,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) = esk2_0
| esk2_0 = empty_set ),
inference(spm,[status(thm)],[2494,7345,theory(equality)]) ).
cnf(7435,negated_conjecture,
( esk2_0 = empty_set
| ~ subset(esk2_0,esk2_0) ),
inference(spm,[status(thm)],[328,7368,theory(equality)]) ).
cnf(7443,negated_conjecture,
( esk2_0 = empty_set
| $false ),
inference(rw,[status(thm)],[7435,122,theory(equality)]) ).
cnf(7444,negated_conjecture,
esk2_0 = empty_set,
inference(cn,[status(thm)],[7443,theory(equality)]) ).
cnf(7920,negated_conjecture,
( $false
| ~ subset(esk2_0,unordered_pair(esk3_0,esk3_0)) ),
inference(rw,[status(thm)],[327,7444,theory(equality)]) ).
cnf(7921,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[7920,7444,theory(equality)]),317,theory(equality)]) ).
cnf(7922,negated_conjecture,
$false,
inference(cn,[status(thm)],[7921,theory(equality)]) ).
cnf(7923,negated_conjecture,
$false,
7922,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU146+2.p
% --creating new selector for []
% -running prover on /tmp/tmpiON84y/sel_SEU146+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU146+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU146+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU146+2.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
%
%------------------------------------------------------------------------------