TSTP Solution File: SYO037^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO037^1 : TPTP v8.2.0. Released v3.7.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 : 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 09:02:19 EDT 2024

% Result   : Theorem 0.16s 0.40s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (   4 unt;   3 typ;   0 def)
%            Number of atoms       :   29 (  25 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   59 (  15   ~;   6   |;   0   &;  32   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   45 (  45   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   36 (   0   ^  27   !;   8   ?;  36   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_3,type,
    sK0: ( $i > $o ) > $i ).

thf(func_def_5,type,
    inv_sK0_2: $i > $i > $o ).

thf(func_def_6,type,
    ph3: 
      !>[X0: $tType] : X0 ).

thf(f18,plain,
    $false,
    inference(equality_resolution,[],[f16]) ).

thf(f16,plain,
    ! [X2: $i > $o,X3: $i] :
      ( ( ~ ( inv_sK0_2 @ ( sK0 @ X2 ) @ X3 ) )
     != ( X2 @ X3 ) ),
    inference(bool_equality_to_disequality,[],[f14]) ).

thf(f14,plain,
    ! [X2: $i > $o,X3: $i] :
      ( ( inv_sK0_2 @ ( sK0 @ X2 ) @ X3 )
      = ( X2 @ X3 ) ),
    inference(argument_congruence,[],[f12]) ).

thf(f12,plain,
    ! [X2: $i > $o] :
      ( ( inv_sK0_2 @ ( sK0 @ X2 ) )
      = X2 ),
    inference(injectivity,[],[f11]) ).

thf(f11,plain,
    ! [X2: $i > $o,X1: $i > $o] :
      ( ( ( sK0 @ X2 )
       != ( sK0 @ X1 ) )
      | ( X1 = X2 ) ),
    inference(cnf_transformation,[],[f10]) ).

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

thf(f9,plain,
    ( ? [X0: ( $i > $o ) > $i] :
      ! [X1: $i > $o,X2: $i > $o] :
        ( ( ( X0 @ X1 )
         != ( X0 @ X2 ) )
        | ( X1 = X2 ) )
   => ! [X2: $i > $o,X1: $i > $o] :
        ( ( ( sK0 @ X2 )
         != ( sK0 @ X1 ) )
        | ( X1 = X2 ) ) ),
    introduced(choice_axiom,[]) ).

thf(f8,plain,
    ? [X0: ( $i > $o ) > $i] :
    ! [X1: $i > $o,X2: $i > $o] :
      ( ( ( X0 @ X1 )
       != ( X0 @ X2 ) )
      | ( X1 = X2 ) ),
    inference(rectify,[],[f7]) ).

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

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

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

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

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

thf(f1,conjecture,
    ~ ? [X0: ( $i > $o ) > $i] :
      ! [X2: $i > $o,X1: $i > $o] :
        ( ( ( X0 @ X1 )
          = ( X0 @ X2 ) )
       => ( X1 = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14  % Problem    : SYO037^1 : TPTP v8.2.0. Released v3.7.0.
% 0.09/0.16  % 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.16/0.38  % Computer : n018.cluster.edu
% 0.16/0.38  % Model    : x86_64 x86_64
% 0.16/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38  % Memory   : 8042.1875MB
% 0.16/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38  % CPULimit   : 300
% 0.16/0.38  % WCLimit    : 300
% 0.16/0.38  % DateTime   : Mon May 20 08:35:37 EDT 2024
% 0.16/0.38  % CPUTime    : 
% 0.16/0.38  This is a TH0_CAX_EQU_NAR problem
% 0.16/0.38  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.16/0.40  % (23793)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.16/0.40  % (23786)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.16/0.40  % (23793)First to succeed.
% 0.16/0.40  % (23786)Refutation not found, incomplete strategy
% 0.16/0.40  % (23786)------------------------------
% 0.16/0.40  % (23786)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40  % (23786)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.40  
% 0.16/0.40  
% 0.16/0.40  % (23786)Memory used [KB]: 5373
% 0.16/0.40  % (23786)Time elapsed: 0.003 s
% 0.16/0.40  % (23786)Instructions burned: 1 (million)
% 0.16/0.40  % (23786)------------------------------
% 0.16/0.40  % (23786)------------------------------
% 0.16/0.40  % (23793)Refutation found. Thanks to Tanya!
% 0.16/0.40  % SZS status Theorem for theBenchmark
% 0.16/0.40  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.40  % (23793)------------------------------
% 0.16/0.40  % (23793)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40  % (23793)Termination reason: Refutation
% 0.16/0.40  
% 0.16/0.40  % (23793)Memory used [KB]: 5500
% 0.16/0.40  % (23793)Time elapsed: 0.005 s
% 0.16/0.40  % (23793)Instructions burned: 2 (million)
% 0.16/0.40  % (23793)------------------------------
% 0.16/0.40  % (23793)------------------------------
% 0.16/0.40  % (23785)Success in time 0.016 s
% 0.16/0.40  % Vampire---4.8 exiting
%------------------------------------------------------------------------------