%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV012^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 : n018.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:41 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(f9,plain,
    $false,
    inference(trivial_inequality_removal,[],[f8]) ).

thf(f8,plain,
    ( ( ^ [Y0: $o,Y1: $o] : $true )
   != ( ^ [Y0: $o,Y1: $o] : $true ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f7,plain,
    ( ( ^ [Y0: $o,Y1: $o] : $true )
   != ( ^ [Y0: $o,Y1: $o] : $true ) ),
    inference(flattening,[],[f6]) ).

thf(f6,plain,
    ( ( ^ [Y0: $o,Y1: $o] : $true )
   != ( ^ [Y0: $o,Y1: $o] : $true ) ),
    inference(true_and_false_elimination,[],[f5]) ).

thf(f5,plain,
    ~ ( ( ( $true
          & $true )
       => $true )
      & ( ( ^ [Y0: $o,Y1: $o] : $true )
        = ( ^ [Y0: $o,Y1: $o] : $true ) )
      & ( $true
       => $true ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f4,plain,
    ~ ( ( ( $true
          & $true )
       => $true )
      & ( ( ^ [X3: $o,X4: $o] : $true )
        = ( ^ [X5: $o,X6: $o] : $true ) )
      & ( $true
       => $true ) ),
    inference(rectify,[],[f2]) ).

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

thf(f1,conjecture,
    ( ! [X0: $o,X1: $o,X2: $o] :
        ( ( $true
          & $true )
       => $true )
    & ( ( ^ [X0: $o,X1: $o] : $true )
      = ( ^ [X0: $o,X1: $o] : $true ) )
    & ! [X0: $o,X1: $o] :
        ( $true
       => $true ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM519_pme) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SEV012^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/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.11/0.32  % Computer : n018.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Sun May 19 19:20:53 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.11/0.32  This is a TH0_THM_EQU_NAR problem
% 0.11/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.11/0.34  % (17880)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.11/0.34  % (17880)First to succeed.
% 0.11/0.34  % (17879)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.11/0.34  % (17879)Also succeeded, but the first one will report.
% 0.11/0.34  % (17880)Refutation found. Thanks to Tanya!
% 0.11/0.34  % SZS status Theorem for theBenchmark
% 0.11/0.34  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.34  % (17880)------------------------------
% 0.11/0.34  % (17880)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34  % (17880)Termination reason: Refutation
% 0.11/0.34  
% 0.11/0.34  % (17880)Memory used [KB]: 5373
% 0.11/0.34  % (17880)Time elapsed: 0.002 s
% 0.11/0.34  % (17880)Instructions burned: 1 (million)
% 0.11/0.34  % (17880)------------------------------
% 0.11/0.34  % (17880)------------------------------
% 0.11/0.34  % (17878)Success in time 0.01 s
% 0.11/0.34  % Vampire---4.8 exiting
%------------------------------------------------------------------------------