↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYO024^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.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 : Wed Sep 30 08:46:18 AM UTC 2026

% Result   : Theorem 0.33s 0.42s
% Output   : Refutation 0.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   68 (  27 unt;   0 typ;   4 def)
%            Number of atoms       :  300 (  78 equ;  15 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :  275 ( 117   ~;  74   |;  18   &;  50   @)
%                                         (   4 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   53 (  53   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   23 (  18 usr;  10 con; 0-4 aty)
%                                         (   4  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   52 (   0 sgn   2   !;   0   ?;  52   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    leibeq: ( $o > $o > $o ) > ( $o > $o > $o ) > $o ).

thf(func_def_2,type,
    vAND: $o > $o > $o ).

thf(func_def_3,type,
    vPI: 
      !>[X0: $tType] : ( ( X0 > $o ) > $o ) ).

thf(func_def_4,type,
    vIMP: $o > $o > $o ).

thf(func_def_5,type,
    db0: 
      !>[X0: $tType] : X0 ).

thf(func_def_6,type,
    db2: 
      !>[X0: $tType] : X0 ).

thf(func_def_7,type,
    db1: 
      !>[X0: $tType] : X0 ).

thf(func_def_8,type,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

thf(func_def_9,type,
    vNOT: $o > $o ).

thf(func_def_10,type,
    vOR: $o > $o > $o ).

thf(func_def_13,type,
    sK0: ( $o > $o > $o ) > $o ).

thf(func_def_14,type,
    sK1: $o ).

thf(func_def_15,type,
    sK2: $o ).

thf(f1,axiom,
    ( ( ^ [X0: $o > $o > $o,X1: $o > $o > $o] :
        ! [X2: ( $o > $o > $o ) > $o] :
          ( ( X2 @ X0 )
         => ( X2 @ X1 ) ) )
    = leibeq ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq) ).

thf(f2,conjecture,
    ( leibeq @ (&)
    @ ^ [X0: $o,X1: $o] :
        ~ ( ~ X0
          | ~ X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

thf(f3,negated_conjecture,
    ~ ( leibeq @ (&)
      @ ^ [X0: $o,X1: $o] :
          ~ ( ~ X0
            | ~ X1 ) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

thf(f4,plain,
    ( ( ^ [X0: $o > $o > $o,X1: $o > $o > $o] :
        ! [X2: ( $o > $o > $o ) > $o] :
          ( ( X2 @ X0 )
         => ( X2 @ X1 ) ) )
    = leibeq ),
    inference(rectify,[],[f1]) ).

thf(f5,plain,
    ( leibeq
    = ( ^ [Y0: $o > $o > $o,Y1: $o > $o > $o] :
          ( !! @ ( ( $o > $o > $o ) > $o )
          @ ^ [Y2: ( $o > $o > $o ) > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f6,plain,
    ~ ( leibeq @ (&)
      @ ^ [X0: $o,X1: $o] :
          ~ ( ~ X0
            | ~ X1 ) ),
    inference(rectify,[],[f3]) ).

thf(f7,plain,
    ( $true
   != ( leibeq @ (&)
      @ ^ [Y0: $o,Y1: $o] :
          ~ ( ~ Y1
            | ~ Y0 ) ) ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    ( $true
   != ( leibeq @ (&)
      @ ^ [Y0: $o,Y1: $o] :
          ~ ( ~ Y1
            | ~ Y0 ) ) ),
    inference(flattening,[],[f7]) ).

thf(f9,plain,
    ( leibeq
    = ( ^ [Y0: $o > $o > $o,Y1: $o > $o > $o] :
          ( !! @ ( ( $o > $o > $o ) > $o )
          @ ^ [Y2: ( $o > $o > $o ) > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f10,plain,
    ( $true
   != ( leibeq @ (&)
      @ ^ [Y0: $o,Y1: $o] :
          ~ ( ~ Y1
            | ~ Y0 ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f13,plain,
    ( $true
   != ( ^ [Y0: $o > $o > $o,Y1: $o > $o > $o] :
          ( !! @ ( ( $o > $o > $o ) > $o )
          @ ^ [Y2: ( $o > $o > $o ) > $o] :
              ( ( Y2 @ Y0 )
             => ( Y2 @ Y1 ) ) )
      @ (&)
      @ ^ [Y0: $o,Y1: $o] :
          ~ ( ~ Y1
            | ~ Y0 ) ) ),
    inference(definition_unfolding,[],[f10,f9]) ).

thf(f14,plain,
    ( $true
   != ( !! @ ( ( $o > $o > $o ) > $o )
      @ ^ [Y0: ( $o > $o > $o ) > $o] :
          ( ( Y0 @ (&) )
         => ( Y0
            @ ^ [Y1: $o,Y2: $o] :
                ~ ( ~ Y2
                  | ~ Y1 ) ) ) ) ),
    inference(beta-eta_normalization,[],[f13]) ).

thf(f15,plain,
    ( $false
    = ( ^ [Y0: ( $o > $o > $o ) > $o] :
          ( ( Y0 @ (&) )
         => ( Y0
            @ ^ [Y1: $o,Y2: $o] :
                ~ ( ~ Y2
                  | ~ Y1 ) ) )
      @ sK0 ) ),
    inference(sigma_proxy_clausification,[],[f14]) ).

thf(f16,plain,
    ( ( ( sK0 @ (&) )
     => ( sK0
        @ ^ [Y0: $o,Y1: $o] :
            ~ ( ~ Y1
              | ~ Y0 ) ) )
    = $false ),
    inference(beta-eta_normalization,[],[f15]) ).

thf(f17,plain,
    ( ( sK0
      @ ^ [Y0: $o,Y1: $o] :
          ~ ( ~ Y1
            | ~ Y0 ) )
    = $false ),
    inference(imp_proxy_clausification,[],[f16]) ).

thf(f18,plain,
    ( ( sK0 @ (&) )
    = $true ),
    inference(imp_proxy_clausification,[],[f16]) ).

thf(f20,plain,
    ( ( $true = $false )
    | ( (&)
     != ( ^ [Y0: $o,Y1: $o] :
            ~ ( ~ Y1
              | ~ Y0 ) ) ) ),
    inference(constrained_superposition,[],[f18,f17]) ).

thf(f21,plain,
    ( (&)
   != ( ^ [Y0: $o,Y1: $o] :
          ~ ( ~ Y1
            | ~ Y0 ) ) ),
    inference(trivial_inequality_removal,[],[f20]) ).

thf(f23,plain,
    ( ( (&) @ sK1 )
   != ( ^ [Y0: $o,Y1: $o] :
          ~ ( ~ Y1
            | ~ Y0 )
      @ sK1 ) ),
    inference(negative_extensionality,[],[f21]) ).

thf(f24,plain,
    ( ( (&) @ sK1 )
   != ( ^ [Y0: $o] :
          ~ ( ~ Y0
            | ~ sK1 ) ) ),
    inference(beta-eta_normalization,[],[f23]) ).

thf(f25,plain,
    ( ( sK1
      & sK2 )
   != ( ^ [Y0: $o] :
          ~ ( ~ Y0
            | ~ sK1 )
      @ sK2 ) ),
    inference(negative_extensionality,[],[f24]) ).

thf(f26,plain,
    ( ( $true
      = ( ^ [Y0: $o] :
            ~ ( ~ Y0
              | ~ sK1 )
        @ sK2 ) )
    | ( ( sK1
        & sK2 )
      = $true ) ),
    inference(xor_proxy_clausification,[],[f25]) ).

thf(f27,plain,
    ( ( ( sK1
        & sK2 )
      = $false )
    | ( ( ^ [Y0: $o] :
            ~ ( ~ Y0
              | ~ sK1 )
        @ sK2 )
      = $false ) ),
    inference(xor_proxy_clausification,[],[f25]) ).

thf(f28,plain,
    ( ( ( ^ [Y0: $o] :
            ~ ( ~ Y0
              | ~ sK1 )
        @ sK2 )
      = $false )
    | ( sK1 = $false )
    | ( sK2 = $false ) ),
    inference(and_proxy_clausification,[],[f27]) ).

thf(f29,plain,
    ( ( sK1 = $false )
    | ( sK2 = $false )
    | ( ( ~ ( ~ sK2
            | ~ sK1 ) )
      = $false ) ),
    inference(beta-eta_normalization,[],[f28]) ).

thf(f30,plain,
    ( ( ( ~ sK2
        | ~ sK1 )
      = $true )
    | ( sK2 = $false )
    | ( sK1 = $false ) ),
    inference(not_proxy_clausification,[],[f29]) ).

thf(f31,plain,
    ( ( $true = ( ~ sK1 ) )
    | ( ( ~ sK2 ) = $true )
    | ( sK1 = $false )
    | ( sK2 = $false ) ),
    inference(or_proxy_clausification,[],[f30]) ).

thf(f32,plain,
    ( ( sK1 = $false )
    | ( ( ~ sK2 ) = $true )
    | ( sK2 = $false )
    | ( sK1 = $false ) ),
    inference(not_proxy_clausification,[],[f31]) ).

thf(f33,plain,
    ( ( sK1 = $false )
    | ( sK2 = $false )
    | ( sK2 = $false )
    | ( sK1 = $false ) ),
    inference(not_proxy_clausification,[],[f32]) ).

thf(f34,plain,
    ( ( sK1 = $false )
    | ( sK2 = $false ) ),
    inference(duplicate_literal_removal,[],[f33]) ).

thf(f35,plain,
    ( ( $true
      = ( ^ [Y0: $o] :
            ~ ( ~ Y0
              | ~ sK1 )
        @ sK2 ) )
    | ( sK2 = $true ) ),
    inference(and_proxy_clausification,[],[f26]) ).

thf(f36,plain,
    ( ( $true = sK1 )
    | ( $true
      = ( ^ [Y0: $o] :
            ~ ( ~ Y0
              | ~ sK1 )
        @ sK2 ) ) ),
    inference(and_proxy_clausification,[],[f26]) ).

thf(f37,plain,
    ( ( $true = sK1 )
    | ( ( ~ ( ~ sK2
            | ~ sK1 ) )
      = $true ) ),
    inference(beta-eta_normalization,[],[f36]) ).

thf(f38,plain,
    ( ( ( ~ sK2
        | ~ sK1 )
      = $false )
    | ( $true = sK1 ) ),
    inference(not_proxy_clausification,[],[f37]) ).

thf(f39,plain,
    ( ( $false = ( ~ sK1 ) )
    | ( $true = sK1 ) ),
    inference(or_proxy_clausification,[],[f38]) ).

thf(f42,plain,
    ( ( $true = sK1 )
    | ( $true = sK1 ) ),
    inference(not_proxy_clausification,[],[f39]) ).

thf(f43,plain,
    $true = sK1,
    inference(duplicate_literal_removal,[],[f42]) ).

thf(f44,plain,
    ( ( sK2 = $true )
    | ( ( ~ ( ~ sK2
            | ~ sK1 ) )
      = $true ) ),
    inference(beta-eta_normalization,[],[f35]) ).

thf(f45,plain,
    ( ( sK2 = $true )
    | ( ( ~ sK2
        | ~ sK1 )
      = $false ) ),
    inference(not_proxy_clausification,[],[f44]) ).

thf(f47,plain,
    ( ( sK2 = $true )
    | ( ( ~ sK2 ) = $false ) ),
    inference(or_proxy_clausification,[],[f45]) ).

thf(f48,plain,
    ( ( sK2 = $true )
    | ( sK2 = $true ) ),
    inference(not_proxy_clausification,[],[f47]) ).

thf(f49,plain,
    sK2 = $true,
    inference(duplicate_literal_removal,[],[f48]) ).

thf(f52,definition,
    ( spl3_1
  <=> ( sK1 = $false ) ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

thf(f54,plain,
    ( ( sK1 = $false )
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f52]) ).

thf(f56,definition,
    ( spl3_2
  <=> ( sK2 = $false ) ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

thf(f58,plain,
    ( ( sK2 = $false )
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f56]) ).

thf(f59,plain,
    ( spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f34,f56,f52]) ).

thf(f61,definition,
    ( spl3_3
  <=> ( sK2 = $true ) ),
    introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).

thf(f63,plain,
    ( ( sK2 = $true )
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f61]) ).

thf(f65,definition,
    ( spl3_4
  <=> ( $true = sK1 ) ),
    introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).

thf(f67,plain,
    ( ( $true = sK1 )
    | ~ spl3_4 ),
    inference(avatar_component_clause,[],[f65]) ).

thf(f69,plain,
    spl3_4,
    inference(avatar_split_clause,[],[f43,f65]) ).

thf(f70,plain,
    spl3_3,
    inference(avatar_split_clause,[],[f49,f61]) ).

thf(f72,plain,
    ( ( $true = $false )
    | ~ spl3_2
    | ~ spl3_3 ),
    inference(constrained_superposition,[],[f63,f58]) ).

thf(f76,plain,
    ( $false
    | ~ spl3_2
    | ~ spl3_3 ),
    inference(trivial_inequality_removal,[],[f72]) ).

thf(f77,plain,
    ( ~ spl3_2
    | ~ spl3_3 ),
    inference(avatar_contradiction_clause,[],[f76]) ).

thf(f80,plain,
    ( ( $true = $false )
    | ~ spl3_1
    | ~ spl3_4 ),
    inference(constrained_superposition,[],[f54,f67]) ).

thf(f83,plain,
    ( $false
    | ~ spl3_1
    | ~ spl3_4 ),
    inference(trivial_inequality_removal,[],[f80]) ).

thf(f84,plain,
    ( ~ spl3_1
    | ~ spl3_4 ),
    inference(avatar_contradiction_clause,[],[f83]) ).

cnf(s1,plain,
    ( spl3_1
    | spl3_2 ),
    inference(sat_conversion,[],[f59]) ).

cnf(s3,plain,
    spl3_4,
    inference(sat_conversion,[],[f69]) ).

cnf(s4,plain,
    spl3_3,
    inference(sat_conversion,[],[f70]) ).

cnf(s7,plain,
    ( ~ spl3_2
    | ~ spl3_3 ),
    inference(sat_conversion,[],[f77]) ).

cnf(s9,plain,
    ( ~ spl3_1
    | ~ spl3_4 ),
    inference(sat_conversion,[],[f84]) ).

cnf(s10,plain,
    ~ spl3_2,
    inference(rat,[],[s7,s4]) ).

cnf(s11,plain,
    ~ spl3_1,
    inference(rat,[],[s9,s3]) ).

cnf(s12,plain,
    $false,
    inference(rat,[],[s1,s10,s11]) ).

thf(f85,plain,
    $false,
    inference(avatar_sat_refutation,[],[s12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYO024^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.28  % Computer : n016.cluster.edu
% 0.12/0.28  % Model    : x86_64 x86_64
% 0.12/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.28  % Memory   : 8046.5625MB
% 0.12/0.28  % OS       : Linux 6.8.0-71-generic
% 0.12/0.28  % CPULimit : 300
% 0.12/0.28  % WCLimit  : 300
% 0.12/0.28  % DateTime : Tue Sep 29 16:28:13 UTC 2026
% 0.12/0.28  % CPUTime  : 
% 0.12/0.28  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.33  Running higher-order theorem proving
% 0.27/0.35  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.33/0.42  % (556200)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.33/0.42  % (556207)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=625827265:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.33/0.42  % (556207)Refutation not found, incomplete strategy
% 0.33/0.42  % (556207)------------------------------
% 0.33/0.42  % (556207)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.33/0.42  % (556207)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.33/0.42  % (556207)CaDiCaL version: 2.1.3
% 0.33/0.42  % (556207)Termination reason: Refutation not found, incomplete strategy
% 0.33/0.42  % (556207)Time elapsed: 0.001 s
% 0.33/0.42  % (556207)Peak memory usage: 12 MB
% 0.33/0.42  % (556207)------------------------------
% 0.33/0.42  % (556207)------------------------------
% 0.33/0.42  % (556211)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.33/0.42  % (556211)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.33/0.42  % (556205)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3212657198:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.33/0.42  % (556206)lrs+10_16_si=on:nwc=1.5:random_seed=1365286910:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.33/0.42  % (556209)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2139787920:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.33/0.42  % (556208)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2392225881:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.33/0.42  % (556210)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3635042108:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.33/0.42  % (556211)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=1011049407:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.33/0.42  % (556205)Refutation not found, incomplete strategy
% 0.33/0.42  % (556205)------------------------------
% 0.33/0.42  % (556205)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.33/0.42  % (556205)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.33/0.42  % (556205)CaDiCaL version: 2.1.3
% 0.33/0.42  % (556205)Termination reason: Refutation not found, incomplete strategy
% 0.33/0.42  % (556205)Time elapsed: 0.002 s
% 0.33/0.42  % (556205)Peak memory usage: 12 MB
% 0.33/0.42  % (556205)Instructions burned: 1 (million)
% 0.33/0.42  % (556205)------------------------------
% 0.33/0.42  % (556205)------------------------------
% 0.33/0.42  % (556206) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-556200-556206"...
% 0.33/0.42  % (556211)Refutation not found, incomplete strategy
% 0.33/0.42  % (556211)------------------------------
% 0.33/0.42  % (556211)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.33/0.42  % (556211)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.33/0.42  % (556208)Refutation not found, incomplete strategy
% 0.33/0.42  % (556208)------------------------------
% 0.33/0.42  % (556208)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.33/0.42  % (556211)CaDiCaL version: 2.1.3
% 0.33/0.42  % (556211)Termination reason: Refutation not found, incomplete strategy
% 0.33/0.42  % (556211)Time elapsed: 0.003 s
% 0.33/0.42  % (556208)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.33/0.42  % (556211)Peak memory usage: 12 MB
% 0.33/0.42  % (556211)Instructions burned: 2 (million)
% 0.33/0.42  % (556208)CaDiCaL version: 2.1.3
% 0.33/0.42  % (556208)Termination reason: Refutation not found, incomplete strategy
% 0.33/0.42  % (556208)Time elapsed: 0.004 s
% 0.33/0.42  % (556208)Peak memory usage: 12 MB
% 0.33/0.42  % (556208)Instructions burned: 3 (million)
% 0.33/0.42  % (556210) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-556200-556210"...
% 0.33/0.42  % (556208)------------------------------
% 0.33/0.42  % (556208)------------------------------
% 0.33/0.42  % (556211)------------------------------
% 0.33/0.42  % (556211)------------------------------
% 0.33/0.42  % (556213)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2178208587:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.33/0.42  % (556206)...printing done.
% 0.33/0.42  % (556206)Refutation found. Thanks to Tanya!
% 0.33/0.42  % SZS status Theorem for theBenchmark
% 0.33/0.42  % SZS output start Proof for theBenchmark
% See solution above
% 0.33/0.42  % (556206)------------------------------
% 0.33/0.42  % (556206)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.33/0.42  % (556206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.33/0.42  % (556206)CaDiCaL version: 2.1.3
% 0.33/0.42  % (556206)Termination reason: Refutation
% 0.33/0.42  % (556206)Time elapsed: 0.006 s
% 0.33/0.42  % (556206)Peak memory usage: 13 MB
% 0.33/0.42  % (556206)Instructions burned: 4 (million)
% 0.33/0.42  % (556200)Success in time 0.054 s
% 0.33/0.42  % Vampire exiting
%------------------------------------------------------------------------------