%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO189^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 : n025.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:25 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_2,type,
    sK0: $o > $o ).

tff(f14,plain,
    $false,
    inference(subsumption_resolution,[],[f13,f12]) ).

tff(f12,plain,
    ! [X0: $o,X1: $o] : ( (X0) = (X1) ),
    inference(superposition,[],[f10,f10]) ).

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

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

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

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

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

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

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

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

tff(f13,plain,
    ! [X0: $o] : ( $false != (X0) ),
    inference(superposition,[],[f3,f10]) ).

tff(f3,plain,
    $false != $true,
    introduced(fool_axiom,[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYO189^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/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.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 10:58:38 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_NEQ_NAR problem
% 0.14/0.35  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.14/0.37  % (28810)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.37  % (28810)First to succeed.
% 0.14/0.37  % (28810)Refutation found. Thanks to Tanya!
% 0.14/0.37  % SZS status Theorem for theBenchmark
% 0.14/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37  % (28810)------------------------------
% 0.14/0.37  % (28810)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (28810)Termination reason: Refutation
% 0.14/0.37  
% 0.14/0.37  % (28810)Memory used [KB]: 5500
% 0.14/0.37  % (28810)Time elapsed: 0.002 s
% 0.14/0.37  % (28810)------------------------------
% 0.14/0.37  % (28810)------------------------------
% 0.14/0.37  % (28803)Success in time 0.003 s
% 0.14/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------