%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO390^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 : n002.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:04:15 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
tff(f13,plain,
    $false,
    inference(trivial_inequality_removal,[],[f12]) ).

tff(f12,plain,
    sK1 != sK1,
    inference(definition_unfolding,[],[f10,f11]) ).

tff(f11,plain,
    sK0 = sK1,
    inference(cnf_transformation,[],[f9]) ).

tff(f9,plain,
    ( ( sK0 = sK1 )
    & ( sK0 != sK1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8]) ).

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

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

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

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

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

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

tff(f10,plain,
    sK0 != sK1,
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SYO390^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.14  % 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.14/0.35  % Computer : n002.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 09:22:37 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_EQU_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/sandbox/benchmark/theBenchmark.p
% 0.14/0.37  % (14446)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.14/0.37  % (14445)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.14/0.37  % (14449)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37  % (14445)First to succeed.
% 0.14/0.37  % (14446)Also succeeded, but the first one will report.
% 0.14/0.37  % (14445)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  % (14445)------------------------------
% 0.14/0.37  % (14445)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (14445)Termination reason: Refutation
% 0.14/0.37  
% 0.14/0.37  % (14445)Memory used [KB]: 5373
% 0.14/0.37  % (14445)Time elapsed: 0.003 s
% 0.14/0.37  % (14445)Instructions burned: 1 (million)
% 0.14/0.37  % (14445)------------------------------
% 0.14/0.37  % (14445)------------------------------
% 0.14/0.37  % (14444)Success in time 0.005 s
% 0.14/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------