%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU834^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 : n020.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:53 EDT 2024

% Result   : Theorem 0.12s 0.34s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   16 (   3 unt;   5 typ;   0 def)
%            Number of atoms       :   49 (  20 equ;   0 cnn)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :   57 (   9   ~;   0   |;  14   &;  29   @)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   3 con; 0-2 aty)
%            Number of variables   :   21 (   0   ^  12   !;   9   ?;  21   :)

% 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 ).

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

thf(f13,plain,
    $false,
    inference(subsumption_resolution,[],[f11,f10]) ).

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

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

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

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

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

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

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

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

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

thf(f11,plain,
    ( $true
    = ( sK2 @ sK1 ) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SEU834^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.13  % 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.12/0.32  % Computer : n020.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Sun May 19 15:22:38 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  This is a TH0_THM_NEQ_NAR problem
% 0.12/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/sandbox/benchmark/theBenchmark.p
% 0.12/0.34  % (5191)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.12/0.34  % (5191)First to succeed.
% 0.12/0.34  % (5191)Refutation found. Thanks to Tanya!
% 0.12/0.34  % SZS status Theorem for theBenchmark
% 0.12/0.34  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.34  % (5191)------------------------------
% 0.12/0.34  % (5191)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.34  % (5191)Termination reason: Refutation
% 0.12/0.34  
% 0.12/0.34  % (5191)Memory used [KB]: 5373
% 0.12/0.34  % (5191)Time elapsed: 0.003 s
% 0.12/0.34  % (5191)Instructions burned: 1 (million)
% 0.12/0.34  % (5191)------------------------------
% 0.12/0.34  % (5191)------------------------------
% 0.12/0.34  % (5187)Success in time 0.01 s
% 0.12/0.34  % Vampire---4.8 exiting
%------------------------------------------------------------------------------