%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC373+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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 01:03:41 PM UTC 2026
% Result : Theorem 3.13s 1.12s
% Output : Refutation 4.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 18 unt; 2 def)
% Number of atoms : 229 ( 36 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 276 ( 111 ~; 102 |; 42 &)
% ( 6 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn 65 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ rearsegP(X3,X2)
| segmentP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ rearsegP(X3,X2)
| segmentP(X1,X0) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& rearsegP(X3,X2)
& ~ segmentP(X1,X0)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& rearsegP(X3,X2)
& ~ segmentP(X1,X0)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f243,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f244,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X3,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f243]) ).
fof(f245,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ( ssList(sK12(X0,X1))
& app(sK12(X0,X1),X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X3,sK12(X0,X1))],[f244]) ).
fof(f246,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f247,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f246]) ).
fof(f248,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK13(X0,X1))
& ssList(sK14(X0,X1))
& app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14]),skolemize(X4,sK13(X0,X1)),skolemize(X5,sK14(X0,X1))],[f247]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& rearsegP(sK56,sK55)
& ~ segmentP(sK54,sK53)
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f312,plain,
! [X0,X1] :
( ~ rearsegP(X0,X1)
| app(sK12(X0,X1),X1) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f313,plain,
! [X0,X1] :
( ssList(sK12(X0,X1))
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f245]) ).
fof(f318,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f401,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f482,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
~ segmentP(sK54,sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
rearsegP(sK56,sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f318]) ).
fof(f539,definition,
( spl57_1
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f540,plain,
( ssList(nil)
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f539]) ).
fof(f572,plain,
spl57_1,
inference(avatar_split_clause,[],[f389,f539]) ).
fof(f575,plain,
rearsegP(sK54,sK55),
inference(superposition,[],[f501,f503]) ).
fof(f577,plain,
rearsegP(sK54,sK53),
inference(forward_demodulation,[],[f575,f502]) ).
fof(f832,plain,
( sK54 = app(sK12(sK54,sK53),sK53)
| ~ ssList(sK53)
| ~ ssList(sK54) ),
inference(resolution,[],[f312,f577]) ).
fof(f839,plain,
( sK54 = app(sK12(sK54,sK53),sK53)
| ~ ssList(sK54) ),
inference(forward_subsumption_resolution,[],[f832,f496]) ).
fof(f844,plain,
sK54 = app(sK12(sK54,sK53),sK53),
inference(forward_subsumption_resolution,[],[f839,f497]) ).
fof(f856,definition,
( spl57_13
<=> ssList(sK12(sK54,sK53)) ),
introduced(definition,[new_symbols(definition,[spl57_13])],[avatar_definition]) ).
fof(f857,plain,
( ssList(sK12(sK54,sK53))
| ~ spl57_13 ),
inference(avatar_component_clause,[],[f856]) ).
fof(f858,plain,
( ~ ssList(sK12(sK54,sK53))
| spl57_13 ),
inference(avatar_component_clause,[],[f856]) ).
fof(f887,plain,
( ~ rearsegP(sK54,sK53)
| ~ ssList(sK53)
| ~ ssList(sK54)
| spl57_13 ),
inference(resolution,[],[f858,f313]) ).
fof(f888,plain,
( ~ ssList(sK53)
| ~ ssList(sK54)
| spl57_13 ),
inference(forward_subsumption_resolution,[],[f887,f577]) ).
fof(f889,plain,
( ~ ssList(sK54)
| spl57_13 ),
inference(forward_subsumption_resolution,[],[f888,f496]) ).
fof(f890,plain,
( $false
| spl57_13 ),
inference(forward_subsumption_resolution,[],[f889,f497]) ).
fof(f891,plain,
spl57_13,
inference(avatar_contradiction_clause,[],[f890]) ).
fof(f1648,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X1)
| segmentP(app(X0,X1),X1)
| ~ ssList(app(X0,X1)) ),
inference(superposition,[],[f509,f482]) ).
fof(f1649,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X1)
| segmentP(app(X0,X1),X1) ),
inference(duplicate_literal_removal,[],[f1648]) ).
fof(f1657,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X1)
| segmentP(app(X0,X1),X1) ),
inference(forward_subsumption_resolution,[],[f1649,f401]) ).
fof(f1664,plain,
( ! [X0,X1] :
( segmentP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f1657,f540]) ).
fof(f2267,plain,
( segmentP(sK54,sK53)
| ~ ssList(sK53)
| ~ ssList(sK12(sK54,sK53))
| ~ spl57_1 ),
inference(superposition,[],[f1664,f844]) ).
fof(f2283,plain,
( ~ ssList(sK53)
| ~ ssList(sK12(sK54,sK53))
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f2267,f500]) ).
fof(f2297,plain,
( ~ ssList(sK12(sK54,sK53))
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f2283,f496]) ).
fof(f2305,plain,
( $false
| ~ spl57_1
| ~ spl57_13 ),
inference(forward_subsumption_resolution,[],[f2297,f857]) ).
fof(f2306,plain,
( ~ spl57_1
| ~ spl57_13 ),
inference(avatar_contradiction_clause,[],[f2305]) ).
cnf(s9,plain,
spl57_1,
inference(sat_conversion,[],[f572]) ).
cnf(s19,plain,
spl57_13,
inference(sat_conversion,[],[f891]) ).
cnf(s79,plain,
( ~ spl57_1
| ~ spl57_13 ),
inference(sat_conversion,[],[f2306]) ).
cnf(s83,plain,
~ spl57_1,
inference(rat,[],[s79,s19]) ).
cnf(s103,plain,
$false,
inference(rat,[],[s9,s83]) ).
fof(f2308,plain,
$false,
inference(avatar_sat_refutation,[],[s103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC373+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n010.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 09:20:47 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.20 Running first-order theorem proving
% 0.07/0.20 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
% 3.13/1.12 % (1794681)Detected formulas, will run a generic FOF schedule.
% 3.13/1.12 % (1794688)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=2896435787:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.13/1.12 % (1794690)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2451701760:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.13/1.12 % (1794689)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=516359560:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.13/1.12 % (1794691)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3449488457:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.13/1.12 % (1794692)dis-21_1_sil=8000:lcm=predicate:random_seed=843904197: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)
% 3.13/1.12 % (1794686)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=3693698906:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.13/1.12 % (1794687)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=3932355610:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.13/1.12 % (1794691)First to succeed.
% 3.13/1.12 % (1794691)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1794681"
% 3.13/1.12 % (1794690)Instruction limit reached!
% 3.13/1.12 % (1794690)------------------------------
% 3.13/1.12 % (1794690)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.12 % (1794690)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.12 % (1794690)CaDiCaL version: 2.1.3
% 3.13/1.12 % (1794690)Termination reason: Instruction limit
% 3.13/1.12 % (1794690)Termination phase: Saturation
% 3.13/1.12 % (1794690)Time elapsed: 0.056 s
% 3.13/1.12 % (1794690)Peak memory usage: 88 MB
% 3.13/1.12 % (1794690)Instructions burned: 120 (million)
% 3.13/1.12 % (1794689)Instruction limit reached!
% 3.13/1.12 % (1794689)------------------------------
% 3.13/1.12 % (1794689)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.12 % (1794689)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.12 % (1794689)CaDiCaL version: 2.1.3
% 3.13/1.12 % (1794689)Termination reason: Instruction limit
% 3.13/1.12 % (1794689)Termination phase: Saturation
% 3.13/1.12 % (1794689)Time elapsed: 0.066 s
% 3.13/1.12 % (1794689)Peak memory usage: 89 MB
% 3.13/1.12 % (1794689)Instructions burned: 109 (million)
% 3.13/1.12 % (1794692)Instruction limit reached!
% 3.13/1.12 % (1794692)------------------------------
% 3.13/1.12 % (1794692)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.13/1.12 % (1794692)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.13/1.12 % (1794692)CaDiCaL version: 2.1.3
% 3.13/1.12 % (1794692)Termination reason: Instruction limit
% 3.13/1.12 % (1794692)Termination phase: Saturation
% 3.13/1.12 % (1794692)Time elapsed: 0.074 s
% 3.13/1.12 % (1794692)Peak memory usage: 90 MB
% 3.13/1.12 % (1794692)Instructions burned: 130 (million)
% 3.13/1.12 % (1794700)lrs+10_1_sil=8000:sp=occurrence:random_seed=924635703:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.13/1.12 % (1794701)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4154034665:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.13/1.12 % (1794702)lrs+1011_1_sil=32000:sp=occurrence:random_seed=387350082:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.13/1.12 % (1794700)Also succeeded, but the first one will report.
% 3.13/1.12 % (1794691)Refutation found. Thanks to Tanya!
% 3.13/1.12 % SZS status Theorem for theBenchmark
% 3.13/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 4.01/1.31 % (1794691)------------------------------
% 4.01/1.31 % (1794691)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.01/1.31 % (1794691)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.01/1.31 % (1794691)CaDiCaL version: 2.1.3
% 4.01/1.31 % (1794691)Termination reason: Refutation
% 4.01/1.31 % (1794691)Time elapsed: 0.048 s
% 4.01/1.31 % (1794691)Peak memory usage: 90 MB
% 4.01/1.31 % (1794691)Instructions burned: 72 (million)
% 4.01/1.31 % (1794691)------------------------------
% 4.01/1.31 % (1794691)------------------------------
% 4.01/1.31 % (1794681)Success in time 0.48 s
% 4.01/1.31 % Vampire exiting
%------------------------------------------------------------------------------