TSTP Solution File: SYO537^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO537^1 : TPTP v8.2.0. Released v5.2.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n032.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 09:06:08 EDT 2024

% Result   : Theorem 0.16s 0.32s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   51 (  16 unt;  11 typ;   0 def)
%            Number of atoms       :  172 (  44 equ;   0 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :  287 (  19   ~;  14   |;   4   &; 218   @)
%                                         (   3 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :  193 ( 193   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   18 (  14 usr;   6 con; 0-2 aty)
%                                         (   0  !!;  23  ??;   0 @@+;   0 @@-)
%            Number of variables   :   88 (  46   ^  20   !;  20   ?;  88   :)
%                                         (   2  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_0,type,
    epsii: ( ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_2,type,
    epsa: ( ( $i > $i ) > ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_3,type,
    epsb: ( ( $i > $i ) > ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_4,type,
    vEPSILON: 
      !>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).

thf(func_def_12,type,
    sK0: ( $i > $i ) > ( $i > $i ) > $o ).

thf(func_def_13,type,
    sK1: $i > $i ).

thf(func_def_14,type,
    sK2: $i > $i ).

thf(func_def_16,type,
    ph4: 
      !>[X0: $tType] : X0 ).

thf(func_def_17,type,
    sK5: $i > $i ).

thf(func_def_18,type,
    sK6: $i > $i ).

thf(func_def_19,type,
    sK7: $i > $i ).

thf(f73,plain,
    $false,
    inference(avatar_sat_refutation,[],[f40,f64,f65,f72]) ).

thf(f72,plain,
    ( spl3_4
    | ~ spl3_1 ),
    inference(avatar_split_clause,[],[f71,f34,f46]) ).

thf(f46,plain,
    ( spl3_4
  <=> ! [X2: $i > $i,X1: $i > $i] :
        ( $false
        = ( sK0 @ X1 @ X2 ) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).

thf(f34,plain,
    ( spl3_1
  <=> ! [X1: $i > $i] :
        ( ( sK0
          @ ( epsii
            @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) )
          @ X1 )
        = $false ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

thf(f71,plain,
    ( ! [X2: $i > $i,X1: $i > $i] :
        ( $false
        = ( sK0 @ X1 @ X2 ) )
    | ~ spl3_1 ),
    inference(trivial_inequality_removal,[],[f70]) ).

thf(f70,plain,
    ( ! [X2: $i > $i,X1: $i > $i] :
        ( ( $false
          = ( sK0 @ X1 @ X2 ) )
        | ( $false = $true ) )
    | ~ spl3_1 ),
    inference(forward_demodulation,[],[f69,f35]) ).

thf(f35,plain,
    ( ! [X1: $i > $i] :
        ( ( sK0
          @ ( epsii
            @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) )
          @ X1 )
        = $false )
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f34]) ).

thf(f69,plain,
    ! [X2: $i > $i,X1: $i > $i] :
      ( ( $true
        = ( sK0
          @ ( epsii
            @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) )
          @ sK7 ) )
      | ( $false
        = ( sK0 @ X1 @ X2 ) ) ),
    inference(pi_clausification,[],[f68]) ).

thf(f68,plain,
    ! [X1: $i > $i] :
      ( ( $true
        = ( sK0
          @ ( epsii
            @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) )
          @ sK7 ) )
      | ( $false
        = ( ?? @ ( $i > $i ) @ ( sK0 @ X1 ) ) ) ),
    inference(sigma_clausification,[],[f67]) ).

thf(f67,plain,
    ! [X1: $i > $i] :
      ( ( $true
        = ( ?? @ ( $i > $i )
          @ ( sK0
            @ ( epsii
              @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) ) ) ) )
      | ( $false
        = ( ?? @ ( $i > $i ) @ ( sK0 @ X1 ) ) ) ),
    inference(beta_eta_normalization,[],[f66]) ).

thf(f66,plain,
    ! [X1: $i > $i] :
      ( ( ( ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) )
          @ X1 )
        = $false )
      | ( $true
        = ( ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) )
          @ ( epsii
            @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f65,plain,
    ~ spl3_2,
    inference(avatar_split_clause,[],[f27,f37]) ).

thf(f37,plain,
    ( spl3_2
  <=> ( ( sK0
        @ ( epsii
          @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) )
        @ ( epsii
          @ ( sK0
            @ ( epsii
              @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) ) ) ) )
      = $true ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

thf(f27,plain,
    ( ( sK0
      @ ( epsii
        @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) )
      @ ( epsii
        @ ( sK0
          @ ( epsii
            @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) ) ) ) )
   != $true ),
    inference(beta_eta_normalization,[],[f26]) ).

thf(f26,plain,
    ( $true
   != ( sK0
      @ ( ^ [Y0: ( $i > $i ) > ( $i > $i ) > $o] :
            ( epsii
            @ ^ [Y1: $i > $i] :
                ( ?? @ ( $i > $i )
                @ ^ [Y2: $i > $i] : ( Y0 @ Y1 @ Y2 ) ) )
        @ sK0 )
      @ ( ^ [Y0: ( $i > $i ) > ( $i > $i ) > $o] :
            ( epsii
            @ ^ [Y1: $i > $i] :
                ( Y0
                @ ( ^ [Y2: ( $i > $i ) > ( $i > $i ) > $o] :
                      ( epsii
                      @ ^ [Y3: $i > $i] :
                          ( ?? @ ( $i > $i )
                          @ ^ [Y4: $i > $i] : ( Y2 @ Y3 @ Y4 ) ) )
                  @ Y0 )
                @ Y1 ) )
        @ sK0 ) ) ),
    inference(definition_unfolding,[],[f21,f22,f25]) ).

thf(f25,plain,
    ( epsb
    = ( ^ [Y0: ( $i > $i ) > ( $i > $i ) > $o] :
          ( epsii
          @ ^ [Y1: $i > $i] :
              ( Y0
              @ ( ^ [Y2: ( $i > $i ) > ( $i > $i ) > $o] :
                    ( epsii
                    @ ^ [Y3: $i > $i] :
                        ( ?? @ ( $i > $i )
                        @ ^ [Y4: $i > $i] : ( Y2 @ Y3 @ Y4 ) ) )
                @ Y0 )
              @ Y1 ) ) ) ),
    inference(definition_unfolding,[],[f23,f22]) ).

thf(f23,plain,
    ( epsb
    = ( ^ [Y0: ( $i > $i ) > ( $i > $i ) > $o] :
          ( epsii
          @ ^ [Y1: $i > $i] : ( Y0 @ ( epsa @ Y0 ) @ Y1 ) ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f8,plain,
    ( epsb
    = ( ^ [Y0: ( $i > $i ) > ( $i > $i ) > $o] :
          ( epsii
          @ ^ [Y1: $i > $i] : ( Y0 @ ( epsa @ Y0 ) @ Y1 ) ) ) ),
    inference(fool_elimination,[],[f7]) ).

thf(f7,plain,
    ( ( ^ [X0: ( $i > $i ) > ( $i > $i ) > $o] :
          ( epsii
          @ ^ [X1: $i > $i] : ( X0 @ ( epsa @ X0 ) @ X1 ) ) )
    = epsb ),
    inference(rectify,[],[f3]) ).

thf(f3,axiom,
    ( ( ^ [X2: ( $i > $i ) > ( $i > $i ) > $o] :
          ( epsii
          @ ^ [X3: $i > $i] : ( X2 @ ( epsa @ X2 ) @ X3 ) ) )
    = epsb ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',epsbd) ).

thf(f22,plain,
    ( epsa
    = ( ^ [Y0: ( $i > $i ) > ( $i > $i ) > $o] :
          ( epsii
          @ ^ [Y1: $i > $i] :
              ( ?? @ ( $i > $i )
              @ ^ [Y2: $i > $i] : ( Y0 @ Y1 @ Y2 ) ) ) ) ),
    inference(cnf_transformation,[],[f10]) ).

thf(f10,plain,
    ( epsa
    = ( ^ [Y0: ( $i > $i ) > ( $i > $i ) > $o] :
          ( epsii
          @ ^ [Y1: $i > $i] :
              ( ?? @ ( $i > $i )
              @ ^ [Y2: $i > $i] : ( Y0 @ Y1 @ Y2 ) ) ) ) ),
    inference(fool_elimination,[],[f9]) ).

thf(f9,plain,
    ( epsa
    = ( ^ [X0: ( $i > $i ) > ( $i > $i ) > $o] :
          ( epsii
          @ ^ [X1: $i > $i] :
            ? [X2: $i > $i] : ( X0 @ X1 @ X2 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,axiom,
    ( epsa
    = ( ^ [X2: ( $i > $i ) > ( $i > $i ) > $o] :
          ( epsii
          @ ^ [X1: $i > $i] :
            ? [X3: $i > $i] : ( X2 @ X1 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',epsad) ).

thf(f21,plain,
    ( ( sK0 @ ( epsa @ sK0 ) @ ( epsb @ sK0 ) )
   != $true ),
    inference(cnf_transformation,[],[f19]) ).

thf(f19,plain,
    ( ( ( sK0 @ ( epsa @ sK0 ) @ ( epsb @ sK0 ) )
     != $true )
    & ( ( sK0 @ sK2 @ sK1 )
      = $true ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f15,f18,f17]) ).

thf(f17,plain,
    ( ? [X0: ( $i > $i ) > ( $i > $i ) > $o] :
        ( ( $true
         != ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) ) )
        & ? [X1: $i > $i,X2: $i > $i] :
            ( $true
            = ( X0 @ X2 @ X1 ) ) )
   => ( ( ( sK0 @ ( epsa @ sK0 ) @ ( epsb @ sK0 ) )
       != $true )
      & ? [X2: $i > $i,X1: $i > $i] :
          ( ( sK0 @ X2 @ X1 )
          = $true ) ) ),
    introduced(choice_axiom,[]) ).

thf(f18,plain,
    ( ? [X2: $i > $i,X1: $i > $i] :
        ( ( sK0 @ X2 @ X1 )
        = $true )
   => ( ( sK0 @ sK2 @ sK1 )
      = $true ) ),
    introduced(choice_axiom,[]) ).

thf(f15,plain,
    ? [X0: ( $i > $i ) > ( $i > $i ) > $o] :
      ( ( $true
       != ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) ) )
      & ? [X1: $i > $i,X2: $i > $i] :
          ( $true
          = ( X0 @ X2 @ X1 ) ) ),
    inference(ennf_transformation,[],[f12]) ).

thf(f12,plain,
    ~ ! [X0: ( $i > $i ) > ( $i > $i ) > $o] :
        ( ? [X1: $i > $i,X2: $i > $i] :
            ( $true
            = ( X0 @ X2 @ X1 ) )
       => ( $true
          = ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) ) ) ),
    inference(fool_elimination,[],[f11]) ).

thf(f11,plain,
    ~ ! [X0: ( $i > $i ) > ( $i > $i ) > $o] :
        ( ? [X1: $i > $i,X2: $i > $i] : ( X0 @ X2 @ X1 )
       => ( X0 @ ( epsa @ X0 ) @ ( epsb @ X0 ) ) ),
    inference(rectify,[],[f5]) ).

thf(f5,negated_conjecture,
    ~ ! [X2: ( $i > $i ) > ( $i > $i ) > $o] :
        ( ? [X3: $i > $i,X1: $i > $i] : ( X2 @ X1 @ X3 )
       => ( X2 @ ( epsa @ X2 ) @ ( epsb @ X2 ) ) ),
    inference(negated_conjecture,[],[f4]) ).

thf(f4,conjecture,
    ! [X2: ( $i > $i ) > ( $i > $i ) > $o] :
      ( ? [X3: $i > $i,X1: $i > $i] : ( X2 @ X1 @ X3 )
     => ( X2 @ ( epsa @ X2 ) @ ( epsb @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

thf(f64,plain,
    ~ spl3_4,
    inference(avatar_contradiction_clause,[],[f63]) ).

thf(f63,plain,
    ( $false
    | ~ spl3_4 ),
    inference(trivial_inequality_removal,[],[f58]) ).

thf(f58,plain,
    ( ( $false = $true )
    | ~ spl3_4 ),
    inference(backward_demodulation,[],[f20,f47]) ).

thf(f47,plain,
    ( ! [X2: $i > $i,X1: $i > $i] :
        ( $false
        = ( sK0 @ X1 @ X2 ) )
    | ~ spl3_4 ),
    inference(avatar_component_clause,[],[f46]) ).

thf(f20,plain,
    ( ( sK0 @ sK2 @ sK1 )
    = $true ),
    inference(cnf_transformation,[],[f19]) ).

thf(f40,plain,
    ( spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f29,f37,f34]) ).

thf(f29,plain,
    ! [X1: $i > $i] :
      ( ( ( sK0
          @ ( epsii
            @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) )
          @ ( epsii
            @ ( sK0
              @ ( epsii
                @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) ) ) ) )
        = $true )
      | ( ( sK0
          @ ( epsii
            @ ^ [Y0: $i > $i] : ( ?? @ ( $i > $i ) @ ( sK0 @ Y0 ) ) )
          @ X1 )
        = $false ) ),
    introduced(choice_axiom,[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SYO537^1 : TPTP v8.2.0. Released v5.2.0.
% 0.00/0.10  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.30  % Computer : n032.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon May 20 09:09:53 EDT 2024
% 0.09/0.30  % CPUTime    : 
% 0.09/0.30  This is a TH0_THM_EQU_NAR problem
% 0.09/0.30  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.32  % (14117)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.16/0.32  % (14116)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.32  % (14114)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.32  % (14112)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.16/0.32  % (14115)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.16/0.32  % (14111)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.16/0.32  % (14110)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.16/0.32  % (14114)Instruction limit reached!
% 0.16/0.32  % (14114)------------------------------
% 0.16/0.32  % (14114)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.32  % (14114)Termination reason: Unknown
% 0.16/0.32  % (14114)Termination phase: Saturation
% 0.16/0.32  
% 0.16/0.32  % (14114)Memory used [KB]: 5500
% 0.16/0.32  % (14114)Time elapsed: 0.003 s
% 0.16/0.32  % (14114)Instructions burned: 3 (million)
% 0.16/0.32  % (14114)------------------------------
% 0.16/0.32  % (14114)------------------------------
% 0.16/0.32  % (14117)Instruction limit reached!
% 0.16/0.32  % (14117)------------------------------
% 0.16/0.32  % (14117)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.32  % (14117)Termination reason: Unknown
% 0.16/0.32  % (14117)Termination phase: Saturation
% 0.16/0.32  
% 0.16/0.32  % (14117)Memory used [KB]: 5500
% 0.16/0.32  % (14117)Time elapsed: 0.003 s
% 0.16/0.32  % (14117)Instructions burned: 3 (million)
% 0.16/0.32  % (14117)------------------------------
% 0.16/0.32  % (14117)------------------------------
% 0.16/0.32  % (14115)Refutation not found, incomplete strategy
% 0.16/0.32  % (14115)------------------------------
% 0.16/0.32  % (14115)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.32  % (14115)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.32  
% 0.16/0.32  
% 0.16/0.32  % (14115)Memory used [KB]: 5500
% 0.16/0.32  % (14115)Time elapsed: 0.002 s
% 0.16/0.32  % (14115)Instructions burned: 2 (million)
% 0.16/0.32  % (14115)------------------------------
% 0.16/0.32  % (14115)------------------------------
% 0.16/0.32  % (14111)Instruction limit reached!
% 0.16/0.32  % (14111)------------------------------
% 0.16/0.32  % (14111)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.32  % (14111)Termination reason: Unknown
% 0.16/0.32  % (14111)Termination phase: Saturation
% 0.16/0.32  
% 0.16/0.32  % (14111)Memory used [KB]: 5500
% 0.16/0.32  % (14111)Time elapsed: 0.003 s
% 0.16/0.32  % (14111)Instructions burned: 4 (million)
% 0.16/0.32  % (14111)------------------------------
% 0.16/0.32  % (14111)------------------------------
% 0.16/0.32  % (14112)First to succeed.
% 0.16/0.32  % (14113)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.32  % (14113)Instruction limit reached!
% 0.16/0.32  % (14113)------------------------------
% 0.16/0.32  % (14113)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.32  % (14113)Termination reason: Unknown
% 0.16/0.32  % (14113)Termination phase: Saturation
% 0.16/0.32  
% 0.16/0.32  % (14113)Memory used [KB]: 5373
% 0.16/0.32  % (14113)Time elapsed: 0.002 s
% 0.16/0.32  % (14113)Instructions burned: 2 (million)
% 0.16/0.32  % (14113)------------------------------
% 0.16/0.32  % (14113)------------------------------
% 0.16/0.32  % (14112)Refutation found. Thanks to Tanya!
% 0.16/0.32  % SZS status Theorem for theBenchmark
% 0.16/0.32  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.32  % (14112)------------------------------
% 0.16/0.32  % (14112)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.32  % (14112)Termination reason: Refutation
% 0.16/0.32  
% 0.16/0.32  % (14112)Memory used [KB]: 5500
% 0.16/0.32  % (14112)Time elapsed: 0.004 s
% 0.16/0.32  % (14112)Instructions burned: 4 (million)
% 0.16/0.32  % (14112)------------------------------
% 0.16/0.32  % (14112)------------------------------
% 0.16/0.32  % (14105)Success in time 0.006 s
% 0.16/0.32  % Vampire---4.8 exiting
%------------------------------------------------------------------------------