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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO031^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 : 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:02:18 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   9 unt;   2 typ;   0 def)
%            Number of atoms       :   74 (  26 equ;   3 cnn)
%            Maximal formula atoms :    2 (   4 avg)
%            Number of connectives :   70 (  18   ~;   8   |;   0   &;  43   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   13 (  13   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   2 usr;   3 con; 0-2 aty)
%            Number of variables   :   28 (  12   ^  11   !;   4   ?;  28   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

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

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

thf(f94,plain,
    $false,
    inference(trivial_inequality_removal,[],[f93]) ).

thf(f93,plain,
    $true = $false,
    inference(boolean_simplification,[],[f92]) ).

thf(f92,plain,
    ( $false = ~ $false ),
    inference(trivial_inequality_removal,[],[f90]) ).

thf(f90,plain,
    ( ( $false = ~ $false )
    | ( $true = $false ) ),
    inference(superposition,[],[f9,f87]) ).

thf(f87,plain,
    ( $false
    = ( sK0 @ (~) ) ),
    inference(duplicate_literal_removal,[],[f86]) ).

thf(f86,plain,
    ( ( $false
      = ( sK0 @ (~) ) )
    | ( $false
      = ( sK0 @ (~) ) ) ),
    inference(beta_eta_normalization,[],[f70]) ).

thf(f70,plain,
    ( ( $false
      = ( sK0
        @ ^ [Y0: $o] :
            ~ ( ^ [Y1: $o] : Y1
              @ Y0 ) ) )
    | ( $false
      = ( ^ [Y0: $o] : Y0
        @ ( sK0
          @ ^ [Y0: $o] :
              ~ ( ^ [Y1: $o] : Y1
                @ Y0 ) ) ) ) ),
    inference(primitive_instantiation,[],[f19]) ).

thf(f19,plain,
    ! [X3: $o > $o] :
      ( ( $false
        = ( X3
          @ ( sK0
            @ ^ [Y0: $o] :
                ~ ( X3 @ Y0 ) ) ) )
      | ( $false
        = ( sK0
          @ ^ [Y0: $o] :
              ~ ( X3 @ Y0 ) ) ) ),
    inference(not_proxy_clausification,[],[f18]) ).

thf(f18,plain,
    ! [X3: $o > $o] :
      ( ( ( ~ ( X3
              @ ( sK0
                @ ^ [Y0: $o] :
                    ~ ( X3 @ Y0 ) ) ) )
        = $true )
      | ( $false
        = ( sK0
          @ ^ [Y0: $o] :
              ~ ( X3 @ Y0 ) ) ) ),
    inference(beta_eta_normalization,[],[f13]) ).

thf(f13,plain,
    ! [X3: $o > $o] :
      ( ( ( ^ [Y0: $o] :
              ~ ( X3 @ Y0 )
          @ ( sK0
            @ ^ [Y0: $o] :
                ~ ( X3 @ Y0 ) ) )
        = $true )
      | ( $false
        = ( sK0
          @ ^ [Y0: $o] :
              ~ ( X3 @ Y0 ) ) ) ),
    inference(primitive_instantiation,[],[f8]) ).

thf(f8,plain,
    ! [X0: $o > $o] :
      ( ( $true
        = ( X0 @ ( sK0 @ X0 ) ) )
      | ( $false
        = ( sK0 @ X0 ) ) ),
    inference(binary_proxy_clausification,[],[f7]) ).

thf(f7,plain,
    ! [X0: $o > $o] :
      ( ( X0 @ ( sK0 @ X0 ) )
      = ( sK0 @ X0 ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f6,plain,
    ! [X0: $o > $o] :
      ( ( X0 @ ( sK0 @ X0 ) )
      = ( sK0 @ X0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f4,f5]) ).

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

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

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

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

thf(f9,plain,
    ! [X0: $o > $o] :
      ( ( $false
        = ( X0 @ ( sK0 @ X0 ) ) )
      | ( $true
        = ( sK0 @ X0 ) ) ),
    inference(binary_proxy_clausification,[],[f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYO031^1 : TPTP v8.2.0. Released v3.7.0.
% 0.12/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.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 10:28:53 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  This is a TH0_THM_EQU_NAR problem
% 0.13/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.13/0.37  % (2653)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.13/0.37  % (2655)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.13/0.37  % (2656)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.37  % (2657)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.13/0.37  % (2658)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.13/0.37  % (2659)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.37  % (2656)Instruction limit reached!
% 0.13/0.37  % (2656)------------------------------
% 0.13/0.37  % (2656)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (2656)Termination reason: Unknown
% 0.13/0.37  % (2657)Instruction limit reached!
% 0.13/0.37  % (2657)------------------------------
% 0.13/0.37  % (2657)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (2657)Termination reason: Unknown
% 0.13/0.37  % (2657)Termination phase: Saturation
% 0.13/0.37  
% 0.13/0.37  % (2657)Memory used [KB]: 5500
% 0.13/0.37  % (2657)Time elapsed: 0.004 s
% 0.13/0.37  % (2657)Instructions burned: 2 (million)
% 0.13/0.37  % (2657)------------------------------
% 0.13/0.37  % (2657)------------------------------
% 0.13/0.37  % (2656)Termination phase: Saturation
% 0.13/0.37  
% 0.13/0.37  % (2656)Memory used [KB]: 5500
% 0.13/0.37  % (2656)Time elapsed: 0.004 s
% 0.13/0.37  % (2656)Instructions burned: 2 (million)
% 0.13/0.37  % (2656)------------------------------
% 0.13/0.37  % (2656)------------------------------
% 0.13/0.37  % (2655)Refutation not found, incomplete strategy
% 0.13/0.37  % (2655)------------------------------
% 0.13/0.37  % (2655)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (2655)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37  
% 0.13/0.37  
% 0.13/0.37  % (2655)Memory used [KB]: 5500
% 0.13/0.37  % (2655)Time elapsed: 0.004 s
% 0.13/0.37  % (2655)Instructions burned: 2 (million)
% 0.13/0.37  % (2655)------------------------------
% 0.13/0.37  % (2655)------------------------------
% 0.13/0.37  % (2660)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.13/0.37  % (2658)First to succeed.
% 0.13/0.37  % (2659)Also succeeded, but the first one will report.
% 0.13/0.37  % (2658)Refutation found. Thanks to Tanya!
% 0.13/0.37  % SZS status Theorem for theBenchmark
% 0.13/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37  % (2658)------------------------------
% 0.13/0.37  % (2658)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (2658)Termination reason: Refutation
% 0.13/0.37  
% 0.13/0.37  % (2658)Memory used [KB]: 5500
% 0.13/0.37  % (2658)Time elapsed: 0.006 s
% 0.13/0.37  % (2658)Instructions burned: 5 (million)
% 0.13/0.37  % (2658)------------------------------
% 0.13/0.37  % (2658)------------------------------
% 0.13/0.37  % (2652)Success in time 0.007 s
% 0.13/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------