%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO308^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 : Wed Sep 30 08:47:24 AM UTC 2026
% Result : Theorem 0.32s 0.38s
% Output : Refutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 17
% Syntax : Number of formulae : 99 ( 30 unt; 0 typ; 16 def)
% Number of atoms : 485 ( 117 equ; 0 cnn)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 364 ( 98 ~; 105 |; 12 &; 123 @)
% ( 10 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 21 usr; 16 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 44 !; 6 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cB: $i > $o ).
thf(func_def_1,type,
cA: $i > $o ).
thf(func_def_5,type,
sK0: $i > $o ).
thf(func_def_7,type,
sF2: $i > $o ).
thf(func_def_8,type,
sF3: $i > $o ).
thf(func_def_9,type,
sF4: $i > $o ).
thf(func_def_10,type,
sF5: $o ).
thf(func_def_11,type,
sF6: $o ).
thf(func_def_12,type,
sF7: $o ).
thf(f1,conjecture,
! [X0: $i > $o] :
( ( ! [X2: $i] :
( ( X0 @ X2 )
=> ( cB @ X2 ) )
| ! [X1: $i] :
( ( X0 @ X1 )
=> ( cA @ X1 ) ) )
=> ! [X3: $i] :
( ( X0 @ X3 )
=> ( ( cB @ X3 )
| ( cA @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cSET81_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: $i > $o] :
( ( ! [X2: $i] :
( ( X0 @ X2 )
=> ( cB @ X2 ) )
| ! [X1: $i] :
( ( X0 @ X1 )
=> ( cA @ X1 ) ) )
=> ! [X3: $i] :
( ( X0 @ X3 )
=> ( ( cB @ X3 )
| ( cA @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: $i > $o] :
( ( ! [X1: $i] :
( ( X0 @ X1 )
=> ( cB @ X1 ) )
| ! [X2: $i] :
( ( X0 @ X2 )
=> ( cA @ X2 ) ) )
=> ! [X3: $i] :
( ( X0 @ X3 )
=> ( ( cB @ X3 )
| ( cA @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: $i > $o] :
( ( ! [X1: $i] :
( ( ( X0 @ X1 )
= $true )
=> ( $true
= ( cB @ X1 ) ) )
| ! [X2: $i] :
( ( ( X0 @ X2 )
= $true )
=> ( ( cA @ X2 )
= $true ) ) )
=> ! [X3: $i] :
( ( ( X0 @ X3 )
= $true )
=> ( ( ( cB @ X3 )
= $true )
| ( ( cA @ X3 )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: $i > $o] :
( ? [X3: $i] :
( ( ( cB @ X3 )
!= $true )
& ( ( cA @ X3 )
!= $true )
& ( ( X0 @ X3 )
= $true ) )
& ( ! [X2: $i] :
( ( ( cA @ X2 )
= $true )
| ( ( X0 @ X2 )
!= $true ) )
| ! [X1: $i] :
( ( $true
= ( cB @ X1 ) )
| ( ( X0 @ X1 )
!= $true ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: $i > $o] :
( ( ! [X2: $i] :
( ( ( cA @ X2 )
= $true )
| ( ( X0 @ X2 )
!= $true ) )
| ! [X1: $i] :
( ( $true
= ( cB @ X1 ) )
| ( ( X0 @ X1 )
!= $true ) ) )
& ? [X3: $i] :
( ( ( cA @ X3 )
!= $true )
& ( ( cB @ X3 )
!= $true )
& ( ( X0 @ X3 )
= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
? [X0: $i > $o] :
( ( ! [X1: $i] :
( ( ( cA @ X1 )
= $true )
| ( ( X0 @ X1 )
!= $true ) )
| ! [X2: $i] :
( ( ( cB @ X2 )
= $true )
| ( ( X0 @ X2 )
!= $true ) ) )
& ? [X3: $i] :
( ( ( cA @ X3 )
!= $true )
& ( ( cB @ X3 )
!= $true )
& ( ( X0 @ X3 )
= $true ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( ! [X1: $i] :
( ( ( cA @ X1 )
= $true )
| ( ( sK0 @ X1 )
!= $true ) )
| ! [X2: $i] :
( ( ( cB @ X2 )
= $true )
| ( ( sK0 @ X2 )
!= $true ) ) )
& ( ( cA @ sK1 )
!= $true )
& ( ( cB @ sK1 )
!= $true )
& ( ( sK0 @ sK1 )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X3,sK1)],[f7]) ).
thf(f9,plain,
( ( sK0 @ sK1 )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
( ( cB @ sK1 )
!= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
( ( cA @ sK1 )
!= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f12,plain,
! [X2: $i,X1: $i] :
( ( ( cA @ X1 )
= $true )
| ( ( sK0 @ X1 )
!= $true )
| ( ( cB @ X2 )
= $true )
| ( ( sK0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f15,definition,
! [X1: $i] :
( ( sF2 @ X1 )
= ( cA @ X1 ) ),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
thf(f16,plain,
! [X1: $i] :
( ( cA @ X1 )
= ( sF2 @ X1 ) ),
inference(reorient_equations,[],[f15]) ).
thf(f17,definition,
! [X1: $i] :
( ( sF3 @ X1 )
= ( sK0 @ X1 ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f18,definition,
! [X2: $i] :
( ( sF4 @ X2 )
= ( cB @ X2 ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f19,plain,
! [X2: $i] :
( ( cB @ X2 )
= ( sF4 @ X2 ) ),
inference(reorient_equations,[],[f18]) ).
thf(f20,plain,
! [X2: $i,X1: $i] :
( ( ( sF4 @ X2 )
= $true )
| ( ( sF3 @ X2 )
!= $true )
| ( ( sF3 @ X1 )
!= $true )
| ( ( sF2 @ X1 )
= $true ) ),
inference(definition_folding,[],[f12,f17,f19,f17,f16]) ).
thf(f21,definition,
( sF5
= ( cA @ sK1 ) ),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
thf(f22,plain,
sF5 != $true,
inference(definition_folding,[],[f11,f21]) ).
thf(f23,definition,
( sF6
= ( cB @ sK1 ) ),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
thf(f24,plain,
sF6 != $true,
inference(definition_folding,[],[f10,f23]) ).
thf(f25,definition,
( sF7
= ( sK0 @ sK1 ) ),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
thf(f26,plain,
( ( sK0 @ sK1 )
= sF7 ),
inference(reorient_equations,[],[f25]) ).
thf(f27,plain,
sF7 = $true,
inference(definition_folding,[],[f9,f26]) ).
thf(f28,plain,
! [X2: $i] :
( ( $false
= ( sF4 @ X2 ) )
| ( ( cB @ X2 )
= $true ) ),
inference(iff_proxy_clausification,[],[f19]) ).
thf(f30,plain,
! [X1: $i] :
( ( $false
= ( sF2 @ X1 ) )
| ( ( cA @ X1 )
= $true ) ),
inference(iff_proxy_clausification,[],[f16]) ).
thf(f32,plain,
( ( $false
= ( cA @ sK1 ) )
| ( sF5 = $true ) ),
inference(iff_proxy_clausification,[],[f21]) ).
thf(f34,plain,
! [X1: $i] :
( ( $false
= ( sK0 @ X1 ) )
| ( ( sF3 @ X1 )
= $true ) ),
inference(iff_proxy_clausification,[],[f17]) ).
thf(f36,plain,
( ( sF7 = $false )
| ( ( sK0 @ sK1 )
= $true ) ),
inference(iff_proxy_clausification,[],[f26]) ).
thf(f38,plain,
( ( $false
= ( cB @ sK1 ) )
| ( sF6 = $true ) ),
inference(iff_proxy_clausification,[],[f23]) ).
thf(f50,definition,
( spl8_3
<=> ( $false
= ( cA @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl8_3])],[avatar_definition]) ).
thf(f52,plain,
( ( $false
= ( cA @ sK1 ) )
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f54,definition,
( spl8_4
<=> ( sF5 = $true ) ),
introduced(definition,[new_symbols(definition,[spl8_4])],[avatar_definition]) ).
thf(f57,plain,
( spl8_3
| spl8_4 ),
inference(avatar_split_clause,[],[f32,f54,f50]) ).
thf(f59,definition,
( spl8_5
<=> ! [X1: $i] :
( ( ( sF3 @ X1 )
!= $true )
| ( ( sF2 @ X1 )
= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl8_5])],[avatar_definition]) ).
thf(f60,plain,
( ! [X1: $i] :
( ( ( sF2 @ X1 )
= $true )
| ( ( sF3 @ X1 )
!= $true ) )
| ~ spl8_5 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f62,definition,
( spl8_6
<=> ! [X2: $i] :
( ( ( sF4 @ X2 )
= $true )
| ( ( sF3 @ X2 )
!= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl8_6])],[avatar_definition]) ).
thf(f63,plain,
( ! [X2: $i] :
( ( ( sF4 @ X2 )
= $true )
| ( ( sF3 @ X2 )
!= $true ) )
| ~ spl8_6 ),
inference(avatar_component_clause,[],[f62]) ).
thf(f64,plain,
( spl8_5
| spl8_6 ),
inference(avatar_split_clause,[],[f20,f62,f59]) ).
thf(f66,definition,
( spl8_7
<=> ( ( sK0 @ sK1 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl8_7])],[avatar_definition]) ).
thf(f67,plain,
( ( ( sK0 @ sK1 )
!= $false )
| spl8_7 ),
inference(avatar_component_clause,[],[f66]) ).
thf(f68,plain,
( ( ( sK0 @ sK1 )
= $false )
| ~ spl8_7 ),
inference(avatar_component_clause,[],[f66]) ).
thf(f70,definition,
( spl8_8
<=> ( sF7 = $true ) ),
introduced(definition,[new_symbols(definition,[spl8_8])],[avatar_definition]) ).
thf(f72,plain,
( ( sF7 = $true )
| ~ spl8_8 ),
inference(avatar_component_clause,[],[f70]) ).
thf(f75,definition,
( spl8_9
<=> ( ( sK0 @ sK1 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl8_9])],[avatar_definition]) ).
thf(f77,plain,
( ( ( sK0 @ sK1 )
= $true )
| ~ spl8_9 ),
inference(avatar_component_clause,[],[f75]) ).
thf(f79,definition,
( spl8_10
<=> ( sF7 = $false ) ),
introduced(definition,[new_symbols(definition,[spl8_10])],[avatar_definition]) ).
thf(f81,plain,
( ( sF7 = $false )
| ~ spl8_10 ),
inference(avatar_component_clause,[],[f79]) ).
thf(f82,plain,
( spl8_9
| spl8_10 ),
inference(avatar_split_clause,[],[f36,f79,f75]) ).
thf(f93,definition,
( spl8_13
<=> ( sF6 = $true ) ),
introduced(definition,[new_symbols(definition,[spl8_13])],[avatar_definition]) ).
thf(f97,definition,
( spl8_14
<=> ( $false
= ( cB @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl8_14])],[avatar_definition]) ).
thf(f99,plain,
( ( $false
= ( cB @ sK1 ) )
| ~ spl8_14 ),
inference(avatar_component_clause,[],[f97]) ).
thf(f100,plain,
( spl8_13
| spl8_14 ),
inference(avatar_split_clause,[],[f38,f97,f93]) ).
thf(f101,plain,
~ spl8_4,
inference(avatar_split_clause,[],[f22,f54]) ).
thf(f102,plain,
~ spl8_13,
inference(avatar_split_clause,[],[f24,f93]) ).
thf(f103,plain,
spl8_8,
inference(avatar_split_clause,[],[f27,f70]) ).
thf(f124,plain,
( ( $false = $true )
| ~ spl8_7
| ~ spl8_9 ),
inference(forward_demodulation,[],[f77,f68]) ).
thf(f125,plain,
( $false
| ~ spl8_7
| ~ spl8_9 ),
inference(trivial_inequality_removal,[],[f124]) ).
thf(f126,plain,
( ~ spl8_7
| ~ spl8_9 ),
inference(avatar_contradiction_clause,[],[f125]) ).
thf(f146,plain,
( ! [X0: $i] :
( ( ( sF3 @ X0 )
!= $true )
| ( $false = $true )
| ( ( cA @ X0 )
= $true ) )
| ~ spl8_5 ),
inference(constrained_superposition,[],[f60,f30]) ).
thf(f147,plain,
( ! [X0: $i] :
( ( ( cA @ X0 )
= $true )
| ( ( sF3 @ X0 )
!= $true ) )
| ~ spl8_5 ),
inference(trivial_inequality_removal,[],[f146]) ).
thf(f151,plain,
( ( $false = $true )
| ( ( sF3 @ sK1 )
!= $true )
| ~ spl8_3
| ~ spl8_5 ),
inference(constrained_superposition,[],[f52,f147]) ).
thf(f152,plain,
( ( ( sF3 @ sK1 )
!= $true )
| ~ spl8_3
| ~ spl8_5 ),
inference(trivial_inequality_removal,[],[f151]) ).
thf(f166,plain,
( ( ( sF3 @ sK1 )
= $true )
| ( $false != $false )
| spl8_7 ),
inference(constrained_superposition,[],[f67,f34]) ).
thf(f170,plain,
( ( ( sF3 @ sK1 )
= $true )
| spl8_7 ),
inference(trivial_inequality_removal,[],[f166]) ).
thf(f175,plain,
( $false
| ~ spl8_3
| ~ spl8_5
| spl8_7 ),
inference(forward_subsumption_resolution,[],[f170,f152]) ).
thf(f176,plain,
( ~ spl8_3
| ~ spl8_5
| spl8_7 ),
inference(avatar_contradiction_clause,[],[f175]) ).
thf(f177,plain,
( ( $false = $true )
| ~ spl8_8
| ~ spl8_10 ),
inference(forward_demodulation,[],[f81,f72]) ).
thf(f178,plain,
( $false
| ~ spl8_8
| ~ spl8_10 ),
inference(trivial_inequality_removal,[],[f177]) ).
thf(f179,plain,
( ~ spl8_8
| ~ spl8_10 ),
inference(avatar_contradiction_clause,[],[f178]) ).
thf(f181,plain,
( ! [X0: $i] :
( ( ( sF3 @ X0 )
!= $true )
| ( ( cB @ X0 )
= $true )
| ( $false = $true ) )
| ~ spl8_6 ),
inference(constrained_superposition,[],[f63,f28]) ).
thf(f183,plain,
( ! [X0: $i] :
( ( ( cB @ X0 )
= $true )
| ( ( sF3 @ X0 )
!= $true ) )
| ~ spl8_6 ),
inference(trivial_inequality_removal,[],[f181]) ).
thf(f185,plain,
( ( $false = $true )
| ( ( sF3 @ sK1 )
!= $true )
| ~ spl8_6
| ~ spl8_14 ),
inference(constrained_superposition,[],[f183,f99]) ).
thf(f188,plain,
( ( ( sF3 @ sK1 )
!= $true )
| ~ spl8_6
| ~ spl8_14 ),
inference(trivial_inequality_removal,[],[f185]) ).
thf(f196,plain,
( ( $false != $false )
| ( ( sF3 @ sK1 )
= $true )
| spl8_7 ),
inference(constrained_superposition,[],[f67,f34]) ).
thf(f198,plain,
( ( ( sF3 @ sK1 )
= $true )
| spl8_7 ),
inference(trivial_inequality_removal,[],[f196]) ).
thf(f199,plain,
( $false
| ~ spl8_6
| spl8_7
| ~ spl8_14 ),
inference(forward_subsumption_resolution,[],[f198,f188]) ).
thf(f200,plain,
( ~ spl8_6
| spl8_7
| ~ spl8_14 ),
inference(avatar_contradiction_clause,[],[f199]) ).
cnf(s2,plain,
( spl8_3
| spl8_4 ),
inference(sat_conversion,[],[f57]) ).
cnf(s3,plain,
( spl8_5
| spl8_6 ),
inference(sat_conversion,[],[f64]) ).
cnf(s5,plain,
( spl8_9
| spl8_10 ),
inference(sat_conversion,[],[f82]) ).
cnf(s7,plain,
( spl8_13
| spl8_14 ),
inference(sat_conversion,[],[f100]) ).
cnf(s8,plain,
~ spl8_4,
inference(sat_conversion,[],[f101]) ).
cnf(s9,plain,
~ spl8_13,
inference(sat_conversion,[],[f102]) ).
cnf(s10,plain,
spl8_8,
inference(sat_conversion,[],[f103]) ).
cnf(s12,plain,
( ~ spl8_7
| ~ spl8_9 ),
inference(sat_conversion,[],[f126]) ).
cnf(s17,plain,
( ~ spl8_3
| ~ spl8_5
| spl8_7 ),
inference(sat_conversion,[],[f176]) ).
cnf(s18,plain,
( ~ spl8_8
| ~ spl8_10 ),
inference(sat_conversion,[],[f179]) ).
cnf(s19,plain,
( ~ spl8_6
| spl8_7
| ~ spl8_14 ),
inference(sat_conversion,[],[f200]) ).
cnf(s20,plain,
~ spl8_10,
inference(rat,[],[s18,s10]) ).
cnf(s22,plain,
spl8_14,
inference(rat,[],[s7,s9]) ).
cnf(s24,plain,
spl8_9,
inference(rat,[],[s5,s20]) ).
cnf(s25,plain,
~ spl8_7,
inference(rat,[],[s12,s24]) ).
cnf(s26,plain,
~ spl8_6,
inference(rat,[],[s19,s22,s25]) ).
cnf(s27,plain,
spl8_5,
inference(rat,[],[s3,s26]) ).
cnf(s28,plain,
~ spl8_3,
inference(rat,[],[s17,s25,s27]) ).
cnf(s29,plain,
$false,
inference(rat,[],[s2,s8,s28]) ).
thf(f201,plain,
$false,
inference(avatar_sat_refutation,[],[s29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYO308^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.27 % Computer : n002.cluster.edu
% 0.24/0.27 % Model : x86_64 x86_64
% 0.24/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.27 % Memory : 8046.5625MB
% 0.24/0.27 % OS : Linux 6.8.0-71-generic
% 0.24/0.27 % CPULimit : 300
% 0.24/0.27 % WCLimit : 300
% 0.24/0.27 % DateTime : Tue Sep 29 16:47:22 UTC 2026
% 0.24/0.28 % CPUTime :
% 0.24/0.28 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.32 Running higher-order theorem proving
% 0.24/0.34 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.32/0.38 % (1536445)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.32/0.38 % (1536456)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.32/0.38 % (1536456)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.32/0.38 % (1536456)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=3563821084:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.32/0.38 % (1536456) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1536445-1536456"...
% 0.32/0.38 % (1536456)...printing done.
% 0.32/0.38 % (1536456)Refutation found. Thanks to Tanya!
% 0.32/0.38 % SZS status Theorem for theBenchmark
% 0.32/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.32/0.39 % (1536456)------------------------------
% 0.32/0.39 % (1536456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.39 % (1536456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.39 % (1536456)CaDiCaL version: 2.1.3
% 0.32/0.39 % (1536456)Termination reason: Refutation
% 0.32/0.39 % (1536456)Time elapsed: 0.005 s
% 0.32/0.39 % (1536456)Peak memory usage: 13 MB
% 0.32/0.39 % (1536456)Instructions burned: 8 (million)
% 0.32/0.39 % (1536445)Success in time 0.029 s
% 0.32/0.39 % Vampire exiting
%------------------------------------------------------------------------------