%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT076+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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:04:29 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 24
% Syntax : Number of formulae : 103 ( 34 unt; 0 def)
% Number of atoms : 283 ( 99 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 314 ( 134 ~; 140 |; 27 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 149 ( 148 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( less(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',transitive) ).
fof(f3,axiom,
! [X0,X1] :
( less(X0,X1)
| X0 = X1
| less(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',trichotomy) ).
fof(f4,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(f5,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& leq(X1,X0) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(f6,axiom,
! [X0,X1] :
( less(X0,X1)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( less(X0,X1)
& leq(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_leq_trans) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(f17,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',conflict_is_verdict) ).
fof(f18,axiom,
is_verdict(compatible),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',compatible_is_verdict) ).
fof(f19,axiom,
is_verdict(unknown),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',unknown_is_verdict) ).
fof(f20,axiom,
conflict != compatible,
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',verdicts_distinct_cf_cp) ).
fof(f21,axiom,
conflict != unknown,
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',verdicts_distinct_cf_un) ).
fof(f22,axiom,
compatible != unknown,
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',verdicts_distinct_cp_un) ).
fof(f24,axiom,
! [X0,X1] :
( ( is_verdict(X0)
& is_verdict(X1)
& ( X0 = conflict
| X1 = conflict ) )
=> box_verdict(X0,X1) = conflict ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',box_conflict) ).
fof(f25,axiom,
! [X0,X1] :
( ( is_verdict(X0)
& is_verdict(X1)
& X0 = compatible
& X1 = compatible )
=> box_verdict(X0,X1) = compatible ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',box_compatible) ).
fof(f26,axiom,
! [X0,X1] :
( ( is_verdict(X0)
& is_verdict(X1)
& ( X0 = unknown
| X1 = unknown )
& X0 != conflict
& X1 != conflict )
=> box_verdict(X0,X1) = unknown ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',box_unknown) ).
fof(f27,axiom,
! [X0,X1] :
( ( is_verdict(X0)
& is_verdict(X1) )
=> ( box_verdict(X0,X1) = conflict
| box_verdict(X0,X1) = compatible
| box_verdict(X0,X1) = unknown ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',box_verdict_total) ).
fof(f31,axiom,
less(v0,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(f32,axiom,
less(v0,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v800) ).
fof(f33,axiom,
less(v400,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(f34,axiom,
( v0 != v400
& v0 != v800
& v400 != v800 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
fof(f35,conjecture,
! [X0] :
( leq(v800,X0)
=> leq(v400,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl311) ).
fof(f36,negated_conjecture,
~ ! [X0] :
( leq(v800,X0)
=> leq(v400,X0) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f40,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f41,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f40]) ).
fof(f42,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f43,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(flattening,[],[f42]) ).
fof(f44,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f45,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f46,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f48,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f47]) ).
fof(f49,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f50,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f49]) ).
fof(f53,plain,
! [X0,X1] :
( box_verdict(X0,X1) = conflict
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( conflict != X0
& conflict != X1 ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f54,plain,
! [X0,X1] :
( box_verdict(X0,X1) = conflict
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( conflict != X0
& conflict != X1 ) ),
inference(flattening,[],[f53]) ).
fof(f55,plain,
! [X0,X1] :
( box_verdict(X0,X1) = compatible
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| compatible != X0
| compatible != X1 ),
inference(ennf_transformation,[],[f25]) ).
fof(f56,plain,
! [X0,X1] :
( box_verdict(X0,X1) = compatible
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| compatible != X0
| compatible != X1 ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
! [X0,X1] :
( box_verdict(X0,X1) = unknown
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( unknown != X0
& unknown != X1 )
| conflict = X0
| conflict = X1 ),
inference(ennf_transformation,[],[f26]) ).
fof(f58,plain,
! [X0,X1] :
( box_verdict(X0,X1) = unknown
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( unknown != X0
& unknown != X1 )
| conflict = X0
| conflict = X1 ),
inference(flattening,[],[f57]) ).
fof(f59,plain,
! [X0,X1] :
( box_verdict(X0,X1) = conflict
| box_verdict(X0,X1) = compatible
| box_verdict(X0,X1) = unknown
| ~ is_verdict(X0)
| ~ is_verdict(X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f60,plain,
! [X0,X1] :
( box_verdict(X0,X1) = conflict
| box_verdict(X0,X1) = compatible
| box_verdict(X0,X1) = unknown
| ~ is_verdict(X0)
| ~ is_verdict(X1) ),
inference(flattening,[],[f59]) ).
fof(f61,plain,
? [X0] :
( ~ leq(v400,X0)
& leq(v800,X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f62,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f63,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(flattening,[],[f62]) ).
fof(f64,plain,
( ~ leq(v400,sK0)
& leq(v800,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f61]) ).
fof(f65,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f66,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f41]) ).
fof(f67,plain,
! [X0,X1] :
( less(X0,X1)
| X0 = X1
| less(X1,X0) ),
inference(cnf_transformation,[],[f3]) ).
fof(f68,plain,
! [X0,X1] :
( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f69,plain,
! [X0,X1] :
( leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f63]) ).
fof(f70,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f71,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f72,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f73,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f46]) ).
fof(f74,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(cnf_transformation,[],[f48]) ).
fof(f75,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(cnf_transformation,[],[f50]) ).
fof(f76,plain,
is_verdict(conflict),
inference(cnf_transformation,[],[f17]) ).
fof(f77,plain,
is_verdict(compatible),
inference(cnf_transformation,[],[f18]) ).
fof(f78,plain,
is_verdict(unknown),
inference(cnf_transformation,[],[f19]) ).
fof(f79,plain,
conflict != compatible,
inference(cnf_transformation,[],[f20]) ).
fof(f80,plain,
conflict != unknown,
inference(cnf_transformation,[],[f21]) ).
fof(f81,plain,
compatible != unknown,
inference(cnf_transformation,[],[f22]) ).
fof(f83,plain,
! [X0,X1] :
( conflict = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| conflict != X1 ),
inference(cnf_transformation,[],[f54]) ).
fof(f84,plain,
! [X0,X1] :
( conflict = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| conflict != X0 ),
inference(cnf_transformation,[],[f54]) ).
fof(f85,plain,
! [X0,X1] :
( compatible = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| compatible != X0
| compatible != X1 ),
inference(cnf_transformation,[],[f56]) ).
fof(f86,plain,
! [X0,X1] :
( unknown = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| unknown != X1
| conflict = X0
| conflict = X1 ),
inference(cnf_transformation,[],[f58]) ).
fof(f87,plain,
! [X0,X1] :
( unknown = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| unknown != X0
| conflict = X0
| conflict = X1 ),
inference(cnf_transformation,[],[f58]) ).
fof(f88,plain,
! [X0,X1] :
( conflict = box_verdict(X0,X1)
| compatible = box_verdict(X0,X1)
| unknown = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f89,plain,
less(v0,v400),
inference(cnf_transformation,[],[f31]) ).
fof(f90,plain,
less(v0,v800),
inference(cnf_transformation,[],[f32]) ).
fof(f91,plain,
less(v400,v800),
inference(cnf_transformation,[],[f33]) ).
fof(f92,plain,
v400 != v800,
inference(cnf_transformation,[],[f34]) ).
fof(f93,plain,
v0 != v800,
inference(cnf_transformation,[],[f34]) ).
fof(f94,plain,
v0 != v400,
inference(cnf_transformation,[],[f34]) ).
fof(f95,plain,
leq(v800,sK0),
inference(cnf_transformation,[],[f64]) ).
fof(f96,plain,
~ leq(v400,sK0),
inference(cnf_transformation,[],[f64]) ).
fof(f97,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f69]) ).
fof(f98,plain,
! [X1] :
( conflict = box_verdict(conflict,X1)
| ~ is_verdict(conflict)
| ~ is_verdict(X1) ),
inference(equality_resolution,[],[f84]) ).
fof(f99,plain,
! [X0] :
( conflict = box_verdict(X0,conflict)
| ~ is_verdict(X0)
| ~ is_verdict(conflict) ),
inference(equality_resolution,[],[f83]) ).
fof(f100,plain,
! [X1] :
( compatible = box_verdict(compatible,X1)
| ~ is_verdict(compatible)
| ~ is_verdict(X1)
| compatible != X1 ),
inference(equality_resolution,[],[f85]) ).
fof(f101,plain,
( compatible = box_verdict(compatible,compatible)
| ~ is_verdict(compatible)
| ~ is_verdict(compatible) ),
inference(equality_resolution,[],[f100]) ).
fof(f102,plain,
! [X1] :
( unknown = box_verdict(unknown,X1)
| ~ is_verdict(unknown)
| ~ is_verdict(X1)
| conflict = unknown
| conflict = X1 ),
inference(equality_resolution,[],[f87]) ).
fof(f103,plain,
! [X0] :
( unknown = box_verdict(X0,unknown)
| ~ is_verdict(X0)
| ~ is_verdict(unknown)
| conflict = X0
| conflict = unknown ),
inference(equality_resolution,[],[f86]) ).
fof(f104,plain,
! [X0] : less(X0,X0),
inference(consistent_polarity_flipping,[],[f65]) ).
fof(f105,plain,
! [X2,X0,X1] :
( ~ less(X0,X1)
| less(X0,X2)
| less(X2,X1) ),
inference(consistent_polarity_flipping,[],[f66]) ).
fof(f106,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X0 = X1
| ~ less(X1,X0) ),
inference(consistent_polarity_flipping,[],[f67]) ).
fof(f107,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f70]) ).
fof(f108,plain,
! [X0] : ~ leq(X0,X0),
inference(consistent_polarity_flipping,[],[f97]) ).
fof(f109,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X0 = X1
| leq(X0,X1) ),
inference(consistent_polarity_flipping,[],[f68]) ).
fof(f110,plain,
! [X0,X1] :
( X0 = X1
| leq(X0,X1)
| leq(X1,X0) ),
inference(consistent_polarity_flipping,[],[f71]) ).
fof(f111,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f72]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ less(X0,X1)
| leq(X0,X2)
| less(X2,X1) ),
inference(consistent_polarity_flipping,[],[f73]) ).
fof(f113,plain,
! [X2,X0,X1] :
( ~ less(X0,X1)
| less(X0,X2)
| leq(X2,X1) ),
inference(consistent_polarity_flipping,[],[f74]) ).
fof(f114,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| leq(X0,X2)
| leq(X2,X1) ),
inference(consistent_polarity_flipping,[],[f75]) ).
fof(f115,plain,
~ less(v0,v400),
inference(consistent_polarity_flipping,[],[f89]) ).
fof(f116,plain,
~ less(v0,v800),
inference(consistent_polarity_flipping,[],[f90]) ).
fof(f117,plain,
~ less(v400,v800),
inference(consistent_polarity_flipping,[],[f91]) ).
fof(f118,plain,
leq(v400,sK0),
inference(consistent_polarity_flipping,[],[f96]) ).
fof(f119,plain,
~ leq(v800,sK0),
inference(consistent_polarity_flipping,[],[f95]) ).
fof(f183,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f104,f105,f106,f107,f108,f109,f110,f111,f112,f113,f114,f76,f77,f78,f79,f80,f81,f98,f99,f101,f102,f103,f88,f115,f116,f117,f94,f93,f92,f118,f119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT076+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n015.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 17:37:31 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.45 % (1890931)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (1890936)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3027951645_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45 % Detected minimum model sizes of [3]
% 0.10/0.45 % Detected maximum model sizes of [max]
% 0.10/0.45 % TRYING [3]
% 0.10/0.45 % TRYING [4]
% 0.10/0.45 % (1890936) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1890931-1890936"...
% 0.10/0.45 % (1890936)...printing done.
% 0.10/0.45 % (1890937)% WARNING: option uhcvi not known.
% 0.10/0.45 % (1890936)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 % (1890936)------------------------------
% 0.10/0.45 % (1890936)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (1890936)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (1890936)CaDiCaL version: 2.1.3
% 0.10/0.45 % (1890936)Termination reason: Refutation
% 0.10/0.45 % (1890936)Time elapsed: 0.003 s
% 0.10/0.45 % (1890936)Peak memory usage: 12 MB
% 0.10/0.45 % (1890936)Instructions burned: 11 (million)
% 0.10/0.45 % (1890931)Success in time 0.028 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------