%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV180+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 01:08:19 PM UTC 2026
% Result : Theorem 0.67s 0.99s
% Output : Refutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 71 ( 23 unt; 6 def)
% Number of atoms : 322 ( 117 equ)
% Maximal formula atoms : 41 ( 4 avg)
% Number of connectives : 360 ( 109 ~; 138 |; 75 &)
% ( 5 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 17 con; 0-3 aty)
% Number of variables : 54 ( 0 sgn 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( leq(n0,pv86)
& leq(pv86,n4)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,n135299) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,n4) )
=> a_select3(q_init,X0,X1) = init ) )
& ! [X2] :
( ( leq(n0,X2)
& leq(X2,n4) )
=> a_select2(rho_init,X2) = init )
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,n4) )
=> a_select2(mu_init,X3) = init )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(sigma_init,X4) = init )
& ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select3(center_init,X5,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(muold_init,X6) = init ) )
& ( gt(loopcounter,n1)
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select2(rhoold_init,X7) = init ) )
& ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(sigmaold_init,X8) = init ) )
& ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(muold_init,X9) = init )
& ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select2(rhoold_init,X10) = init )
& ! [X11] :
( ( leq(n0,X11)
& leq(X11,n4) )
=> a_select2(sigmaold_init,X11) = init ) )
=> a_select2(muold_init,pv86) = init ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0076) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv86)
& leq(pv86,n4)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,n135299) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,n4) )
=> a_select3(q_init,X0,X1) = init ) )
& ! [X2] :
( ( leq(n0,X2)
& leq(X2,n4) )
=> a_select2(rho_init,X2) = init )
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,n4) )
=> a_select2(mu_init,X3) = init )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(sigma_init,X4) = init )
& ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select3(center_init,X5,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(muold_init,X6) = init ) )
& ( gt(loopcounter,n1)
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select2(rhoold_init,X7) = init ) )
& ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(sigmaold_init,X8) = init ) )
& ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(muold_init,X9) = init )
& ! [X10] :
( ( leq(n0,X10)
& leq(X10,n4) )
=> a_select2(rhoold_init,X10) = init )
& ! [X11] :
( ( leq(n0,X11)
& leq(X11,n4) )
=> a_select2(sigmaold_init,X11) = init ) )
=> a_select2(muold_init,pv86) = init ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f83,axiom,
! [X0] :
( ( leq(n0,X0)
& leq(X0,n4) )
=> ( X0 = n0
| X0 = n1
| X0 = n2
| X0 = n3
| X0 = n4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_4) ).
fof(f89,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_4) ).
fof(f91,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(f94,plain,
( init != a_select2(muold_init,pv86)
& leq(n0,pv86)
& leq(pv86,n4)
& ! [X0] :
( ! [X1] :
( a_select3(q_init,X0,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n4) )
| ~ leq(n0,X0)
| ~ leq(X0,n135299) )
& ! [X2] :
( a_select2(rho_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
& ! [X3] :
( a_select2(mu_init,X3) = init
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
& ! [X4] :
( a_select2(sigma_init,X4) = init
| ~ leq(n0,X4)
| ~ leq(X4,n4) )
& ! [X5] :
( a_select3(center_init,X5,n0) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
& ( ! [X6] :
( a_select2(muold_init,X6) = init
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X7] :
( a_select2(rhoold_init,X7) = init
| ~ leq(n0,X7)
| ~ leq(X7,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X8] :
( a_select2(sigmaold_init,X8) = init
| ~ leq(n0,X8)
| ~ leq(X8,n4) )
| ~ gt(loopcounter,n1) )
& ! [X9] :
( a_select2(muold_init,X9) = init
| ~ leq(n0,X9)
| ~ leq(X9,n4) )
& ! [X10] :
( a_select2(rhoold_init,X10) = init
| ~ leq(n0,X10)
| ~ leq(X10,n4) )
& ! [X11] :
( a_select2(sigmaold_init,X11) = init
| ~ leq(n0,X11)
| ~ leq(X11,n4) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f95,plain,
( init != a_select2(muold_init,pv86)
& leq(n0,pv86)
& leq(pv86,n4)
& ! [X0] :
( ! [X1] :
( a_select3(q_init,X0,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n4) )
| ~ leq(n0,X0)
| ~ leq(X0,n135299) )
& ! [X2] :
( a_select2(rho_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
& ! [X3] :
( a_select2(mu_init,X3) = init
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
& ! [X4] :
( a_select2(sigma_init,X4) = init
| ~ leq(n0,X4)
| ~ leq(X4,n4) )
& ! [X5] :
( a_select3(center_init,X5,n0) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
& ( ! [X6] :
( a_select2(muold_init,X6) = init
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X7] :
( a_select2(rhoold_init,X7) = init
| ~ leq(n0,X7)
| ~ leq(X7,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X8] :
( a_select2(sigmaold_init,X8) = init
| ~ leq(n0,X8)
| ~ leq(X8,n4) )
| ~ gt(loopcounter,n1) )
& ! [X9] :
( a_select2(muold_init,X9) = init
| ~ leq(n0,X9)
| ~ leq(X9,n4) )
& ! [X10] :
( a_select2(rhoold_init,X10) = init
| ~ leq(n0,X10)
| ~ leq(X10,n4) )
& ! [X11] :
( a_select2(sigmaold_init,X11) = init
| ~ leq(n0,X11)
| ~ leq(X11,n4) ) ),
inference(flattening,[],[f94]) ).
fof(f107,plain,
! [X0] :
( X0 = n0
| X0 = n1
| X0 = n2
| X0 = n3
| X0 = n4
| ~ leq(n0,X0)
| ~ leq(X0,n4) ),
inference(ennf_transformation,[],[f83]) ).
fof(f108,plain,
! [X0] :
( X0 = n0
| X0 = n1
| X0 = n2
| X0 = n3
| X0 = n4
| ~ leq(n0,X0)
| ~ leq(X0,n4) ),
inference(flattening,[],[f107]) ).
fof(f111,plain,
! [X9] :
( init = a_select2(muold_init,X9)
| ~ leq(n0,X9)
| ~ leq(X9,n4) ),
inference(cnf_transformation,[],[f95]) ).
fof(f120,plain,
leq(pv86,n4),
inference(cnf_transformation,[],[f95]) ).
fof(f121,plain,
leq(n0,pv86),
inference(cnf_transformation,[],[f95]) ).
fof(f122,plain,
init != a_select2(muold_init,pv86),
inference(cnf_transformation,[],[f95]) ).
fof(f131,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f91]) ).
fof(f134,plain,
n4 = succ(succ(succ(succ(n0)))),
inference(cnf_transformation,[],[f89]) ).
fof(f135,plain,
! [X0] :
( ~ leq(n0,X0)
| n1 = X0
| n2 = X0
| n3 = X0
| n4 = X0
| n0 = X0
| ~ leq(X0,n4) ),
inference(cnf_transformation,[],[f108]) ).
fof(f147,definition,
~ sP0(init),
introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).
fof(f148,plain,
sP0(a_select2(muold_init,pv86)),
inference(inequality_splitting,[],[f122,f147]) ).
fof(f151,plain,
! [X9] :
( ~ leq(X9,succ(succ(succ(succ(n0)))))
| init = a_select2(muold_init,X9)
| ~ leq(n0,X9) ),
inference(forward_demodulation,[],[f111,f134]) ).
fof(f160,plain,
leq(pv86,succ(succ(succ(succ(n0))))),
inference(forward_demodulation,[],[f120,f134]) ).
fof(f161,plain,
( n1 = pv86
| n2 = pv86
| n3 = pv86
| n4 = pv86
| n0 = pv86
| ~ leq(pv86,n4) ),
inference(resolution,[],[f121,f135]) ).
fof(f167,definition,
( spl1_1
<=> n0 = pv86 ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f169,plain,
( n0 = pv86
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f167]) ).
fof(f181,plain,
( pv86 = succ(n0)
| n2 = pv86
| n3 = pv86
| n4 = pv86
| n0 = pv86
| ~ leq(pv86,n4) ),
inference(forward_demodulation,[],[f161,f131]) ).
fof(f183,plain,
( pv86 = succ(succ(succ(succ(n0))))
| pv86 = succ(n0)
| n2 = pv86
| n3 = pv86
| n0 = pv86
| ~ leq(pv86,n4) ),
inference(forward_demodulation,[],[f181,f134]) ).
fof(f185,definition,
( spl1_4
<=> pv86 = succ(n0) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f187,plain,
( pv86 = succ(n0)
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f185]) ).
fof(f193,plain,
( ~ leq(pv86,succ(succ(succ(succ(n0)))))
| pv86 = succ(succ(succ(succ(n0))))
| pv86 = succ(n0)
| n2 = pv86
| n3 = pv86
| n0 = pv86 ),
inference(forward_demodulation,[],[f183,f134]) ).
fof(f194,plain,
( pv86 = succ(succ(succ(succ(n0))))
| pv86 = succ(n0)
| n2 = pv86
| n3 = pv86
| n0 = pv86 ),
inference(forward_subsumption_resolution,[],[f193,f160]) ).
fof(f196,definition,
( spl1_6
<=> n3 = pv86 ),
introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).
fof(f198,plain,
( n3 = pv86
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f196]) ).
fof(f200,definition,
( spl1_7
<=> n2 = pv86 ),
introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).
fof(f202,plain,
( n2 = pv86
| ~ spl1_7 ),
inference(avatar_component_clause,[],[f200]) ).
fof(f204,definition,
( spl1_8
<=> pv86 = succ(succ(succ(succ(n0)))) ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f206,plain,
( pv86 = succ(succ(succ(succ(n0))))
| ~ spl1_8 ),
inference(avatar_component_clause,[],[f204]) ).
fof(f207,plain,
( spl1_1
| spl1_6
| spl1_7
| spl1_4
| spl1_8 ),
inference(avatar_split_clause,[],[f194,f204,f185,f200,f196,f167]) ).
fof(f240,plain,
( sP0(a_select2(muold_init,n3))
| ~ spl1_6 ),
inference(superposition,[],[f148,f198]) ).
fof(f263,plain,
( init = a_select2(muold_init,pv86)
| ~ leq(n0,pv86) ),
inference(resolution,[],[f151,f160]) ).
fof(f264,plain,
init = a_select2(muold_init,pv86),
inference(forward_subsumption_resolution,[],[f263,f121]) ).
fof(f265,plain,
( init = a_select2(muold_init,n3)
| ~ spl1_6 ),
inference(forward_demodulation,[],[f264,f198]) ).
fof(f310,plain,
( sP0(init)
| ~ spl1_6 ),
inference(superposition,[],[f240,f265]) ).
fof(f311,plain,
( $false
| ~ spl1_6 ),
inference(forward_subsumption_resolution,[],[f310,f147]) ).
fof(f312,plain,
~ spl1_6,
inference(avatar_contradiction_clause,[],[f311]) ).
fof(f318,plain,
( init = a_select2(muold_init,n2)
| ~ spl1_7 ),
inference(forward_demodulation,[],[f264,f202]) ).
fof(f336,plain,
( sP0(a_select2(muold_init,n2))
| ~ spl1_7 ),
inference(superposition,[],[f148,f202]) ).
fof(f343,plain,
( sP0(init)
| ~ spl1_7 ),
inference(forward_demodulation,[],[f336,f318]) ).
fof(f344,plain,
( $false
| ~ spl1_7 ),
inference(forward_subsumption_resolution,[],[f343,f147]) ).
fof(f345,plain,
~ spl1_7,
inference(avatar_contradiction_clause,[],[f344]) ).
fof(f350,plain,
( init = a_select2(muold_init,succ(succ(succ(succ(n0)))))
| ~ spl1_8 ),
inference(forward_demodulation,[],[f264,f206]) ).
fof(f361,plain,
( sP0(a_select2(muold_init,succ(succ(succ(succ(n0))))))
| ~ spl1_8 ),
inference(superposition,[],[f148,f206]) ).
fof(f372,plain,
( sP0(init)
| ~ spl1_8 ),
inference(forward_demodulation,[],[f361,f350]) ).
fof(f375,plain,
( $false
| ~ spl1_8 ),
inference(forward_subsumption_resolution,[],[f372,f147]) ).
fof(f376,plain,
~ spl1_8,
inference(avatar_contradiction_clause,[],[f375]) ).
fof(f383,plain,
( init = a_select2(muold_init,succ(n0))
| ~ spl1_4 ),
inference(forward_demodulation,[],[f264,f187]) ).
fof(f392,plain,
( sP0(a_select2(muold_init,succ(n0)))
| ~ spl1_4 ),
inference(superposition,[],[f148,f187]) ).
fof(f401,plain,
( sP0(init)
| ~ spl1_4 ),
inference(forward_demodulation,[],[f392,f383]) ).
fof(f402,plain,
( $false
| ~ spl1_4 ),
inference(forward_subsumption_resolution,[],[f401,f147]) ).
fof(f403,plain,
~ spl1_4,
inference(avatar_contradiction_clause,[],[f402]) ).
fof(f411,plain,
( init = a_select2(muold_init,n0)
| ~ spl1_1 ),
inference(forward_demodulation,[],[f264,f169]) ).
fof(f421,plain,
( sP0(a_select2(muold_init,n0))
| ~ spl1_1 ),
inference(superposition,[],[f148,f169]) ).
fof(f435,plain,
( sP0(init)
| ~ spl1_1 ),
inference(forward_demodulation,[],[f421,f411]) ).
fof(f436,plain,
( $false
| ~ spl1_1 ),
inference(forward_subsumption_resolution,[],[f435,f147]) ).
fof(f437,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f436]) ).
cnf(s4,plain,
( spl1_1
| spl1_4
| spl1_6
| spl1_7
| spl1_8 ),
inference(sat_conversion,[],[f207]) ).
cnf(s10,plain,
~ spl1_6,
inference(sat_conversion,[],[f312]) ).
cnf(s12,plain,
~ spl1_7,
inference(sat_conversion,[],[f345]) ).
cnf(s18,plain,
~ spl1_8,
inference(sat_conversion,[],[f376]) ).
cnf(s21,plain,
~ spl1_4,
inference(sat_conversion,[],[f403]) ).
cnf(s26,plain,
~ spl1_1,
inference(sat_conversion,[],[f437]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s4,s18,s12,s10,s21,s26]) ).
fof(f438,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV180+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 % Computer : n017.cluster.edu
% 0.07/0.21 % Model : x86_64 x86_64
% 0.07/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.21 % Memory : 8046.5625MB
% 0.07/0.21 % OS : Linux 6.8.0-71-generic
% 0.07/0.21 % CPULimit : 300
% 0.07/0.21 % WCLimit : 300
% 0.07/0.21 % DateTime : Mon Sep 28 10:03:35 UTC 2026
% 0.07/0.22 % CPUTime :
% 0.07/0.22 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.25 Running first-order theorem proving
% 0.07/0.25 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
% 0.67/0.99 % (3447435)Detected formulas, will run a generic FOF schedule.
% 0.67/0.99 % (3447443)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4184358048:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.67/0.99 % (3447443)First to succeed.
% 0.67/0.99 % (3447443)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3447435"
% 0.67/0.99 % (3447441)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=332058294:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.67/0.99 % (3447445)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2727481323:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.67/0.99 % (3447446)dis-21_1_sil=8000:lcm=predicate:random_seed=2829723173: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)
% 0.67/0.99 % (3447444)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1375149268:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.67/0.99 % (3447442)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=1049823532:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.67/0.99 % (3447440)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=2079518623:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.67/0.99 % (3447444)Also succeeded, but the first one will report.
% 0.67/0.99 % (3447446)Also succeeded, but the first one will report.
% 0.67/0.99 % (3447445)Also succeeded, but the first one will report.
% 0.67/0.99 % (3447443)Refutation found. Thanks to Tanya!
% 0.67/0.99 % SZS status Theorem for theBenchmark
% 0.67/0.99 % SZS output start Proof for theBenchmark
% See solution above
% 2.83/1.19 % (3447443)------------------------------
% 2.83/1.19 % (3447443)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.83/1.19 % (3447443)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.83/1.19 % (3447443)CaDiCaL version: 2.1.3
% 2.83/1.19 % (3447443)Termination reason: Refutation
% 2.83/1.19 % (3447443)Time elapsed: 0.005 s
% 2.83/1.19 % (3447443)Peak memory usage: 89 MB
% 2.83/1.19 % (3447443)Instructions burned: 11 (million)
% 2.83/1.19 % (3447443)------------------------------
% 2.83/1.19 % (3447443)------------------------------
% 2.83/1.19 % (3447435)Success in time 0.31 s
% 2.83/1.19 % Vampire exiting
%------------------------------------------------------------------------------