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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU843^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 : n027.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:51:54 EDT 2024

% Result   : Theorem 0.19s 0.34s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   23 (  11 unt;   6 typ;   0 def)
%            Number of atoms       :   81 (  32 equ;   0 cnn)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :  100 (  11   ~;  13   |;  10   &;  54   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   37 (  11   ^  17   !;   8   ?;  37   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

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

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

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

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

thf(func_def_9,type,
    sK2: a ).

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

thf(f20,plain,
    $false,
    inference(subsumption_resolution,[],[f19,f13]) ).

thf(f13,plain,
    ( ( sK1 @ sK2 )
   != $true ),
    inference(cnf_transformation,[],[f10]) ).

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

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

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

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

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

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

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

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

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

thf(f19,plain,
    ( ( sK1 @ sK2 )
    = $true ),
    inference(boolean_simplification,[],[f17]) ).

thf(f17,plain,
    ( ( sK1 @ sK2 )
    = ( ( sK1 @ sK2 )
      | $true ) ),
    inference(superposition,[],[f15,f12]) ).

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

thf(f15,plain,
    ! [X1: a] :
      ( ( ( sK1 @ X1 )
        | ( sK0 @ X1 ) )
      = ( sK1 @ X1 ) ),
    inference(beta_eta_normalization,[],[f14]) ).

thf(f14,plain,
    ! [X1: a] :
      ( ( sK1 @ X1 )
      = ( ^ [Y0: a] :
            ( ( sK1 @ Y0 )
            | ( sK0 @ Y0 ) )
        @ X1 ) ),
    inference(argument_congruence,[],[f11]) ).

thf(f11,plain,
    ( ( ^ [Y0: a] :
          ( ( sK1 @ Y0 )
          | ( sK0 @ Y0 ) ) )
    = sK1 ),
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SEU843^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.12  % 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.13/0.33  % Computer : n027.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Sun May 19 16:20:08 EDT 2024
% 0.13/0.33  % CPUTime    : 
% 0.13/0.33  This is a TH0_THM_EQU_NAR problem
% 0.13/0.33  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.19/0.34  % (25224)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.19/0.34  % (25224)First to succeed.
% 0.19/0.34  % (25224)Refutation found. Thanks to Tanya!
% 0.19/0.34  % SZS status Theorem for theBenchmark
% 0.19/0.34  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.34  % (25224)------------------------------
% 0.19/0.34  % (25224)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.34  % (25224)Termination reason: Refutation
% 0.19/0.34  
% 0.19/0.34  % (25224)Memory used [KB]: 5500
% 0.19/0.34  % (25224)Time elapsed: 0.002 s
% 0.19/0.34  % (25224)Instructions burned: 2 (million)
% 0.19/0.34  % (25224)------------------------------
% 0.19/0.34  % (25224)------------------------------
% 0.19/0.34  % (25216)Success in time 0.002 s
% 0.19/0.35  % Vampire---4.8 exiting
%------------------------------------------------------------------------------