TSTP Solution File: SWC387+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC387+1 : TPTP v8.1.2. Released v2.4.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 : n006.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 : Wed May 1 04:01:51 EDT 2024
% Result : Theorem 0.58s 0.75s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 64 ( 6 unt; 0 def)
% Number of atoms : 377 ( 145 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 491 ( 178 ~; 152 |; 129 &)
% ( 8 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 82 ( 44 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f383,plain,
$false,
inference(avatar_sat_refutation,[],[f222,f227,f232,f241,f242,f258,f382]) ).
fof(f382,plain,
( ~ spl11_1
| ~ spl11_3
| ~ spl11_4 ),
inference(avatar_contradiction_clause,[],[f381]) ).
fof(f381,plain,
( $false
| ~ spl11_1
| ~ spl11_3
| ~ spl11_4 ),
inference(subsumption_resolution,[],[f380,f177]) ).
fof(f177,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.Twm3AWtMrQ/Vampire---4.8_26360',ax17) ).
fof(f380,plain,
( ~ ssList(nil)
| ~ spl11_1
| ~ spl11_3
| ~ spl11_4 ),
inference(subsumption_resolution,[],[f379,f231]) ).
fof(f231,plain,
( ssItem(sK4)
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f229,plain,
( spl11_4
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f379,plain,
( ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl11_1
| ~ spl11_3
| ~ spl11_4 ),
inference(subsumption_resolution,[],[f378,f217]) ).
fof(f217,plain,
( memberP(sK3,sK4)
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f215]) ).
fof(f215,plain,
( spl11_1
<=> memberP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f378,plain,
( ~ memberP(sK3,sK4)
| ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl11_3
| ~ spl11_4 ),
inference(subsumption_resolution,[],[f373,f287]) ).
fof(f287,plain,
( sK2 = app(sK2,nil)
| ~ spl11_3
| ~ spl11_4 ),
inference(subsumption_resolution,[],[f286,f177]) ).
fof(f286,plain,
( sK2 = app(sK2,nil)
| ~ ssList(nil)
| ~ spl11_3
| ~ spl11_4 ),
inference(subsumption_resolution,[],[f269,f231]) ).
fof(f269,plain,
( sK2 = app(sK2,nil)
| ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl11_3 ),
inference(superposition,[],[f194,f226]) ).
fof(f226,plain,
( sK2 = cons(sK4,nil)
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f224]) ).
fof(f224,plain,
( spl11_3
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f194,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Twm3AWtMrQ/Vampire---4.8_26360',ax81) ).
fof(f373,plain,
( sK2 != app(sK2,nil)
| ~ memberP(sK3,sK4)
| ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl11_3
| ~ spl11_4 ),
inference(superposition,[],[f201,f272]) ).
fof(f272,plain,
( ! [X0] :
( cons(sK4,X0) = app(sK2,X0)
| ~ ssList(X0) )
| ~ spl11_3
| ~ spl11_4 ),
inference(subsumption_resolution,[],[f259,f231]) ).
fof(f259,plain,
( ! [X0] :
( cons(sK4,X0) = app(sK2,X0)
| ~ ssItem(sK4)
| ~ ssList(X0) )
| ~ spl11_3 ),
inference(superposition,[],[f194,f226]) ).
fof(f201,plain,
! [X5] :
( cons(X5,nil) != sK2
| ~ memberP(sK3,X5)
| ~ ssItem(X5) ),
inference(definition_unfolding,[],[f156,f154,f155]) ).
fof(f155,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
( ( ~ neq(sK3,nil)
| ( memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ( nil != sK0
| nil != sK1 )
& ( nil != sK3
| nil = sK2 )
& ! [X5] :
( ~ memberP(sK1,X5)
| cons(X5,nil) != sK0
| ~ ssItem(X5) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f100,f129,f128,f127,f126,f125]) ).
fof(f125,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != sK0
| ~ ssItem(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != sK0
| ~ ssItem(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(sK1,X5)
| cons(X5,nil) != sK0
| ~ ssItem(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(sK1,X5)
| cons(X5,nil) != sK0
| ~ ssItem(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X3
| nil = sK2 )
& ! [X5] :
( ~ memberP(sK1,X5)
| cons(X5,nil) != sK0
| ~ ssItem(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X3
| nil = sK2 )
& ! [X5] :
( ~ memberP(sK1,X5)
| cons(X5,nil) != sK0
| ~ ssItem(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ neq(sK3,nil)
| ? [X4] :
( memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ( nil != sK3
| nil = sK2 )
& ! [X5] :
( ~ memberP(sK1,X5)
| cons(X5,nil) != sK0
| ~ ssItem(X5) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X4] :
( memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) )
=> ( memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X5] :
( memberP(X1,X5)
& cons(X5,nil) = X0
& ssItem(X5) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( memberP(X1,X4)
& cons(X4,nil) = X0
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( memberP(X1,X4)
& cons(X4,nil) = X0
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Twm3AWtMrQ/Vampire---4.8_26360',co1) ).
fof(f154,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f130]) ).
fof(f156,plain,
! [X5] :
( ~ memberP(sK1,X5)
| cons(X5,nil) != sK0
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f130]) ).
fof(f258,plain,
( spl11_2
| spl11_5 ),
inference(avatar_contradiction_clause,[],[f257]) ).
fof(f257,plain,
( $false
| spl11_2
| spl11_5 ),
inference(subsumption_resolution,[],[f256,f153]) ).
fof(f153,plain,
ssList(sK3),
inference(cnf_transformation,[],[f130]) ).
fof(f256,plain,
( ~ ssList(sK3)
| spl11_2
| spl11_5 ),
inference(subsumption_resolution,[],[f255,f177]) ).
fof(f255,plain,
( ~ ssList(nil)
| ~ ssList(sK3)
| spl11_2
| spl11_5 ),
inference(subsumption_resolution,[],[f244,f236]) ).
fof(f236,plain,
( nil != sK3
| spl11_5 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f234,plain,
( spl11_5
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f244,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3)
| spl11_2 ),
inference(resolution,[],[f221,f174]) ).
fof(f174,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Twm3AWtMrQ/Vampire---4.8_26360',ax15) ).
fof(f221,plain,
( ~ neq(sK3,nil)
| spl11_2 ),
inference(avatar_component_clause,[],[f219]) ).
fof(f219,plain,
( spl11_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f242,plain,
( spl11_6
| ~ spl11_5 ),
inference(avatar_split_clause,[],[f157,f234,f238]) ).
fof(f238,plain,
( spl11_6
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_6])]) ).
fof(f157,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f241,plain,
( ~ spl11_5
| ~ spl11_6 ),
inference(avatar_split_clause,[],[f200,f238,f234]) ).
fof(f200,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f158,f155,f154]) ).
fof(f158,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f130]) ).
fof(f232,plain,
( spl11_4
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f159,f219,f229]) ).
fof(f159,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f130]) ).
fof(f227,plain,
( spl11_3
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f160,f219,f224]) ).
fof(f160,plain,
( ~ neq(sK3,nil)
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f130]) ).
fof(f222,plain,
( spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f161,f219,f215]) ).
fof(f161,plain,
( ~ neq(sK3,nil)
| memberP(sK3,sK4) ),
inference(cnf_transformation,[],[f130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC387+1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/0.15 % 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.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 18:14:35 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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/tmp/tmp.Twm3AWtMrQ/Vampire---4.8_26360
% 0.58/0.75 % (26552)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.58/0.75 % (26554)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.58/0.75 % (26546)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 Vampire---4 for (2996ds/34Mi)
% 0.58/0.75 % (26549)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.58/0.75 % (26548)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 Vampire---4 for (2996ds/51Mi)
% 0.58/0.75 % (26550)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.58/0.75 % (26551)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 Vampire---4 for (2996ds/34Mi)
% 0.58/0.75 % (26553)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 Vampire---4 for (2996ds/83Mi)
% 0.58/0.75 % (26552)First to succeed.
% 0.58/0.75 % (26552)Refutation found. Thanks to Tanya!
% 0.58/0.75 % SZS status Theorem for Vampire---4
% 0.58/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75 % (26552)------------------------------
% 0.58/0.75 % (26552)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75 % (26552)Termination reason: Refutation
% 0.58/0.75
% 0.58/0.75 % (26552)Memory used [KB]: 1193
% 0.58/0.75 % (26552)Time elapsed: 0.005 s
% 0.58/0.75 % (26552)Instructions burned: 11 (million)
% 0.58/0.75 % (26552)------------------------------
% 0.58/0.75 % (26552)------------------------------
% 0.58/0.75 % (26527)Success in time 0.388 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------