%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET707+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:44:28 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 10
% Syntax : Number of formulae : 99 ( 13 unt; 5 def)
% Number of atoms : 262 ( 65 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 271 ( 108 ~; 131 |; 18 &)
% ( 10 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 73 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(f8,axiom,
! [X0,X1] :
( member(X0,singleton(X1))
<=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',singleton) ).
fof(f9,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( X0 = X1
| X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',unordered_pair) ).
fof(f12,conjecture,
! [X0,X1,X2,X3] :
( equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X2),unordered_pair(X2,X3)))
=> ( X0 = X2
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI50) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X2),unordered_pair(X2,X3)))
=> ( X0 = X2
& X1 = X3 ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( equal_set(X0,X1)
=> ( subset(X0,X1)
& subset(X1,X0) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
| ~ equal_set(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f18,plain,
? [X0,X1,X2,X3] :
( ( X0 != X2
| X1 != X3 )
& equal_set(unordered_pair(singleton(X0),unordered_pair(X0,X1)),unordered_pair(singleton(X2),unordered_pair(X2,X3))) ),
inference(ennf_transformation,[],[f13]) ).
fof(f19,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f20,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f20]) ).
fof(f29,plain,
! [X0,X1] :
( ( member(X0,singleton(X1))
| X0 != X1 )
& ( X0 = X1
| ~ member(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X1
& X0 != X2 ) )
& ( X0 = X1
| X0 = X2
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X1
& X0 != X2 ) )
& ( X0 = X1
| X0 = X2
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f30]) ).
fof(f38,plain,
( ( sK3 != sK5
| sK4 != sK6 )
& equal_set(unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6)],[f18]) ).
fof(f39,plain,
! [X3,X0,X1] :
( ~ member(X3,X0)
| member(X3,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f42,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f43,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f56,plain,
! [X0,X1] :
( ~ member(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f57,plain,
! [X0,X1] :
( member(X0,singleton(X1))
| X0 != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f59,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X2 ),
inference(cnf_transformation,[],[f31]) ).
fof(f60,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f67,plain,
equal_set(unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))),
inference(cnf_transformation,[],[f38]) ).
fof(f68,plain,
( sK3 != sK5
| sK4 != sK6 ),
inference(cnf_transformation,[],[f38]) ).
fof(f69,plain,
! [X1] : member(X1,singleton(X1)),
inference(equality_resolution,[],[f57]) ).
fof(f70,plain,
! [X2,X1] : member(X1,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f60]) ).
fof(f71,plain,
! [X2,X1] : member(X2,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f59]) ).
fof(f73,definition,
( spl7_1
<=> sK4 = sK6 ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f75,plain,
( sK4 != sK6
| spl7_1 ),
inference(avatar_component_clause,[],[f73]) ).
fof(f77,definition,
( spl7_2
<=> sK3 = sK5 ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f78,plain,
( sK3 = sK5
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f80,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f68,f77,f73]) ).
fof(f81,plain,
subset(unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)),unordered_pair(singleton(sK3),unordered_pair(sK3,sK4))),
inference(resolution,[],[f42,f67]) ).
fof(f82,plain,
subset(unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))),
inference(resolution,[],[f43,f67]) ).
fof(f101,plain,
! [X2,X0,X1] :
( ~ subset(unordered_pair(X0,X2),X1)
| member(X0,X1) ),
inference(resolution,[],[f39,f70]) ).
fof(f102,plain,
! [X2,X0,X1] :
( ~ subset(unordered_pair(X2,X0),X1)
| member(X0,X1) ),
inference(resolution,[],[f39,f71]) ).
fof(f107,plain,
member(singleton(sK3),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))),
inference(resolution,[],[f101,f82]) ).
fof(f172,plain,
( singleton(sK3) = unordered_pair(sK5,sK6)
| singleton(sK3) = singleton(sK5) ),
inference(resolution,[],[f58,f107]) ).
fof(f177,definition,
( spl7_3
<=> singleton(sK3) = singleton(sK5) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f179,plain,
( singleton(sK3) = singleton(sK5)
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f177]) ).
fof(f181,definition,
( spl7_4
<=> singleton(sK3) = unordered_pair(sK5,sK6) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
fof(f182,plain,
( singleton(sK3) != unordered_pair(sK5,sK6)
| spl7_4 ),
inference(avatar_component_clause,[],[f181]) ).
fof(f183,plain,
( singleton(sK3) = unordered_pair(sK5,sK6)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f181]) ).
fof(f184,plain,
( spl7_3
| spl7_4 ),
inference(avatar_split_clause,[],[f172,f181,f177]) ).
fof(f186,definition,
( spl7_5
<=> unordered_pair(sK3,sK4) = singleton(sK5) ),
introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).
fof(f187,plain,
( unordered_pair(sK3,sK4) != singleton(sK5)
| spl7_5 ),
inference(avatar_component_clause,[],[f186]) ).
fof(f188,plain,
( unordered_pair(sK3,sK4) = singleton(sK5)
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f186]) ).
fof(f200,plain,
( member(sK5,singleton(sK3))
| ~ spl7_3 ),
inference(superposition,[],[f69,f179]) ).
fof(f204,plain,
( sK3 = sK5
| ~ spl7_3 ),
inference(resolution,[],[f200,f56]) ).
fof(f207,plain,
( spl7_2
| ~ spl7_3 ),
inference(avatar_split_clause,[],[f204,f177,f77]) ).
fof(f212,plain,
member(unordered_pair(sK5,sK6),unordered_pair(singleton(sK3),unordered_pair(sK3,sK4))),
inference(resolution,[],[f102,f81]) ).
fof(f213,plain,
member(unordered_pair(sK3,sK4),unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))),
inference(resolution,[],[f102,f82]) ).
fof(f225,plain,
( member(sK6,singleton(sK3))
| ~ spl7_4 ),
inference(superposition,[],[f71,f183]) ).
fof(f226,plain,
( member(sK5,singleton(sK3))
| ~ spl7_4 ),
inference(superposition,[],[f70,f183]) ).
fof(f230,plain,
( sK3 = sK6
| ~ spl7_4 ),
inference(resolution,[],[f225,f56]) ).
fof(f238,plain,
( sK3 != sK4
| spl7_1
| ~ spl7_4 ),
inference(superposition,[],[f75,f230]) ).
fof(f252,plain,
( sK3 = sK5
| ~ spl7_4 ),
inference(resolution,[],[f226,f56]) ).
fof(f255,plain,
( spl7_2
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f252,f181,f77]) ).
fof(f274,plain,
( singleton(sK3) = unordered_pair(sK3,sK4)
| ~ spl7_2
| ~ spl7_5 ),
inference(forward_demodulation,[],[f188,f78]) ).
fof(f287,plain,
( member(sK4,singleton(sK3))
| ~ spl7_2
| ~ spl7_5 ),
inference(superposition,[],[f71,f274]) ).
fof(f303,plain,
( sK3 = sK4
| ~ spl7_2
| ~ spl7_5 ),
inference(resolution,[],[f287,f56]) ).
fof(f306,plain,
( $false
| spl7_1
| ~ spl7_2
| ~ spl7_4
| ~ spl7_5 ),
inference(forward_subsumption_resolution,[],[f303,f238]) ).
fof(f307,plain,
( spl7_1
| ~ spl7_2
| ~ spl7_4
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f306]) ).
fof(f308,plain,
( singleton(sK3) != unordered_pair(sK3,sK4)
| ~ spl7_2
| spl7_5 ),
inference(forward_demodulation,[],[f187,f78]) ).
fof(f496,plain,
( member(unordered_pair(sK3,sK4),unordered_pair(singleton(sK5),singleton(sK3)))
| ~ spl7_4 ),
inference(forward_demodulation,[],[f213,f183]) ).
fof(f497,plain,
( member(unordered_pair(sK3,sK4),unordered_pair(singleton(sK3),singleton(sK3)))
| ~ spl7_2
| ~ spl7_4 ),
inference(forward_demodulation,[],[f496,f78]) ).
fof(f521,plain,
( singleton(sK3) = unordered_pair(sK3,sK4)
| singleton(sK3) = unordered_pair(sK3,sK4)
| ~ spl7_2
| ~ spl7_4 ),
inference(resolution,[],[f497,f58]) ).
fof(f525,plain,
( singleton(sK3) = unordered_pair(sK3,sK4)
| ~ spl7_2
| ~ spl7_4 ),
inference(duplicate_literal_removal,[],[f521]) ).
fof(f526,plain,
( $false
| ~ spl7_2
| ~ spl7_4
| spl7_5 ),
inference(forward_subsumption_resolution,[],[f525,f308]) ).
fof(f527,plain,
( ~ spl7_2
| ~ spl7_4
| spl7_5 ),
inference(avatar_contradiction_clause,[],[f526]) ).
fof(f528,plain,
( singleton(sK3) != unordered_pair(sK3,sK6)
| ~ spl7_2
| spl7_4 ),
inference(forward_demodulation,[],[f182,f78]) ).
fof(f534,plain,
( member(unordered_pair(sK3,sK6),unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)))
| ~ spl7_2 ),
inference(forward_demodulation,[],[f212,f78]) ).
fof(f545,plain,
( unordered_pair(sK3,sK4) = unordered_pair(sK3,sK6)
| singleton(sK3) = unordered_pair(sK3,sK6)
| ~ spl7_2 ),
inference(resolution,[],[f534,f58]) ).
fof(f549,plain,
( unordered_pair(sK3,sK4) = unordered_pair(sK3,sK6)
| ~ spl7_2
| spl7_4 ),
inference(forward_subsumption_resolution,[],[f545,f528]) ).
fof(f571,plain,
( member(sK6,unordered_pair(sK3,sK4))
| ~ spl7_2
| spl7_4 ),
inference(superposition,[],[f71,f549]) ).
fof(f592,plain,
( sK4 = sK6
| sK3 = sK6
| ~ spl7_2
| spl7_4 ),
inference(resolution,[],[f571,f58]) ).
fof(f596,plain,
( sK3 = sK6
| spl7_1
| ~ spl7_2
| spl7_4 ),
inference(forward_subsumption_resolution,[],[f592,f75]) ).
fof(f634,plain,
( sK3 != sK4
| spl7_1
| ~ spl7_2
| spl7_4 ),
inference(superposition,[],[f75,f596]) ).
fof(f644,plain,
( unordered_pair(sK3,sK4) = unordered_pair(sK3,sK3)
| spl7_1
| ~ spl7_2
| spl7_4 ),
inference(superposition,[],[f549,f596]) ).
fof(f730,plain,
( member(sK4,unordered_pair(sK3,sK3))
| spl7_1
| ~ spl7_2
| spl7_4 ),
inference(superposition,[],[f71,f644]) ).
fof(f768,plain,
( sK3 = sK4
| sK3 = sK4
| spl7_1
| ~ spl7_2
| spl7_4 ),
inference(resolution,[],[f730,f58]) ).
fof(f774,plain,
( sK3 = sK4
| spl7_1
| ~ spl7_2
| spl7_4 ),
inference(duplicate_literal_removal,[],[f768]) ).
fof(f775,plain,
( $false
| spl7_1
| ~ spl7_2
| spl7_4 ),
inference(forward_subsumption_resolution,[],[f774,f634]) ).
fof(f776,plain,
( spl7_1
| ~ spl7_2
| spl7_4 ),
inference(avatar_contradiction_clause,[],[f775]) ).
cnf(s1,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(sat_conversion,[],[f80]) ).
cnf(s2,plain,
( spl7_3
| spl7_4 ),
inference(sat_conversion,[],[f184]) ).
cnf(s4,plain,
( spl7_2
| ~ spl7_3 ),
inference(sat_conversion,[],[f207]) ).
cnf(s5,plain,
( spl7_2
| ~ spl7_4 ),
inference(sat_conversion,[],[f255]) ).
cnf(s7,plain,
( spl7_1
| ~ spl7_2
| ~ spl7_4
| ~ spl7_5 ),
inference(sat_conversion,[],[f307]) ).
cnf(s8,plain,
( ~ spl7_2
| ~ spl7_4
| spl7_5 ),
inference(sat_conversion,[],[f527]) ).
cnf(s9,plain,
( spl7_1
| ~ spl7_2
| spl7_4 ),
inference(sat_conversion,[],[f776]) ).
cnf(s10,plain,
spl7_2,
inference(rat,[],[s2,s4,s5]) ).
cnf(s12,plain,
( ~ spl7_4
| spl7_1 ),
inference(rat,[],[s8,s7,s10]) ).
cnf(s13,plain,
spl7_1,
inference(rat,[],[s12,s9,s10]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s1,s10,s13]) ).
fof(f777,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET707+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 02:34:47 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.45 % (1508922)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (1508930)dis+10_1_sil=32000:sp=arity:random_seed=3727294147:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (1508928)% WARNING: option uhcvi not known.
% 0.10/0.45 % (1508928)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3965984441:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.45 % (1508929)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3764720984:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45 % (1508931)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4010060780:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (1508932)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3514596678:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.45 % (1508933)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1818796496:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.45 % (1508930) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1508922-1508930"...
% 0.10/0.45 % (1508930)...printing done.
% 0.10/0.45 % (1508930)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Theorem for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (1508930)------------------------------
% 0.10/0.45 % (1508930)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (1508930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (1508930)CaDiCaL version: 2.1.3
% 0.10/0.45 % (1508930)Termination reason: Refutation
% 0.10/0.45 % (1508930)Time elapsed: 0.011 s
% 0.10/0.45 % (1508930)Peak memory usage: 12 MB
% 0.10/0.45 % (1508930)Instructions burned: 29 (million)
% 0.10/0.45 % (1508922)Success in time 0.042 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------