TSTP Solution File: SET608+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET608+3 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:12:23 EDT 2024
% Result : Theorem 0.46s 0.70s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 67 ( 7 unt; 0 def)
% Number of atoms : 203 ( 17 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 224 ( 88 ~; 99 |; 25 &)
% ( 10 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 83 ( 76 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f100,plain,
$false,
inference(avatar_sat_refutation,[],[f60,f61,f71,f76,f79,f82,f88,f98]) ).
fof(f98,plain,
( spl4_1
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f97]) ).
fof(f97,plain,
( $false
| spl4_1
| ~ spl4_4 ),
inference(subsumption_resolution,[],[f95,f54]) ).
fof(f54,plain,
( ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK0)
| spl4_1 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f53,plain,
( spl4_1
<=> member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f95,plain,
( member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK0)
| ~ spl4_4 ),
inference(resolution,[],[f70,f35]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(f70,plain,
( member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),intersection(sK0,sK1))
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f68,plain,
( spl4_4
<=> member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),intersection(sK0,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f88,plain,
( ~ spl4_1
| spl4_3
| spl4_4 ),
inference(avatar_contradiction_clause,[],[f87]) ).
fof(f87,plain,
( $false
| ~ spl4_1
| spl4_3
| spl4_4 ),
inference(subsumption_resolution,[],[f86,f55]) ).
fof(f55,plain,
( member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK0)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f86,plain,
( ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK0)
| ~ spl4_1
| spl4_3
| spl4_4 ),
inference(subsumption_resolution,[],[f85,f84]) ).
fof(f84,plain,
( member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK1)
| ~ spl4_1
| spl4_3 ),
inference(subsumption_resolution,[],[f83,f55]) ).
fof(f83,plain,
( member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK1)
| ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK0)
| spl4_3 ),
inference(resolution,[],[f65,f40]) ).
fof(f40,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
fof(f65,plain,
( ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),difference(sK0,sK1))
| spl4_3 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f64,plain,
( spl4_3
<=> member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),difference(sK0,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f85,plain,
( ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK1)
| ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK0)
| spl4_4 ),
inference(resolution,[],[f69,f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f69,plain,
( ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),intersection(sK0,sK1))
| spl4_4 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f82,plain,
( ~ spl4_3
| spl4_2 ),
inference(avatar_split_clause,[],[f78,f57,f64]) ).
fof(f57,plain,
( spl4_2
<=> member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),union(intersection(sK0,sK1),difference(sK0,sK1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f78,plain,
( ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),difference(sK0,sK1))
| spl4_2 ),
inference(resolution,[],[f58,f33]) ).
fof(f33,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f58,plain,
( ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),union(intersection(sK0,sK1),difference(sK0,sK1)))
| spl4_2 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f79,plain,
( ~ spl4_4
| spl4_2 ),
inference(avatar_split_clause,[],[f77,f57,f68]) ).
fof(f77,plain,
( ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),intersection(sK0,sK1))
| spl4_2 ),
inference(resolution,[],[f58,f32]) ).
fof(f32,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f76,plain,
( spl4_1
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f72,f64,f53]) ).
fof(f72,plain,
( member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK0)
| ~ spl4_3 ),
inference(resolution,[],[f66,f38]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f66,plain,
( member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),difference(sK0,sK1))
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f71,plain,
( spl4_3
| spl4_4
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f62,f57,f68,f64]) ).
fof(f62,plain,
( member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),intersection(sK0,sK1))
| member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),difference(sK0,sK1))
| ~ spl4_2 ),
inference(resolution,[],[f59,f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f59,plain,
( member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),union(intersection(sK0,sK1),difference(sK0,sK1)))
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f61,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f51,f57,f53]) ).
fof(f51,plain,
( ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),union(intersection(sK0,sK1),difference(sK0,sK1)))
| ~ member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK0) ),
inference(resolution,[],[f44,f45]) ).
fof(f45,plain,
! [X0,X1] :
( sQ3_eqProxy(X0,X1)
| ~ member(sK2(X0,X1),X1)
| ~ member(sK2(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f29,f43]) ).
fof(f43,plain,
! [X0,X1] :
( sQ3_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ3_eqProxy])]) ).
fof(f29,plain,
! [X0,X1] :
( X0 = X1
| ~ member(sK2(X0,X1),X1)
| ~ member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( X0 = X1
| ( ( ~ member(sK2(X0,X1),X1)
| ~ member(sK2(X0,X1),X0) )
& ( member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f16,f17]) ).
fof(f17,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) )
=> ( ( ~ member(sK2(X0,X1),X1)
| ~ member(sK2(X0,X1),X0) )
& ( member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X2] :
( ( member(X2,X0)
| ~ member(X2,X1) )
& ( member(X2,X1)
| ~ member(X2,X0) ) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f44,plain,
~ sQ3_eqProxy(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),
inference(equality_proxy_replacement,[],[f25,f43]) ).
fof(f25,plain,
sK0 != union(intersection(sK0,sK1),difference(sK0,sK1)),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
sK0 != union(intersection(sK0,sK1),difference(sK0,sK1)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f13]) ).
fof(f13,plain,
( ? [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) != X0
=> sK0 != union(intersection(sK0,sK1),difference(sK0,sK1)) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) != X0,
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) = X0,
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_union_intersection_difference) ).
fof(f60,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f50,f57,f53]) ).
fof(f50,plain,
( member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),union(intersection(sK0,sK1),difference(sK0,sK1)))
| member(sK2(sK0,union(intersection(sK0,sK1),difference(sK0,sK1))),sK0) ),
inference(resolution,[],[f44,f46]) ).
fof(f46,plain,
! [X0,X1] :
( sQ3_eqProxy(X0,X1)
| member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f28,f43]) ).
fof(f28,plain,
! [X0,X1] :
( X0 = X1
| member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET608+3 : TPTP v8.2.0. Released v2.2.0.
% 0.00/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.30 % Computer : n012.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 11:58:38 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a FOF_THM_RFO_SEQ problem
% 0.09/0.30 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.70 % (9510)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.46/0.70 % (9508)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.46/0.70 % (9511)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.46/0.70 % (9509)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.46/0.70 % (9512)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.46/0.70 % (9513)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.46/0.70 % (9514)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.46/0.70 % (9515)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.46/0.70 % (9513)Refutation not found, incomplete strategy% (9513)------------------------------
% 0.46/0.70 % (9513)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.70 % (9513)Termination reason: Refutation not found, incomplete strategy
% 0.46/0.70
% 0.46/0.70 % (9513)Memory used [KB]: 956
% 0.46/0.70 % (9513)Time elapsed: 0.001 s
% 0.46/0.70 % (9513)Instructions burned: 2 (million)
% 0.46/0.70 % (9514)Refutation not found, incomplete strategy% (9514)------------------------------
% 0.46/0.70 % (9514)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.70 % (9511)Refutation not found, incomplete strategy% (9511)------------------------------
% 0.46/0.70 % (9511)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.70 % (9514)Termination reason: Refutation not found, incomplete strategy
% 0.46/0.70 % (9511)Termination reason: Refutation not found, incomplete strategy
% 0.46/0.70
% 0.46/0.70 % (9511)Memory used [KB]: 973
% 0.46/0.70 % (9511)Time elapsed: 0.002 s
% 0.46/0.70 % (9511)Instructions burned: 3 (million)
% 0.46/0.70
% 0.46/0.70 % (9514)Memory used [KB]: 955
% 0.46/0.70 % (9514)Time elapsed: 0.002 s
% 0.46/0.70 % (9514)Instructions burned: 3 (million)
% 0.46/0.70 % (9513)------------------------------
% 0.46/0.70 % (9513)------------------------------
% 0.46/0.70 % (9511)------------------------------
% 0.46/0.70 % (9511)------------------------------
% 0.46/0.70 % (9514)------------------------------
% 0.46/0.70 % (9514)------------------------------
% 0.46/0.70 % (9515)First to succeed.
% 0.46/0.70 % (9512)Also succeeded, but the first one will report.
% 0.46/0.70 % (9515)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-9485"
% 0.46/0.70 % (9508)Also succeeded, but the first one will report.
% 0.46/0.70 % (9515)Refutation found. Thanks to Tanya!
% 0.46/0.70 % SZS status Theorem for theBenchmark
% 0.46/0.70 % SZS output start Proof for theBenchmark
% See solution above
% 0.46/0.70 % (9515)------------------------------
% 0.46/0.70 % (9515)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.70 % (9515)Termination reason: Refutation
% 0.46/0.70
% 0.46/0.70 % (9515)Memory used [KB]: 996
% 0.46/0.70 % (9515)Time elapsed: 0.002 s
% 0.46/0.70 % (9515)Instructions burned: 5 (million)
% 0.46/0.70 % (9485)Success in time 0.39 s
% 0.46/0.70 % Vampire---4.8 exiting
%------------------------------------------------------------------------------