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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : DAT056^1 : TPTP v8.2.0. Released v5.4.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 : n022.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 : Mon May 20 19:49:28 EDT 2024

% Result   : Theorem 0.23s 0.41s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   62 (  18 unt;  16 typ;   0 def)
%            Number of atoms       :   91 (  73 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  724 (  41   ~;  27   |;   6   &; 638   @)
%                                         (   2 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    2 (   2 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  14 usr;  13 con; 0-2 aty)
%            Number of variables   :  127 (   0   ^  93   !;  34   ?; 127   :)

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

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

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

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

thf(func_def_2,type,
    ap: lst > lst > lst ).

thf(func_def_3,type,
    cns: a > lst > lst ).

thf(func_def_4,type,
    nl: lst ).

thf(func_def_5,type,
    xs: lst ).

thf(func_def_9,type,
    sK0: lst ).

thf(func_def_10,type,
    sK1: lst ).

thf(func_def_11,type,
    sK2: lst ).

thf(func_def_12,type,
    sK3: a ).

thf(func_def_13,type,
    sK4: lst ).

thf(func_def_14,type,
    sK5: lst ).

thf(func_def_15,type,
    sK6: lst ).

thf(func_def_16,type,
    sK7: lst ).

thf(f58,plain,
    $false,
    inference(avatar_sat_refutation,[],[f38,f46,f55]) ).

thf(f55,plain,
    ~ spl8_1,
    inference(avatar_contradiction_clause,[],[f54]) ).

thf(f54,plain,
    ( $false
    | ~ spl8_1 ),
    inference(trivial_inequality_removal,[],[f53]) ).

thf(f53,plain,
    ( ( ( ap @ xs @ ( ap @ sK0 @ sK1 ) )
     != ( ap @ xs @ ( ap @ sK0 @ sK1 ) ) )
    | ~ spl8_1 ),
    inference(superposition,[],[f23,f33]) ).

thf(f33,plain,
    ( ! [X2: lst,X0: lst,X1: lst] :
        ( ( ap @ ( ap @ X0 @ X1 ) @ X2 )
        = ( ap @ X0 @ ( ap @ X1 @ X2 ) ) )
    | ~ spl8_1 ),
    inference(avatar_component_clause,[],[f32]) ).

thf(f32,plain,
    ( spl8_1
  <=> ! [X2: lst,X0: lst,X1: lst] :
        ( ( ap @ ( ap @ X0 @ X1 ) @ X2 )
        = ( ap @ X0 @ ( ap @ X1 @ X2 ) ) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).

thf(f23,plain,
    ( ( ap @ ( ap @ xs @ sK0 ) @ sK1 )
   != ( ap @ xs @ ( ap @ sK0 @ sK1 ) ) ),
    inference(cnf_transformation,[],[f16]) ).

thf(f16,plain,
    ( ( ap @ ( ap @ xs @ sK0 ) @ sK1 )
   != ( ap @ xs @ ( ap @ sK0 @ sK1 ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f14,f15]) ).

thf(f15,plain,
    ( ? [X0: lst,X1: lst] :
        ( ( ap @ xs @ ( ap @ X0 @ X1 ) )
       != ( ap @ ( ap @ xs @ X0 ) @ X1 ) )
   => ( ( ap @ ( ap @ xs @ sK0 ) @ sK1 )
     != ( ap @ xs @ ( ap @ sK0 @ sK1 ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f14,plain,
    ? [X0: lst,X1: lst] :
      ( ( ap @ xs @ ( ap @ X0 @ X1 ) )
     != ( ap @ ( ap @ xs @ X0 ) @ X1 ) ),
    inference(rectify,[],[f13]) ).

thf(f13,plain,
    ? [X1: lst,X0: lst] :
      ( ( ap @ xs @ ( ap @ X1 @ X0 ) )
     != ( ap @ ( ap @ xs @ X1 ) @ X0 ) ),
    inference(ennf_transformation,[],[f10]) ).

thf(f10,plain,
    ~ ! [X1: lst,X0: lst] :
        ( ( ap @ xs @ ( ap @ X1 @ X0 ) )
        = ( ap @ ( ap @ xs @ X1 ) @ X0 ) ),
    inference(rectify,[],[f5]) ).

thf(f5,negated_conjecture,
    ~ ! [X2: lst,X1: lst] :
        ( ( ap @ xs @ ( ap @ X1 @ X2 ) )
        = ( ap @ ( ap @ xs @ X1 ) @ X2 ) ),
    inference(negated_conjecture,[],[f4]) ).

thf(f4,conjecture,
    ! [X2: lst,X1: lst] :
      ( ( ap @ xs @ ( ap @ X1 @ X2 ) )
      = ( ap @ ( ap @ xs @ X1 ) @ X2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(f46,plain,
    spl8_2,
    inference(avatar_contradiction_clause,[],[f45]) ).

thf(f45,plain,
    ( $false
    | spl8_2 ),
    inference(trivial_inequality_removal,[],[f44]) ).

thf(f44,plain,
    ( ( ( cns @ sK3 @ ( ap @ sK2 @ ( ap @ sK4 @ sK5 ) ) )
     != ( cns @ sK3 @ ( ap @ sK2 @ ( ap @ sK4 @ sK5 ) ) ) )
    | spl8_2 ),
    inference(forward_demodulation,[],[f43,f40]) ).

thf(f40,plain,
    ! [X0: lst,X1: lst] :
      ( ( ap @ ( ap @ sK2 @ X0 ) @ X1 )
      = ( ap @ sK2 @ ( ap @ X0 @ X1 ) ) ),
    inference(subsumption_resolution,[],[f39,f25]) ).

thf(f25,plain,
    ! [X0: lst] :
      ( ( ap @ nl @ X0 )
      = X0 ),
    inference(cnf_transformation,[],[f7]) ).

thf(f7,plain,
    ! [X0: lst] :
      ( ( ap @ nl @ X0 )
      = X0 ),
    inference(rectify,[],[f3]) ).

thf(f3,axiom,
    ! [X7: lst] :
      ( ( ap @ nl @ X7 )
      = X7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2p_Osimps_I1_J) ).

thf(f39,plain,
    ! [X0: lst,X1: lst] :
      ( ( ( ap @ nl @ ( ap @ sK7 @ sK6 ) )
       != ( ap @ sK7 @ sK6 ) )
      | ( ( ap @ ( ap @ sK2 @ X0 ) @ X1 )
        = ( ap @ sK2 @ ( ap @ X0 @ X1 ) ) ) ),
    inference(forward_demodulation,[],[f28,f25]) ).

thf(f28,plain,
    ! [X0: lst,X1: lst] :
      ( ( ( ap @ nl @ ( ap @ sK7 @ sK6 ) )
       != ( ap @ ( ap @ nl @ sK7 ) @ sK6 ) )
      | ( ( ap @ ( ap @ sK2 @ X0 ) @ X1 )
        = ( ap @ sK2 @ ( ap @ X0 @ X1 ) ) ) ),
    inference(condensation,[],[f26]) ).

thf(f26,plain,
    ! [X2: lst,X0: lst,X1: lst,X8: lst,X7: lst] :
      ( ( ( ap @ sK2 @ ( ap @ X7 @ X8 ) )
        = ( ap @ ( ap @ sK2 @ X7 ) @ X8 ) )
      | ( ( ap @ ( ap @ X0 @ X1 ) @ X2 )
        = ( ap @ X0 @ ( ap @ X1 @ X2 ) ) )
      | ( ( ap @ nl @ ( ap @ sK7 @ sK6 ) )
       != ( ap @ ( ap @ nl @ sK7 ) @ sK6 ) ) ),
    inference(cnf_transformation,[],[f22]) ).

thf(f22,plain,
    ! [X0: lst] :
      ( ! [X1: lst,X2: lst] :
          ( ( ap @ ( ap @ X0 @ X1 ) @ X2 )
          = ( ap @ X0 @ ( ap @ X1 @ X2 ) ) )
      | ( ( ( ap @ ( cns @ sK3 @ sK2 ) @ ( ap @ sK4 @ sK5 ) )
         != ( ap @ ( ap @ ( cns @ sK3 @ sK2 ) @ sK4 ) @ sK5 ) )
        & ! [X7: lst,X8: lst] :
            ( ( ap @ sK2 @ ( ap @ X7 @ X8 ) )
            = ( ap @ ( ap @ sK2 @ X7 ) @ X8 ) ) )
      | ( ( ap @ nl @ ( ap @ sK7 @ sK6 ) )
       != ( ap @ ( ap @ nl @ sK7 ) @ sK6 ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7])],[f18,f21,f20,f19]) ).

thf(f19,plain,
    ( ? [X3: lst,X4: a] :
        ( ? [X5: lst,X6: lst] :
            ( ( ap @ ( cns @ X4 @ X3 ) @ ( ap @ X5 @ X6 ) )
           != ( ap @ ( ap @ ( cns @ X4 @ X3 ) @ X5 ) @ X6 ) )
        & ! [X7: lst,X8: lst] :
            ( ( ap @ X3 @ ( ap @ X7 @ X8 ) )
            = ( ap @ ( ap @ X3 @ X7 ) @ X8 ) ) )
   => ( ? [X6: lst,X5: lst] :
          ( ( ap @ ( ap @ ( cns @ sK3 @ sK2 ) @ X5 ) @ X6 )
         != ( ap @ ( cns @ sK3 @ sK2 ) @ ( ap @ X5 @ X6 ) ) )
      & ! [X8: lst,X7: lst] :
          ( ( ap @ sK2 @ ( ap @ X7 @ X8 ) )
          = ( ap @ ( ap @ sK2 @ X7 ) @ X8 ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f20,plain,
    ( ? [X6: lst,X5: lst] :
        ( ( ap @ ( ap @ ( cns @ sK3 @ sK2 ) @ X5 ) @ X6 )
       != ( ap @ ( cns @ sK3 @ sK2 ) @ ( ap @ X5 @ X6 ) ) )
   => ( ( ap @ ( cns @ sK3 @ sK2 ) @ ( ap @ sK4 @ sK5 ) )
     != ( ap @ ( ap @ ( cns @ sK3 @ sK2 ) @ sK4 ) @ sK5 ) ) ),
    introduced(choice_axiom,[]) ).

thf(f21,plain,
    ( ? [X9: lst,X10: lst] :
        ( ( ap @ ( ap @ nl @ X10 ) @ X9 )
       != ( ap @ nl @ ( ap @ X10 @ X9 ) ) )
   => ( ( ap @ nl @ ( ap @ sK7 @ sK6 ) )
     != ( ap @ ( ap @ nl @ sK7 ) @ sK6 ) ) ),
    introduced(choice_axiom,[]) ).

thf(f18,plain,
    ! [X0: lst] :
      ( ! [X1: lst,X2: lst] :
          ( ( ap @ ( ap @ X0 @ X1 ) @ X2 )
          = ( ap @ X0 @ ( ap @ X1 @ X2 ) ) )
      | ? [X3: lst,X4: a] :
          ( ? [X5: lst,X6: lst] :
              ( ( ap @ ( cns @ X4 @ X3 ) @ ( ap @ X5 @ X6 ) )
             != ( ap @ ( ap @ ( cns @ X4 @ X3 ) @ X5 ) @ X6 ) )
          & ! [X7: lst,X8: lst] :
              ( ( ap @ X3 @ ( ap @ X7 @ X8 ) )
              = ( ap @ ( ap @ X3 @ X7 ) @ X8 ) ) )
      | ? [X9: lst,X10: lst] :
          ( ( ap @ ( ap @ nl @ X10 ) @ X9 )
         != ( ap @ nl @ ( ap @ X10 @ X9 ) ) ) ),
    inference(rectify,[],[f12]) ).

thf(f12,plain,
    ! [X0: lst] :
      ( ! [X9: lst,X10: lst] :
          ( ( ap @ X0 @ ( ap @ X9 @ X10 ) )
          = ( ap @ ( ap @ X0 @ X9 ) @ X10 ) )
      | ? [X4: lst,X3: a] :
          ( ? [X8: lst,X7: lst] :
              ( ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X8 @ X7 ) )
             != ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X8 ) @ X7 ) )
          & ! [X6: lst,X5: lst] :
              ( ( ap @ X4 @ ( ap @ X6 @ X5 ) )
              = ( ap @ ( ap @ X4 @ X6 ) @ X5 ) ) )
      | ? [X2: lst,X1: lst] :
          ( ( ap @ nl @ ( ap @ X1 @ X2 ) )
         != ( ap @ ( ap @ nl @ X1 ) @ X2 ) ) ),
    inference(flattening,[],[f11]) ).

thf(f11,plain,
    ! [X0: lst] :
      ( ! [X9: lst,X10: lst] :
          ( ( ap @ X0 @ ( ap @ X9 @ X10 ) )
          = ( ap @ ( ap @ X0 @ X9 ) @ X10 ) )
      | ? [X4: lst,X3: a] :
          ( ? [X8: lst,X7: lst] :
              ( ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X8 @ X7 ) )
             != ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X8 ) @ X7 ) )
          & ! [X6: lst,X5: lst] :
              ( ( ap @ X4 @ ( ap @ X6 @ X5 ) )
              = ( ap @ ( ap @ X4 @ X6 ) @ X5 ) ) )
      | ? [X2: lst,X1: lst] :
          ( ( ap @ nl @ ( ap @ X1 @ X2 ) )
         != ( ap @ ( ap @ nl @ X1 ) @ X2 ) ) ),
    inference(ennf_transformation,[],[f9]) ).

thf(f9,plain,
    ! [X0: lst] :
      ( ! [X1: lst,X2: lst] :
          ( ( ap @ nl @ ( ap @ X1 @ X2 ) )
          = ( ap @ ( ap @ nl @ X1 ) @ X2 ) )
     => ( ! [X3: a,X4: lst] :
            ( ! [X6: lst,X5: lst] :
                ( ( ap @ X4 @ ( ap @ X6 @ X5 ) )
                = ( ap @ ( ap @ X4 @ X6 ) @ X5 ) )
           => ! [X7: lst,X8: lst] :
                ( ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X8 @ X7 ) )
                = ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X8 ) @ X7 ) ) )
       => ! [X9: lst,X10: lst] :
            ( ( ap @ X0 @ ( ap @ X9 @ X10 ) )
            = ( ap @ ( ap @ X0 @ X9 ) @ X10 ) ) ) ),
    inference(rectify,[],[f1]) ).

thf(f1,axiom,
    ! [X0: lst] :
      ( ! [X1: lst,X2: lst] :
          ( ( ap @ nl @ ( ap @ X1 @ X2 ) )
          = ( ap @ ( ap @ nl @ X1 ) @ X2 ) )
     => ( ! [X3: a,X4: lst] :
            ( ! [X6: lst,X5: lst] :
                ( ( ap @ X4 @ ( ap @ X5 @ X6 ) )
                = ( ap @ ( ap @ X4 @ X5 ) @ X6 ) )
           => ! [X2: lst,X1: lst] :
                ( ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X1 @ X2 ) )
                = ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X1 ) @ X2 ) ) )
       => ! [X5: lst,X6: lst] :
            ( ( ap @ X0 @ ( ap @ X5 @ X6 ) )
            = ( ap @ ( ap @ X0 @ X5 ) @ X6 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_lst_Oinduct_091where_AP_A_061_A_C_Fxs_O_AALL_Ays_Azs_O_Aap_Axs_A_Iap_Ays_Azs_J_A_061_Aap_A_Iap_Axs_Ays_J_Azs_C_093) ).

thf(f43,plain,
    ( ( ( cns @ sK3 @ ( ap @ ( ap @ sK2 @ sK4 ) @ sK5 ) )
     != ( cns @ sK3 @ ( ap @ sK2 @ ( ap @ sK4 @ sK5 ) ) ) )
    | spl8_2 ),
    inference(forward_demodulation,[],[f42,f24]) ).

thf(f24,plain,
    ! [X2: lst,X0: lst,X1: a] :
      ( ( cns @ X1 @ ( ap @ X2 @ X0 ) )
      = ( ap @ ( cns @ X1 @ X2 ) @ X0 ) ),
    inference(cnf_transformation,[],[f17]) ).

thf(f17,plain,
    ! [X0: lst,X1: a,X2: lst] :
      ( ( cns @ X1 @ ( ap @ X2 @ X0 ) )
      = ( ap @ ( cns @ X1 @ X2 ) @ X0 ) ),
    inference(rectify,[],[f8]) ).

thf(f8,plain,
    ! [X2: lst,X0: a,X1: lst] :
      ( ( ap @ ( cns @ X0 @ X1 ) @ X2 )
      = ( cns @ X0 @ ( ap @ X1 @ X2 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,axiom,
    ! [X9: a,X8: lst,X7: lst] :
      ( ( ap @ ( cns @ X9 @ X8 ) @ X7 )
      = ( cns @ X9 @ ( ap @ X8 @ X7 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1p_Osimps_I2_J) ).

thf(f42,plain,
    ( ( ( cns @ sK3 @ ( ap @ ( ap @ sK2 @ sK4 ) @ sK5 ) )
     != ( ap @ ( cns @ sK3 @ sK2 ) @ ( ap @ sK4 @ sK5 ) ) )
    | spl8_2 ),
    inference(forward_demodulation,[],[f41,f24]) ).

thf(f41,plain,
    ( ( ( ap @ ( cns @ sK3 @ sK2 ) @ ( ap @ sK4 @ sK5 ) )
     != ( ap @ ( cns @ sK3 @ ( ap @ sK2 @ sK4 ) ) @ sK5 ) )
    | spl8_2 ),
    inference(forward_demodulation,[],[f37,f24]) ).

thf(f37,plain,
    ( ( ( ap @ ( cns @ sK3 @ sK2 ) @ ( ap @ sK4 @ sK5 ) )
     != ( ap @ ( ap @ ( cns @ sK3 @ sK2 ) @ sK4 ) @ sK5 ) )
    | spl8_2 ),
    inference(avatar_component_clause,[],[f35]) ).

thf(f35,plain,
    ( spl8_2
  <=> ( ( ap @ ( cns @ sK3 @ sK2 ) @ ( ap @ sK4 @ sK5 ) )
      = ( ap @ ( ap @ ( cns @ sK3 @ sK2 ) @ sK4 ) @ sK5 ) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).

thf(f38,plain,
    ( spl8_1
    | ~ spl8_2 ),
    inference(avatar_split_clause,[],[f30,f35,f32]) ).

thf(f30,plain,
    ! [X2: lst,X0: lst,X1: lst] :
      ( ( ( ap @ ( ap @ X0 @ X1 ) @ X2 )
        = ( ap @ X0 @ ( ap @ X1 @ X2 ) ) )
      | ( ( ap @ ( cns @ sK3 @ sK2 ) @ ( ap @ sK4 @ sK5 ) )
       != ( ap @ ( ap @ ( cns @ sK3 @ sK2 ) @ sK4 ) @ sK5 ) ) ),
    inference(subsumption_resolution,[],[f29,f25]) ).

thf(f29,plain,
    ! [X2: lst,X0: lst,X1: lst] :
      ( ( ( ap @ ( cns @ sK3 @ sK2 ) @ ( ap @ sK4 @ sK5 ) )
       != ( ap @ ( ap @ ( cns @ sK3 @ sK2 ) @ sK4 ) @ sK5 ) )
      | ( ( ap @ ( ap @ X0 @ X1 ) @ X2 )
        = ( ap @ X0 @ ( ap @ X1 @ X2 ) ) )
      | ( ( ap @ nl @ ( ap @ sK7 @ sK6 ) )
       != ( ap @ sK7 @ sK6 ) ) ),
    inference(forward_demodulation,[],[f27,f25]) ).

thf(f27,plain,
    ! [X2: lst,X0: lst,X1: lst] :
      ( ( ( ap @ ( ap @ X0 @ X1 ) @ X2 )
        = ( ap @ X0 @ ( ap @ X1 @ X2 ) ) )
      | ( ( ap @ ( cns @ sK3 @ sK2 ) @ ( ap @ sK4 @ sK5 ) )
       != ( ap @ ( ap @ ( cns @ sK3 @ sK2 ) @ sK4 ) @ sK5 ) )
      | ( ( ap @ nl @ ( ap @ sK7 @ sK6 ) )
       != ( ap @ ( ap @ nl @ sK7 ) @ sK6 ) ) ),
    inference(cnf_transformation,[],[f22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.15  % Problem    : DAT056^1 : TPTP v8.2.0. Released v5.4.0.
% 0.16/0.17  % 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.17/0.38  % Computer : n022.cluster.edu
% 0.17/0.38  % Model    : x86_64 x86_64
% 0.17/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38  % Memory   : 8042.1875MB
% 0.17/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38  % CPULimit   : 300
% 0.17/0.38  % WCLimit    : 300
% 0.17/0.38  % DateTime   : Sun May 19 23:39:53 EDT 2024
% 0.17/0.38  % CPUTime    : 
% 0.17/0.38  This is a TH0_THM_EQU_NAR problem
% 0.17/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.23/0.40  % (7926)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.40  % (7924)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 (2999ds/275Mi)
% 0.23/0.40  % (7920)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 (2999ds/4Mi)
% 0.23/0.40  % (7923)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 (2999ds/2Mi)
% 0.23/0.40  % (7925)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.23/0.40  % (7921)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 (2999ds/27Mi)
% 0.23/0.40  % (7922)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.23/0.40  % (7919)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.23/0.40  % (7922)Instruction limit reached!
% 0.23/0.40  % (7922)------------------------------
% 0.23/0.40  % (7922)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40  % (7922)Termination reason: Unknown
% 0.23/0.40  % (7922)Termination phase: Preprocessing 3
% 0.23/0.40  
% 0.23/0.40  % (7923)Instruction limit reached!
% 0.23/0.40  % (7923)------------------------------
% 0.23/0.40  % (7923)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40  % (7922)Memory used [KB]: 895
% 0.23/0.40  % (7922)Time elapsed: 0.003 s
% 0.23/0.40  % (7922)Instructions burned: 2 (million)
% 0.23/0.40  % (7922)------------------------------
% 0.23/0.40  % (7922)------------------------------
% 0.23/0.40  % (7923)Termination reason: Unknown
% 0.23/0.40  % (7923)Termination phase: shuffling
% 0.23/0.40  
% 0.23/0.40  % (7923)Memory used [KB]: 895
% 0.23/0.40  % (7923)Time elapsed: 0.003 s
% 0.23/0.40  % (7923)Instructions burned: 2 (million)
% 0.23/0.40  % (7923)------------------------------
% 0.23/0.40  % (7923)------------------------------
% 0.23/0.40  % (7924)Refutation not found, incomplete strategy
% 0.23/0.40  % (7924)------------------------------
% 0.23/0.40  % (7924)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40  % (7924)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.40  
% 0.23/0.40  
% 0.23/0.40  % (7924)Memory used [KB]: 5373
% 0.23/0.40  % (7924)Time elapsed: 0.003 s
% 0.23/0.40  % (7924)Instructions burned: 2 (million)
% 0.23/0.40  % (7924)------------------------------
% 0.23/0.40  % (7924)------------------------------
% 0.23/0.40  % (7926)Instruction limit reached!
% 0.23/0.40  % (7926)------------------------------
% 0.23/0.40  % (7926)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40  % (7926)Termination reason: Unknown
% 0.23/0.40  % (7926)Termination phase: Saturation
% 0.23/0.40  
% 0.23/0.40  % (7926)Memory used [KB]: 5500
% 0.23/0.40  % (7926)Time elapsed: 0.004 s
% 0.23/0.40  % (7926)Instructions burned: 3 (million)
% 0.23/0.40  % (7926)------------------------------
% 0.23/0.40  % (7926)------------------------------
% 0.23/0.41  % (7920)Instruction limit reached!
% 0.23/0.41  % (7920)------------------------------
% 0.23/0.41  % (7920)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.41  % (7920)Termination reason: Unknown
% 0.23/0.41  % (7920)Termination phase: Saturation
% 0.23/0.41  
% 0.23/0.41  % (7920)Memory used [KB]: 5500
% 0.23/0.41  % (7920)Time elapsed: 0.005 s
% 0.23/0.41  % (7920)Instructions burned: 5 (million)
% 0.23/0.41  % (7920)------------------------------
% 0.23/0.41  % (7920)------------------------------
% 0.23/0.41  % (7925)First to succeed.
% 0.23/0.41  % (7919)Also succeeded, but the first one will report.
% 0.23/0.41  % (7921)Also succeeded, but the first one will report.
% 0.23/0.41  % (7925)Refutation found. Thanks to Tanya!
% 0.23/0.41  % SZS status Theorem for theBenchmark
% 0.23/0.41  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.41  % (7925)------------------------------
% 0.23/0.41  % (7925)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.41  % (7925)Termination reason: Refutation
% 0.23/0.41  
% 0.23/0.41  % (7925)Memory used [KB]: 5500
% 0.23/0.41  % (7925)Time elapsed: 0.009 s
% 0.23/0.41  % (7925)Instructions burned: 6 (million)
% 0.23/0.41  % (7925)------------------------------
% 0.23/0.41  % (7925)------------------------------
% 0.23/0.41  % (7918)Success in time 0.022 s
% 0.23/0.41  % Vampire---4.8 exiting
%------------------------------------------------------------------------------