%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU484^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:29:46 AM UTC 2026
% Result : Theorem 0.24s 0.35s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 3
% Syntax : Number of formulae : 49 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 226 ( 83 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 371 ( 44 ~; 26 |; 14 &; 225 @)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 59 ( 59 >; 0 *; 0 +; 0 <<)
% Number of symbols : 49 ( 44 usr; 4 con; 0-4 aty)
% ( 19 !!; 15 ??; 0 @@+; 0 @@-)
% Number of variables : 126 ( 56 ^; 65 !; 5 ?; 126 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_2,type,
inv: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_3,type,
idem: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_4,type,
infl: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_5,type,
mono: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(func_def_6,type,
refl: ( $i > $i > $o ) > $o ).
thf(func_def_7,type,
irrefl: ( $i > $i > $o ) > $o ).
thf(func_def_8,type,
rc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_9,type,
symm: ( $i > $i > $o ) > $o ).
thf(func_def_10,type,
antisymm: ( $i > $i > $o ) > $o ).
thf(func_def_11,type,
asymm: ( $i > $i > $o ) > $o ).
thf(func_def_12,type,
sc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_13,type,
trans: ( $i > $i > $o ) > $o ).
thf(func_def_14,type,
tc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_15,type,
trc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_16,type,
trsc: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_17,type,
po: ( $i > $i > $o ) > $o ).
thf(func_def_18,type,
so: ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
total: ( $i > $i > $o ) > $o ).
thf(func_def_20,type,
term: ( $i > $i > $o ) > $o ).
thf(func_def_21,type,
ind: ( $i > $i > $o ) > $o ).
thf(func_def_22,type,
innf: ( $i > $i > $o ) > $i > $o ).
thf(func_def_23,type,
nfof: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_24,type,
norm: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
join: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_26,type,
lconfl: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
sconfl: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
confl: ( $i > $i > $o ) > $o ).
thf(func_def_29,type,
cr: ( $i > $i > $o ) > $o ).
thf(func_def_30,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_31,type,
vIMP: $o > $o > $o ).
thf(func_def_32,type,
vAND: $o > $o > $o ).
thf(func_def_33,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_35,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_38,type,
vNOT: $o > $o ).
thf(func_def_39,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_40,type,
vOR: $o > $o > $o ).
thf(func_def_41,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_44,type,
sK0: $i > $i > $o ).
thf(func_def_45,type,
sK1: ( $i > $o ) > $i ).
thf(f6,axiom,
( ( ^ [X0: $i > $i > $o] :
! [X1: $i] : ( X0 @ X1 @ X1 ) )
= refl ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',reflexive) ).
thf(f20,axiom,
( ( ^ [X0: $i > $i > $o] :
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ~ ( X0 @ X2 @ X3 ) ) ) ) )
= term ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET009^0.ax',terminating) ).
thf(f30,conjecture,
! [X0: $i > $i > $o] :
( ( refl @ X0 )
=> ~ ( term @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexive_implies_non_terminating) ).
thf(f31,negated_conjecture,
~ ! [X0: $i > $i > $o] :
( ( refl @ X0 )
=> ~ ( term @ X0 ) ),
inference(negated_conjecture,[status(cth)],[f30]) ).
thf(f72,plain,
( ( ^ [X0: $i > $i > $o] :
! [X1: $i > $o] :
( ? [X2: $i] : ( X1 @ X2 )
=> ? [X3: $i] :
( ( X1 @ X3 )
& ! [X4: $i] :
( ( X1 @ X4 )
=> ~ ( X0 @ X3 @ X4 ) ) ) ) )
= term ),
inference(rectify,[],[f20]) ).
thf(f73,plain,
( term
= ( ^ [Y0: $i > $i > $o] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ?? @ $i
@ ^ [Y2: $i] : ( Y1 @ Y2 ) )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( !! @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
=> ~ ( Y0 @ Y2 @ Y3 ) ) )
& ( Y1 @ Y2 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f72]) ).
thf(f76,plain,
~ ! [X0: $i > $i > $o] :
( ( refl @ X0 )
=> ~ ( term @ X0 ) ),
inference(rectify,[],[f31]) ).
thf(f77,plain,
~ ! [X0: $i > $i > $o] :
( ( ( refl @ X0 )
= $true )
=> ( ( term @ X0 )
!= $true ) ),
inference(fool_elimination,[],[f76]) ).
thf(f80,plain,
( ( ^ [X0: $i > $i > $o] :
! [X1: $i] : ( X0 @ X1 @ X1 ) )
= refl ),
inference(rectify,[],[f6]) ).
thf(f81,plain,
( refl
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f80]) ).
thf(f88,plain,
~ ! [X0: $i > $i > $o] :
( ( ( refl @ X0 )
= $true )
=> ( ( term @ X0 )
!= $true ) ),
inference(flattening,[],[f77]) ).
thf(f89,plain,
? [X0: $i > $i > $o] :
( ( ( refl @ X0 )
= $true )
& ( ( term @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f88]) ).
thf(f90,plain,
( ( $true
= ( refl @ sK0 ) )
& ( $true
= ( term @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f89]) ).
thf(f97,plain,
( term
= ( ^ [Y0: $i > $i > $o] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ?? @ $i
@ ^ [Y2: $i] : ( Y1 @ Y2 ) )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( !! @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
=> ~ ( Y0 @ Y2 @ Y3 ) ) )
& ( Y1 @ Y2 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f73]) ).
thf(f119,plain,
( refl
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f81]) ).
thf(f120,plain,
( $true
= ( term @ sK0 ) ),
inference(cnf_transformation,[],[f90]) ).
thf(f121,plain,
( $true
= ( refl @ sK0 ) ),
inference(cnf_transformation,[],[f90]) ).
thf(f139,plain,
( $true
= ( ^ [Y0: $i > $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 @ Y1 ) )
@ sK0 ) ),
inference(definition_unfolding,[],[f121,f119]) ).
thf(f140,plain,
( $true
= ( ^ [Y0: $i > $i > $o] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ?? @ $i
@ ^ [Y2: $i] : ( Y1 @ Y2 ) )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( !! @ $i
@ ^ [Y3: $i] :
( ( Y1 @ Y3 )
=> ~ ( Y0 @ Y2 @ Y3 ) ) )
& ( Y1 @ Y2 ) ) ) ) )
@ sK0 ) ),
inference(definition_unfolding,[],[f120,f97]) ).
thf(f141,plain,
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ?? @ $i @ Y0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ~ ( sK0 @ Y1 @ Y2 ) ) )
& ( Y0 @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f140]) ).
thf(f142,plain,
! [X1: $i > $o] :
( $true
= ( ^ [Y0: $i > $o] :
( ( ?? @ $i @ Y0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ~ ( sK0 @ Y1 @ Y2 ) ) )
& ( Y0 @ Y1 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f141]) ).
thf(f143,plain,
! [X1: $i > $o] :
( $true
= ( ( ?? @ $i @ X1 )
=> ( ?? @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( X1 @ Y1 )
=> ~ ( sK0 @ Y0 @ Y1 ) ) )
& ( X1 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f142]) ).
thf(f144,plain,
! [X1: $i > $o] :
( ( ( ?? @ $i @ X1 )
= $false )
| ( ( ?? @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( X1 @ Y1 )
=> ~ ( sK0 @ Y0 @ Y1 ) ) )
& ( X1 @ Y0 ) ) )
= $true ) ),
inference(imp_proxy_clausification,[],[f143]) ).
thf(f145,plain,
! [X2: $i,X1: $i > $o] :
( ( ( X1 @ X2 )
= $false )
| ( ( ?? @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( X1 @ Y1 )
=> ~ ( sK0 @ Y0 @ Y1 ) ) )
& ( X1 @ Y0 ) ) )
= $true ) ),
inference(pi_proxy_clausification,[],[f144]) ).
thf(f146,plain,
! [X2: $i,X1: $i > $o] :
( ( ( X1 @ X2 )
= $false )
| ( ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( X1 @ Y1 )
=> ~ ( sK0 @ Y0 @ Y1 ) ) )
& ( X1 @ Y0 ) )
@ ( sK1 @ X1 ) )
= $true ) ),
inference(sigma_proxy_clausification,[],[f145]) ).
thf(f147,plain,
! [X2: $i,X1: $i > $o] :
( ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ~ ( sK0 @ ( sK1 @ X1 ) @ Y0 ) ) )
& ( X1 @ ( sK1 @ X1 ) ) ) )
| ( ( X1 @ X2 )
= $false ) ),
inference(beta-eta_normalization,[],[f146]) ).
thf(f148,plain,
! [X2: $i,X1: $i > $o] :
( ( $true
= ( X1 @ ( sK1 @ X1 ) ) )
| ( ( X1 @ X2 )
= $false ) ),
inference(and_proxy_clausification,[],[f147]) ).
thf(f149,plain,
! [X2: $i,X1: $i > $o] :
( ( ( X1 @ X2 )
= $false )
| ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ~ ( sK0 @ ( sK1 @ X1 ) @ Y0 ) ) ) ) ),
inference(and_proxy_clausification,[],[f147]) ).
thf(f150,plain,
! [X2: $i,X3: $i,X1: $i > $o] :
( ( $true
= ( ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ~ ( sK0 @ ( sK1 @ X1 ) @ Y0 ) )
@ X3 ) )
| ( ( X1 @ X2 )
= $false ) ),
inference(pi_proxy_clausification,[],[f149]) ).
thf(f151,plain,
! [X2: $i,X3: $i,X1: $i > $o] :
( ( $true
= ( ( X1 @ X3 )
=> ~ ( sK0 @ ( sK1 @ X1 ) @ X3 ) ) )
| ( ( X1 @ X2 )
= $false ) ),
inference(beta-eta_normalization,[],[f150]) ).
thf(f152,plain,
! [X2: $i,X3: $i,X1: $i > $o] :
( ( ( X1 @ X2 )
= $false )
| ( ( ~ ( sK0 @ ( sK1 @ X1 ) @ X3 ) )
= $true )
| ( ( X1 @ X3 )
= $false ) ),
inference(imp_proxy_clausification,[],[f151]) ).
thf(f153,plain,
! [X2: $i,X3: $i,X1: $i > $o] :
( ( ( sK0 @ ( sK1 @ X1 ) @ X3 )
= $false )
| ( ( X1 @ X2 )
= $false )
| ( ( X1 @ X3 )
= $false ) ),
inference(not_proxy_clausification,[],[f152]) ).
thf(f154,plain,
( ( !! @ $i
@ ^ [Y0: $i] : ( sK0 @ Y0 @ Y0 ) )
= $true ),
inference(beta-eta_normalization,[],[f139]) ).
thf(f155,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] : ( sK0 @ Y0 @ Y0 )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f154]) ).
thf(f156,plain,
! [X1: $i] :
( $true
= ( sK0 @ X1 @ X1 ) ),
inference(beta-eta_normalization,[],[f155]) ).
thf(f163,plain,
! [X2: $i,X3: $i > $o] :
( ( ( ^ [Y0: $i] :
~ ( X3 @ Y0 )
@ X2 )
= $false )
| ( $true
= ( ^ [Y0: $i] :
~ ( X3 @ Y0 )
@ ( sK1
@ ^ [Y0: $i] :
~ ( X3 @ Y0 ) ) ) ) ),
inference(primitive_instantiation,[],[f148]) ).
thf(f167,plain,
! [X2: $i,X3: $i > $o] :
( ( ( ~ ( X3
@ ( sK1
@ ^ [Y0: $i] :
~ ( X3 @ Y0 ) ) ) )
= $true )
| ( ( ~ ( X3 @ X2 ) )
= $false ) ),
inference(beta-eta_normalization,[],[f163]) ).
thf(f168,plain,
! [X2: $i,X3: $i > $o] :
( ( $false
= ( X3
@ ( sK1
@ ^ [Y0: $i] :
~ ( X3 @ Y0 ) ) ) )
| ( ( ~ ( X3 @ X2 ) )
= $false ) ),
inference(not_proxy_clausification,[],[f167]) ).
thf(f169,plain,
! [X2: $i,X3: $i > $o] :
( ( $false
= ( X3
@ ( sK1
@ ^ [Y0: $i] :
~ ( X3 @ Y0 ) ) ) )
| ( $true
= ( X3 @ X2 ) ) ),
inference(not_proxy_clausification,[],[f168]) ).
thf(f178,plain,
! [X0: $i] :
( ( sK1
@ ^ [Y0: $i] :
~ ( ^ [Y1: $i] : ( Y1 != X0 )
@ Y0 ) )
= X0 ),
inference(leibniz_equality_elimination,[],[f169]) ).
thf(f206,plain,
! [X0: $i] :
( ( sK1
@ ^ [Y0: $i] :
~ ( ( Y0 != X0 ) ) )
= X0 ),
inference(beta-eta_normalization,[],[f178]) ).
thf(f207,plain,
! [X0: $i] :
( ( sK1
@ ^ [Y0: $i] : ( Y0 = X0 ) )
= X0 ),
inference(boolean_simplification,[],[f206]) ).
thf(f216,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( ^ [Y0: $i] : ( Y0 = X0 )
@ X2 )
= $false )
| ( ( ^ [Y0: $i] : ( Y0 = X0 )
@ X1 )
= $false )
| ( $false
= ( sK0 @ X0 @ X1 ) ) ),
inference(constrained_superposition,[],[f153,f207]) ).
thf(f239,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $false
= ( sK0 @ X0 @ X1 ) )
| ( ( X1 = X0 )
= $false )
| ( ( X2 = X0 )
= $false ) ),
inference(beta-eta_normalization,[],[f216]) ).
thf(f240,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $false
= ( sK0 @ X0 @ X1 ) )
| ( X0 != X1 )
| ( ( X2 = X0 )
= $false ) ),
inference(equality_proxy_clausification,[],[f239]) ).
thf(f241,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $false
= ( sK0 @ X0 @ X1 ) )
| ( X0 != X2 )
| ( X0 != X1 ) ),
inference(equality_proxy_clausification,[],[f240]) ).
thf(f257,plain,
! [X0: $i,X1: $i] :
( ( X0 != X1 )
| ( $true = $false )
| ( X0 != X0 ) ),
inference(constrained_superposition,[],[f156,f241]) ).
thf(f260,plain,
! [X0: $i,X1: $i] : ( X0 != X1 ),
inference(trivial_inequality_removal,[],[f257]) ).
thf(f261,plain,
$false,
inference(flex-flex_simplification,[],[f260]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU484^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 % Computer : n014.cluster.edu
% 0.09/0.23 % Model : x86_64 x86_64
% 0.09/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.23 % Memory : 8046.5625MB
% 0.09/0.23 % OS : Linux 6.8.0-71-generic
% 0.09/0.23 % CPULimit : 300
% 0.09/0.23 % WCLimit : 300
% 0.09/0.23 % DateTime : Tue Sep 29 13:43:15 UTC 2026
% 0.09/0.23 % CPUTime :
% 0.09/0.23 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.28 Running higher-order theorem proving
% 0.24/0.30 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.24/0.35 % (2678656)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.24/0.35 % (2678661)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3135991754:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.24/0.35 % (2678665)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2441042507:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.24/0.35 % (2678661) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2678656-2678661"...
% 0.24/0.35 % (2678667)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.24/0.35 % (2678667)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.24/0.35 % (2678661)...printing done.
% 0.24/0.35 % (2678661)Refutation found. Thanks to Tanya!
% 0.24/0.35 % SZS status Theorem for theBenchmark
% 0.24/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.35 % (2678661)------------------------------
% 0.24/0.35 % (2678661)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.35 % (2678661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.35 % (2678661)CaDiCaL version: 2.1.3
% 0.24/0.35 % (2678661)Termination reason: Refutation
% 0.24/0.35 % (2678661)Time elapsed: 0.009 s
% 0.24/0.35 % (2678661)Peak memory usage: 12 MB
% 0.24/0.35 % (2678661)Instructions burned: 18 (million)
% 0.24/0.35 % (2678656)Success in time 0.034 s
% 0.24/0.35 % Vampire exiting
%------------------------------------------------------------------------------