%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO197^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 : n015.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:27 EDT 2024

% Result   : Theorem 0.13s 0.36s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   2 unt;   1 typ;   0 def)
%            Number of atoms       :   29 (  13 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   19 (   9   ~;   0   |;   4   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   32 (  15 fml;  17 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   20 (  10   !;   9   ?;  20   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    vEPSILON: 
      !>[X0: $tType] : sTfun(sTfun(X0,$o),X0) ).

tff(f13,plain,
    $false,
    inference(equality_resolution,[],[f11]) ).

tff(f11,plain,
    ! [X1: $o] : ( $true != (X1) ),
    inference(cnf_transformation,[],[f10]) ).

tff(f10,plain,
    ! [X1: $o] :
      ( ( $true = sK0 )
      & ( $true != (X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).

tff(f9,plain,
    ( ? [X0: $o] :
      ! [X1: $o] :
        ( ( $true = (X0) )
        & ( $true != (X1) ) )
   => ! [X1: $o] :
        ( ( $true = sK0 )
        & ( $true != (X1) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f8,plain,
    ? [X0: $o] :
    ! [X1: $o] :
      ( ( $true = (X0) )
      & ( $true != (X1) ) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f7,plain,
    ~ ! [X0: $o] :
      ? [X1: $o] :
        ( ( $true = (X0) )
       => ( $true = (X1) ) ),
    inference(rectify,[],[f6]) ).

tff(f6,plain,
    ~ ! [X1: $o] :
      ? [X2: $o] :
        ( ( $true = (X1) )
       => ( $true = (X2) ) ),
    inference(fool_elimination,[],[f5]) ).

tff(f5,plain,
    ~ ! [X1: $o] :
      ? [X2: $o] :
        ( (X1)
       => (X2) ),
    inference(rectify,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ? [X0: $o] :
      ! [X1: $o] :
      ? [X2: $o] :
        ( (X1)
       => (X2) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ? [X0: $o] :
    ! [X1: $o] :
    ? [X2: $o] :
      ( (X1)
     => (X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cCT18) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYO197^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14  % 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 : n015.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   : Mon May 20 09:44:08 EDT 2024
% 0.13/0.33  % CPUTime    : 
% 0.13/0.33  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.13/0.36  % (21982)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 (2999ds/27Mi)
% 0.13/0.36  % (21982)First to succeed.
% 0.13/0.36  % (21980)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.13/0.36  % (21980)Also succeeded, but the first one will report.
% 0.13/0.36  % (21982)Refutation found. Thanks to Tanya!
% 0.13/0.36  % SZS status Theorem for theBenchmark
% 0.13/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.36  % (21982)------------------------------
% 0.13/0.36  % (21982)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36  % (21982)Termination reason: Refutation
% 0.13/0.36  
% 0.13/0.36  % (21982)Memory used [KB]: 5373
% 0.13/0.36  % (21982)Time elapsed: 0.002 s
% 0.13/0.36  % (21982)Instructions burned: 1 (million)
% 0.13/0.36  % (21982)------------------------------
% 0.13/0.36  % (21982)------------------------------
% 0.13/0.36  % (21979)Success in time 0.003 s
% 0.13/0.36  % Vampire---4.8 exiting
%------------------------------------------------------------------------------