↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

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

% Computer : n013.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:58:07 AM UTC 2026

% Result   : Unsatisfiable 2.32s 0.92s
% Output   : Refutation 2.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   59 (  49 unt;  10 def)
%            Number of atoms       :   73 (  21 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   33 (  19   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;  13 con; 0-2 aty)
%            Number of variables   :   45 (  45   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).

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

fof(f11,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,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(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
    inference(definition_unfolding,[],[f9,f6,f6,f6,f6,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 = or(sF0,q),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

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

fof(f21,definition,
    sF2 = not(sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f22,plain,
    not(sF1) = sF2,
    inference(reorient_equations,[],[f21]) ).

fof(f23,definition,
    sF3 = or(sF0,r),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f24,plain,
    or(sF0,r) = sF3,
    inference(reorient_equations,[],[f23]) ).

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

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

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

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

fof(f29,definition,
    sF6 = not(q),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f30,plain,
    not(q) = sF6,
    inference(reorient_equations,[],[f29]) ).

fof(f31,definition,
    sF7 = or(sF6,r),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f32,plain,
    or(sF6,r) = sF7,
    inference(reorient_equations,[],[f31]) ).

fof(f33,definition,
    sF8 = or(sF0,sF7),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f34,plain,
    or(sF0,sF7) = sF8,
    inference(reorient_equations,[],[f33]) ).

fof(f35,definition,
    sF9 = or(sF5,sF8),
    introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).

fof(f36,plain,
    or(sF5,sF8) = sF9,
    inference(reorient_equations,[],[f35]) ).

fof(f37,plain,
    ~ theorem(sF9),
    inference(definition_folding,[],[f16,f36,f34,f32,f30,f18,f28,f26,f24,f18,f22,f20,f18]) ).

fof(f38,plain,
    ~ theorem(or(sF5,sF8)),
    inference(superposition,[],[f37,f36]) ).

fof(f45,plain,
    axiom(or(not(q),sF1)),
    inference(superposition,[],[f11,f20]) ).

fof(f50,plain,
    axiom(or(sF6,sF1)),
    inference(forward_demodulation,[],[f45,f30]) ).

fof(f64,plain,
    theorem(or(sF6,sF1)),
    inference(resolution,[],[f50,f7]) ).

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

fof(f103,plain,
    ! [X0] : axiom(or(not(or(X0,sF3)),or(sF0,or(X0,r)))),
    inference(superposition,[],[f13,f24]) ).

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

fof(f124,plain,
    ! [X0] : axiom(or(not(or(not(X0),sF7)),or(not(or(sF0,X0)),sF8))),
    inference(superposition,[],[f14,f34]) ).

fof(f126,plain,
    ! [X0] : axiom(or(not(or(not(X0),r)),or(not(or(sF6,X0)),sF7))),
    inference(superposition,[],[f14,f32]) ).

fof(f213,plain,
    axiom(or(not(sF4),or(sF0,or(sF2,r)))),
    inference(superposition,[],[f103,f26]) ).

fof(f217,plain,
    axiom(or(sF5,or(sF0,or(sF2,r)))),
    inference(forward_demodulation,[],[f213,f28]) ).

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

fof(f326,plain,
    ! [X0] : theorem(or(not(or(not(X0),sF7)),or(not(or(sF0,X0)),sF8))),
    inference(resolution,[],[f124,f7]) ).

fof(f353,plain,
    axiom(or(not(or(sF2,r)),or(not(or(sF6,sF1)),sF7))),
    inference(superposition,[],[f126,f22]) ).

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

fof(f455,plain,
    theorem(or(sF5,or(sF0,or(sF2,r)))),
    inference(resolution,[],[f217,f7]) ).

fof(f749,plain,
    theorem(or(not(or(sF2,r)),or(not(or(sF6,sF1)),sF7))),
    inference(resolution,[],[f353,f7]) ).

fof(f841,plain,
    ! [X0] :
      ( theorem(or(not(or(sF0,X0)),sF8))
      | ~ theorem(or(not(X0),sF7)) ),
    inference(resolution,[],[f326,f15]) ).

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

fof(f1588,plain,
    theorem(or(not(or(sF6,sF1)),or(not(or(sF2,r)),sF7))),
    inference(resolution,[],[f749,f269]) ).

fof(f2143,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(sF0,X1)))
      | theorem(or(X0,sF8))
      | ~ theorem(or(not(X1),sF7)) ),
    inference(resolution,[],[f960,f841]) ).

fof(f7804,plain,
    ( theorem(or(not(or(sF2,r)),sF7))
    | ~ theorem(or(sF6,sF1)) ),
    inference(resolution,[],[f1588,f15]) ).

fof(f7817,plain,
    theorem(or(not(or(sF2,r)),sF7)),
    inference(forward_subsumption_resolution,[],[f7804,f64]) ).

fof(f13883,plain,
    ( theorem(or(sF5,sF8))
    | ~ theorem(or(not(or(sF2,r)),sF7)) ),
    inference(resolution,[],[f2143,f455]) ).

fof(f13894,plain,
    ~ theorem(or(not(or(sF2,r)),sF7)),
    inference(forward_subsumption_resolution,[],[f13883,f38]) ).

fof(f13927,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f13894,f7817]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL231-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38  % Computer : n013.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 15:28:07 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42  Running first-order model finding
% 0.10/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.32/0.92  % (353083)Will run a generic schedule for satisfiability detection.
% 2.32/0.92  % (353091)dis+10_1_sil=32000:sp=arity:random_seed=21560896:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.32/0.92  % (353089)% WARNING: option uhcvi not known.
% 2.32/0.92  % (353088)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2427329999_2999 on theBenchmark for (2999ds/0Mi)
% 2.32/0.92  % (353089)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1556473494:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.32/0.92  % (353090)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1721333112:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.32/0.92  % (353092)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3154179062:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.32/0.92  % (353093)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3654040284:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.32/0.92  % (353094)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2368433613:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.32/0.92  % TRYING [1]
% 2.32/0.92  % TRYING [2]
% 2.32/0.92  % TRYING [3]
% 2.32/0.92  % (353091)Instruction limit reached! 
% 2.32/0.92  % (353091)------------------------------
% 2.32/0.92  % (353091)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.92  % (353091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.92  % (353091)CaDiCaL version: 2.1.3
% 2.32/0.92  % (353091)Termination reason: Instruction limit
% 2.32/0.92  % (353091)Termination phase: Saturation
% 2.32/0.92  % (353091)Time elapsed: 0.037 s
% 2.32/0.92  % (353091)Peak memory usage: 12 MB
% 2.32/0.92  % (353091)Instructions burned: 106 (million)
% 2.32/0.92  % TRYING [4]
% 2.32/0.92  % (353102)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2365178433:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.32/0.92  % TRYING [1]
% 2.32/0.92  % TRYING [2]
% 2.32/0.92  % TRYING [3]
% 2.32/0.92  % (353092)Instruction limit reached! 
% 2.32/0.92  % (353092)------------------------------
% 2.32/0.92  % (353092)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.92  % (353092)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.92  % (353092)CaDiCaL version: 2.1.3
% 2.32/0.92  % (353092)Termination reason: Instruction limit
% 2.32/0.92  % (353092)Termination phase: Saturation
% 2.32/0.92  % (353092)Time elapsed: 0.055 s
% 2.32/0.92  % (353092)Peak memory usage: 11 MB
% 2.32/0.92  % (353092)Instructions burned: 118 (million)
% 2.32/0.92  % TRYING [4]
% 2.32/0.92  % (353104)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=79594175:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.32/0.92  % (353093)Instruction limit reached! 
% 2.32/0.92  % (353093)------------------------------
% 2.32/0.92  % (353093)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.92  % (353093)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.92  % (353093)CaDiCaL version: 2.1.3
% 2.32/0.92  % (353093)Termination reason: Instruction limit
% 2.32/0.92  % (353093)Termination phase: Saturation
% 2.32/0.92  % (353093)Time elapsed: 0.082 s
% 2.32/0.92  % (353093)Peak memory usage: 13 MB
% 2.32/0.92  % (353093)Instructions burned: 132 (million)
% 2.32/0.92  % (353094)Instruction limit reached! 
% 2.32/0.92  % (353094)------------------------------
% 2.32/0.92  % (353094)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.92  % (353094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.92  % (353094)CaDiCaL version: 2.1.3
% 2.32/0.92  % (353094)Termination reason: Instruction limit
% 2.32/0.92  % (353094)Termination phase: Saturation
% 2.32/0.92  % (353094)Time elapsed: 0.096 s
% 2.32/0.92  % (353094)Peak memory usage: 13 MB
% 2.32/0.92  % (353094)Instructions burned: 159 (million)
% 2.32/0.92  % (353106)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2715443599:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.32/0.92  % (353107)ott-21_1_sil=16000:fs=off:random_seed=3758250561:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.32/0.92  % (353104)Instruction limit reached! 
% 2.32/0.92  % (353104)------------------------------
% 2.32/0.92  % (353104)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.92  % (353104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.92  % (353104)CaDiCaL version: 2.1.3
% 2.32/0.92  % (353104)Termination reason: Instruction limit
% 2.32/0.92  % (353104)Termination phase: Saturation
% 2.32/0.92  % (353104)Time elapsed: 0.080 s
% 2.32/0.92  % (353104)Peak memory usage: 12 MB
% 2.32/0.92  % (353104)Instructions burned: 132 (million)
% 2.32/0.92  % (353110)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1030476202:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.32/0.92  % TRYING [5]
% 2.32/0.92  % (353107)Instruction limit reached! 
% 2.32/0.92  % (353107)------------------------------
% 2.32/0.92  % (353107)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.92  % (353107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.92  % (353107)CaDiCaL version: 2.1.3
% 2.32/0.92  % (353107)Termination reason: Instruction limit
% 2.32/0.92  % (353107)Termination phase: Saturation
% 2.32/0.92  % (353107)Time elapsed: 0.092 s
% 2.32/0.92  % (353107)Peak memory usage: 12 MB
% 2.32/0.92  % (353107)Instructions burned: 180 (million)
% 2.32/0.92  % (353112)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1289081455:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.32/0.92  % TRYING [1]
% 2.32/0.92  % TRYING [2]
% 2.32/0.92  % TRYING [3]
% 2.32/0.92  % TRYING [4]
% 2.32/0.92  % TRYING [5]
% 2.32/0.92  % (353102)Instruction limit reached! 
% 2.32/0.92  % (353102)------------------------------
% 2.32/0.92  % (353102)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.92  % (353102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.92  % (353102)CaDiCaL version: 2.1.3
% 2.32/0.92  % (353102)Termination reason: Instruction limit
% 2.32/0.92  % (353102)Termination phase: Finite model building SAT solving
% 2.32/0.92  % (353102)Time elapsed: 0.220 s
% 2.32/0.92  % (353102)Peak memory usage: 16 MB
% 2.32/0.92  % (353102)Instructions burned: 716 (million)
% 2.32/0.92  % (353114)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=820226833:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.32/0.92  % TRYING [5]
% 2.32/0.92  % (353114) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-353083-353114"...
% 2.32/0.92  % (353114)...printing done.
% 2.32/0.92  % (353114)Refutation found. Thanks to Tanya!
% 2.32/0.92  % SZS status Unsatisfiable for theBenchmark
% 2.32/0.92  % SZS output start Proof for theBenchmark
% See solution above
% 2.32/0.92  % (353114)------------------------------
% 2.32/0.92  % (353114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.32/0.92  % (353114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.32/0.92  % (353114)CaDiCaL version: 2.1.3
% 2.32/0.92  % (353114)Termination reason: Refutation
% 2.32/0.92  % (353114)Time elapsed: 0.170 s
% 2.32/0.92  % (353114)Peak memory usage: 18 MB
% 2.32/0.92  % (353114)Instructions burned: 524 (million)
% 2.32/0.92  % (353083)Success in time 0.49 s
% 2.32/0.92  % Vampire exiting
%------------------------------------------------------------------------------