%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL811_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:56:41 AM UTC 2026
% Result : Theorem 3.51s 1.47s
% Output : Refutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 5 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 61 ( 61 usr; 17 con; 0-6 aty)
% Number of variables : 29 ( 29 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,X1),fun(fun(X2,X0),fun(X2,X1))) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_3,type,
combk:
!>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).
tff(func_def_4,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_5,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_6,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_7,type,
it: fun(dB,bool) ).
tff(func_def_8,type,
abs: dB > dB ).
tff(func_def_9,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_10,type,
var: nat > dB ).
tff(func_def_11,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_12,type,
dB_size: dB > nat ).
tff(func_def_13,type,
lift: fun(dB,fun(nat,dB)) ).
tff(func_def_14,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_15,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_16,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_17,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_18,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_19,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_20,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_21,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_22,type,
monoid_add_listsum:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_23,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_24,type,
suc: nat > nat ).
tff(func_def_25,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_26,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_27,type,
fFalse: bool ).
tff(func_def_28,type,
fTrue: bool ).
tff(func_def_29,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_30,type,
a: dB ).
tff(func_def_31,type,
as: list(dB) ).
tff(func_def_32,type,
b: dB ).
tff(func_def_33,type,
bs: list(dB) ).
tff(func_def_34,type,
i: nat ).
tff(func_def_35,type,
n: nat ).
tff(func_def_36,type,
rs: list(dB) ).
tff(func_def_37,type,
t: dB ).
tff(func_def_38,type,
u: dB ).
tff(func_def_39,type,
ua: dB ).
tff(func_def_40,type,
sK1: dB > dB ).
tff(func_def_41,type,
sK2: dB > dB ).
tff(func_def_42,type,
sK3: dB > list(dB) ).
tff(func_def_43,type,
sK4: dB > list(dB) ).
tff(func_def_44,type,
sK5: dB > nat ).
tff(func_def_45,type,
sK6: dB > dB ).
tff(func_def_46,type,
sK7:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_47,type,
sK8:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_48,type,
sK9:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_49,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_50,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_51,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_52,type,
sK13:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_53,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_54,type,
sK15:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_55,type,
sK16: fun(nat,bool) > nat ).
tff(func_def_56,type,
sK17: fun(nat,bool) > nat ).
tff(func_def_57,type,
sK18: nat > nat ).
tff(func_def_58,type,
sK19: nat > nat ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_6,type,
null:
!>[X0: $tType] : ( list(X0) > $o ) ).
tff(pred_def_7,type,
pp: bool > $o ).
tff(pred_def_8,type,
sP0: dB > $o ).
tff(f5,axiom,
listsp(dB,it,cons(dB,aa(nat,dB,aa(dB,fun(nat,dB),lift,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),u),i)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),bs)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4__096listsp_AIT_A_Ilift_A_Ib_091u_Pi_093_J_A0_A_D_Amap_A_I_Ft_O_Alift_At_A0_J_A_Imap_A_I_Ft_O_At_091u_Pi_093_J_Abs_J_J_096) ).
tff(f11,axiom,
! [X0: $tType,X1: $tType,X2: list(X1),X3: X1,X4: fun(X1,X0)] : ( map(X1,X0,X4,cons(X1,X3,X2)) = cons(X0,aa(X1,X0,X4,X3),map(X1,X0,X4,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_10_map_Osimps_I2_J) ).
tff(f105,axiom,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
tff(f112,conjecture,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),cons(dB,b,bs)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f113,negated_conjecture,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),cons(dB,b,bs)))),
inference(negated_conjecture,[status(cth)],[f112]) ).
tff(f114,plain,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),cons(dB,b,bs)))),
inference(flattening,[],[f113]) ).
tff(f170,plain,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),cons(dB,b,bs)))),
inference(cnf_transformation,[],[f114]) ).
tff(f171,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
inference(cnf_transformation,[],[f105]) ).
tff(f177,plain,
listsp(dB,it,cons(dB,aa(nat,dB,aa(dB,fun(nat,dB),lift,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),u),i)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),bs)))),
inference(cnf_transformation,[],[f5]) ).
tff(f218,plain,
! [X1: $tType,X0: $tType,X2: list(X1),X3: X1,X4: fun(X1,X0)] : ( map(X1,X0,X4,cons(X1,X3,X2)) = cons(X0,aa(X1,X0,X4,X3),map(X1,X0,X4,X2)) ),
inference(cnf_transformation,[],[f11]) ).
tff(f403,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: fun(X2,fun(X0,X1)),X6: list(X2),X4: X2,X5: X0] : ( map(X2,X1,combc(X2,X0,X1,X3,X5),cons(X2,X4,X6)) = cons(X1,aa(X0,X1,aa(X2,fun(X0,X1),X3,X4),X5),map(X2,X1,combc(X2,X0,X1,X3,X5),X6)) ),
inference(superposition,[],[f218,f171]) ).
tff(f944,plain,
listsp(dB,it,cons(dB,aa(nat,dB,aa(dB,fun(nat,dB),lift,aa(nat,dB,aa(dB,fun(nat,dB),combc(dB,dB,fun(nat,dB),subst,u),b),i)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),bs)))),
inference(superposition,[],[f177,f171]) ).
tff(f949,plain,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),cons(dB,aa(nat,dB,aa(dB,fun(nat,dB),combc(dB,dB,fun(nat,dB),subst,u),b),i),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),bs)))),
inference(forward_demodulation,[],[f944,f403]) ).
tff(f951,plain,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),cons(dB,b,bs)))),
inference(forward_demodulation,[],[f949,f403]) ).
tff(f952,plain,
$false,
inference(forward_subsumption_resolution,[],[f951,f170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL811_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n006.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 16:53:56 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.44/1.27 % (3170635)Detected formulas, will run a generic FOF schedule.
% 2.44/1.27 % (3170646)dis-21_1_sil=8000:lcm=predicate:random_seed=1651578502: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)
% 2.44/1.27 % (3170640)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=229001107:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.44/1.27 % (3170645)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2918512649:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.44/1.27 % (3170642)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=2862516553:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.44/1.27 % (3170641)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=1854679685:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.44/1.27 % (3170646)Instruction limit reached!
% 2.44/1.27 % (3170646)------------------------------
% 2.44/1.27 % (3170646)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.44/1.27 % (3170646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/1.27 % (3170646)CaDiCaL version: 2.1.3
% 2.44/1.27 % (3170646)Termination reason: Instruction limit
% 2.44/1.27 % (3170646)Termination phase: Saturation
% 2.44/1.27 % (3170646)Time elapsed: 0.039 s
% 2.44/1.27 % (3170646)Peak memory usage: 89 MB
% 2.44/1.27 % (3170646)Instructions burned: 131 (million)
% 2.44/1.27 % (3170642)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.44/1.27 % (3170644)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=868323739:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.44/1.27 % (3170643)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1666613394:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.44/1.27 % (3170643)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.44/1.27 % (3170643)Refutation not found, incomplete strategy
% 2.44/1.27 % (3170643)------------------------------
% 2.44/1.27 % (3170643)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.44/1.27 % (3170643)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/1.27 % (3170643)CaDiCaL version: 2.1.3
% 2.44/1.27 % (3170643)Termination reason: Refutation not found, incomplete strategy
% 2.44/1.27 % (3170643)Time elapsed: 0.005 s
% 2.44/1.27 % (3170643)Peak memory usage: 89 MB
% 2.44/1.27 % (3170643)Instructions burned: 7 (million)
% 2.44/1.27 % (3170644)Instruction limit reached!
% 2.44/1.27 % (3170644)------------------------------
% 2.44/1.27 % (3170644)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.44/1.27 % (3170644)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/1.27 % (3170644)CaDiCaL version: 2.1.3
% 2.44/1.27 % (3170644)Termination reason: Instruction limit
% 2.44/1.27 % (3170644)Termination phase: Saturation
% 2.44/1.27 % (3170644)Time elapsed: 0.074 s
% 2.44/1.27 % (3170644)Peak memory usage: 89 MB
% 2.44/1.27 % (3170644)Instructions burned: 120 (million)
% 2.44/1.27 % (3170652)lrs+10_1_sil=8000:sp=occurrence:random_seed=163768387:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.44/1.27 % (3170645)Instruction limit reached!
% 2.44/1.27 % (3170645)------------------------------
% 2.44/1.27 % (3170645)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.44/1.27 % (3170645)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/1.27 % (3170645)CaDiCaL version: 2.1.3
% 2.44/1.27 % (3170645)Termination reason: Instruction limit
% 2.44/1.27 % (3170645)Termination phase: Saturation
% 2.44/1.27 % (3170645)Time elapsed: 0.091 s
% 2.44/1.27 % (3170645)Peak memory usage: 89 MB
% 2.44/1.27 % (3170645)Instructions burned: 140 (million)
% 2.44/1.27 % (3170652)First to succeed.
% 2.44/1.27 % (3170652)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3170635"
% 2.44/1.27 % (3170657)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4139161503:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.44/1.27 % (3170655)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3599548948:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.51/1.47 % (3170655)Also succeeded, but the first one will report.
% 3.51/1.47 % (3170643)------------------------------
% 3.51/1.47 % (3170643)------------------------------
% 3.51/1.47 % (3170657)Also succeeded, but the first one will report.
% 3.51/1.47 % (3170652)Refutation found. Thanks to Tanya!
% 3.51/1.47 % SZS status Theorem for theBenchmark
% 3.51/1.47 % SZS output start Proof for theBenchmark
% See solution above
% 3.51/1.47 % (3170652)------------------------------
% 3.51/1.47 % (3170652)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.47 % (3170652)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.47 % (3170652)CaDiCaL version: 2.1.3
% 3.51/1.47 % (3170652)Termination reason: Refutation
% 3.51/1.47 % (3170652)Time elapsed: 0.023 s
% 3.51/1.47 % (3170652)Peak memory usage: 90 MB
% 3.51/1.47 % (3170652)Instructions burned: 65 (million)
% 3.51/1.47 % (3170652)------------------------------
% 3.51/1.47 % (3170652)------------------------------
% 3.51/1.47 % (3170635)Success in time 0.42 s
% 3.51/1.47 % Vampire exiting
%------------------------------------------------------------------------------