TSTP Solution File: SET722+4 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET722+4 : TPTP v8.2.0. Bugfixed v2.2.1.
% 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 : n005.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:58 EDT 2024

% Result   : Theorem 0.61s 0.77s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   45 (   6 unt;   0 def)
%            Number of atoms       :  189 (   0 equ)
%            Maximal formula atoms :   10 (   4 avg)
%            Number of connectives :  223 (  79   ~;  66   |;  60   &)
%                                         (   7 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-5 aty)
%            Number of variables   :  176 ( 145   !;  31   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f94,plain,
    $false,
    inference(subsumption_resolution,[],[f93,f78]) ).

fof(f78,plain,
    member(sK7(sK1,sK3,sK4),sK4),
    inference(resolution,[],[f59,f69]) ).

fof(f69,plain,
    ! [X2,X0,X1] :
      ( surjective(X0,X1,X2)
      | member(sK7(X0,X1,X2),X2) ),
    inference(cnf_transformation,[],[f55]) ).

fof(f55,plain,
    ! [X0,X1,X2] :
      ( ( surjective(X0,X1,X2)
        | ( ! [X4] :
              ( ~ apply(X0,X4,sK7(X0,X1,X2))
              | ~ member(X4,X1) )
          & member(sK7(X0,X1,X2),X2) ) )
      & ( ! [X5] :
            ( ( apply(X0,sK8(X0,X1,X5),X5)
              & member(sK8(X0,X1,X5),X1) )
            | ~ member(X5,X2) )
        | ~ surjective(X0,X1,X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f52,f54,f53]) ).

fof(f53,plain,
    ! [X0,X1,X2] :
      ( ? [X3] :
          ( ! [X4] :
              ( ~ apply(X0,X4,X3)
              | ~ member(X4,X1) )
          & member(X3,X2) )
     => ( ! [X4] :
            ( ~ apply(X0,X4,sK7(X0,X1,X2))
            | ~ member(X4,X1) )
        & member(sK7(X0,X1,X2),X2) ) ),
    introduced(choice_axiom,[]) ).

fof(f54,plain,
    ! [X0,X1,X5] :
      ( ? [X6] :
          ( apply(X0,X6,X5)
          & member(X6,X1) )
     => ( apply(X0,sK8(X0,X1,X5),X5)
        & member(sK8(X0,X1,X5),X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f52,plain,
    ! [X0,X1,X2] :
      ( ( surjective(X0,X1,X2)
        | ? [X3] :
            ( ! [X4] :
                ( ~ apply(X0,X4,X3)
                | ~ member(X4,X1) )
            & member(X3,X2) ) )
      & ( ! [X5] :
            ( ? [X6] :
                ( apply(X0,X6,X5)
                & member(X6,X1) )
            | ~ member(X5,X2) )
        | ~ surjective(X0,X1,X2) ) ),
    inference(rectify,[],[f51]) ).

fof(f51,plain,
    ! [X0,X1,X2] :
      ( ( surjective(X0,X1,X2)
        | ? [X3] :
            ( ! [X4] :
                ( ~ apply(X0,X4,X3)
                | ~ member(X4,X1) )
            & member(X3,X2) ) )
      & ( ! [X3] :
            ( ? [X4] :
                ( apply(X0,X4,X3)
                & member(X4,X1) )
            | ~ member(X3,X2) )
        | ~ surjective(X0,X1,X2) ) ),
    inference(nnf_transformation,[],[f42]) ).

fof(f42,plain,
    ! [X0,X1,X2] :
      ( surjective(X0,X1,X2)
    <=> ! [X3] :
          ( ? [X4] :
              ( apply(X0,X4,X3)
              & member(X4,X1) )
          | ~ member(X3,X2) ) ),
    inference(ennf_transformation,[],[f34]) ).

fof(f34,plain,
    ! [X0,X1,X2] :
      ( surjective(X0,X1,X2)
    <=> ! [X3] :
          ( member(X3,X2)
         => ? [X4] :
              ( apply(X0,X4,X3)
              & member(X4,X1) ) ) ),
    inference(rectify,[],[f18]) ).

fof(f18,axiom,
    ! [X5,X0,X1] :
      ( surjective(X5,X0,X1)
    <=> ! [X4] :
          ( member(X4,X1)
         => ? [X3] :
              ( apply(X5,X3,X4)
              & member(X3,X0) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',surjective) ).

fof(f59,plain,
    ~ surjective(sK1,sK3,sK4),
    inference(cnf_transformation,[],[f44]) ).

fof(f44,plain,
    ( ~ surjective(sK1,sK3,sK4)
    & surjective(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,sK4)
    & maps(sK1,sK3,sK4)
    & maps(sK0,sK2,sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f37,f43]) ).

fof(f43,plain,
    ( ? [X0,X1,X2,X3,X4] :
        ( ~ surjective(X1,X3,X4)
        & surjective(compose_function(X1,X0,X2,X3,X4),X2,X4)
        & maps(X1,X3,X4)
        & maps(X0,X2,X3) )
   => ( ~ surjective(sK1,sK3,sK4)
      & surjective(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,sK4)
      & maps(sK1,sK3,sK4)
      & maps(sK0,sK2,sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f37,plain,
    ? [X0,X1,X2,X3,X4] :
      ( ~ surjective(X1,X3,X4)
      & surjective(compose_function(X1,X0,X2,X3,X4),X2,X4)
      & maps(X1,X3,X4)
      & maps(X0,X2,X3) ),
    inference(flattening,[],[f36]) ).

fof(f36,plain,
    ? [X0,X1,X2,X3,X4] :
      ( ~ surjective(X1,X3,X4)
      & surjective(compose_function(X1,X0,X2,X3,X4),X2,X4)
      & maps(X1,X3,X4)
      & maps(X0,X2,X3) ),
    inference(ennf_transformation,[],[f31]) ).

fof(f31,plain,
    ~ ! [X0,X1,X2,X3,X4] :
        ( ( surjective(compose_function(X1,X0,X2,X3,X4),X2,X4)
          & maps(X1,X3,X4)
          & maps(X0,X2,X3) )
       => surjective(X1,X3,X4) ),
    inference(rectify,[],[f30]) ).

fof(f30,negated_conjecture,
    ~ ! [X5,X9,X0,X1,X10] :
        ( ( surjective(compose_function(X9,X5,X0,X1,X10),X0,X10)
          & maps(X9,X1,X10)
          & maps(X5,X0,X1) )
       => surjective(X9,X1,X10) ),
    inference(negated_conjecture,[],[f29]) ).

fof(f29,conjecture,
    ! [X5,X9,X0,X1,X10] :
      ( ( surjective(compose_function(X9,X5,X0,X1,X10),X0,X10)
        & maps(X9,X1,X10)
        & maps(X5,X0,X1) )
     => surjective(X9,X1,X10) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thII13) ).

fof(f93,plain,
    ~ member(sK7(sK1,sK3,sK4),sK4),
    inference(resolution,[],[f92,f88]) ).

fof(f88,plain,
    ! [X0] :
      ( member(sK6(sK1,sK0,sK3,sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),X0),sK3)
      | ~ member(X0,sK4) ),
    inference(subsumption_resolution,[],[f87,f80]) ).

fof(f80,plain,
    ! [X0] :
      ( member(sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),sK2)
      | ~ member(X0,sK4) ),
    inference(resolution,[],[f58,f67]) ).

fof(f67,plain,
    ! [X2,X0,X1,X5] :
      ( ~ surjective(X0,X1,X2)
      | ~ member(X5,X2)
      | member(sK8(X0,X1,X5),X1) ),
    inference(cnf_transformation,[],[f55]) ).

fof(f58,plain,
    surjective(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,sK4),
    inference(cnf_transformation,[],[f44]) ).

fof(f87,plain,
    ! [X0] :
      ( ~ member(X0,sK4)
      | member(sK6(sK1,sK0,sK3,sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),X0),sK3)
      | ~ member(sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),sK2) ),
    inference(duplicate_literal_removal,[],[f82]) ).

fof(f82,plain,
    ! [X0] :
      ( ~ member(X0,sK4)
      | member(sK6(sK1,sK0,sK3,sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),X0),sK3)
      | ~ member(X0,sK4)
      | ~ member(sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),sK2) ),
    inference(resolution,[],[f81,f63]) ).

fof(f63,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
      | member(sK6(X0,X1,X3,X5,X6),X3)
      | ~ member(X6,X4)
      | ~ member(X5,X2) ),
    inference(cnf_transformation,[],[f50]) ).

fof(f50,plain,
    ! [X0,X1,X2,X3,X4,X5,X6] :
      ( ( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
          | ! [X7] :
              ( ~ apply(X0,X7,X6)
              | ~ apply(X1,X5,X7)
              | ~ member(X7,X3) ) )
        & ( ( apply(X0,sK6(X0,X1,X3,X5,X6),X6)
            & apply(X1,X5,sK6(X0,X1,X3,X5,X6))
            & member(sK6(X0,X1,X3,X5,X6),X3) )
          | ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6) ) )
      | ~ member(X6,X4)
      | ~ member(X5,X2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f48,f49]) ).

fof(f49,plain,
    ! [X0,X1,X3,X5,X6] :
      ( ? [X8] :
          ( apply(X0,X8,X6)
          & apply(X1,X5,X8)
          & member(X8,X3) )
     => ( apply(X0,sK6(X0,X1,X3,X5,X6),X6)
        & apply(X1,X5,sK6(X0,X1,X3,X5,X6))
        & member(sK6(X0,X1,X3,X5,X6),X3) ) ),
    introduced(choice_axiom,[]) ).

fof(f48,plain,
    ! [X0,X1,X2,X3,X4,X5,X6] :
      ( ( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
          | ! [X7] :
              ( ~ apply(X0,X7,X6)
              | ~ apply(X1,X5,X7)
              | ~ member(X7,X3) ) )
        & ( ? [X8] :
              ( apply(X0,X8,X6)
              & apply(X1,X5,X8)
              & member(X8,X3) )
          | ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6) ) )
      | ~ member(X6,X4)
      | ~ member(X5,X2) ),
    inference(rectify,[],[f47]) ).

fof(f47,plain,
    ! [X0,X1,X2,X3,X4,X5,X6] :
      ( ( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
          | ! [X7] :
              ( ~ apply(X0,X7,X6)
              | ~ apply(X1,X5,X7)
              | ~ member(X7,X3) ) )
        & ( ? [X7] :
              ( apply(X0,X7,X6)
              & apply(X1,X5,X7)
              & member(X7,X3) )
          | ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6) ) )
      | ~ member(X6,X4)
      | ~ member(X5,X2) ),
    inference(nnf_transformation,[],[f41]) ).

fof(f41,plain,
    ! [X0,X1,X2,X3,X4,X5,X6] :
      ( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
      <=> ? [X7] :
            ( apply(X0,X7,X6)
            & apply(X1,X5,X7)
            & member(X7,X3) ) )
      | ~ member(X6,X4)
      | ~ member(X5,X2) ),
    inference(flattening,[],[f40]) ).

fof(f40,plain,
    ! [X0,X1,X2,X3,X4,X5,X6] :
      ( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
      <=> ? [X7] :
            ( apply(X0,X7,X6)
            & apply(X1,X5,X7)
            & member(X7,X3) ) )
      | ~ member(X6,X4)
      | ~ member(X5,X2) ),
    inference(ennf_transformation,[],[f33]) ).

fof(f33,plain,
    ! [X0,X1,X2,X3,X4,X5,X6] :
      ( ( member(X6,X4)
        & member(X5,X2) )
     => ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
      <=> ? [X7] :
            ( apply(X0,X7,X6)
            & apply(X1,X5,X7)
            & member(X7,X3) ) ) ),
    inference(rectify,[],[f14]) ).

fof(f14,axiom,
    ! [X9,X5,X0,X1,X10,X2,X11] :
      ( ( member(X11,X10)
        & member(X2,X0) )
     => ( apply(compose_function(X9,X5,X0,X1,X10),X2,X11)
      <=> ? [X4] :
            ( apply(X9,X4,X11)
            & apply(X5,X2,X4)
            & member(X4,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compose_function) ).

fof(f81,plain,
    ! [X0] :
      ( apply(compose_function(sK1,sK0,sK2,sK3,sK4),sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),X0)
      | ~ member(X0,sK4) ),
    inference(resolution,[],[f58,f68]) ).

fof(f68,plain,
    ! [X2,X0,X1,X5] :
      ( ~ surjective(X0,X1,X2)
      | ~ member(X5,X2)
      | apply(X0,sK8(X0,X1,X5),X5) ),
    inference(cnf_transformation,[],[f55]) ).

fof(f92,plain,
    ~ member(sK6(sK1,sK0,sK3,sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,sK7(sK1,sK3,sK4)),sK7(sK1,sK3,sK4)),sK3),
    inference(subsumption_resolution,[],[f91,f78]) ).

fof(f91,plain,
    ( ~ member(sK7(sK1,sK3,sK4),sK4)
    | ~ member(sK6(sK1,sK0,sK3,sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,sK7(sK1,sK3,sK4)),sK7(sK1,sK3,sK4)),sK3) ),
    inference(resolution,[],[f90,f79]) ).

fof(f79,plain,
    ! [X0] :
      ( ~ apply(sK1,X0,sK7(sK1,sK3,sK4))
      | ~ member(X0,sK3) ),
    inference(resolution,[],[f59,f70]) ).

fof(f70,plain,
    ! [X2,X0,X1,X4] :
      ( surjective(X0,X1,X2)
      | ~ apply(X0,X4,sK7(X0,X1,X2))
      | ~ member(X4,X1) ),
    inference(cnf_transformation,[],[f55]) ).

fof(f90,plain,
    ! [X0] :
      ( apply(sK1,sK6(sK1,sK0,sK3,sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),X0),X0)
      | ~ member(X0,sK4) ),
    inference(subsumption_resolution,[],[f85,f80]) ).

fof(f85,plain,
    ! [X0] :
      ( ~ member(X0,sK4)
      | apply(sK1,sK6(sK1,sK0,sK3,sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),X0),X0)
      | ~ member(sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),sK2) ),
    inference(duplicate_literal_removal,[],[f84]) ).

fof(f84,plain,
    ! [X0] :
      ( ~ member(X0,sK4)
      | apply(sK1,sK6(sK1,sK0,sK3,sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),X0),X0)
      | ~ member(X0,sK4)
      | ~ member(sK8(compose_function(sK1,sK0,sK2,sK3,sK4),sK2,X0),sK2) ),
    inference(resolution,[],[f81,f65]) ).

fof(f65,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
      | apply(X0,sK6(X0,X1,X3,X5,X6),X6)
      | ~ member(X6,X4)
      | ~ member(X5,X2) ),
    inference(cnf_transformation,[],[f50]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SET722+4 : TPTP v8.2.0. Bugfixed v2.2.1.
% 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.13/0.36  % Computer : n005.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit   : 300
% 0.13/0.36  % WCLimit    : 300
% 0.13/0.36  % DateTime   : Mon May 20 11:52:08 EDT 2024
% 0.13/0.36  % CPUTime    : 
% 0.13/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.13/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/benchmark/theBenchmark.p
% 0.61/0.77  % (15396)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.61/0.77  % (15395)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.61/0.77  % (15394)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.61/0.77  % (15399)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.61/0.77  % (15397)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.61/0.77  % (15398)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.61/0.77  % (15393)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.61/0.77  % (15392)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.61/0.77  % (15397)Refutation not found, incomplete strategy% (15397)------------------------------
% 0.61/0.77  % (15397)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77  % (15397)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77  
% 0.61/0.77  % (15397)Memory used [KB]: 1062
% 0.61/0.77  % (15397)Time elapsed: 0.003 s
% 0.61/0.77  % (15397)Instructions burned: 3 (million)
% 0.61/0.77  % (15399)First to succeed.
% 0.61/0.77  % (15397)------------------------------
% 0.61/0.77  % (15397)------------------------------
% 0.61/0.77  % (15396)Refutation not found, incomplete strategy% (15396)------------------------------
% 0.61/0.77  % (15396)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77  % (15396)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77  
% 0.61/0.77  % (15396)Memory used [KB]: 1150
% 0.61/0.77  % (15396)Time elapsed: 0.003 s
% 0.61/0.77  % (15396)Instructions burned: 5 (million)
% 0.61/0.77  % (15396)------------------------------
% 0.61/0.77  % (15396)------------------------------
% 0.61/0.77  % (15399)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15391"
% 0.61/0.77  % (15395)Also succeeded, but the first one will report.
% 0.61/0.77  % (15399)Refutation found. Thanks to Tanya!
% 0.61/0.77  % SZS status Theorem for theBenchmark
% 0.61/0.77  % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.77  % (15399)------------------------------
% 0.61/0.77  % (15399)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77  % (15399)Termination reason: Refutation
% 0.61/0.77  
% 0.61/0.77  % (15399)Memory used [KB]: 1091
% 0.61/0.77  % (15399)Time elapsed: 0.004 s
% 0.61/0.77  % (15399)Instructions burned: 6 (million)
% 0.61/0.77  % (15391)Success in time 0.399 s
% 0.61/0.77  % Vampire---4.8 exiting
%------------------------------------------------------------------------------