%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM432+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 12:15:09 PM UTC 2026
% Result : Theorem 2.52s 1.28s
% Output : Refutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 20 unt; 1 def)
% Number of atoms : 194 ( 42 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 229 ( 94 ~; 91 |; 34 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 54 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ( aInteger0(X0)
& aInteger0(X1) )
=> aInteger0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntPlus) ).
fof(f6,axiom,
! [X0,X1] :
( ( aInteger0(X0)
& aInteger0(X1) )
=> aInteger0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntMult) ).
fof(f18,axiom,
! [X0] :
( aInteger0(X0)
=> ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivisor) ).
fof(f19,axiom,
! [X0,X1,X2] :
( ( aInteger0(X0)
& aInteger0(X1)
& aInteger0(X2)
& X2 != sz00 )
=> ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEquMod) ).
fof(f22,axiom,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xq)
& xq != sz00
& aInteger0(xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__818) ).
fof(f24,axiom,
( aInteger0(xn)
& sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__876) ).
fof(f25,axiom,
( aInteger0(xm)
& sdtasdt0(xq,xm) = sdtpldt0(xb,smndt0(xc)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__899) ).
fof(f26,axiom,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__924) ).
fof(f27,conjecture,
sdteqdtlpzmzozddtrp0(xa,xc,xq),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f28,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f30,plain,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(flattening,[],[f28]) ).
fof(f32,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f33,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f35,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(flattening,[],[f34]) ).
fof(f53,plain,
! [X0] :
( ! [X1] :
( aDivisorOf0(X1,X0)
<=> ( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = X0 ) ) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sz00 = X2 ),
inference(ennf_transformation,[],[f19]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
<=> aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sz00 = X2 ),
inference(flattening,[],[f54]) ).
fof(f60,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ~ aInteger0(X1)
| sz00 = X1
| ! [X2] :
( ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X0 ) )
& ( ( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = X0 ) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(nnf_transformation,[],[f53]) ).
fof(f61,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ~ aInteger0(X1)
| sz00 = X1
| ! [X2] :
( ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X0 ) )
& ( ( aInteger0(X1)
& X1 != sz00
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(X1,X2) = X0 ) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ~ aInteger0(X1)
| sz00 = X1
| ! [X2] :
( ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X0 ) )
& ( ( aInteger0(X1)
& X1 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X1,X3) = X0 ) )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(rectify,[],[f61]) ).
fof(f63,plain,
! [X0] :
( ! [X1] :
( ( aDivisorOf0(X1,X0)
| ~ aInteger0(X1)
| sz00 = X1
| ! [X2] :
( ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X0 ) )
& ( ( aInteger0(X1)
& X1 != sz00
& aInteger0(sK0(X0,X1))
& sdtasdt0(X1,sK0(X0,X1)) = X0 )
| ~ aDivisorOf0(X1,X0) ) )
| ~ aInteger0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f62]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ( ( sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1))) )
& ( aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ~ sdteqdtlpzmzozddtrp0(X0,X1,X2) ) )
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sz00 = X2 ),
inference(nnf_transformation,[],[f55]) ).
fof(f68,plain,
! [X0,X1] :
( aInteger0(sdtpldt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f69,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f91,plain,
! [X2,X0,X1] :
( aDivisorOf0(X1,X0)
| ~ aInteger0(X1)
| sz00 = X1
| ~ aInteger0(X2)
| sdtasdt0(X1,X2) != X0
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f93,plain,
! [X2,X0,X1] :
( sdteqdtlpzmzozddtrp0(X0,X1,X2)
| ~ aDivisorOf0(X2,sdtpldt0(X0,smndt0(X1)))
| ~ aInteger0(X0)
| ~ aInteger0(X1)
| ~ aInteger0(X2)
| sz00 = X2 ),
inference(cnf_transformation,[],[f64]) ).
fof(f96,plain,
aInteger0(xc),
inference(cnf_transformation,[],[f22]) ).
fof(f97,plain,
sz00 != xq,
inference(cnf_transformation,[],[f22]) ).
fof(f98,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f22]) ).
fof(f100,plain,
aInteger0(xa),
inference(cnf_transformation,[],[f22]) ).
fof(f104,plain,
aInteger0(xn),
inference(cnf_transformation,[],[f24]) ).
fof(f106,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f25]) ).
fof(f107,plain,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(cnf_transformation,[],[f26]) ).
fof(f108,plain,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
inference(cnf_transformation,[],[f30]) ).
fof(f109,plain,
! [X2,X1] :
( aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X1)
| sz00 = X1
| ~ aInteger0(X2)
| ~ aInteger0(sdtasdt0(X1,X2)) ),
inference(equality_resolution,[],[f91]) ).
fof(f127,plain,
( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(xa)
| ~ aInteger0(xc)
| ~ aInteger0(xq)
| sz00 = xq ),
inference(resolution,[],[f93,f108]) ).
fof(f130,plain,
( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(xc)
| ~ aInteger0(xq)
| sz00 = xq ),
inference(forward_subsumption_resolution,[],[f127,f100]) ).
fof(f132,plain,
( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(xq)
| sz00 = xq ),
inference(forward_subsumption_resolution,[],[f130,f96]) ).
fof(f134,plain,
( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| sz00 = xq ),
inference(forward_subsumption_resolution,[],[f132,f98]) ).
fof(f136,plain,
~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))),
inference(forward_subsumption_resolution,[],[f134,f97]) ).
fof(f180,definition,
( spl1_5
<=> aInteger0(sdtpldt0(xn,xm)) ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f181,plain,
( aInteger0(sdtpldt0(xn,xm))
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f180]) ).
fof(f182,plain,
( ~ aInteger0(sdtpldt0(xn,xm))
| spl1_5 ),
inference(avatar_component_clause,[],[f180]) ).
fof(f290,plain,
( ~ aInteger0(xn)
| ~ aInteger0(xm)
| spl1_5 ),
inference(resolution,[],[f182,f68]) ).
fof(f292,plain,
( ~ aInteger0(xm)
| spl1_5 ),
inference(forward_subsumption_resolution,[],[f290,f104]) ).
fof(f293,plain,
( $false
| spl1_5 ),
inference(forward_subsumption_resolution,[],[f292,f106]) ).
fof(f294,plain,
spl1_5,
inference(avatar_contradiction_clause,[],[f293]) ).
fof(f367,plain,
! [X2,X1] :
( aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X1)
| sz00 = X1
| ~ aInteger0(X2) ),
inference(forward_subsumption_resolution,[],[f109,f69]) ).
fof(f377,plain,
( aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ~ aInteger0(xq)
| sz00 = xq
| ~ aInteger0(sdtpldt0(xn,xm)) ),
inference(superposition,[],[f367,f107]) ).
fof(f383,plain,
( ~ aInteger0(xq)
| sz00 = xq
| ~ aInteger0(sdtpldt0(xn,xm)) ),
inference(forward_subsumption_resolution,[],[f377,f136]) ).
fof(f389,plain,
( sz00 = xq
| ~ aInteger0(sdtpldt0(xn,xm)) ),
inference(forward_subsumption_resolution,[],[f383,f98]) ).
fof(f402,plain,
~ aInteger0(sdtpldt0(xn,xm)),
inference(forward_subsumption_resolution,[],[f389,f97]) ).
fof(f403,plain,
( $false
| ~ spl1_5 ),
inference(forward_subsumption_resolution,[],[f402,f181]) ).
fof(f404,plain,
~ spl1_5,
inference(avatar_contradiction_clause,[],[f403]) ).
cnf(s24,plain,
spl1_5,
inference(sat_conversion,[],[f294]) ).
cnf(s31,plain,
~ spl1_5,
inference(sat_conversion,[],[f404]) ).
cnf(s34,plain,
$false,
inference(rat,[],[s24,s31]) ).
fof(f405,plain,
$false,
inference(avatar_sat_refutation,[],[s34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM432+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n019.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 19:53:34 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 2.52/1.28 % (3369332)Detected formulas, will run a generic FOF schedule.
% 2.52/1.28 % (3369341)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=872063890:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.52/1.28 % (3369343)dis-21_1_sil=8000:lcm=predicate:random_seed=3173904844: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.52/1.28 % (3369337)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=2541339417:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.52/1.28 % (3369340)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3350011091:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.52/1.28 % (3369339)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=3498835561:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.52/1.28 % (3369338)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=2076255727:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.52/1.28 % (3369341)Instruction limit reached!
% 2.52/1.28 % (3369341)------------------------------
% 2.52/1.28 % (3369341)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.52/1.28 % (3369341)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.52/1.28 % (3369341)CaDiCaL version: 2.1.3
% 2.52/1.28 % (3369341)Termination reason: Instruction limit
% 2.52/1.28 % (3369341)Termination phase: Saturation
% 2.52/1.28 % (3369341)Time elapsed: 0.040 s
% 2.52/1.28 % (3369341)Peak memory usage: 88 MB
% 2.52/1.28 % (3369341)Instructions burned: 134 (million)
% 2.52/1.28 % (3369343)Refutation not found, incomplete strategy
% 2.52/1.28 % (3369343)------------------------------
% 2.52/1.28 % (3369343)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.52/1.28 % (3369343)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.52/1.28 % (3369343)CaDiCaL version: 2.1.3
% 2.52/1.28 % (3369343)Termination reason: Refutation not found, incomplete strategy
% 2.52/1.28 % (3369343)Time elapsed: 0.004 s
% 2.52/1.28 % (3369343)Peak memory usage: 88 MB
% 2.52/1.28 % (3369343)Instructions burned: 5 (million)
% 2.52/1.28 % (3369342)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2479616839:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.52/1.28 % (3369342)First to succeed.
% 2.52/1.28 % (3369342)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3369332"
% 2.52/1.28 % (3369340)Instruction limit reached!
% 2.52/1.28 % (3369340)------------------------------
% 2.52/1.28 % (3369340)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.52/1.28 % (3369340)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.52/1.28 % (3369340)CaDiCaL version: 2.1.3
% 2.52/1.28 % (3369340)Termination reason: Instruction limit
% 2.52/1.28 % (3369340)Termination phase: Saturation
% 2.52/1.28 % (3369340)Time elapsed: 0.067 s
% 2.52/1.28 % (3369340)Peak memory usage: 89 MB
% 2.52/1.28 % (3369340)Instructions burned: 109 (million)
% 2.52/1.28 % (3369350)lrs+10_1_sil=8000:sp=occurrence:random_seed=2682455248:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.52/1.28 % (3369350)Also succeeded, but the first one will report.
% 2.52/1.28 % (3369352)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1827031294:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.52/1.28 % (3369352)Refutation not found, incomplete strategy
% 2.52/1.28 % (3369352)------------------------------
% 2.52/1.28 % (3369352)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.52/1.28 % (3369352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.52/1.28 % (3369352)CaDiCaL version: 2.1.3
% 2.52/1.28 % (3369352)Termination reason: Refutation not found, incomplete strategy
% 2.52/1.28 % (3369352)Time elapsed: 0.004 s
% 2.52/1.28 % (3369352)Peak memory usage: 88 MB
% 2.52/1.28 % (3369352)Instructions burned: 4 (million)
% 2.52/1.28 % (3369343)------------------------------
% 2.52/1.28 % (3369343)------------------------------
% 2.52/1.28 % (3369342)Refutation found. Thanks to Tanya!
% 2.52/1.28 % SZS status Theorem for theBenchmark
% 2.52/1.28 % SZS output start Proof for theBenchmark
% See solution above
% 3.48/1.38 % (3369342)------------------------------
% 3.48/1.38 % (3369342)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.38 % (3369342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.38 % (3369342)CaDiCaL version: 2.1.3
% 3.48/1.38 % (3369342)Termination reason: Refutation
% 3.48/1.38 % (3369342)Time elapsed: 0.010 s
% 3.48/1.38 % (3369342)Peak memory usage: 90 MB
% 3.48/1.38 % (3369342)Instructions burned: 11 (million)
% 3.48/1.38 % (3369342)------------------------------
% 3.48/1.38 % (3369342)------------------------------
% 3.48/1.38 % (3369332)Success in time 0.425 s
% 3.48/1.38 % Vampire exiting
%------------------------------------------------------------------------------