%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO252^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 : 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 : Tue May 21 09:03:40 EDT 2024

% Result   : Theorem 0.20s 0.37s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   8 unt;   1 typ;   0 def)
%            Number of atoms       :   25 (   9 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   21 (   9   ~;   0   |;   0   &;  11   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   10 (  10   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   2 usr;   3 con; 0-2 aty)
%            Number of variables   :   19 (   1   ^  10   !;   7   ?;  19   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_5,type,
    ph2: 
      !>[X0: $tType] : X0 ).

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

thf(f19,plain,
    $false = $true,
    inference(beta_eta_normalization,[],[f13]) ).

thf(f13,plain,
    ( ( ^ [Y0: $o] : $false
      @ sK0 )
    = $true ),
    inference(primitive_instantiation,[],[f10]) ).

thf(f10,plain,
    ! [X1: $o > $o] :
      ( $true
      = ( X1 @ sK0 ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f9,plain,
    ! [X1: $o > $o] :
      ( $true
      = ( X1 @ sK0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).

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

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

thf(f6,plain,
    ~ ! [X0: $o] :
      ? [X1: $o > $o] :
        ( ( X1 @ X0 )
       != $true ),
    inference(flattening,[],[f5]) ).

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

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

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

thf(f1,conjecture,
    ! [X0: $o] :
    ? [X1: $o > $o] :
      ~ ( X1 @ X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM123B) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SYO252^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13  % 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.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 09:10:37 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a TH0_THM_NEQ_NAR problem
% 0.13/0.34  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.36  % (21161)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.36  % (21161)First to succeed.
% 0.20/0.37  % (21161)Refutation found. Thanks to Tanya!
% 0.20/0.37  % SZS status Theorem for theBenchmark
% 0.20/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.37  % (21161)------------------------------
% 0.20/0.37  % (21161)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37  % (21161)Termination reason: Refutation
% 0.20/0.37  
% 0.20/0.37  % (21161)Memory used [KB]: 5500
% 0.20/0.37  % (21161)Time elapsed: 0.004 s
% 0.20/0.37  % (21161)Instructions burned: 1 (million)
% 0.20/0.37  % (21161)------------------------------
% 0.20/0.37  % (21161)------------------------------
% 0.20/0.37  % (21155)Success in time 0.017 s
% 0.20/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------