TSTP Solution File: SWC254+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC254+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 : n027.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:00:52 EDT 2024
% Result : Theorem 0.56s 0.75s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 56 ( 6 unt; 0 def)
% Number of atoms : 280 ( 67 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 305 ( 81 ~; 74 |; 124 &)
% ( 6 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 112 ( 65 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f298,plain,
$false,
inference(avatar_sat_refutation,[],[f212,f214,f249,f268,f297]) ).
fof(f297,plain,
( ~ spl12_1
| ~ spl12_4 ),
inference(avatar_contradiction_clause,[],[f296]) ).
fof(f296,plain,
( $false
| ~ spl12_1
| ~ spl12_4 ),
inference(resolution,[],[f273,f207]) ).
fof(f207,plain,
( sP0(sK5,sK6,sK5,sK6)
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f205]) ).
fof(f205,plain,
( spl12_1
<=> sP0(sK5,sK6,sK5,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f273,plain,
( ! [X2,X0,X1] : ~ sP0(sK5,X0,X1,X2)
| ~ spl12_4 ),
inference(resolution,[],[f246,f152]) ).
fof(f152,plain,
! [X2,X3,X0,X1] :
( ~ singletonP(X0)
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
! [X0,X1,X2,X3] :
( ( ~ singletonP(X0)
& app(sK2(X1,X2),cons(sK1(X1,X2),nil)) = X1
& cons(sK1(X1,X2),nil) = X2
& ssList(sK2(X1,X2))
& ssItem(sK1(X1,X2))
& neq(X3,nil) )
| ~ sP0(X0,X1,X2,X3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f124,f126,f125]) ).
fof(f125,plain,
! [X1,X2] :
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( app(X5,cons(sK1(X1,X2),nil)) = X1
& cons(sK1(X1,X2),nil) = X2
& ssList(X5) )
& ssItem(sK1(X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
! [X1,X2] :
( ? [X5] :
( app(X5,cons(sK1(X1,X2),nil)) = X1
& cons(sK1(X1,X2),nil) = X2
& ssList(X5) )
=> ( app(sK2(X1,X2),cons(sK1(X1,X2),nil)) = X1
& cons(sK1(X1,X2),nil) = X2
& ssList(sK2(X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
! [X0,X1,X2,X3] :
( ( ~ singletonP(X0)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X3,nil) )
| ~ sP0(X0,X1,X2,X3) ),
inference(rectify,[],[f123]) ).
fof(f123,plain,
! [X0,X3,X2,X1] :
( ( ~ singletonP(X0)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) )
| ~ sP0(X0,X3,X2,X1) ),
inference(nnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0,X3,X2,X1] :
( ( ~ singletonP(X0)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) )
| ~ sP0(X0,X3,X2,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f246,plain,
( singletonP(sK5)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f244]) ).
fof(f244,plain,
( spl12_4
<=> singletonP(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f268,plain,
( ~ spl12_1
| spl12_3 ),
inference(avatar_contradiction_clause,[],[f267]) ).
fof(f267,plain,
( $false
| ~ spl12_1
| spl12_3 ),
inference(resolution,[],[f263,f207]) ).
fof(f263,plain,
( ! [X0,X1] : ~ sP0(X0,sK6,sK5,X1)
| spl12_3 ),
inference(resolution,[],[f242,f148]) ).
fof(f148,plain,
! [X2,X3,X0,X1] :
( ssItem(sK1(X1,X2))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f127]) ).
fof(f242,plain,
( ~ ssItem(sK1(sK6,sK5))
| spl12_3 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f240,plain,
( spl12_3
<=> ssItem(sK1(sK6,sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f249,plain,
( spl12_4
| ~ spl12_3
| ~ spl12_1 ),
inference(avatar_split_clause,[],[f248,f205,f240,f244]) ).
fof(f248,plain,
( ~ ssItem(sK1(sK6,sK5))
| singletonP(sK5)
| ~ spl12_1 ),
inference(subsumption_resolution,[],[f235,f155]) ).
fof(f155,plain,
ssList(sK5),
inference(cnf_transformation,[],[f132]) ).
fof(f132,plain,
( ( ( ~ neq(sK6,nil)
& neq(sK4,nil) )
| sP0(sK3,sK6,sK5,sK4) )
& sK3 = sK5
& sK4 = sK6
& ssList(sK6)
& ssList(sK5)
& ssList(sK4)
& ssList(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f122,f131,f130,f129,f128]) ).
fof(f128,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X0,X3,X2,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(sK3,X3,X2,X1) )
& sK3 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(sK3,X3,X2,X1) )
& sK3 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(sK3,X3,X2,sK4) )
& sK3 = X2
& sK4 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(sK3,X3,X2,sK4) )
& sK3 = X2
& sK4 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(sK3,X3,sK5,sK4) )
& sK3 = sK5
& sK4 = X3
& ssList(X3) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK4,nil) )
| sP0(sK3,X3,sK5,sK4) )
& sK3 = sK5
& sK4 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK6,nil)
& neq(sK4,nil) )
| sP0(sK3,sK6,sK5,sK4) )
& sK3 = sK5
& sK4 = sK6
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X0,X3,X2,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f121]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ singletonP(X0)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ singletonP(X0)
& ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( singletonP(X0)
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| cons(X4,nil) != X2 ) ) )
| ~ neq(X1,nil) ) )
| 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)
| ~ neq(X1,nil) )
& ( singletonP(X0)
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| cons(X4,nil) != X2 ) ) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3M6v9456DP/Vampire---4.8_1930',co1) ).
fof(f235,plain,
( ~ ssList(sK5)
| ~ ssItem(sK1(sK6,sK5))
| singletonP(sK5)
| ~ spl12_1 ),
inference(superposition,[],[f200,f233]) ).
fof(f233,plain,
( sK5 = cons(sK1(sK6,sK5),nil)
| ~ spl12_1 ),
inference(resolution,[],[f150,f207]) ).
fof(f150,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| cons(sK1(X1,X2),nil) = X2 ),
inference(cnf_transformation,[],[f127]) ).
fof(f200,plain,
! [X1] :
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(equality_resolution,[],[f191]) ).
fof(f191,plain,
! [X0,X1] :
( singletonP(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK11(X0),nil) = X0
& ssItem(sK11(X0)) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f144,f145]) ).
fof(f145,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK11(X0),nil) = X0
& ssItem(sK11(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f143]) ).
fof(f143,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3M6v9456DP/Vampire---4.8_1930',ax4) ).
fof(f214,plain,
spl12_2,
inference(avatar_split_clause,[],[f213,f209]) ).
fof(f209,plain,
( spl12_2
<=> neq(sK6,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f213,plain,
neq(sK6,nil),
inference(subsumption_resolution,[],[f193,f147]) ).
fof(f147,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| neq(X3,nil) ),
inference(cnf_transformation,[],[f127]) ).
fof(f193,plain,
( neq(sK6,nil)
| sP0(sK5,sK6,sK5,sK6) ),
inference(definition_unfolding,[],[f159,f157,f158,f157]) ).
fof(f158,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f132]) ).
fof(f157,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f132]) ).
fof(f159,plain,
( neq(sK4,nil)
| sP0(sK3,sK6,sK5,sK4) ),
inference(cnf_transformation,[],[f132]) ).
fof(f212,plain,
( spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f192,f209,f205]) ).
fof(f192,plain,
( ~ neq(sK6,nil)
| sP0(sK5,sK6,sK5,sK6) ),
inference(definition_unfolding,[],[f160,f158,f157]) ).
fof(f160,plain,
( ~ neq(sK6,nil)
| sP0(sK3,sK6,sK5,sK4) ),
inference(cnf_transformation,[],[f132]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC254+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % 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 : n027.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.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 18:46:18 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35 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.3M6v9456DP/Vampire---4.8_1930
% 0.56/0.74 % (2137)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.56/0.74 % (2139)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.56/0.74 % (2126)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.56/0.74 % (2128)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.56/0.74 % (2136)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.56/0.74 % (2134)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.56/0.74 % (2127)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.56/0.74 % (2138)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.56/0.74 % (2139)Refutation not found, incomplete strategy% (2139)------------------------------
% 0.56/0.74 % (2139)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.74 % (2139)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74
% 0.56/0.74 % (2139)Memory used [KB]: 1146
% 0.56/0.74 % (2139)Time elapsed: 0.002 s
% 0.56/0.74 % (2139)Instructions burned: 4 (million)
% 0.56/0.74 % (2139)------------------------------
% 0.56/0.74 % (2139)------------------------------
% 0.56/0.74 % (2137)Refutation not found, incomplete strategy% (2137)------------------------------
% 0.56/0.74 % (2137)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.74 % (2137)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74
% 0.56/0.74 % (2137)Memory used [KB]: 1143
% 0.56/0.74 % (2137)Time elapsed: 0.003 s
% 0.56/0.74 % (2137)Instructions burned: 4 (million)
% 0.56/0.74 % (2137)------------------------------
% 0.56/0.74 % (2137)------------------------------
% 0.56/0.75 % (2144)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.56/0.75 % (2145)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.56/0.75 % (2128)First to succeed.
% 0.56/0.75 % (2127)Also succeeded, but the first one will report.
% 0.56/0.75 % (2128)Refutation found. Thanks to Tanya!
% 0.56/0.75 % SZS status Theorem for Vampire---4
% 0.56/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.75 % (2128)------------------------------
% 0.56/0.75 % (2128)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.75 % (2128)Termination reason: Refutation
% 0.56/0.75
% 0.56/0.75 % (2128)Memory used [KB]: 1176
% 0.56/0.75 % (2128)Time elapsed: 0.008 s
% 0.56/0.75 % (2128)Instructions burned: 10 (million)
% 0.56/0.75 % (2128)------------------------------
% 0.56/0.75 % (2128)------------------------------
% 0.56/0.75 % (2086)Success in time 0.386 s
% 0.56/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------