%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL486+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 11:52:35 AM UTC 2026
% Result : Theorem 4.22s 1.53s
% Output : Refutation 5.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 20
% Syntax : Number of formulae : 86 ( 29 unt; 10 def)
% Number of atoms : 178 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 167 ( 75 ~; 69 |; 2 &)
% ( 14 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 18 ( 16 usr; 16 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn 85 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f6,axiom,
( implies_3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_3) ).
fof(f25,axiom,
( r4
<=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r4) ).
fof(f26,axiom,
( r5
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r5) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_or) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f39,axiom,
r4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r4) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r5) ).
fof(f45,conjecture,
implies_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_3) ).
fof(f46,negated_conjecture,
~ implies_3,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ implies_3,
inference(flattening,[],[f46]) ).
fof(f48,plain,
( r5
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f26]) ).
fof(f49,plain,
( r4
=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f25]) ).
fof(f53,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
=> implies_3 ),
inference(unused_predicate_definition_removal,[],[f6]) ).
fof(f55,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f56,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f55]) ).
fof(f57,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f56]) ).
fof(f59,plain,
( implies_3
| ? [X0,X1,X2] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(ennf_transformation,[],[f53]) ).
fof(f63,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(ennf_transformation,[],[f49]) ).
fof(f64,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(ennf_transformation,[],[f48]) ).
fof(f68,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f70,plain,
( implies_3
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f59]) ).
fof(f71,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f57]) ).
fof(f73,plain,
( implies_3
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
inference(cnf_transformation,[],[f70]) ).
fof(f77,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(cnf_transformation,[],[f63]) ).
fof(f78,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(cnf_transformation,[],[f64]) ).
fof(f82,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f68]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f87,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f91,plain,
r4,
inference(cnf_transformation,[],[f39]) ).
fof(f92,plain,
r5,
inference(cnf_transformation,[],[f40]) ).
fof(f97,plain,
~ implies_3,
inference(cnf_transformation,[],[f47]) ).
fof(f107,definition,
( spl3_3
<=> op_implies_or ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f111,definition,
( spl3_4
<=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
fof(f112,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f113,plain,
( ~ spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f82,f111,f107]) ).
fof(f139,definition,
( spl3_11
<=> r5 ),
introduced(definition,[new_symbols(definition,[spl3_11])],[avatar_definition]) ).
fof(f143,definition,
( spl3_12
<=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
introduced(definition,[new_symbols(definition,[spl3_12])],[avatar_definition]) ).
fof(f144,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ spl3_12 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f145,plain,
( ~ spl3_11
| spl3_12 ),
inference(avatar_split_clause,[],[f78,f143,f139]) ).
fof(f147,definition,
( spl3_13
<=> r4 ),
introduced(definition,[new_symbols(definition,[spl3_13])],[avatar_definition]) ).
fof(f151,definition,
( spl3_14
<=> ! [X2,X0,X1] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
introduced(definition,[new_symbols(definition,[spl3_14])],[avatar_definition]) ).
fof(f152,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ spl3_14 ),
inference(avatar_component_clause,[],[f151]) ).
fof(f153,plain,
( ~ spl3_13
| spl3_14 ),
inference(avatar_split_clause,[],[f77,f151,f147]) ).
fof(f179,definition,
( spl3_21
<=> is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
introduced(definition,[new_symbols(definition,[spl3_21])],[avatar_definition]) ).
fof(f181,plain,
( ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2))))
| spl3_21 ),
inference(avatar_component_clause,[],[f179]) ).
fof(f183,definition,
( spl3_22
<=> implies_3 ),
introduced(definition,[new_symbols(definition,[spl3_22])],[avatar_definition]) ).
fof(f186,plain,
( ~ spl3_21
| spl3_22 ),
inference(avatar_split_clause,[],[f73,f183,f179]) ).
fof(f196,definition,
( spl3_25
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl3_25])],[avatar_definition]) ).
fof(f200,definition,
( spl3_26
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[spl3_26])],[avatar_definition]) ).
fof(f201,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl3_26 ),
inference(avatar_component_clause,[],[f200]) ).
fof(f202,plain,
( ~ spl3_25
| spl3_26 ),
inference(avatar_split_clause,[],[f71,f200,f196]) ).
fof(f203,plain,
~ spl3_22,
inference(avatar_split_clause,[],[f97,f183]) ).
fof(f206,plain,
spl3_3,
inference(avatar_split_clause,[],[f84,f107]) ).
fof(f212,plain,
spl3_25,
inference(avatar_split_clause,[],[f87,f196]) ).
fof(f224,plain,
spl3_13,
inference(avatar_split_clause,[],[f91,f147]) ).
fof(f227,plain,
spl3_11,
inference(avatar_split_clause,[],[f92,f139]) ).
fof(f242,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))))
| ~ is_a_theorem(X0) )
| spl3_21
| ~ spl3_26 ),
inference(resolution,[],[f201,f181]) ).
fof(f250,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X2,X1),implies(or(not(X0),X2),implies(X0,X1))))
| ~ spl3_4
| ~ spl3_12 ),
inference(superposition,[],[f144,f112]) ).
fof(f251,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X2,X1),implies(implies(X0,X2),implies(X0,X1))))
| ~ spl3_4
| ~ spl3_12 ),
inference(forward_demodulation,[],[f250,f112]) ).
fof(f257,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X1,or(not(X0),X2)),implies(X0,or(X1,X2))))
| ~ spl3_4
| ~ spl3_14 ),
inference(superposition,[],[f152,f112]) ).
fof(f258,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X1,implies(X0,X2)),implies(X0,or(X1,X2))))
| ~ spl3_4
| ~ spl3_14 ),
inference(forward_demodulation,[],[f257,f112]) ).
fof(f335,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(not(X0),implies(X2,X1)),implies(X2,implies(X0,X1))))
| ~ spl3_4
| ~ spl3_14 ),
inference(superposition,[],[f258,f112]) ).
fof(f340,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X2,X1)),implies(X2,implies(X0,X1))))
| ~ spl3_4
| ~ spl3_14 ),
inference(forward_demodulation,[],[f335,f112]) ).
fof(f729,plain,
( ~ is_a_theorem(implies(implies(sK1,sK2),implies(implies(sK0,sK1),implies(sK0,sK2))))
| ~ spl3_4
| ~ spl3_14
| spl3_21
| ~ spl3_26 ),
inference(resolution,[],[f340,f242]) ).
fof(f754,plain,
( $false
| ~ spl3_4
| ~ spl3_12
| ~ spl3_14
| spl3_21
| ~ spl3_26 ),
inference(forward_subsumption_resolution,[],[f729,f251]) ).
fof(f755,plain,
( ~ spl3_4
| ~ spl3_12
| ~ spl3_14
| spl3_21
| ~ spl3_26 ),
inference(avatar_contradiction_clause,[],[f754]) ).
cnf(s2,plain,
( ~ spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f113]) ).
cnf(s6,plain,
( ~ spl3_11
| spl3_12 ),
inference(sat_conversion,[],[f145]) ).
cnf(s7,plain,
( ~ spl3_13
| spl3_14 ),
inference(sat_conversion,[],[f153]) ).
cnf(s11,plain,
( ~ spl3_21
| spl3_22 ),
inference(sat_conversion,[],[f186]) ).
cnf(s13,plain,
( ~ spl3_25
| spl3_26 ),
inference(sat_conversion,[],[f202]) ).
cnf(s14,plain,
~ spl3_22,
inference(sat_conversion,[],[f203]) ).
cnf(s16,plain,
spl3_3,
inference(sat_conversion,[],[f206]) ).
cnf(s20,plain,
spl3_25,
inference(sat_conversion,[],[f212]) ).
cnf(s28,plain,
spl3_13,
inference(sat_conversion,[],[f224]) ).
cnf(s30,plain,
spl3_11,
inference(sat_conversion,[],[f227]) ).
cnf(s39,plain,
( ~ spl3_4
| ~ spl3_12
| ~ spl3_14
| spl3_21
| ~ spl3_26 ),
inference(sat_conversion,[],[f755]) ).
cnf(s40,plain,
spl3_26,
inference(rat,[],[s13,s20]) ).
cnf(s42,plain,
~ spl3_21,
inference(rat,[],[s11,s14]) ).
cnf(s46,plain,
spl3_14,
inference(rat,[],[s7,s28]) ).
cnf(s47,plain,
spl3_12,
inference(rat,[],[s6,s30]) ).
cnf(s48,plain,
~ spl3_4,
inference(rat,[],[s39,s40,s42,s46,s47]) ).
cnf(s52,plain,
$false,
inference(rat,[],[s2,s48,s16]) ).
fof(f756,plain,
$false,
inference(avatar_sat_refutation,[],[s52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL486+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n008.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 15:51:40 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.22/1.53 % (1411532)Detected formulas, will run a generic FOF schedule.
% 4.22/1.53 % (1411583)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=538748150:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.22/1.53 % (1411588)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=122980201:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.22/1.53 % (1411586)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2298316042:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.22/1.53 % (1411584)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2301101882:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.22/1.53 % (1411587)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=485900041:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.22/1.53 % (1411585)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=952815404:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.22/1.53 % (1411587)Refutation not found, incomplete strategy
% 4.22/1.53 % (1411587)------------------------------
% 4.22/1.53 % (1411587)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.22/1.53 % (1411587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.22/1.53 % (1411586)Refutation not found, incomplete strategy
% 4.22/1.53 % (1411586)------------------------------
% 4.22/1.53 % (1411586)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.22/1.53 % (1411587)CaDiCaL version: 2.1.3
% 4.22/1.53 % (1411586)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.22/1.53 % (1411587)Termination reason: Refutation not found, incomplete strategy
% 4.22/1.53 % (1411587)Time elapsed: 0.001 s
% 4.22/1.53 % (1411587)Peak memory usage: 86 MB
% 4.22/1.53 % (1411586)CaDiCaL version: 2.1.3
% 4.22/1.53 % (1411586)Termination reason: Refutation not found, incomplete strategy
% 4.22/1.53 % (1411586)Time elapsed: 0.001 s
% 4.22/1.53 % (1411586)Peak memory usage: 87 MB
% 4.22/1.53 % (1411588)First to succeed.
% 4.22/1.53 % (1411588)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1411532"
% 4.22/1.53 % (1411589)dis-21_1_sil=8000:lcm=predicate:random_seed=1693260873:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 4.22/1.53 % (1411589)Refutation not found, incomplete strategy
% 4.22/1.53 % (1411589)------------------------------
% 4.22/1.53 % (1411589)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.22/1.53 % (1411589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.22/1.53 % (1411589)CaDiCaL version: 2.1.3
% 4.22/1.53 % (1411589)Termination reason: Refutation not found, incomplete strategy
% 4.22/1.53 % (1411589)Time elapsed: 0.003 s
% 4.22/1.53 % (1411589)Peak memory usage: 88 MB
% 4.22/1.53 % (1411589)Instructions burned: 1 (million)
% 4.22/1.53 % (1411587)------------------------------
% 4.22/1.53 % (1411587)------------------------------
% 4.22/1.53 % (1411586)------------------------------
% 4.22/1.53 % (1411586)------------------------------
% 4.22/1.53 % (1411588)Refutation found. Thanks to Tanya!
% 4.22/1.53 % SZS status Theorem for theBenchmark
% 4.22/1.53 % SZS output start Proof for theBenchmark
% See solution above
% 5.23/1.74 % (1411588)------------------------------
% 5.23/1.74 % (1411588)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.23/1.74 % (1411588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.23/1.74 % (1411588)CaDiCaL version: 2.1.3
% 5.23/1.74 % (1411588)Termination reason: Refutation
% 5.23/1.74 % (1411588)Time elapsed: 0.029 s
% 5.23/1.74 % (1411588)Peak memory usage: 90 MB
% 5.23/1.74 % (1411588)Instructions burned: 23 (million)
% 5.23/1.74 % (1411588)------------------------------
% 5.23/1.74 % (1411588)------------------------------
% 5.23/1.74 % (1411532)Success in time 0.653 s
% 5.23/1.74 % Vampire exiting
%------------------------------------------------------------------------------