TSTP Solution File: SYO363^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO363^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 : n017.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:09 EDT 2024

% Result   : Theorem 0.18s 0.36s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   30 (  10 unt;  10 typ;   0 def)
%            Number of atoms       :   66 (  41 equ;   0 cnn)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :  157 (  17   ~;   1   |;  18   &; 112   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   35 (  35   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   36 (   0   ^  31   !;   4   ?;  36   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(func_def_0,type,
    a: $tType ).

thf(func_def_1,type,
    j: a > a ).

thf(func_def_2,type,
    g: ( a > a ) > a > a ).

thf(func_def_3,type,
    h: a > a ).

thf(func_def_4,type,
    f: ( a > a ) > a > a ).

thf(func_def_8,type,
    sK0: ( a > a ) > $o ).

thf(func_def_10,type,
    ph2: 
      !>[X0: $tType] : X0 ).

thf(func_def_11,type,
    sK3: a ).

thf(func_def_12,type,
    sK4: a ).

thf(f21,plain,
    $false,
    inference(subsumption_resolution,[],[f20,f13]) ).

thf(f13,plain,
    ! [X2: a] :
      ( ( h @ X2 )
      = ( j @ X2 ) ),
    inference(cnf_transformation,[],[f10]) ).

thf(f10,plain,
    ( ! [X0: a > a,X1: a] :
        ( ( f @ X0 @ X1 )
        = ( g @ X0 @ X1 ) )
    & ! [X2: a] :
        ( ( h @ X2 )
        = ( j @ X2 ) )
    & ( ( sK0 @ ( g @ j ) )
     != $true )
    & ( $true
      = ( sK0 @ ( f @ h ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).

thf(f9,plain,
    ( ? [X3: ( a > a ) > $o] :
        ( ( ( X3 @ ( g @ j ) )
         != $true )
        & ( ( X3 @ ( f @ h ) )
          = $true ) )
   => ( ( ( sK0 @ ( g @ j ) )
       != $true )
      & ( $true
        = ( sK0 @ ( f @ h ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f8,plain,
    ( ! [X0: a > a,X1: a] :
        ( ( f @ X0 @ X1 )
        = ( g @ X0 @ X1 ) )
    & ! [X2: a] :
        ( ( h @ X2 )
        = ( j @ X2 ) )
    & ? [X3: ( a > a ) > $o] :
        ( ( ( X3 @ ( g @ j ) )
         != $true )
        & ( ( X3 @ ( f @ h ) )
          = $true ) ) ),
    inference(rectify,[],[f7]) ).

thf(f7,plain,
    ( ! [X2: a > a,X1: a] :
        ( ( g @ X2 @ X1 )
        = ( f @ X2 @ X1 ) )
    & ! [X0: a] :
        ( ( h @ X0 )
        = ( j @ X0 ) )
    & ? [X3: ( a > a ) > $o] :
        ( ( ( X3 @ ( g @ j ) )
         != $true )
        & ( ( X3 @ ( f @ h ) )
          = $true ) ) ),
    inference(flattening,[],[f6]) ).

thf(f6,plain,
    ( ? [X3: ( a > a ) > $o] :
        ( ( ( X3 @ ( g @ j ) )
         != $true )
        & ( ( X3 @ ( f @ h ) )
          = $true ) )
    & ! [X0: a] :
        ( ( h @ X0 )
        = ( j @ X0 ) )
    & ! [X2: a > a,X1: a] :
        ( ( g @ X2 @ X1 )
        = ( f @ X2 @ X1 ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f5,plain,
    ~ ( ( ! [X0: a] :
            ( ( h @ X0 )
            = ( j @ X0 ) )
        & ! [X2: a > a,X1: a] :
            ( ( g @ X2 @ X1 )
            = ( f @ X2 @ X1 ) ) )
     => ! [X3: ( a > a ) > $o] :
          ( ( ( X3 @ ( f @ h ) )
            = $true )
         => ( ( X3 @ ( g @ j ) )
            = $true ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f4,plain,
    ~ ( ( ! [X0: a] :
            ( ( h @ X0 )
            = ( j @ X0 ) )
        & ! [X1: a,X2: a > a] :
            ( ( g @ X2 @ X1 )
            = ( f @ X2 @ X1 ) ) )
     => ! [X3: ( a > a ) > $o] :
          ( ( X3 @ ( f @ h ) )
         => ( X3 @ ( g @ j ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ( ( ! [X2: a] :
            ( ( h @ X2 )
            = ( j @ X2 ) )
        & ! [X1: a,X0: a > a] :
            ( ( f @ X0 @ X1 )
            = ( g @ X0 @ X1 ) ) )
     => ! [X3: ( a > a ) > $o] :
          ( ( X3 @ ( f @ h ) )
         => ( X3 @ ( g @ j ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ( ( ! [X2: a] :
          ( ( h @ X2 )
          = ( j @ X2 ) )
      & ! [X1: a,X0: a > a] :
          ( ( f @ X0 @ X1 )
          = ( g @ X0 @ X1 ) ) )
   => ! [X3: ( a > a ) > $o] :
        ( ( X3 @ ( f @ h ) )
       => ( X3 @ ( g @ j ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEDEC2_pme) ).

thf(f20,plain,
    ( ( j @ sK4 )
   != ( h @ sK4 ) ),
    inference(negative_extensionality,[],[f19]) ).

thf(f19,plain,
    h != j,
    inference(equality_resolution,[],[f18]) ).

thf(f18,plain,
    ( ( g @ j @ sK3 )
   != ( g @ h @ sK3 ) ),
    inference(superposition,[],[f17,f14]) ).

thf(f14,plain,
    ! [X0: a > a,X1: a] :
      ( ( f @ X0 @ X1 )
      = ( g @ X0 @ X1 ) ),
    inference(cnf_transformation,[],[f10]) ).

thf(f17,plain,
    ( ( f @ h @ sK3 )
   != ( g @ j @ sK3 ) ),
    inference(negative_extensionality,[],[f16]) ).

thf(f16,plain,
    ( ( f @ h )
   != ( g @ j ) ),
    inference(trivial_inequality_removal,[],[f15]) ).

thf(f15,plain,
    ( ( ( f @ h )
     != ( g @ j ) )
    | ( $true != $true ) ),
    inference(constrained_superposition,[],[f12,f11]) ).

thf(f11,plain,
    ( $true
    = ( sK0 @ ( f @ h ) ) ),
    inference(cnf_transformation,[],[f10]) ).

thf(f12,plain,
    ( ( sK0 @ ( g @ j ) )
   != $true ),
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SYO363^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.13  % 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.11/0.33  % Computer : n017.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Mon May 20 08:55:08 EDT 2024
% 0.11/0.33  % CPUTime    : 
% 0.11/0.33  This is a TH0_THM_EQU_NAR problem
% 0.11/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/sandbox/benchmark/theBenchmark.p
% 0.18/0.35  % (4757)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.18/0.35  % (4759)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.18/0.35  % (4756)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.18/0.35  % (4763)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.18/0.35  % (4761)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.18/0.35  % (4760)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.18/0.35  % (4758)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 (3000ds/27Mi)
% 0.18/0.35  % (4759)Instruction limit reached!
% 0.18/0.35  % (4759)------------------------------
% 0.18/0.35  % (4759)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.35  % (4759)Termination reason: Unknown
% 0.18/0.35  % (4759)Termination phase: Saturation
% 0.18/0.35  
% 0.18/0.35  % (4759)Memory used [KB]: 5500
% 0.18/0.35  % (4759)Time elapsed: 0.003 s
% 0.18/0.35  % (4759)Instructions burned: 2 (million)
% 0.18/0.35  % (4759)------------------------------
% 0.18/0.35  % (4759)------------------------------
% 0.18/0.35  % (4760)Instruction limit reached!
% 0.18/0.35  % (4760)------------------------------
% 0.18/0.35  % (4760)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.35  % (4760)Termination reason: Unknown
% 0.18/0.35  % (4760)Termination phase: Saturation
% 0.18/0.35  
% 0.18/0.35  % (4760)Memory used [KB]: 5500
% 0.18/0.35  % (4760)Time elapsed: 0.003 s
% 0.18/0.35  % (4760)Instructions burned: 2 (million)
% 0.18/0.35  % (4760)------------------------------
% 0.18/0.35  % (4760)------------------------------
% 0.18/0.35  % (4761)Refutation not found, incomplete strategy
% 0.18/0.35  % (4761)------------------------------
% 0.18/0.35  % (4761)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.35  % (4761)Termination reason: Refutation not found, incomplete strategy
% 0.18/0.35  
% 0.18/0.35  
% 0.18/0.35  % (4762)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.18/0.35  % (4761)Memory used [KB]: 5500
% 0.18/0.35  % (4761)Time elapsed: 0.003 s
% 0.18/0.35  % (4761)Instructions burned: 2 (million)
% 0.18/0.35  % (4761)------------------------------
% 0.18/0.35  % (4761)------------------------------
% 0.18/0.35  % (4757)Refutation not found, incomplete strategy
% 0.18/0.35  % (4757)------------------------------
% 0.18/0.35  % (4757)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.35  % (4757)Termination reason: Refutation not found, incomplete strategy
% 0.18/0.35  
% 0.18/0.35  
% 0.18/0.35  % (4757)Memory used [KB]: 5500
% 0.18/0.35  % (4757)Time elapsed: 0.003 s
% 0.18/0.35  % (4757)Instructions burned: 2 (million)
% 0.18/0.35  % (4757)------------------------------
% 0.18/0.35  % (4757)------------------------------
% 0.18/0.35  % (4756)First to succeed.
% 0.18/0.35  % (4758)Refutation not found, incomplete strategy
% 0.18/0.35  % (4758)------------------------------
% 0.18/0.35  % (4758)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.35  % (4758)Termination reason: Refutation not found, incomplete strategy
% 0.18/0.35  
% 0.18/0.35  
% 0.18/0.35  % (4758)Memory used [KB]: 5500
% 0.18/0.35  % (4758)Time elapsed: 0.002 s
% 0.18/0.35  % (4758)Instructions burned: 1 (million)
% 0.18/0.35  % (4758)------------------------------
% 0.18/0.35  % (4758)------------------------------
% 0.18/0.35  % (4763)Also succeeded, but the first one will report.
% 0.18/0.36  % (4756)Refutation found. Thanks to Tanya!
% 0.18/0.36  % SZS status Theorem for theBenchmark
% 0.18/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.36  % (4756)------------------------------
% 0.18/0.36  % (4756)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.36  % (4756)Termination reason: Refutation
% 0.18/0.36  
% 0.18/0.36  % (4756)Memory used [KB]: 5500
% 0.18/0.36  % (4756)Time elapsed: 0.004 s
% 0.18/0.36  % (4756)Instructions burned: 2 (million)
% 0.18/0.36  % (4756)------------------------------
% 0.18/0.36  % (4756)------------------------------
% 0.18/0.36  % (4755)Success in time 0.004 s
% 0.18/0.36  % Vampire---4.8 exiting
%------------------------------------------------------------------------------