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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV057^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n007.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 04:11:51 EDT 2024

% Result   : Theorem 0.23s 0.44s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   53 (   1 unt;   8 typ;   0 def)
%            Number of atoms       :  359 ( 167 equ;   0 cnn)
%            Maximal formula atoms :   16 (   7 avg)
%            Number of connectives :  538 ( 120   ~;  96   |;  52   &; 252   @)
%                                         (   2 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   7 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   35 (  35   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :  141 (  50   ^  58   !;  32   ?; 141   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

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

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

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

thf(func_def_5,type,
    sK1: ( a > a ) > a ).

thf(func_def_6,type,
    sK2: ( a > a ) > a ).

thf(func_def_7,type,
    sK3: a > ( a > a ) > a ).

thf(func_def_9,type,
    ph5: 
      !>[X0: $tType] : X0 ).

thf(func_def_14,type,
    sK6: a ).

thf(f174,plain,
    $false,
    inference(avatar_sat_refutation,[],[f66,f72,f111,f173]) ).

thf(f173,plain,
    ( spl4_2
    | ~ spl4_1 ),
    inference(avatar_split_clause,[],[f172,f60,f64]) ).

thf(f64,plain,
    ( spl4_2
  <=> ! [X0: a] :
        ( ( ( sK0 @ X0 )
         != $true )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 ) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).

thf(f60,plain,
    ( spl4_1
  <=> ( ( sK0
        @ ( sK1
          @ ^ [Y0: a] : Y0 ) )
      = $true ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).

thf(f172,plain,
    ( ! [X0: a] :
        ( ( ( sK0 @ X0 )
         != $true )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 ) )
    | ~ spl4_1 ),
    inference(subsumption_resolution,[],[f171,f62]) ).

thf(f62,plain,
    ( ( ( sK0
        @ ( sK1
          @ ^ [Y0: a] : Y0 ) )
      = $true )
    | ~ spl4_1 ),
    inference(avatar_component_clause,[],[f60]) ).

thf(f171,plain,
    ( ! [X0: a] :
        ( ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 )
        | ( ( sK0 @ X0 )
         != $true )
        | ( ( sK0
            @ ( sK1
              @ ^ [Y0: a] : Y0 ) )
         != $true ) )
    | ~ spl4_1 ),
    inference(duplicate_literal_removal,[],[f170]) ).

thf(f170,plain,
    ( ! [X0: a] :
        ( ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 )
        | ( ( sK0 @ X0 )
         != $true )
        | ( ( sK0
            @ ( sK1
              @ ^ [Y0: a] : Y0 ) )
         != $true )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 ) )
    | ~ spl4_1 ),
    inference(beta_eta_normalization,[],[f169]) ).

thf(f169,plain,
    ( ! [X0: a] :
        ( ( ( sK0 @ X0 )
         != $true )
        | ( ( sK0
            @ ( ^ [Y0: a] : Y0
              @ ( sK1
                @ ^ [Y0: a] : Y0 ) ) )
         != $true )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != ( ^ [Y0: a] : Y0
            @ X0 ) )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 ) )
    | ~ spl4_1 ),
    inference(duplicate_literal_removal,[],[f164]) ).

thf(f164,plain,
    ( ! [X0: a] :
        ( ( ( sK0
            @ ( ^ [Y0: a] : Y0
              @ ( sK1
                @ ^ [Y0: a] : Y0 ) ) )
         != $true )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != ( ^ [Y0: a] : Y0
            @ X0 ) )
        | ( ( sK0 @ X0 )
         != $true )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 )
        | ( ( sK0 @ X0 )
         != $true ) )
    | ~ spl4_1 ),
    inference(superposition,[],[f108,f14]) ).

thf(f14,plain,
    ! [X1: a > a,X4: a] :
      ( ( ( sK2 @ X1 )
        = ( X1 @ ( sK3 @ X4 @ X1 ) ) )
      | ( ( X1 @ X4 )
       != ( sK2 @ X1 ) )
      | ( ( sK0 @ X4 )
       != $true )
      | ( $true
       != ( sK0 @ ( X1 @ ( sK1 @ X1 ) ) ) ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f13,plain,
    ! [X1: a > a] :
      ( ( ( ( sK0 @ ( sK1 @ X1 ) )
          = $true )
        & ( $true
         != ( sK0 @ ( X1 @ ( sK1 @ X1 ) ) ) ) )
      | ( ( ( sK0 @ ( sK2 @ X1 ) )
          = $true )
        & ! [X4: a] :
            ( ( ( X1 @ X4 )
             != ( sK2 @ X1 ) )
            | ( ( sK0 @ X4 )
             != $true )
            | ( ( ( sK3 @ X4 @ X1 )
               != X4 )
              & ( ( sK0 @ ( sK3 @ X4 @ X1 ) )
                = $true )
              & ( ( sK2 @ X1 )
                = ( X1 @ ( sK3 @ X4 @ X1 ) ) ) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f12,f11,f10,f9]) ).

thf(f9,plain,
    ( ? [X0: a > $o] :
      ! [X1: a > a] :
        ( ? [X2: a] :
            ( ( ( X0 @ X2 )
              = $true )
            & ( ( X0 @ ( X1 @ X2 ) )
             != $true ) )
        | ? [X3: a] :
            ( ( ( X0 @ X3 )
              = $true )
            & ! [X4: a] :
                ( ( ( X1 @ X4 )
                 != X3 )
                | ( ( X0 @ X4 )
                 != $true )
                | ? [X5: a] :
                    ( ( X4 != X5 )
                    & ( ( X0 @ X5 )
                      = $true )
                    & ( ( X1 @ X5 )
                      = X3 ) ) ) ) )
   => ! [X1: a > a] :
        ( ? [X2: a] :
            ( ( ( sK0 @ X2 )
              = $true )
            & ( ( sK0 @ ( X1 @ X2 ) )
             != $true ) )
        | ? [X3: a] :
            ( ( $true
              = ( sK0 @ X3 ) )
            & ! [X4: a] :
                ( ( ( X1 @ X4 )
                 != X3 )
                | ( ( sK0 @ X4 )
                 != $true )
                | ? [X5: a] :
                    ( ( X4 != X5 )
                    & ( $true
                      = ( sK0 @ X5 ) )
                    & ( ( X1 @ X5 )
                      = X3 ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f10,plain,
    ! [X1: a > a] :
      ( ? [X2: a] :
          ( ( ( sK0 @ X2 )
            = $true )
          & ( ( sK0 @ ( X1 @ X2 ) )
           != $true ) )
     => ( ( ( sK0 @ ( sK1 @ X1 ) )
          = $true )
        & ( $true
         != ( sK0 @ ( X1 @ ( sK1 @ X1 ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f11,plain,
    ! [X1: a > a] :
      ( ? [X3: a] :
          ( ( $true
            = ( sK0 @ X3 ) )
          & ! [X4: a] :
              ( ( ( X1 @ X4 )
               != X3 )
              | ( ( sK0 @ X4 )
               != $true )
              | ? [X5: a] :
                  ( ( X4 != X5 )
                  & ( $true
                    = ( sK0 @ X5 ) )
                  & ( ( X1 @ X5 )
                    = X3 ) ) ) )
     => ( ( ( sK0 @ ( sK2 @ X1 ) )
          = $true )
        & ! [X4: a] :
            ( ( ( X1 @ X4 )
             != ( sK2 @ X1 ) )
            | ( ( sK0 @ X4 )
             != $true )
            | ? [X5: a] :
                ( ( X4 != X5 )
                & ( $true
                  = ( sK0 @ X5 ) )
                & ( ( sK2 @ X1 )
                  = ( X1 @ X5 ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f12,plain,
    ! [X1: a > a,X4: a] :
      ( ? [X5: a] :
          ( ( X4 != X5 )
          & ( $true
            = ( sK0 @ X5 ) )
          & ( ( sK2 @ X1 )
            = ( X1 @ X5 ) ) )
     => ( ( ( sK3 @ X4 @ X1 )
         != X4 )
        & ( ( sK0 @ ( sK3 @ X4 @ X1 ) )
          = $true )
        & ( ( sK2 @ X1 )
          = ( X1 @ ( sK3 @ X4 @ X1 ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f8,plain,
    ? [X0: a > $o] :
    ! [X1: a > a] :
      ( ? [X2: a] :
          ( ( ( X0 @ X2 )
            = $true )
          & ( ( X0 @ ( X1 @ X2 ) )
           != $true ) )
      | ? [X3: a] :
          ( ( ( X0 @ X3 )
            = $true )
          & ! [X4: a] :
              ( ( ( X1 @ X4 )
               != X3 )
              | ( ( X0 @ X4 )
               != $true )
              | ? [X5: a] :
                  ( ( X4 != X5 )
                  & ( ( X0 @ X5 )
                    = $true )
                  & ( ( X1 @ X5 )
                    = X3 ) ) ) ) ),
    inference(rectify,[],[f7]) ).

thf(f7,plain,
    ? [X0: a > $o] :
    ! [X1: a > a] :
      ( ? [X5: a] :
          ( ( ( X0 @ X5 )
            = $true )
          & ( ( X0 @ ( X1 @ X5 ) )
           != $true ) )
      | ? [X2: a] :
          ( ( ( X0 @ X2 )
            = $true )
          & ! [X3: a] :
              ( ( ( X1 @ X3 )
               != X2 )
              | ( ( X0 @ X3 )
               != $true )
              | ? [X4: a] :
                  ( ( X3 != X4 )
                  & ( ( X0 @ X4 )
                    = $true )
                  & ( ( X1 @ X4 )
                    = X2 ) ) ) ) ),
    inference(flattening,[],[f6]) ).

thf(f6,plain,
    ? [X0: a > $o] :
    ! [X1: a > a] :
      ( ? [X5: a] :
          ( ( ( X0 @ X5 )
            = $true )
          & ( ( X0 @ ( X1 @ X5 ) )
           != $true ) )
      | ? [X2: a] :
          ( ! [X3: a] :
              ( ( ( X0 @ X3 )
               != $true )
              | ( ( X1 @ X3 )
               != X2 )
              | ? [X4: a] :
                  ( ( X3 != X4 )
                  & ( ( X0 @ X4 )
                    = $true )
                  & ( ( X1 @ X4 )
                    = X2 ) ) )
          & ( ( X0 @ X2 )
            = $true ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f5,plain,
    ~ ! [X0: a > $o] :
      ? [X1: a > a] :
        ( ! [X5: a] :
            ( ( ( X0 @ X5 )
              = $true )
           => ( ( X0 @ ( X1 @ X5 ) )
              = $true ) )
        & ! [X2: a] :
            ( ( ( X0 @ X2 )
              = $true )
           => ? [X3: a] :
                ( ( ( X0 @ X3 )
                  = $true )
                & ( ( X1 @ X3 )
                  = X2 )
                & ! [X4: a] :
                    ( ( ( ( X0 @ X4 )
                        = $true )
                      & ( ( X1 @ X4 )
                        = X2 ) )
                   => ( X3 = X4 ) ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

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

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

thf(f1,conjecture,
    ! [X0: a > $o] :
    ? [X1: a > a] :
      ( ! [X3: a] :
          ( ( X0 @ X3 )
         => ? [X2: a] :
              ( ( ( X1 @ X2 )
                = X3 )
              & ( X0 @ X2 )
              & ! [X4: a] :
                  ( ( ( ( X1 @ X4 )
                      = X3 )
                    & ( X0 @ X4 ) )
                 => ( X2 = X4 ) ) ) )
      & ! [X2: a] :
          ( ( X0 @ X2 )
         => ( X0 @ ( X1 @ X2 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEQP1_1A_pme) ).

thf(f108,plain,
    ( ! [X0: a] :
        ( ( ( sK3 @ X0
            @ ^ [Y0: a] : Y0 )
         != X0 )
        | ( ( sK0 @ X0 )
         != $true )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 ) )
    | ~ spl4_1 ),
    inference(beta_eta_normalization,[],[f107]) ).

thf(f107,plain,
    ( ! [X0: a] :
        ( ( ( sK0 @ X0 )
         != $true )
        | ( ( sK3 @ X0
            @ ^ [Y0: a] : Y0 )
         != X0 )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != ( ^ [Y0: a] : Y0
            @ X0 ) ) )
    | ~ spl4_1 ),
    inference(trivial_inequality_removal,[],[f105]) ).

thf(f105,plain,
    ( ! [X0: a] :
        ( ( ( sK3 @ X0
            @ ^ [Y0: a] : Y0 )
         != X0 )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != ( ^ [Y0: a] : Y0
            @ X0 ) )
        | ( ( sK0 @ X0 )
         != $true )
        | ( $true != $true ) )
    | ~ spl4_1 ),
    inference(superposition,[],[f16,f62]) ).

thf(f16,plain,
    ! [X1: a > a,X4: a] :
      ( ( $true
       != ( sK0 @ ( X1 @ ( sK1 @ X1 ) ) ) )
      | ( ( sK0 @ X4 )
       != $true )
      | ( ( X1 @ X4 )
       != ( sK2 @ X1 ) )
      | ( ( sK3 @ X4 @ X1 )
       != X4 ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f111,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(avatar_contradiction_clause,[],[f110]) ).

thf(f110,plain,
    ( $false
    | ~ spl4_1
    | ~ spl4_2 ),
    inference(subsumption_resolution,[],[f109,f69]) ).

thf(f69,plain,
    ( ( ( sK0
        @ ( sK2
          @ ^ [Y0: a] : Y0 ) )
     != $true )
    | ~ spl4_2 ),
    inference(equality_resolution,[],[f65]) ).

thf(f65,plain,
    ( ! [X0: a] :
        ( ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 )
        | ( ( sK0 @ X0 )
         != $true ) )
    | ~ spl4_2 ),
    inference(avatar_component_clause,[],[f64]) ).

thf(f109,plain,
    ( ( ( sK0
        @ ( sK2
          @ ^ [Y0: a] : Y0 ) )
      = $true )
    | ~ spl4_1 ),
    inference(trivial_inequality_removal,[],[f106]) ).

thf(f106,plain,
    ( ( $true != $true )
    | ( ( sK0
        @ ( sK2
          @ ^ [Y0: a] : Y0 ) )
      = $true )
    | ~ spl4_1 ),
    inference(superposition,[],[f17,f62]) ).

thf(f17,plain,
    ! [X1: a > a] :
      ( ( $true
       != ( sK0 @ ( X1 @ ( sK1 @ X1 ) ) ) )
      | ( ( sK0 @ ( sK2 @ X1 ) )
        = $true ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f72,plain,
    ( spl4_1
    | ~ spl4_2 ),
    inference(avatar_split_clause,[],[f71,f64,f60]) ).

thf(f71,plain,
    ( ( ( sK0
        @ ( sK1
          @ ^ [Y0: a] : Y0 ) )
      = $true )
    | ~ spl4_2 ),
    inference(trivial_inequality_removal,[],[f70]) ).

thf(f70,plain,
    ( ( $true != $true )
    | ( ( sK0
        @ ( sK1
          @ ^ [Y0: a] : Y0 ) )
      = $true )
    | ~ spl4_2 ),
    inference(superposition,[],[f69,f21]) ).

thf(f21,plain,
    ! [X1: a > a] :
      ( ( ( sK0 @ ( sK2 @ X1 ) )
        = $true )
      | ( ( sK0 @ ( sK1 @ X1 ) )
        = $true ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f66,plain,
    ( spl4_1
    | spl4_2 ),
    inference(avatar_split_clause,[],[f58,f64,f60]) ).

thf(f58,plain,
    ! [X0: a] :
      ( ( ( sK0 @ X0 )
       != $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 )
      | ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
        = $true ) ),
    inference(duplicate_literal_removal,[],[f57]) ).

thf(f57,plain,
    ! [X0: a] :
      ( ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
        = $true )
      | ( ( sK0 @ X0 )
       != $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 ) ),
    inference(beta_eta_normalization,[],[f56]) ).

thf(f56,plain,
    ! [X0: a] :
      ( ( ( sK0 @ X0 )
       != $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 )
      | ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
        = $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != ( ^ [Y0: a] : Y0
          @ X0 ) ) ),
    inference(duplicate_literal_removal,[],[f44]) ).

thf(f44,plain,
    ! [X0: a] :
      ( ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != ( ^ [Y0: a] : Y0
          @ X0 ) )
      | ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
        = $true )
      | ( ( sK0 @ X0 )
       != $true )
      | ( ( sK0 @ X0 )
       != $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != ( ^ [Y0: a] : Y0
          @ X0 ) )
      | ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
        = $true ) ),
    inference(superposition,[],[f20,f18]) ).

thf(f18,plain,
    ! [X1: a > a,X4: a] :
      ( ( ( sK2 @ X1 )
        = ( X1 @ ( sK3 @ X4 @ X1 ) ) )
      | ( ( sK0 @ ( sK1 @ X1 ) )
        = $true )
      | ( ( X1 @ X4 )
       != ( sK2 @ X1 ) )
      | ( ( sK0 @ X4 )
       != $true ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f20,plain,
    ! [X1: a > a,X4: a] :
      ( ( ( sK3 @ X4 @ X1 )
       != X4 )
      | ( ( sK0 @ ( sK1 @ X1 ) )
        = $true )
      | ( ( sK0 @ X4 )
       != $true )
      | ( ( X1 @ X4 )
       != ( sK2 @ X1 ) ) ),
    inference(cnf_transformation,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem    : SEV057^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.16  % 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.15/0.38  % Computer : n007.cluster.edu
% 0.15/0.38  % Model    : x86_64 x86_64
% 0.15/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38  % Memory   : 8042.1875MB
% 0.15/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38  % CPULimit   : 300
% 0.15/0.38  % WCLimit    : 300
% 0.15/0.38  % DateTime   : Sun May 19 18:51:23 EDT 2024
% 0.15/0.38  % CPUTime    : 
% 0.15/0.38  This is a TH0_THM_EQU_NAR problem
% 0.15/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/sandbox/benchmark/theBenchmark.p
% 0.23/0.40  % (6343)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.23/0.40  % (6337)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.23/0.40  % (6339)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.23/0.40  % (6338)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.23/0.40  % (6340)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.23/0.40  % (6341)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.23/0.40  % (6342)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.23/0.40  % (6344)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.23/0.40  % (6340)Instruction limit reached!
% 0.23/0.40  % (6340)------------------------------
% 0.23/0.40  % (6340)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40  % (6340)Termination reason: Unknown
% 0.23/0.40  % (6340)Termination phase: Saturation
% 0.23/0.40  % (6341)Instruction limit reached!
% 0.23/0.40  % (6341)------------------------------
% 0.23/0.40  % (6341)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40  % (6341)Termination reason: Unknown
% 0.23/0.40  % (6341)Termination phase: Saturation
% 0.23/0.40  
% 0.23/0.40  % (6341)Memory used [KB]: 895
% 0.23/0.40  % (6341)Time elapsed: 0.003 s
% 0.23/0.40  % (6341)Instructions burned: 2 (million)
% 0.23/0.40  % (6341)------------------------------
% 0.23/0.40  % (6341)------------------------------
% 0.23/0.40  
% 0.23/0.40  % (6340)Memory used [KB]: 895
% 0.23/0.40  % (6340)Time elapsed: 0.003 s
% 0.23/0.40  % (6340)Instructions burned: 2 (million)
% 0.23/0.40  % (6340)------------------------------
% 0.23/0.40  % (6340)------------------------------
% 0.23/0.40  % (6344)Instruction limit reached!
% 0.23/0.40  % (6344)------------------------------
% 0.23/0.40  % (6344)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40  % (6344)Termination reason: Unknown
% 0.23/0.40  % (6344)Termination phase: Saturation
% 0.23/0.40  
% 0.23/0.40  % (6344)Memory used [KB]: 5500
% 0.23/0.40  % (6344)Time elapsed: 0.004 s
% 0.23/0.40  % (6344)Instructions burned: 3 (million)
% 0.23/0.40  % (6344)------------------------------
% 0.23/0.40  % (6344)------------------------------
% 0.23/0.40  % (6338)Instruction limit reached!
% 0.23/0.40  % (6338)------------------------------
% 0.23/0.40  % (6338)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40  % (6338)Termination reason: Unknown
% 0.23/0.40  % (6338)Termination phase: Saturation
% 0.23/0.40  
% 0.23/0.40  % (6338)Memory used [KB]: 5500
% 0.23/0.40  % (6338)Time elapsed: 0.005 s
% 0.23/0.40  % (6338)Instructions burned: 4 (million)
% 0.23/0.40  % (6338)------------------------------
% 0.23/0.40  % (6338)------------------------------
% 0.23/0.40  % (6339)Refutation not found, incomplete strategy
% 0.23/0.40  % (6339)------------------------------
% 0.23/0.40  % (6339)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40  % (6339)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.40  
% 0.23/0.40  
% 0.23/0.40  % (6339)Memory used [KB]: 5500
% 0.23/0.40  % (6339)Time elapsed: 0.005 s
% 0.23/0.40  % (6339)Instructions burned: 4 (million)
% 0.23/0.40  % (6339)------------------------------
% 0.23/0.40  % (6339)------------------------------
% 0.23/0.40  % (6342)Refutation not found, incomplete strategy
% 0.23/0.40  % (6342)------------------------------
% 0.23/0.40  % (6342)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40  % (6342)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.40  
% 0.23/0.40  
% 0.23/0.40  % (6342)Memory used [KB]: 5500
% 0.23/0.40  % (6342)Time elapsed: 0.004 s
% 0.23/0.40  % (6342)Instructions burned: 3 (million)
% 0.23/0.40  % (6342)------------------------------
% 0.23/0.40  % (6342)------------------------------
% 0.23/0.41  % (6343)Instruction limit reached!
% 0.23/0.41  % (6343)------------------------------
% 0.23/0.41  % (6343)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.41  % (6343)Termination reason: Unknown
% 0.23/0.41  % (6343)Termination phase: Saturation
% 0.23/0.41  
% 0.23/0.41  % (6343)Memory used [KB]: 5628
% 0.23/0.41  % (6343)Time elapsed: 0.012 s
% 0.23/0.41  % (6343)Instructions burned: 18 (million)
% 0.23/0.41  % (6343)------------------------------
% 0.23/0.41  % (6343)------------------------------
% 0.23/0.42  % (6345)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.23/0.42  % (6346)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.23/0.42  % (6348)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.23/0.42  % (6347)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.42  % (6349)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.23/0.42  % (6350)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.23/0.42  % (6347)Instruction limit reached!
% 0.23/0.42  % (6347)------------------------------
% 0.23/0.42  % (6347)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.42  % (6347)Termination reason: Unknown
% 0.23/0.42  % (6347)Termination phase: Saturation
% 0.23/0.42  
% 0.23/0.42  % (6347)Memory used [KB]: 5500
% 0.23/0.42  % (6347)Time elapsed: 0.004 s
% 0.23/0.42  % (6347)Instructions burned: 3 (million)
% 0.23/0.42  % (6347)------------------------------
% 0.23/0.42  % (6347)------------------------------
% 0.23/0.42  % (6349)Instruction limit reached!
% 0.23/0.42  % (6349)------------------------------
% 0.23/0.42  % (6349)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.42  % (6349)Termination reason: Unknown
% 0.23/0.42  % (6349)Termination phase: Saturation
% 0.23/0.42  
% 0.23/0.42  % (6349)Memory used [KB]: 1023
% 0.23/0.42  % (6351)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.42  % (6349)Time elapsed: 0.007 s
% 0.23/0.42  % (6349)Instructions burned: 7 (million)
% 0.23/0.42  % (6349)------------------------------
% 0.23/0.42  % (6349)------------------------------
% 0.23/0.42  % (6351)Instruction limit reached!
% 0.23/0.42  % (6351)------------------------------
% 0.23/0.42  % (6351)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.42  % (6351)Termination reason: Unknown
% 0.23/0.42  % (6351)Termination phase: Saturation
% 0.23/0.42  
% 0.23/0.42  % (6351)Memory used [KB]: 5500
% 0.23/0.42  % (6351)Time elapsed: 0.004 s
% 0.23/0.42  % (6351)Instructions burned: 4 (million)
% 0.23/0.42  % (6351)------------------------------
% 0.23/0.42  % (6351)------------------------------
% 0.23/0.43  % (6346)Instruction limit reached!
% 0.23/0.43  % (6346)------------------------------
% 0.23/0.43  % (6346)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.43  % (6346)Termination reason: Unknown
% 0.23/0.43  % (6346)Termination phase: Saturation
% 0.23/0.43  
% 0.23/0.43  % (6346)Memory used [KB]: 5500
% 0.23/0.43  % (6346)Time elapsed: 0.012 s
% 0.23/0.43  % (6346)Instructions burned: 15 (million)
% 0.23/0.43  % (6346)------------------------------
% 0.23/0.43  % (6346)------------------------------
% 0.23/0.43  % (6350)Instruction limit reached!
% 0.23/0.43  % (6350)------------------------------
% 0.23/0.43  % (6350)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.43  % (6350)Termination reason: Unknown
% 0.23/0.43  % (6350)Termination phase: Saturation
% 0.23/0.43  
% 0.23/0.43  % (6350)Memory used [KB]: 5628
% 0.23/0.43  % (6350)Time elapsed: 0.012 s
% 0.23/0.43  % (6350)Instructions burned: 16 (million)
% 0.23/0.43  % (6350)------------------------------
% 0.23/0.43  % (6350)------------------------------
% 0.23/0.43  % (6337)First to succeed.
% 0.23/0.43  % (6352)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.43  % (6345)Instruction limit reached!
% 0.23/0.43  % (6345)------------------------------
% 0.23/0.43  % (6345)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.43  % (6345)Termination reason: Unknown
% 0.23/0.43  % (6345)Termination phase: Saturation
% 0.23/0.43  
% 0.23/0.43  % (6345)Memory used [KB]: 5756
% 0.23/0.43  % (6345)Time elapsed: 0.021 s
% 0.23/0.43  % (6345)Instructions burned: 37 (million)
% 0.23/0.43  % (6345)------------------------------
% 0.23/0.43  % (6345)------------------------------
% 0.23/0.44  % (6352)Instruction limit reached!
% 0.23/0.44  % (6352)------------------------------
% 0.23/0.44  % (6352)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.44  % (6352)Termination reason: Unknown
% 0.23/0.44  % (6352)Termination phase: Saturation
% 0.23/0.44  
% 0.23/0.44  % (6352)Memory used [KB]: 1023
% 0.23/0.44  % (6352)Time elapsed: 0.004 s
% 0.23/0.44  % (6352)Instructions burned: 3 (million)
% 0.23/0.44  % (6352)------------------------------
% 0.23/0.44  % (6352)------------------------------
% 0.23/0.44  % (6337)Refutation found. Thanks to Tanya!
% 0.23/0.44  % SZS status Theorem for theBenchmark
% 0.23/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.44  % (6337)------------------------------
% 0.23/0.44  % (6337)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.44  % (6337)Termination reason: Refutation
% 0.23/0.44  
% 0.23/0.44  % (6337)Memory used [KB]: 5756
% 0.23/0.44  % (6337)Time elapsed: 0.038 s
% 0.23/0.44  % (6337)Instructions burned: 36 (million)
% 0.23/0.44  % (6337)------------------------------
% 0.23/0.44  % (6337)------------------------------
% 0.23/0.44  % (6336)Success in time 0.044 s
% 0.23/0.44  % Vampire---4.8 exiting
%------------------------------------------------------------------------------