TSTP Solution File: SWC016+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC016+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 1 03:59:13 EDT 2024
% Result : Theorem 0.67s 0.83s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 54 ( 3 unt; 0 def)
% Number of atoms : 393 ( 98 equ)
% Maximal formula atoms : 40 ( 7 avg)
% Number of connectives : 512 ( 173 ~; 156 |; 155 &)
% ( 8 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 70 ( 32 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f246,plain,
$false,
inference(avatar_sat_refutation,[],[f171,f176,f181,f182,f187,f192,f197,f202,f203,f245]) ).
fof(f245,plain,
( ~ spl6_2
| ~ spl6_5
| ~ spl6_6
| ~ spl6_7
| ~ spl6_8 ),
inference(avatar_contradiction_clause,[],[f244]) ).
fof(f244,plain,
( $false
| ~ spl6_2
| ~ spl6_5
| ~ spl6_6
| ~ spl6_7
| ~ spl6_8 ),
inference(subsumption_resolution,[],[f243,f191]) ).
fof(f191,plain,
( frontsegP(sK3,sK4)
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f189]) ).
fof(f189,plain,
( spl6_6
<=> frontsegP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f243,plain,
( ~ frontsegP(sK3,sK4)
| ~ spl6_2
| ~ spl6_5
| ~ spl6_7
| ~ spl6_8 ),
inference(subsumption_resolution,[],[f242,f186]) ).
fof(f186,plain,
( frontsegP(sK2,sK4)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f184]) ).
fof(f184,plain,
( spl6_5
<=> frontsegP(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f242,plain,
( ~ frontsegP(sK2,sK4)
| ~ frontsegP(sK3,sK4)
| ~ spl6_2
| ~ spl6_7
| ~ spl6_8 ),
inference(subsumption_resolution,[],[f232,f201]) ).
fof(f201,plain,
( ssList(sK4)
| ~ spl6_8 ),
inference(avatar_component_clause,[],[f199]) ).
fof(f199,plain,
( spl6_8
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_8])]) ).
fof(f232,plain,
( ~ ssList(sK4)
| ~ frontsegP(sK2,sK4)
| ~ frontsegP(sK3,sK4)
| ~ spl6_2
| ~ spl6_7 ),
inference(resolution,[],[f170,f196]) ).
fof(f196,plain,
( neq(sK4,nil)
| ~ spl6_7 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f194,plain,
( spl6_7
<=> neq(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).
fof(f170,plain,
( ! [X4] :
( ~ neq(X4,nil)
| ~ ssList(X4)
| ~ frontsegP(sK2,X4)
| ~ frontsegP(sK3,X4) )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f169]) ).
fof(f169,plain,
( spl6_2
<=> ! [X4] :
( ~ frontsegP(sK2,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK3,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f203,plain,
( spl6_1
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f132,f173,f165]) ).
fof(f165,plain,
( spl6_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f173,plain,
( spl6_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f132,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(sK3,nil)
| ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f102,f118,f117,f116,f115,f114]) ).
fof(f114,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f116,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = sK2 )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f117,plain,
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = sK2 )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(sK3,nil)
| ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(sK3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != sK3
| nil = sK2 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
( ? [X5] :
( frontsegP(sK2,X5)
& frontsegP(sK3,X5)
& neq(X5,nil)
& ssList(X5) )
=> ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f102,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f101]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X5] :
( frontsegP(X0,X5)
& frontsegP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X5] :
( frontsegP(X0,X5)
& frontsegP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.eloMj4pRmS/Vampire---4.8_16758',co1) ).
fof(f202,plain,
( spl6_8
| ~ spl6_4 ),
inference(avatar_split_clause,[],[f133,f178,f199]) ).
fof(f178,plain,
( spl6_4
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f133,plain,
( ~ neq(sK3,nil)
| ssList(sK4) ),
inference(cnf_transformation,[],[f119]) ).
fof(f197,plain,
( spl6_7
| ~ spl6_4 ),
inference(avatar_split_clause,[],[f134,f178,f194]) ).
fof(f134,plain,
( ~ neq(sK3,nil)
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f119]) ).
fof(f192,plain,
( spl6_6
| ~ spl6_4 ),
inference(avatar_split_clause,[],[f135,f178,f189]) ).
fof(f135,plain,
( ~ neq(sK3,nil)
| frontsegP(sK3,sK4) ),
inference(cnf_transformation,[],[f119]) ).
fof(f187,plain,
( spl6_5
| ~ spl6_4 ),
inference(avatar_split_clause,[],[f136,f178,f184]) ).
fof(f136,plain,
( ~ neq(sK3,nil)
| frontsegP(sK2,sK4) ),
inference(cnf_transformation,[],[f119]) ).
fof(f182,plain,
( spl6_3
| spl6_4 ),
inference(avatar_split_clause,[],[f157,f178,f173]) ).
fof(f157,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f137,f130,f130]) ).
fof(f130,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f119]) ).
fof(f137,plain,
( neq(sK1,nil)
| nil = sK1 ),
inference(cnf_transformation,[],[f119]) ).
fof(f181,plain,
( ~ spl6_1
| spl6_4 ),
inference(avatar_split_clause,[],[f156,f178,f165]) ).
fof(f156,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f138,f130,f131]) ).
fof(f131,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f119]) ).
fof(f138,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f119]) ).
fof(f176,plain,
( spl6_3
| spl6_2 ),
inference(avatar_split_clause,[],[f155,f169,f173]) ).
fof(f155,plain,
! [X4] :
( ~ frontsegP(sK2,X4)
| ~ frontsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK3 ),
inference(definition_unfolding,[],[f139,f131,f130,f130]) ).
fof(f139,plain,
! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK1 ),
inference(cnf_transformation,[],[f119]) ).
fof(f171,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f154,f169,f165]) ).
fof(f154,plain,
! [X4] :
( ~ frontsegP(sK2,X4)
| ~ frontsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK2 ),
inference(definition_unfolding,[],[f140,f131,f130,f131]) ).
fof(f140,plain,
! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK0 ),
inference(cnf_transformation,[],[f119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC016+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n004.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 18:11:48 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.eloMj4pRmS/Vampire---4.8_16758
% 0.67/0.83 % (16964)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.67/0.83 % (16962)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.67/0.83 % (16965)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.67/0.83 % (16963)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.67/0.83 % (16968)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.67/0.83 % (16966)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.67/0.83 % (16967)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.67/0.83 % (16969)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.67/0.83 % (16965)First to succeed.
% 0.67/0.83 % (16962)Also succeeded, but the first one will report.
% 0.67/0.83 % (16969)Also succeeded, but the first one will report.
% 0.67/0.83 % (16965)Refutation found. Thanks to Tanya!
% 0.67/0.83 % SZS status Theorem for Vampire---4
% 0.67/0.83 % SZS output start Proof for Vampire---4
% See solution above
% 0.67/0.83 % (16965)------------------------------
% 0.67/0.83 % (16965)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.67/0.83 % (16965)Termination reason: Refutation
% 0.67/0.83
% 0.67/0.83 % (16965)Memory used [KB]: 1166
% 0.67/0.83 % (16965)Time elapsed: 0.006 s
% 0.67/0.83 % (16965)Instructions burned: 7 (million)
% 0.67/0.83 % (16965)------------------------------
% 0.67/0.83 % (16965)------------------------------
% 0.67/0.83 % (16926)Success in time 0.454 s
% 0.67/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------