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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU902^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 : n018.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:52:07 EDT 2024

% Result   : Theorem 0.20s 0.40s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   29
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   40 (  15 unt;   5 typ;   0 def)
%            Number of atoms       :  228 ( 110 equ;   0 cnn)
%            Maximal formula atoms :    8 (   6 avg)
%            Number of connectives :  366 (  50   ~;  18   |;  45   &; 218   @)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :  104 ( 104   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   5 usr;   3 con; 0-2 aty)
%                                         (   0  !!;  22  ??;   0 @@+;   0 @@-)
%            Number of variables   :   98 (  46   ^  45   !;   6   ?;  98   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

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

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

thf(func_def_13,type,
    sK2: $i > $o ).

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

thf(func_def_15,type,
    sK4: $i > $i > $o ).

thf(f51,plain,
    $false,
    inference(trivial_inequality_removal,[],[f50]) ).

thf(f50,plain,
    $false = $true,
    inference(duplicate_literal_removal,[],[f44]) ).

thf(f44,plain,
    ( ( $false = $true )
    | ( $false = $true ) ),
    inference(superposition,[],[f43,f21]) ).

thf(f21,plain,
    ( ( sK2 @ ( sK0 @ sK2 ) )
    = $false ),
    inference(not_proxy_clausification,[],[f20]) ).

thf(f20,plain,
    ( ( ~ ( sK2 @ ( sK0 @ sK2 ) ) )
    = $true ),
    inference(binary_proxy_clausification,[],[f18]) ).

thf(f18,plain,
    ( $true
    = ( ~ ( sK2 @ ( sK0 @ sK2 ) )
      & ( ( sK0 @ sK2 )
        = ( sK0
          @ ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                  & ( ( sK0 @ Y1 )
                    = Y0 ) ) ) ) ) ) ),
    inference(beta_eta_normalization,[],[f17]) ).

thf(f17,plain,
    ( ( ^ [Y0: $i > $o] :
          ( ~ ( Y0 @ ( sK0 @ Y0 ) )
          & ( ( sK0 @ Y0 )
            = ( sK0
              @ ^ [Y1: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y2: $i > $o] :
                      ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                      & ( ( sK0 @ Y2 )
                        = Y1 ) ) ) ) ) )
      @ sK2 )
    = $true ),
    inference(sigma_clausification,[],[f16]) ).

thf(f16,plain,
    ( ( ?? @ ( $i > $o )
      @ ^ [Y0: $i > $o] :
          ( ~ ( Y0 @ ( sK0 @ Y0 ) )
          & ( ( sK0 @ Y0 )
            = ( sK0
              @ ^ [Y1: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y2: $i > $o] :
                      ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                      & ( ( sK0 @ Y2 )
                        = Y1 ) ) ) ) ) ) )
    = $true ),
    inference(beta_eta_normalization,[],[f15]) ).

thf(f15,plain,
    ( ( ^ [Y0: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y1: $i > $o] :
              ( ~ ( Y1 @ ( sK0 @ Y1 ) )
              & ( ( sK0 @ Y1 )
                = Y0 ) ) )
      @ ( sK0
        @ ^ [Y0: $i] :
            ( ?? @ ( $i > $o )
            @ ^ [Y1: $i > $o] :
                ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                & ( ( sK0 @ Y1 )
                  = Y0 ) ) ) ) )
    = $true ),
    inference(definition_unfolding,[],[f12,f14,f14]) ).

thf(f14,plain,
    ( d
    = ( ^ [Y0: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y1: $i > $o] :
              ( ~ ( Y1 @ ( sK0 @ Y1 ) )
              & ( ( sK0 @ Y1 )
                = Y0 ) ) ) ) ),
    inference(cnf_transformation,[],[f11]) ).

thf(f11,plain,
    ( ( d
      = ( ^ [Y0: $i] :
            ( ?? @ ( $i > $o )
            @ ^ [Y1: $i > $o] :
                ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                & ( ( sK0 @ Y1 )
                  = Y0 ) ) ) ) )
    & ! [X1: $i > $o,X2: $i > $o] :
        ( ( ( sK0 @ X2 )
         != ( sK0 @ X1 ) )
        | ( X1 = X2 ) )
    & ( ( d @ ( sK0 @ d ) )
      = $true ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).

thf(f10,plain,
    ( ? [X0: ( $i > $o ) > $i] :
        ( ( d
          = ( ^ [Y0: $i] :
                ( ?? @ ( $i > $o )
                @ ^ [Y1: $i > $o] :
                    ( ~ ( Y1 @ ( X0 @ Y1 ) )
                    & ( ( X0 @ Y1 )
                      = Y0 ) ) ) ) )
        & ! [X1: $i > $o,X2: $i > $o] :
            ( ( ( X0 @ X1 )
             != ( X0 @ X2 ) )
            | ( X1 = X2 ) )
        & ( ( d @ ( X0 @ d ) )
          = $true ) )
   => ( ( d
        = ( ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                  & ( ( sK0 @ Y1 )
                    = Y0 ) ) ) ) )
      & ! [X2: $i > $o,X1: $i > $o] :
          ( ( ( sK0 @ X2 )
           != ( sK0 @ X1 ) )
          | ( X1 = X2 ) )
      & ( ( d @ ( sK0 @ d ) )
        = $true ) ) ),
    introduced(choice_axiom,[]) ).

thf(f9,plain,
    ? [X0: ( $i > $o ) > $i] :
      ( ( d
        = ( ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( X0 @ Y1 ) )
                  & ( ( X0 @ Y1 )
                    = Y0 ) ) ) ) )
      & ! [X1: $i > $o,X2: $i > $o] :
          ( ( ( X0 @ X1 )
           != ( X0 @ X2 ) )
          | ( X1 = X2 ) )
      & ( ( d @ ( X0 @ d ) )
        = $true ) ),
    inference(flattening,[],[f8]) ).

thf(f8,plain,
    ? [X0: ( $i > $o ) > $i] :
      ( ( ( d @ ( X0 @ d ) )
        = $true )
      & ( d
        = ( ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( X0 @ Y1 ) )
                  & ( ( X0 @ Y1 )
                    = Y0 ) ) ) ) )
      & ! [X1: $i > $o,X2: $i > $o] :
          ( ( ( X0 @ X1 )
           != ( X0 @ X2 ) )
          | ( X1 = X2 ) ) ),
    inference(ennf_transformation,[],[f7]) ).

thf(f7,plain,
    ~ ! [X0: ( $i > $o ) > $i] :
        ( ( ( d
            = ( ^ [Y0: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y1: $i > $o] :
                      ( ~ ( Y1 @ ( X0 @ Y1 ) )
                      & ( ( X0 @ Y1 )
                        = Y0 ) ) ) ) )
          & ! [X1: $i > $o,X2: $i > $o] :
              ( ( ( X0 @ X1 )
                = ( X0 @ X2 ) )
             => ( X1 = X2 ) ) )
       => ( ( d @ ( X0 @ d ) )
         != $true ) ),
    inference(flattening,[],[f6]) ).

thf(f6,plain,
    ~ ! [X0: ( $i > $o ) > $i] :
        ( ( ( d
            = ( ^ [Y0: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y1: $i > $o] :
                      ( ~ ( Y1 @ ( X0 @ Y1 ) )
                      & ( ( X0 @ Y1 )
                        = Y0 ) ) ) ) )
          & ! [X1: $i > $o,X2: $i > $o] :
              ( ( ( X0 @ X1 )
                = ( X0 @ X2 ) )
             => ( X1 = X2 ) ) )
       => ( ( d @ ( X0 @ d ) )
         != $true ) ),
    inference(rectify,[],[f5]) ).

thf(f5,plain,
    ~ ! [X0: ( $i > $o ) > $i] :
        ( ( ( d
            = ( ^ [Y0: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y1: $i > $o] :
                      ( ~ ( Y1 @ ( X0 @ Y1 ) )
                      & ( ( X0 @ Y1 )
                        = Y0 ) ) ) ) )
          & ! [X3: $i > $o,X4: $i > $o] :
              ( ( ( X0 @ X4 )
                = ( X0 @ X3 ) )
             => ( X3 = X4 ) ) )
       => ( ( d @ ( X0 @ d ) )
         != $true ) ),
    inference(fool_elimination,[],[f4]) ).

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

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

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

thf(f12,plain,
    ( ( d @ ( sK0 @ d ) )
    = $true ),
    inference(cnf_transformation,[],[f11]) ).

thf(f43,plain,
    ! [X0: $i > $o] :
      ( ( ( sK2 @ ( sK0 @ X0 ) )
        = $true )
      | ( ( X0 @ ( sK0 @ X0 ) )
        = $true ) ),
    inference(equality_resolution,[],[f36]) ).

thf(f36,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( ( sK0 @ X2 )
       != X1 )
      | ( ( X2 @ ( sK0 @ X2 ) )
        = $true )
      | ( ( sK2 @ X1 )
        = $true ) ),
    inference(equality_proxy_clausification,[],[f35]) ).

thf(f35,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( ( X2 @ ( sK0 @ X2 ) )
        = $true )
      | ( ( sK2 @ X1 )
        = $true )
      | ( ( ( sK0 @ X2 )
          = X1 )
        = $false ) ),
    inference(not_proxy_clausification,[],[f34]) ).

thf(f34,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( ( sK2 @ X1 )
        = $true )
      | ( ( ~ ( X2 @ ( sK0 @ X2 ) ) )
        = $false )
      | ( ( ( sK0 @ X2 )
          = X1 )
        = $false ) ),
    inference(binary_proxy_clausification,[],[f33]) ).

thf(f33,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( ( ~ ( X2 @ ( sK0 @ X2 ) )
          & ( ( sK0 @ X2 )
            = X1 ) )
        = $false )
      | ( ( sK2 @ X1 )
        = $true ) ),
    inference(beta_eta_normalization,[],[f32]) ).

thf(f32,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( ( sK2 @ X1 )
        = $true )
      | ( ( ^ [Y0: $i > $o] :
              ( ~ ( Y0 @ ( sK0 @ Y0 ) )
              & ( ( sK0 @ Y0 )
                = X1 ) )
          @ X2 )
        = $false ) ),
    inference(pi_clausification,[],[f31]) ).

thf(f31,plain,
    ! [X1: $i] :
      ( ( ( ?? @ ( $i > $o )
          @ ^ [Y0: $i > $o] :
              ( ~ ( Y0 @ ( sK0 @ Y0 ) )
              & ( ( sK0 @ Y0 )
                = X1 ) ) )
        = $false )
      | ( ( sK2 @ X1 )
        = $true ) ),
    inference(binary_proxy_clausification,[],[f29]) ).

thf(f29,plain,
    ! [X1: $i] :
      ( ( ?? @ ( $i > $o )
        @ ^ [Y0: $i > $o] :
            ( ~ ( Y0 @ ( sK0 @ Y0 ) )
            & ( ( sK0 @ Y0 )
              = X1 ) ) )
      = ( sK2 @ X1 ) ),
    inference(beta_eta_normalization,[],[f28]) ).

thf(f28,plain,
    ! [X1: $i] :
      ( ( ^ [Y0: $i] :
            ( ?? @ ( $i > $o )
            @ ^ [Y1: $i > $o] :
                ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                & ( ( sK0 @ Y1 )
                  = Y0 ) ) )
        @ X1 )
      = ( sK2 @ X1 ) ),
    inference(argument_congruence,[],[f27]) ).

thf(f27,plain,
    ( sK2
    = ( ^ [Y0: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y1: $i > $o] :
              ( ~ ( Y1 @ ( sK0 @ Y1 ) )
              & ( ( sK0 @ Y1 )
                = Y0 ) ) ) ) ),
    inference(equality_resolution,[],[f25]) ).

thf(f25,plain,
    ! [X0: $i > $o] :
      ( ( ( sK0 @ sK2 )
       != ( sK0 @ X0 ) )
      | ( ( ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                  & ( ( sK0 @ Y1 )
                    = Y0 ) ) ) )
        = X0 ) ),
    inference(superposition,[],[f13,f22]) ).

thf(f22,plain,
    ( ( sK0 @ sK2 )
    = ( sK0
      @ ^ [Y0: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y1: $i > $o] :
              ( ~ ( Y1 @ ( sK0 @ Y1 ) )
              & ( ( sK0 @ Y1 )
                = Y0 ) ) ) ) ),
    inference(equality_proxy_clausification,[],[f19]) ).

thf(f19,plain,
    ( ( ( sK0 @ sK2 )
      = ( sK0
        @ ^ [Y0: $i] :
            ( ?? @ ( $i > $o )
            @ ^ [Y1: $i > $o] :
                ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                & ( ( sK0 @ Y1 )
                  = Y0 ) ) ) ) )
    = $true ),
    inference(binary_proxy_clausification,[],[f18]) ).

thf(f13,plain,
    ! [X2: $i > $o,X1: $i > $o] :
      ( ( ( sK0 @ X2 )
       != ( sK0 @ X1 ) )
      | ( X1 = X2 ) ),
    inference(cnf_transformation,[],[f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem    : SEU902^5 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.16  % 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.37  % Computer : n018.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 300
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Sun May 19 16:05:08 EDT 2024
% 0.14/0.37  % CPUTime    : 
% 0.14/0.37  This is a TH0_THM_EQU_NAR problem
% 0.20/0.38  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.20/0.39  % (22304)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.20/0.39  % (22305)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.39  % (22303)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.20/0.39  % (22307)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.20/0.39  % (22302)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.20/0.39  % (22306)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.20/0.39  % (22308)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.39  % (22309)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.20/0.40  % (22305)Instruction limit reached!
% 0.20/0.40  % (22305)------------------------------
% 0.20/0.40  % (22305)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40  % (22305)Termination reason: Unknown
% 0.20/0.40  % (22305)Termination phase: Saturation
% 0.20/0.40  
% 0.20/0.40  % (22305)Memory used [KB]: 5373
% 0.20/0.40  % (22306)Instruction limit reached!
% 0.20/0.40  % (22306)------------------------------
% 0.20/0.40  % (22306)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40  % (22306)Termination reason: Unknown
% 0.20/0.40  % (22306)Termination phase: Saturation
% 0.20/0.40  
% 0.20/0.40  % (22306)Memory used [KB]: 5500
% 0.20/0.40  % (22306)Time elapsed: 0.003 s
% 0.20/0.40  % (22306)Instructions burned: 2 (million)
% 0.20/0.40  % (22306)------------------------------
% 0.20/0.40  % (22306)------------------------------
% 0.20/0.40  % (22305)Time elapsed: 0.003 s
% 0.20/0.40  % (22305)Instructions burned: 2 (million)
% 0.20/0.40  % (22305)------------------------------
% 0.20/0.40  % (22305)------------------------------
% 0.20/0.40  % (22309)Instruction limit reached!
% 0.20/0.40  % (22309)------------------------------
% 0.20/0.40  % (22309)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40  % (22309)Termination reason: Unknown
% 0.20/0.40  % (22309)Termination phase: Saturation
% 0.20/0.40  
% 0.20/0.40  % (22309)Memory used [KB]: 5500
% 0.20/0.40  % (22309)Time elapsed: 0.005 s
% 0.20/0.40  % (22309)Instructions burned: 3 (million)
% 0.20/0.40  % (22309)------------------------------
% 0.20/0.40  % (22309)------------------------------
% 0.20/0.40  % (22303)Instruction limit reached!
% 0.20/0.40  % (22303)------------------------------
% 0.20/0.40  % (22303)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40  % (22303)Termination reason: Unknown
% 0.20/0.40  % (22303)Termination phase: Saturation
% 0.20/0.40  
% 0.20/0.40  % (22303)Memory used [KB]: 5500
% 0.20/0.40  % (22303)Time elapsed: 0.005 s
% 0.20/0.40  % (22303)Instructions burned: 4 (million)
% 0.20/0.40  % (22303)------------------------------
% 0.20/0.40  % (22303)------------------------------
% 0.20/0.40  % (22308)First to succeed.
% 0.20/0.40  % (22304)Also succeeded, but the first one will report.
% 0.20/0.40  % (22307)Also succeeded, but the first one will report.
% 0.20/0.40  % (22308)Refutation found. Thanks to Tanya!
% 0.20/0.40  % SZS status Theorem for theBenchmark
% 0.20/0.40  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.40  % (22308)------------------------------
% 0.20/0.40  % (22308)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40  % (22308)Termination reason: Refutation
% 0.20/0.40  
% 0.20/0.40  % (22308)Memory used [KB]: 5500
% 0.20/0.40  % (22308)Time elapsed: 0.008 s
% 0.20/0.40  % (22308)Instructions burned: 5 (million)
% 0.20/0.40  % (22308)------------------------------
% 0.20/0.40  % (22308)------------------------------
% 0.20/0.40  % (22301)Success in time 0.02 s
% 0.20/0.40  % Vampire---4.8 exiting
%------------------------------------------------------------------------------