↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL210-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 11:51:34 AM UTC 2026

% Result   : Unsatisfiable 7.19s 1.98s
% Output   : Refutation 7.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   60 (  44 unt;   6 def)
%            Number of atoms       :   80 (  13 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   43 (  23   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   69 (  69   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).

fof(f9,negated_conjecture,
    ~ theorem(implies(not(p),implies(or(p,q),q))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f10,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f11,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f12,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f13,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f14,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f16,plain,
    ~ theorem(or(not(not(p)),or(not(or(p,q)),q))),
    inference(definition_unfolding,[],[f9,f6,f6]) ).

fof(f17,definition,
    sF0 = not(p),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f18,plain,
    not(p) = sF0,
    inference(reorient_equations,[],[f17]) ).

fof(f19,definition,
    sF1 = not(sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f20,plain,
    not(sF0) = sF1,
    inference(reorient_equations,[],[f19]) ).

fof(f21,definition,
    sF2 = or(p,q),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f22,plain,
    or(p,q) = sF2,
    inference(reorient_equations,[],[f21]) ).

fof(f23,definition,
    sF3 = not(sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f24,plain,
    not(sF2) = sF3,
    inference(reorient_equations,[],[f23]) ).

fof(f25,definition,
    sF4 = or(sF3,q),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f26,plain,
    or(sF3,q) = sF4,
    inference(reorient_equations,[],[f25]) ).

fof(f27,definition,
    sF5 = or(sF1,sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f28,plain,
    or(sF1,sF4) = sF5,
    inference(reorient_equations,[],[f27]) ).

fof(f29,plain,
    ~ theorem(sF5),
    inference(definition_folding,[],[f16,f28,f26,f24,f22,f20,f18]) ).

fof(f30,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[],[f14,f7]) ).

fof(f51,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f15,f30]) ).

fof(f79,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f11,f7]) ).

fof(f93,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f12,f7]) ).

fof(f101,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f93,f15]) ).

fof(f109,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f13,f7]) ).

fof(f116,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f10,f7]) ).

fof(f117,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f116,f15]) ).

fof(f134,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f51,f15]) ).

fof(f144,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f134,f93]) ).

fof(f146,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f134,f79]) ).

fof(f147,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f134,f116]) ).

fof(f148,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF0,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,p)) ),
    inference(superposition,[],[f134,f18]) ).

fof(f154,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f144,f79]) ).

fof(f161,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f147,f79]) ).

fof(f179,plain,
    theorem(or(sF3,sF2)),
    inference(superposition,[],[f161,f24]) ).

fof(f193,plain,
    ! [X0] : theorem(or(sF1,or(sF0,X0))),
    inference(superposition,[],[f154,f20]) ).

fof(f208,plain,
    ! [X0] : theorem(or(not(or(sF1,or(X0,sF4))),or(X0,sF5))),
    inference(superposition,[],[f109,f28]) ).

fof(f210,plain,
    ! [X0] : theorem(or(not(or(sF3,or(X0,q))),or(X0,sF4))),
    inference(superposition,[],[f109,f26]) ).

fof(f227,plain,
    ! [X0] :
      ( ~ theorem(or(sF3,or(X0,q)))
      | theorem(or(X0,sF4)) ),
    inference(resolution,[],[f210,f15]) ).

fof(f237,plain,
    ! [X0] :
      ( ~ theorem(or(sF1,or(X0,sF4)))
      | theorem(or(X0,sF5)) ),
    inference(resolution,[],[f208,f15]) ).

fof(f247,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF4))
      | theorem(or(X0,sF5)) ),
    inference(superposition,[],[f146,f28]) ).

fof(f468,plain,
    ( ~ theorem(or(sF3,sF2))
    | theorem(or(p,sF4)) ),
    inference(superposition,[],[f227,f22]) ).

fof(f470,plain,
    theorem(or(p,sF4)),
    inference(forward_subsumption_resolution,[],[f468,f179]) ).

fof(f473,plain,
    theorem(or(p,sF5)),
    inference(resolution,[],[f470,f247]) ).

fof(f475,plain,
    theorem(or(sF5,p)),
    inference(resolution,[],[f473,f101]) ).

fof(f503,plain,
    theorem(or(sF0,sF5)),
    inference(resolution,[],[f193,f237]) ).

fof(f537,plain,
    ! [X0] :
      ( ~ theorem(or(X0,p))
      | theorem(or(X0,sF5)) ),
    inference(resolution,[],[f148,f503]) ).

fof(f547,plain,
    theorem(or(sF5,sF5)),
    inference(resolution,[],[f537,f475]) ).

fof(f549,plain,
    theorem(sF5),
    inference(resolution,[],[f547,f117]) ).

fof(f551,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f549,f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL210-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n026.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 15:29:41 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42  Running first-order theorem proving
% 0.15/0.42  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.27/1.82  % (2999961)Input is clausal, will run a generic CNF schedule.
% 4.27/1.82  % (2999988)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=174893196:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.27/1.82  % (2999990)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3515119118:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.27/1.82  % (2999992)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2683602929:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.27/1.82  % (2999993)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2662255449:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.27/1.82  % (2999991)lrs+10_1_sil=8000:sp=occurrence:random_seed=3670334690:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.27/1.82  % (2999989)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=581159300:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.27/1.82  % (2999994)dis-21_1_sil=8000:lcm=predicate:random_seed=2895402330:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 4.27/1.82  % (2999992)Instruction limit reached! 
% 4.27/1.82  % (2999992)------------------------------
% 4.27/1.82  % (2999992)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.82  % (2999992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.82  % (2999992)CaDiCaL version: 2.1.3
% 4.27/1.82  % (2999992)Termination reason: Instruction limit
% 4.27/1.82  % (2999992)Termination phase: Saturation
% 4.27/1.82  % (2999992)Time elapsed: 0.094 s
% 4.27/1.82  % (2999992)Peak memory usage: 87 MB
% 4.27/1.82  % (2999992)Instructions burned: 115 (million)
% 4.27/1.82  % (2999991)Instruction limit reached! 
% 4.27/1.82  % (2999991)------------------------------
% 4.27/1.82  % (2999991)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.82  % (2999991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.82  % (2999991)CaDiCaL version: 2.1.3
% 4.27/1.82  % (2999991)Termination reason: Instruction limit
% 4.27/1.82  % (2999991)Termination phase: Saturation
% 4.27/1.82  % (2999991)Time elapsed: 0.112 s
% 4.27/1.82  % (2999991)Peak memory usage: 89 MB
% 4.27/1.82  % (2999991)Instructions burned: 107 (million)
% 4.27/1.82  % (2999994)Instruction limit reached! 
% 4.27/1.82  % (2999994)------------------------------
% 4.27/1.82  % (2999994)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.82  % (2999994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.82  % (2999994)CaDiCaL version: 2.1.3
% 4.27/1.82  % (2999994)Termination reason: Instruction limit
% 4.27/1.82  % (2999994)Termination phase: Saturation
% 4.27/1.82  % (2999994)Time elapsed: 0.094 s
% 4.27/1.82  % (2999994)Peak memory usage: 87 MB
% 4.27/1.82  % (2999994)Instructions burned: 117 (million)
% 4.27/1.82  % (2999993)Instruction limit reached! 
% 4.27/1.82  % (2999993)------------------------------
% 4.27/1.82  % (2999993)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.82  % (2999993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.82  % (2999993)CaDiCaL version: 2.1.3
% 4.27/1.82  % (2999993)Termination reason: Instruction limit
% 4.27/1.82  % (2999993)Termination phase: Saturation
% 4.27/1.82  % (2999993)Time elapsed: 0.190 s
% 4.27/1.82  % (2999993)Peak memory usage: 89 MB
% 4.27/1.82  % (2999993)Instructions burned: 180 (million)
% 4.27/1.82  % (3000016)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=4139680280:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 4.27/1.82  % (3000016)Refutation not found, incomplete strategy
% 4.27/1.82  % (3000016)------------------------------
% 4.27/1.82  % (3000016)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.27/1.82  % (3000016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.27/1.82  % (3000016)CaDiCaL version: 2.1.3
% 4.27/1.82  % (3000016)Termination reason: Refutation not found, incomplete strategy
% 4.27/1.82  % (3000016)Time elapsed: 0.002 s
% 4.27/1.82  % (3000016)Peak memory usage: 88 MB
% 4.27/1.82  % (3000017)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=729588433:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 7.19/1.98  % (3000017)Refutation not found, incomplete strategy
% 7.19/1.98  % (3000017)------------------------------
% 7.19/1.98  % (3000017)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.19/1.98  % (3000017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.98  % (3000017)CaDiCaL version: 2.1.3
% 7.19/1.98  % (3000017)Termination reason: Refutation not found, incomplete strategy
% 7.19/1.98  % (3000017)Time elapsed: 0.002 s
% 7.19/1.98  % (3000017)Peak memory usage: 87 MB
% 7.19/1.98  % (3000020)lrs+10_64_to=lpo:sil=8000:random_seed=239165064:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 7.19/1.98  % (3000018)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=252567312:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 7.19/1.98  % (3000018)Refutation not found, incomplete strategy
% 7.19/1.98  % (3000018)------------------------------
% 7.19/1.98  % (3000018)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.19/1.98  % (3000018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.98  % (3000018)CaDiCaL version: 2.1.3
% 7.19/1.98  % (3000018)Termination reason: Refutation not found, incomplete strategy
% 7.19/1.98  % (3000018)Time elapsed: 0.002 s
% 7.19/1.98  % (3000018)Peak memory usage: 88 MB
% 7.19/1.98  % (2999988)First to succeed.
% 7.19/1.98  % (2999988)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2999961"
% 7.19/1.98  % (3000020)Instruction limit reached! 
% 7.19/1.98  % (3000020)------------------------------
% 7.19/1.98  % (3000020)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.19/1.98  % (3000020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.98  % (3000020)CaDiCaL version: 2.1.3
% 7.19/1.98  % (3000020)Termination reason: Instruction limit
% 7.19/1.98  % (3000020)Termination phase: Saturation
% 7.19/1.98  % (3000020)Time elapsed: 0.122 s
% 7.19/1.98  % (3000020)Peak memory usage: 89 MB
% 7.19/1.98  % (3000020)Instructions burned: 126 (million)
% 7.19/1.98  % (3000016)------------------------------
% 7.19/1.98  % (3000016)------------------------------
% 7.19/1.98  % (2999988)Refutation found. Thanks to Tanya!
% 7.19/1.98  % SZS status Unsatisfiable for theBenchmark
% 7.19/1.98  % SZS output start Proof for theBenchmark
% See solution above
% 7.19/1.98  % (2999988)------------------------------
% 7.19/1.98  % (2999988)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.19/1.98  % (2999988)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.19/1.98  % (2999988)CaDiCaL version: 2.1.3
% 7.19/1.98  % (2999988)Termination reason: Refutation
% 7.19/1.98  % (2999988)Time elapsed: 0.583 s
% 7.19/1.98  % (2999988)Peak memory usage: 129 MB
% 7.19/1.98  % (2999988)Instructions burned: 1076 (million)
% 7.19/1.98  % (2999988)------------------------------
% 7.19/1.98  % (2999988)------------------------------
% 7.19/1.98  % (2999961)Success in time 0.955 s
% 7.19/1.98  % Vampire exiting
%------------------------------------------------------------------------------