TSTP Solution File: SET794+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET794+4 : TPTP v8.2.0. Released v3.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 : n009.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:13:19 EDT 2024
% Result : Theorem 0.53s 0.70s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 74 ( 10 unt; 0 def)
% Number of atoms : 299 ( 18 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 342 ( 117 ~; 120 |; 60 &)
% ( 13 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 7 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 153 ( 141 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f112,plain,
$false,
inference(avatar_sat_refutation,[],[f81,f83,f91,f93,f101,f109,f111]) ).
fof(f111,plain,
spl4_6,
inference(avatar_contradiction_clause,[],[f110]) ).
fof(f110,plain,
( $false
| spl4_6 ),
inference(resolution,[],[f108,f50]) ).
fof(f50,plain,
total_order(sK1,sK2),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
( ~ least(sK3,sK1,sK2)
& min(sK3,sK1,sK2)
& total_order(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f36,f39]) ).
fof(f39,plain,
( ? [X0,X1,X2] :
( ~ least(X2,X0,X1)
& min(X2,X0,X1)
& total_order(X0,X1) )
=> ( ~ least(sK3,sK1,sK2)
& min(sK3,sK1,sK2)
& total_order(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
? [X0,X1,X2] :
( ~ least(X2,X0,X1)
& min(X2,X0,X1)
& total_order(X0,X1) ),
inference(flattening,[],[f35]) ).
fof(f35,plain,
? [X0,X1,X2] :
( ~ least(X2,X0,X1)
& min(X2,X0,X1)
& total_order(X0,X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,plain,
~ ! [X0,X1,X2] :
( ( min(X2,X0,X1)
& total_order(X0,X1) )
=> least(X2,X0,X1) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X5] :
( ( min(X5,X0,X1)
& total_order(X0,X1) )
=> least(X5,X0,X1) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X1,X5] :
( ( min(X5,X0,X1)
& total_order(X0,X1) )
=> least(X5,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV6) ).
fof(f108,plain,
( ~ total_order(sK1,sK2)
| spl4_6 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f106,plain,
( spl4_6
<=> total_order(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
fof(f109,plain,
( spl4_2
| ~ spl4_6
| ~ spl4_1
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f104,f79,f67,f106,f71]) ).
fof(f71,plain,
( spl4_2
<=> least(sK3,sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f67,plain,
( spl4_1
<=> member(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f79,plain,
( spl4_4
<=> ! [X0] :
( ~ member(sK3,X0)
| ~ member(sK0(sK1,sK2,sK3),X0)
| ~ total_order(sK1,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f104,plain,
( ~ member(sK3,sK2)
| ~ total_order(sK1,sK2)
| least(sK3,sK1,sK2)
| ~ spl4_4 ),
inference(duplicate_literal_removal,[],[f103]) ).
fof(f103,plain,
( ~ member(sK3,sK2)
| ~ total_order(sK1,sK2)
| least(sK3,sK1,sK2)
| ~ member(sK3,sK2)
| ~ spl4_4 ),
inference(resolution,[],[f80,f46]) ).
fof(f46,plain,
! [X2,X0,X1] :
( member(sK0(X0,X1,X2),X1)
| least(X2,X0,X1)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1,X2] :
( least(X2,X0,X1)
| ( ~ apply(X0,X2,sK0(X0,X1,X2))
& member(sK0(X0,X1,X2),X1) )
| ~ member(X2,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f32,f37]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) )
=> ( ~ apply(X0,X2,sK0(X0,X1,X2))
& member(sK0(X0,X1,X2),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0,X1,X2] :
( least(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) )
| ~ member(X2,X1) ),
inference(flattening,[],[f31]) ).
fof(f31,plain,
! [X0,X1,X2] :
( least(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) )
| ~ member(X2,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( member(X3,X1)
=> apply(X0,X2,X3) )
& member(X2,X1) )
=> least(X2,X0,X1) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( least(X2,X0,X1)
<=> ( ! [X3] :
( member(X3,X1)
=> apply(X0,X2,X3) )
& member(X2,X1) ) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X5] :
( least(X5,X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X5,X2) )
& member(X5,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',least) ).
fof(f80,plain,
( ! [X0] :
( ~ member(sK0(sK1,sK2,sK3),X0)
| ~ member(sK3,X0)
| ~ total_order(sK1,X0) )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f101,plain,
spl4_5,
inference(avatar_contradiction_clause,[],[f100]) ).
fof(f100,plain,
( $false
| spl4_5 ),
inference(resolution,[],[f99,f53]) ).
fof(f53,plain,
order(sK1,sK2),
inference(resolution,[],[f44,f50]) ).
fof(f44,plain,
! [X0,X1] :
( ~ total_order(X0,X1)
| order(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( ( ! [X2,X3] :
( apply(X0,X3,X2)
| apply(X0,X2,X3)
| ~ member(X3,X1)
| ~ member(X2,X1) )
& order(X0,X1) )
| ~ total_order(X0,X1) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( ! [X2,X3] :
( apply(X0,X3,X2)
| apply(X0,X2,X3)
| ~ member(X3,X1)
| ~ member(X2,X1) )
& order(X0,X1) )
| ~ total_order(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( total_order(X0,X1)
=> ( ! [X2,X3] :
( ( member(X3,X1)
& member(X2,X1) )
=> ( apply(X0,X3,X2)
| apply(X0,X2,X3) ) )
& order(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( total_order(X0,X1)
<=> ( ! [X2,X3] :
( ( member(X3,X1)
& member(X2,X1) )
=> ( apply(X0,X3,X2)
| apply(X0,X2,X3) ) )
& order(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',total_order) ).
fof(f99,plain,
( ~ order(sK1,sK2)
| spl4_5 ),
inference(resolution,[],[f95,f54]) ).
fof(f54,plain,
member(sK3,sK2),
inference(resolution,[],[f48,f51]) ).
fof(f51,plain,
min(sK3,sK1,sK2),
inference(cnf_transformation,[],[f40]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ~ min(X2,X0,X1)
| member(X2,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( X2 = X3
| ~ apply(X0,X3,X2)
| ~ member(X3,X1) )
& member(X2,X1) )
| ~ min(X2,X0,X1) ),
inference(flattening,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( X2 = X3
| ~ apply(X0,X3,X2)
| ~ member(X3,X1) )
& member(X2,X1) )
| ~ min(X2,X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1,X2] :
( min(X2,X0,X1)
=> ( ! [X3] :
( ( apply(X0,X3,X2)
& member(X3,X1) )
=> X2 = X3 )
& member(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2] :
( min(X2,X0,X1)
<=> ( ! [X3] :
( ( apply(X0,X3,X2)
& member(X3,X1) )
=> X2 = X3 )
& member(X2,X1) ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X0,X1,X5] :
( min(X5,X0,X1)
<=> ( ! [X2] :
( ( apply(X0,X2,X5)
& member(X2,X1) )
=> X2 = X5 )
& member(X5,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',min) ).
fof(f95,plain,
( ! [X0] :
( ~ member(sK3,X0)
| ~ order(sK1,X0) )
| spl4_5 ),
inference(resolution,[],[f90,f41]) ).
fof(f41,plain,
! [X0,X1,X7] :
( apply(X0,X7,X7)
| ~ member(X7,X1)
| ~ order(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( ! [X2,X3,X4] :
( apply(X0,X2,X4)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X2,X3)
| ~ member(X4,X1)
| ~ member(X3,X1)
| ~ member(X2,X1) )
& ! [X5,X6] :
( X5 = X6
| ~ apply(X0,X6,X5)
| ~ apply(X0,X5,X6)
| ~ member(X6,X1)
| ~ member(X5,X1) )
& ! [X7] :
( apply(X0,X7,X7)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( ! [X2,X3,X4] :
( apply(X0,X2,X4)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X2,X3)
| ~ member(X4,X1)
| ~ member(X3,X1)
| ~ member(X2,X1) )
& ! [X5,X6] :
( X5 = X6
| ~ apply(X0,X6,X5)
| ~ apply(X0,X5,X6)
| ~ member(X6,X1)
| ~ member(X5,X1) )
& ! [X7] :
( apply(X0,X7,X7)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( order(X0,X1)
=> ( ! [X2,X3,X4] :
( ( member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) )
& ! [X5,X6] :
( ( member(X6,X1)
& member(X5,X1) )
=> ( ( apply(X0,X6,X5)
& apply(X0,X5,X6) )
=> X5 = X6 ) )
& ! [X7] :
( member(X7,X1)
=> apply(X0,X7,X7) ) ) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( order(X0,X1)
<=> ( ! [X2,X3,X4] :
( ( member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) )
& ! [X5,X6] :
( ( member(X6,X1)
& member(X5,X1) )
=> ( ( apply(X0,X6,X5)
& apply(X0,X5,X6) )
=> X5 = X6 ) )
& ! [X7] :
( member(X7,X1)
=> apply(X0,X7,X7) ) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( order(X0,X1)
<=> ( ! [X2,X3,X4] :
( ( member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) )
& ! [X2,X3] :
( ( member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X2)
& apply(X0,X2,X3) )
=> X2 = X3 ) )
& ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f90,plain,
( ~ apply(sK1,sK3,sK3)
| spl4_5 ),
inference(avatar_component_clause,[],[f88]) ).
fof(f88,plain,
( spl4_5
<=> apply(sK1,sK3,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
fof(f93,plain,
spl4_1,
inference(avatar_contradiction_clause,[],[f92]) ).
fof(f92,plain,
( $false
| spl4_1 ),
inference(resolution,[],[f69,f54]) ).
fof(f69,plain,
( ~ member(sK3,sK2)
| spl4_1 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f91,plain,
( ~ spl4_1
| spl4_2
| ~ spl4_5
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f85,f75,f88,f71,f67]) ).
fof(f75,plain,
( spl4_3
<=> sK3 = sK0(sK1,sK2,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f85,plain,
( ~ apply(sK1,sK3,sK3)
| least(sK3,sK1,sK2)
| ~ member(sK3,sK2)
| ~ spl4_3 ),
inference(superposition,[],[f47,f77]) ).
fof(f77,plain,
( sK3 = sK0(sK1,sK2,sK3)
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ apply(X0,X2,sK0(X0,X1,X2))
| least(X2,X0,X1)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f83,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f82]) ).
fof(f82,plain,
( $false
| ~ spl4_2 ),
inference(resolution,[],[f73,f52]) ).
fof(f52,plain,
~ least(sK3,sK1,sK2),
inference(cnf_transformation,[],[f40]) ).
fof(f73,plain,
( least(sK3,sK1,sK2)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f81,plain,
( ~ spl4_1
| spl4_2
| spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f65,f79,f75,f71,f67]) ).
fof(f65,plain,
! [X0] :
( ~ member(sK3,X0)
| ~ total_order(sK1,X0)
| ~ member(sK0(sK1,sK2,sK3),X0)
| sK3 = sK0(sK1,sK2,sK3)
| least(sK3,sK1,sK2)
| ~ member(sK3,sK2) ),
inference(duplicate_literal_removal,[],[f64]) ).
fof(f64,plain,
! [X0] :
( ~ member(sK3,X0)
| ~ total_order(sK1,X0)
| ~ member(sK0(sK1,sK2,sK3),X0)
| sK3 = sK0(sK1,sK2,sK3)
| least(sK3,sK1,sK2)
| ~ member(sK3,sK2)
| least(sK3,sK1,sK2)
| ~ member(sK3,sK2) ),
inference(resolution,[],[f62,f46]) ).
fof(f62,plain,
! [X0,X1] :
( ~ member(sK0(sK1,X0,sK3),sK2)
| ~ member(sK3,X1)
| ~ total_order(sK1,X1)
| ~ member(sK0(sK1,X0,sK3),X1)
| sK3 = sK0(sK1,X0,sK3)
| least(sK3,sK1,X0)
| ~ member(sK3,X0) ),
inference(resolution,[],[f58,f47]) ).
fof(f58,plain,
! [X0,X1] :
( apply(sK1,sK3,X0)
| ~ member(X0,X1)
| ~ member(sK3,X1)
| ~ total_order(sK1,X1)
| ~ member(X0,sK2)
| sK3 = X0 ),
inference(resolution,[],[f45,f55]) ).
fof(f55,plain,
! [X0] :
( ~ apply(sK1,X0,sK3)
| ~ member(X0,sK2)
| sK3 = X0 ),
inference(resolution,[],[f49,f51]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( ~ min(X2,X0,X1)
| ~ apply(X0,X3,X2)
| ~ member(X3,X1)
| X2 = X3 ),
inference(cnf_transformation,[],[f34]) ).
fof(f45,plain,
! [X2,X3,X0,X1] :
( apply(X0,X3,X2)
| apply(X0,X2,X3)
| ~ member(X3,X1)
| ~ member(X2,X1)
| ~ total_order(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09 % Problem : SET794+4 : TPTP v8.2.0. Released v3.2.0.
% 0.09/0.11 % 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.10/0.30 % Computer : n009.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 13:35:53 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31 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.53/0.70 % (27252)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.53/0.70 % (27256)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.53/0.70 % (27254)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.53/0.70 % (27257)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.53/0.70 % (27258)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.53/0.70 % (27254)Also succeeded, but the first one will report.
% 0.53/0.70 % (27252)First to succeed.
% 0.53/0.70 % (27251)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.53/0.70 % (27252)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27250"
% 0.53/0.70 % (27255)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.53/0.70 % (27252)Refutation found. Thanks to Tanya!
% 0.53/0.70 % SZS status Theorem for theBenchmark
% 0.53/0.70 % SZS output start Proof for theBenchmark
% See solution above
% 0.53/0.70 % (27252)------------------------------
% 0.53/0.70 % (27252)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.70 % (27252)Termination reason: Refutation
% 0.53/0.70
% 0.53/0.70 % (27252)Memory used [KB]: 1091
% 0.53/0.70 % (27252)Time elapsed: 0.004 s
% 0.53/0.70 % (27252)Instructions burned: 6 (million)
% 0.53/0.70 % (27250)Success in time 0.391 s
% 0.53/0.70 % Vampire---4.8 exiting
%------------------------------------------------------------------------------