TSTP Solution File: SET615^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET615^5 : TPTP v8.2.0. Released v4.0.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n010.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:27 EDT 2024

% Result   : Theorem 0.21s 0.38s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   74 (  12 unt;   8 typ;   0 def)
%            Number of atoms       :  410 ( 105 equ;   0 cnn)
%            Maximal formula atoms :    4 (   6 avg)
%            Number of connectives :  493 ( 106   ~; 111   |;  58   &; 211   @)
%                                         (   6 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   23 (  23   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  12 usr;   9 con; 0-2 aty)
%            Number of variables   :   40 (  20   ^  12   !;   6   ?;  40   :)
%                                         (   2  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(func_def_0,type,
    a: $tType ).

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

thf(func_def_10,type,
    sK0: a > $o ).

thf(func_def_11,type,
    sK1: a > $o ).

thf(func_def_12,type,
    sK2: a > $o ).

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

thf(func_def_15,type,
    sK5: a ).

thf(f114,plain,
    $false,
    inference(avatar_sat_refutation,[],[f82,f83,f95,f102,f105,f109,f112]) ).

thf(f112,plain,
    ( ~ spl3_1
    | ~ spl3_4 ),
    inference(avatar_contradiction_clause,[],[f111]) ).

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

thf(f110,plain,
    ( ( $false = $true )
    | ~ spl3_1
    | ~ spl3_4 ),
    inference(forward_demodulation,[],[f70,f90]) ).

thf(f90,plain,
    ( ( ( sK2 @ sK5 )
      = $false )
    | ~ spl3_4 ),
    inference(avatar_component_clause,[],[f88]) ).

thf(f88,plain,
    ( spl3_4
  <=> ( ( sK2 @ sK5 )
      = $false ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).

thf(f70,plain,
    ( ( ( sK2 @ sK5 )
      = $true )
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f68]) ).

thf(f68,plain,
    ( spl3_1
  <=> ( ( sK2 @ sK5 )
      = $true ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

thf(f109,plain,
    ( ~ spl3_3
    | ~ spl3_6 ),
    inference(avatar_contradiction_clause,[],[f108]) ).

thf(f108,plain,
    ( $false
    | ~ spl3_3
    | ~ spl3_6 ),
    inference(trivial_inequality_removal,[],[f107]) ).

thf(f107,plain,
    ( ( $false = $true )
    | ~ spl3_3
    | ~ spl3_6 ),
    inference(forward_demodulation,[],[f78,f99]) ).

thf(f99,plain,
    ( ( ( sK1 @ sK5 )
      = $false )
    | ~ spl3_6 ),
    inference(avatar_component_clause,[],[f97]) ).

thf(f97,plain,
    ( spl3_6
  <=> ( ( sK1 @ sK5 )
      = $false ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).

thf(f78,plain,
    ( ( ( sK1 @ sK5 )
      = $true )
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f76]) ).

thf(f76,plain,
    ( spl3_3
  <=> ( ( sK1 @ sK5 )
      = $true ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).

thf(f105,plain,
    ( ~ spl3_2
    | ~ spl3_5 ),
    inference(avatar_contradiction_clause,[],[f104]) ).

thf(f104,plain,
    ( $false
    | ~ spl3_2
    | ~ spl3_5 ),
    inference(trivial_inequality_removal,[],[f103]) ).

thf(f103,plain,
    ( ( $false = $true )
    | ~ spl3_2
    | ~ spl3_5 ),
    inference(backward_demodulation,[],[f94,f74]) ).

thf(f74,plain,
    ( ( $false
      = ( sK0 @ sK5 ) )
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f72]) ).

thf(f72,plain,
    ( spl3_2
  <=> ( $false
      = ( sK0 @ sK5 ) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

thf(f94,plain,
    ( ( $true
      = ( sK0 @ sK5 ) )
    | ~ spl3_5 ),
    inference(avatar_component_clause,[],[f92]) ).

thf(f92,plain,
    ( spl3_5
  <=> ( $true
      = ( sK0 @ sK5 ) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).

thf(f102,plain,
    ( spl3_6
    | spl3_5 ),
    inference(avatar_split_clause,[],[f22,f92,f97]) ).

thf(f22,plain,
    ( ( ( sK1 @ sK5 )
      = $false )
    | ( $true
      = ( sK0 @ sK5 ) ) ),
    inference(not_proxy_clausification,[],[f21]) ).

thf(f21,plain,
    ( ( ( sK1 @ sK5 )
      = $false )
    | ( ( ~ ( sK0 @ sK5 ) )
      = $false ) ),
    inference(duplicate_literal_removal,[],[f20]) ).

thf(f20,plain,
    ( ( ( ~ ( sK0 @ sK5 ) )
      = $false )
    | ( ( sK1 @ sK5 )
      = $false )
    | ( ( sK1 @ sK5 )
      = $false ) ),
    inference(binary_proxy_clausification,[],[f18]) ).

thf(f18,plain,
    ( ( ( ( sK1 @ sK5 )
        | ( sK2 @ sK5 ) )
      = $false )
    | ( ( ~ ( sK0 @ sK5 ) )
      = $false )
    | ( ( sK1 @ sK5 )
      = $false ) ),
    inference(duplicate_literal_removal,[],[f17]) ).

thf(f17,plain,
    ( ( ( ~ ( sK0 @ sK5 ) )
      = $false )
    | ( ( ~ ( sK0 @ sK5 ) )
      = $false )
    | ( ( ( sK1 @ sK5 )
        | ( sK2 @ sK5 ) )
      = $false )
    | ( ( sK1 @ sK5 )
      = $false ) ),
    inference(binary_proxy_clausification,[],[f16]) ).

thf(f16,plain,
    ( ( ( sK1 @ sK5 )
      = $false )
    | ( ( ~ ( sK0 @ sK5 )
        & ( ( sK1 @ sK5 )
          | ( sK2 @ sK5 ) ) )
      = $false )
    | ( ( ~ ( sK0 @ sK5 ) )
      = $false ) ),
    inference(binary_proxy_clausification,[],[f15]) ).

thf(f15,plain,
    ( ( ( ~ ( sK0 @ sK5 )
        & ( sK1 @ sK5 ) )
      = $false )
    | ( ( ~ ( sK0 @ sK5 )
        & ( ( sK1 @ sK5 )
          | ( sK2 @ sK5 ) ) )
      = $false ) ),
    inference(binary_proxy_clausification,[],[f13]) ).

thf(f13,plain,
    ( ( ( ( ~ ( sK0 @ sK5 )
          & ( sK1 @ sK5 ) )
        | ( ( sK2 @ sK5 )
          & ~ ( sK0 @ sK5 ) ) )
      = $false )
    | ( ( ~ ( sK0 @ sK5 )
        & ( ( sK1 @ sK5 )
          | ( sK2 @ sK5 ) ) )
      = $false ) ),
    inference(binary_proxy_clausification,[],[f11]) ).

thf(f11,plain,
    ( ( ~ ( sK0 @ sK5 )
      & ( ( sK1 @ sK5 )
        | ( sK2 @ sK5 ) ) )
   != ( ( ~ ( sK0 @ sK5 )
        & ( sK1 @ sK5 ) )
      | ( ( sK2 @ sK5 )
        & ~ ( sK0 @ sK5 ) ) ) ),
    inference(beta_eta_normalization,[],[f10]) ).

thf(f10,plain,
    ( ( ^ [Y0: a] :
          ( ( ~ ( sK0 @ Y0 )
            & ( sK1 @ Y0 ) )
          | ( ( sK2 @ Y0 )
            & ~ ( sK0 @ Y0 ) ) )
      @ sK5 )
   != ( ^ [Y0: a] :
          ( ~ ( sK0 @ Y0 )
          & ( ( sK1 @ Y0 )
            | ( sK2 @ Y0 ) ) )
      @ sK5 ) ),
    inference(negative_extensionality,[],[f9]) ).

thf(f9,plain,
    ( ( ^ [Y0: a] :
          ( ~ ( sK0 @ Y0 )
          & ( ( sK1 @ Y0 )
            | ( sK2 @ Y0 ) ) ) )
   != ( ^ [Y0: a] :
          ( ( ~ ( sK0 @ Y0 )
            & ( sK1 @ Y0 ) )
          | ( ( sK2 @ Y0 )
            & ~ ( sK0 @ Y0 ) ) ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f8,plain,
    ( ( ^ [Y0: a] :
          ( ~ ( sK0 @ Y0 )
          & ( ( sK1 @ Y0 )
            | ( sK2 @ Y0 ) ) ) )
   != ( ^ [Y0: a] :
          ( ( ~ ( sK0 @ Y0 )
            & ( sK1 @ Y0 ) )
          | ( ( sK2 @ Y0 )
            & ~ ( sK0 @ Y0 ) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).

thf(f7,plain,
    ( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ^ [Y0: a] :
              ( ( ~ ( X0 @ Y0 )
                & ( X1 @ Y0 ) )
              | ( ( X2 @ Y0 )
                & ~ ( X0 @ Y0 ) ) ) )
       != ( ^ [Y0: a] :
              ( ~ ( X0 @ Y0 )
              & ( ( X1 @ Y0 )
                | ( X2 @ Y0 ) ) ) ) )
   => ( ( ^ [Y0: a] :
            ( ~ ( sK0 @ Y0 )
            & ( ( sK1 @ Y0 )
              | ( sK2 @ Y0 ) ) ) )
     != ( ^ [Y0: a] :
            ( ( ~ ( sK0 @ Y0 )
              & ( sK1 @ Y0 ) )
            | ( ( sK2 @ Y0 )
              & ~ ( sK0 @ Y0 ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f6,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ( ^ [Y0: a] :
            ( ( ~ ( X0 @ Y0 )
              & ( X1 @ Y0 ) )
            | ( ( X2 @ Y0 )
              & ~ ( X0 @ Y0 ) ) ) )
     != ( ^ [Y0: a] :
            ( ~ ( X0 @ Y0 )
            & ( ( X1 @ Y0 )
              | ( X2 @ Y0 ) ) ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f5,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ^ [Y0: a] :
              ( ( ~ ( X0 @ Y0 )
                & ( X1 @ Y0 ) )
              | ( ( X2 @ Y0 )
                & ~ ( X0 @ Y0 ) ) ) )
        = ( ^ [Y0: a] :
              ( ~ ( X0 @ Y0 )
              & ( ( X1 @ Y0 )
                | ( X2 @ Y0 ) ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f4,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ^ [X3: a] :
              ( ( ~ ( X0 @ X3 )
                & ( X2 @ X3 ) )
              | ( ( X1 @ X3 )
                & ~ ( X0 @ X3 ) ) ) )
        = ( ^ [X4: a] :
              ( ( ( X2 @ X4 )
                | ( X1 @ X4 ) )
              & ~ ( X0 @ X4 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ! [X2: a > $o,X0: a > $o,X1: a > $o] :
        ( ( ^ [X4: a] :
              ( ( ~ ( X2 @ X4 )
                & ( X1 @ X4 ) )
              | ( ( X0 @ X4 )
                & ~ ( X2 @ X4 ) ) ) )
        = ( ^ [X3: a] :
              ( ( ( X1 @ X3 )
                | ( X0 @ X3 ) )
              & ~ ( X2 @ X3 ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ! [X2: a > $o,X0: a > $o,X1: a > $o] :
      ( ( ^ [X4: a] :
            ( ( ~ ( X2 @ X4 )
              & ( X1 @ X4 ) )
            | ( ( X0 @ X4 )
              & ~ ( X2 @ X4 ) ) ) )
      = ( ^ [X3: a] :
            ( ( ( X1 @ X3 )
              | ( X0 @ X3 ) )
            & ~ ( X2 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_89_pme) ).

thf(f95,plain,
    ( spl3_4
    | spl3_5 ),
    inference(avatar_split_clause,[],[f34,f92,f88]) ).

thf(f34,plain,
    ( ( ( sK2 @ sK5 )
      = $false )
    | ( $true
      = ( sK0 @ sK5 ) ) ),
    inference(duplicate_literal_removal,[],[f33]) ).

thf(f33,plain,
    ( ( ( sK2 @ sK5 )
      = $false )
    | ( $true
      = ( sK0 @ sK5 ) )
    | ( $true
      = ( sK0 @ sK5 ) ) ),
    inference(not_proxy_clausification,[],[f32]) ).

thf(f32,plain,
    ( ( ( sK2 @ sK5 )
      = $false )
    | ( $true
      = ( sK0 @ sK5 ) )
    | ( ( ~ ( sK0 @ sK5 ) )
      = $false ) ),
    inference(duplicate_literal_removal,[],[f31]) ).

thf(f31,plain,
    ( ( $true
      = ( sK0 @ sK5 ) )
    | ( ( sK2 @ sK5 )
      = $false )
    | ( ( sK2 @ sK5 )
      = $false )
    | ( ( ~ ( sK0 @ sK5 ) )
      = $false ) ),
    inference(binary_proxy_clausification,[],[f26]) ).

thf(f26,plain,
    ( ( ( ( sK2 @ sK5 )
        & ~ ( sK0 @ sK5 ) )
      = $false )
    | ( ( sK2 @ sK5 )
      = $false )
    | ( $true
      = ( sK0 @ sK5 ) ) ),
    inference(binary_proxy_clausification,[],[f25]) ).

thf(f25,plain,
    ( ( ( ( sK1 @ sK5 )
        | ( sK2 @ sK5 ) )
      = $false )
    | ( ( ( sK2 @ sK5 )
        & ~ ( sK0 @ sK5 ) )
      = $false )
    | ( $true
      = ( sK0 @ sK5 ) ) ),
    inference(not_proxy_clausification,[],[f24]) ).

thf(f24,plain,
    ( ( ( ~ ( sK0 @ sK5 ) )
      = $false )
    | ( ( ( sK1 @ sK5 )
        | ( sK2 @ sK5 ) )
      = $false )
    | ( ( ( sK2 @ sK5 )
        & ~ ( sK0 @ sK5 ) )
      = $false ) ),
    inference(binary_proxy_clausification,[],[f14]) ).

thf(f14,plain,
    ( ( ( ~ ( sK0 @ sK5 )
        & ( ( sK1 @ sK5 )
          | ( sK2 @ sK5 ) ) )
      = $false )
    | ( ( ( sK2 @ sK5 )
        & ~ ( sK0 @ sK5 ) )
      = $false ) ),
    inference(binary_proxy_clausification,[],[f13]) ).

thf(f83,plain,
    ( spl3_3
    | spl3_1 ),
    inference(avatar_split_clause,[],[f51,f68,f76]) ).

thf(f51,plain,
    ( ( ( sK1 @ sK5 )
      = $true )
    | ( ( sK2 @ sK5 )
      = $true ) ),
    inference(duplicate_literal_removal,[],[f50]) ).

thf(f50,plain,
    ( ( ( sK2 @ sK5 )
      = $true )
    | ( ( sK1 @ sK5 )
      = $true )
    | ( ( sK1 @ sK5 )
      = $true )
    | ( ( sK2 @ sK5 )
      = $true ) ),
    inference(binary_proxy_clausification,[],[f47]) ).

thf(f47,plain,
    ( ( ( sK1 @ sK5 )
      = $true )
    | ( ( ( sK1 @ sK5 )
        | ( sK2 @ sK5 ) )
      = $true )
    | ( ( sK2 @ sK5 )
      = $true ) ),
    inference(binary_proxy_clausification,[],[f38]) ).

thf(f38,plain,
    ( ( ( ~ ( sK0 @ sK5 )
        & ( ( sK1 @ sK5 )
          | ( sK2 @ sK5 ) ) )
      = $true )
    | ( ( sK1 @ sK5 )
      = $true )
    | ( ( sK2 @ sK5 )
      = $true ) ),
    inference(binary_proxy_clausification,[],[f37]) ).

thf(f37,plain,
    ( ( ( ~ ( sK0 @ sK5 )
        & ( sK1 @ sK5 ) )
      = $true )
    | ( ( ~ ( sK0 @ sK5 )
        & ( ( sK1 @ sK5 )
          | ( sK2 @ sK5 ) ) )
      = $true )
    | ( ( sK2 @ sK5 )
      = $true ) ),
    inference(binary_proxy_clausification,[],[f35]) ).

thf(f35,plain,
    ( ( ( ( sK2 @ sK5 )
        & ~ ( sK0 @ sK5 ) )
      = $true )
    | ( ( ~ ( sK0 @ sK5 )
        & ( sK1 @ sK5 ) )
      = $true )
    | ( ( ~ ( sK0 @ sK5 )
        & ( ( sK1 @ sK5 )
          | ( sK2 @ sK5 ) ) )
      = $true ) ),
    inference(binary_proxy_clausification,[],[f12]) ).

thf(f12,plain,
    ( ( ( ( ~ ( sK0 @ sK5 )
          & ( sK1 @ sK5 ) )
        | ( ( sK2 @ sK5 )
          & ~ ( sK0 @ sK5 ) ) )
      = $true )
    | ( ( ~ ( sK0 @ sK5 )
        & ( ( sK1 @ sK5 )
          | ( sK2 @ sK5 ) ) )
      = $true ) ),
    inference(binary_proxy_clausification,[],[f11]) ).

thf(f82,plain,
    spl3_2,
    inference(avatar_split_clause,[],[f59,f72]) ).

thf(f59,plain,
    ( $false
    = ( sK0 @ sK5 ) ),
    inference(duplicate_literal_removal,[],[f58]) ).

thf(f58,plain,
    ( ( $false
      = ( sK0 @ sK5 ) )
    | ( $false
      = ( sK0 @ sK5 ) ) ),
    inference(not_proxy_clausification,[],[f57]) ).

thf(f57,plain,
    ( ( ( ~ ( sK0 @ sK5 ) )
      = $true )
    | ( $false
      = ( sK0 @ sK5 ) ) ),
    inference(binary_proxy_clausification,[],[f55]) ).

thf(f55,plain,
    ( ( ( ~ ( sK0 @ sK5 )
        & ( sK1 @ sK5 ) )
      = $true )
    | ( $false
      = ( sK0 @ sK5 ) ) ),
    inference(not_proxy_clausification,[],[f54]) ).

thf(f54,plain,
    ( ( ( ~ ( sK0 @ sK5 ) )
      = $true )
    | ( ( ~ ( sK0 @ sK5 )
        & ( sK1 @ sK5 ) )
      = $true ) ),
    inference(duplicate_literal_removal,[],[f53]) ).

thf(f53,plain,
    ( ( ( ~ ( sK0 @ sK5 ) )
      = $true )
    | ( ( ~ ( sK0 @ sK5 )
        & ( sK1 @ sK5 ) )
      = $true )
    | ( ( ~ ( sK0 @ sK5 ) )
      = $true ) ),
    inference(binary_proxy_clausification,[],[f36]) ).

thf(f36,plain,
    ( ( ( ~ ( sK0 @ sK5 )
        & ( ( sK1 @ sK5 )
          | ( sK2 @ sK5 ) ) )
      = $true )
    | ( ( ~ ( sK0 @ sK5 )
        & ( sK1 @ sK5 ) )
      = $true )
    | ( ( ~ ( sK0 @ sK5 ) )
      = $true ) ),
    inference(binary_proxy_clausification,[],[f35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET615^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/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.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 11:54:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_EQU_NAR problem
% 0.14/0.35  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/sandbox2/benchmark/theBenchmark.p
% 0.21/0.37  % (26997)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.21/0.37  % (26997)Instruction limit reached!
% 0.21/0.37  % (26997)------------------------------
% 0.21/0.37  % (26997)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (26997)Termination reason: Unknown
% 0.21/0.37  % (26997)Termination phase: Saturation
% 0.21/0.37  
% 0.21/0.37  % (26997)Memory used [KB]: 5500
% 0.21/0.37  % (26997)Time elapsed: 0.005 s
% 0.21/0.37  % (26997)Instructions burned: 4 (million)
% 0.21/0.37  % (26997)------------------------------
% 0.21/0.37  % (26997)------------------------------
% 0.21/0.37  % (27002)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.21/0.37  % (26998)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.21/0.38  % (26996)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.21/0.38  % (27001)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.21/0.38  % (27003)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.21/0.38  % (27000)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.21/0.38  % (26999)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.21/0.38  % (26998)First to succeed.
% 0.21/0.38  % (26999)Instruction limit reached!
% 0.21/0.38  % (26999)------------------------------
% 0.21/0.38  % (26999)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38  % (26999)Termination reason: Unknown
% 0.21/0.38  % (26999)Termination phase: Saturation
% 0.21/0.38  
% 0.21/0.38  % (26999)Memory used [KB]: 895
% 0.21/0.38  % (26999)Time elapsed: 0.003 s
% 0.21/0.38  % (26999)Instructions burned: 2 (million)
% 0.21/0.38  % (27000)Instruction limit reached!
% 0.21/0.38  % (27000)------------------------------
% 0.21/0.38  % (27000)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38  % (26999)------------------------------
% 0.21/0.38  % (26999)------------------------------
% 0.21/0.38  % (27000)Termination reason: Unknown
% 0.21/0.38  % (27000)Termination phase: Saturation
% 0.21/0.38  
% 0.21/0.38  % (27003)Refutation not found, incomplete strategy
% 0.21/0.38  % (27003)------------------------------
% 0.21/0.38  % (27003)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38  % (27003)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38  
% 0.21/0.38  
% 0.21/0.38  % (27003)Memory used [KB]: 5500
% 0.21/0.38  % (27003)Time elapsed: 0.003 s
% 0.21/0.38  % (27003)Instructions burned: 2 (million)
% 0.21/0.38  % (27003)------------------------------
% 0.21/0.38  % (27003)------------------------------
% 0.21/0.38  % (27000)Memory used [KB]: 5500
% 0.21/0.38  % (27000)Time elapsed: 0.003 s
% 0.21/0.38  % (27000)Instructions burned: 2 (million)
% 0.21/0.38  % (27000)------------------------------
% 0.21/0.38  % (27000)------------------------------
% 0.21/0.38  % (27001)Also succeeded, but the first one will report.
% 0.21/0.38  % (26998)Refutation found. Thanks to Tanya!
% 0.21/0.38  % SZS status Theorem for theBenchmark
% 0.21/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38  % (26998)------------------------------
% 0.21/0.38  % (26998)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38  % (26998)Termination reason: Refutation
% 0.21/0.38  
% 0.21/0.38  % (26998)Memory used [KB]: 5500
% 0.21/0.38  % (26998)Time elapsed: 0.007 s
% 0.21/0.38  % (26998)Instructions burned: 4 (million)
% 0.21/0.38  % (26998)------------------------------
% 0.21/0.38  % (26998)------------------------------
% 0.21/0.38  % (26995)Success in time 0.023 s
% 0.21/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------