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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV179^5 : TPTP v8.2.0. Bugfixed v5.2.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 : n023.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 04:12:16 EDT 2024

% Result   : Theorem 0.14s 0.37s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   37 (  23 unt;   6 typ;   0 def)
%            Number of atoms       :  141 (  60 equ;   0 cnn)
%            Maximal formula atoms :    2 (   4 avg)
%            Number of connectives :  277 (  39   ~;   4   |;  25   &; 189   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   81 (  81   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   6 usr;   3 con; 0-2 aty)
%                                         (   0  !!;  19  ??;   0 @@+;   0 @@-)
%            Number of variables   :   61 (  46   ^  10   !;   4   ?;  61   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_0,type,
    cD_FOR_X5309: ( ( $i > $o ) > $i ) > $i > $o ).

thf(func_def_12,type,
    sK0: ( $i > $o ) > $i ).

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

thf(func_def_15,type,
    sK3: $i > $o ).

thf(func_def_16,type,
    sK4: $i > $o ).

thf(func_def_17,type,
    sK5: $i > $o ).

thf(f66,plain,
    $false,
    inference(trivial_inequality_removal,[],[f64]) ).

thf(f64,plain,
    $false = $true,
    inference(superposition,[],[f54,f27]) ).

thf(f27,plain,
    ( ( sK3 @ ( sK0 @ sK3 ) )
    = $false ),
    inference(not_proxy_clausification,[],[f26]) ).

thf(f26,plain,
    ( $true
    = ( ~ ( sK3 @ ( sK0 @ sK3 ) ) ) ),
    inference(binary_proxy_clausification,[],[f24]) ).

thf(f24,plain,
    ( ( ~ ( sK3 @ ( sK0 @ sK3 ) )
      & ( ( sK0 @ sK3 )
        = ( sK0
          @ ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                  & ( ( sK0 @ Y1 )
                    = Y0 ) ) ) ) ) )
    = $true ),
    inference(beta_eta_normalization,[],[f23]) ).

thf(f23,plain,
    ( ( ^ [Y0: $i > $o] :
          ( ~ ( Y0 @ ( sK0 @ Y0 ) )
          & ( ( sK0 @ Y0 )
            = ( sK0
              @ ^ [Y1: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y2: $i > $o] :
                      ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                      & ( ( sK0 @ Y2 )
                        = Y1 ) ) ) ) ) )
      @ sK3 )
    = $true ),
    inference(sigma_clausification,[],[f22]) ).

thf(f22,plain,
    ( ( ?? @ ( $i > $o )
      @ ^ [Y0: $i > $o] :
          ( ~ ( Y0 @ ( sK0 @ Y0 ) )
          & ( ( sK0 @ Y0 )
            = ( sK0
              @ ^ [Y1: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y2: $i > $o] :
                      ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                      & ( ( sK0 @ Y2 )
                        = Y1 ) ) ) ) ) ) )
    = $true ),
    inference(beta_eta_normalization,[],[f21]) ).

thf(f21,plain,
    ( ( ^ [Y0: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y1: $i > $o] :
              ( ~ ( Y1 @ ( sK0 @ Y1 ) )
              & ( ( sK0 @ Y1 )
                = Y0 ) ) )
      @ ( sK0
        @ ^ [Y0: $i] :
            ( ?? @ ( $i > $o )
            @ ^ [Y1: $i > $o] :
                ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                & ( ( sK0 @ Y1 )
                  = Y0 ) ) ) ) )
    = $true ),
    inference(equality_resolution,[],[f20]) ).

thf(f20,plain,
    ! [X1: $i > $o] :
      ( ( ( sK0 @ X1 )
       != ( sK0
          @ ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                  & ( ( sK0 @ Y1 )
                    = Y0 ) ) ) ) )
      | ( ( X1 @ ( sK0 @ X1 ) )
        = $true ) ),
    inference(equality_proxy_clausification,[],[f19]) ).

thf(f19,plain,
    ! [X1: $i > $o] :
      ( ( ( X1 @ ( sK0 @ X1 ) )
        = $true )
      | ( $false
        = ( ( sK0 @ X1 )
          = ( sK0
            @ ^ [Y0: $i] :
                ( ?? @ ( $i > $o )
                @ ^ [Y1: $i > $o] :
                    ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                    & ( ( sK0 @ Y1 )
                      = Y0 ) ) ) ) ) ) ),
    inference(not_proxy_clausification,[],[f18]) ).

thf(f18,plain,
    ! [X1: $i > $o] :
      ( ( $false
        = ( ~ ( X1 @ ( sK0 @ X1 ) ) ) )
      | ( $false
        = ( ( sK0 @ X1 )
          = ( sK0
            @ ^ [Y0: $i] :
                ( ?? @ ( $i > $o )
                @ ^ [Y1: $i > $o] :
                    ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                    & ( ( sK0 @ Y1 )
                      = Y0 ) ) ) ) ) ) ),
    inference(binary_proxy_clausification,[],[f17]) ).

thf(f17,plain,
    ! [X1: $i > $o] :
      ( $false
      = ( ~ ( X1 @ ( sK0 @ X1 ) )
        & ( ( sK0 @ X1 )
          = ( sK0
            @ ^ [Y0: $i] :
                ( ?? @ ( $i > $o )
                @ ^ [Y1: $i > $o] :
                    ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                    & ( ( sK0 @ Y1 )
                      = Y0 ) ) ) ) ) ) ),
    inference(beta_eta_normalization,[],[f16]) ).

thf(f16,plain,
    ! [X1: $i > $o] :
      ( $false
      = ( ^ [Y0: $i > $o] :
            ( ~ ( Y0 @ ( sK0 @ Y0 ) )
            & ( ( sK0 @ Y0 )
              = ( sK0
                @ ^ [Y1: $i] :
                    ( ?? @ ( $i > $o )
                    @ ^ [Y2: $i > $o] :
                        ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                        & ( ( sK0 @ Y2 )
                          = Y1 ) ) ) ) ) )
        @ X1 ) ),
    inference(pi_clausification,[],[f15]) ).

thf(f15,plain,
    ( ( ?? @ ( $i > $o )
      @ ^ [Y0: $i > $o] :
          ( ~ ( Y0 @ ( sK0 @ Y0 ) )
          & ( ( sK0 @ Y0 )
            = ( sK0
              @ ^ [Y1: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y2: $i > $o] :
                      ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                      & ( ( sK0 @ Y2 )
                        = Y1 ) ) ) ) ) ) )
   != $true ),
    inference(beta_eta_normalization,[],[f14]) ).

thf(f14,plain,
    ( ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ~ ( Y2 @ ( Y0 @ Y2 ) )
              & ( ( Y0 @ Y2 )
                = Y1 ) ) )
      @ sK0
      @ ( sK0
        @ ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y2: $i > $o] :
                  ( ~ ( Y2 @ ( Y0 @ Y2 ) )
                  & ( ( Y0 @ Y2 )
                    = Y1 ) ) )
          @ sK0 ) ) )
   != $true ),
    inference(definition_unfolding,[],[f13,f12,f12]) ).

thf(f12,plain,
    ( cD_FOR_X5309
    = ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ~ ( Y2 @ ( Y0 @ Y2 ) )
              & ( ( Y0 @ Y2 )
                = Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f8,plain,
    ( cD_FOR_X5309
    = ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ~ ( Y2 @ ( Y0 @ Y2 ) )
              & ( ( Y0 @ Y2 )
                = Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f7]) ).

thf(f7,plain,
    ( cD_FOR_X5309
    = ( ^ [X0: ( $i > $o ) > $i,X1: $i] :
        ? [X2: $i > $o] :
          ( ( ( X0 @ X2 )
            = X1 )
          & ~ ( X2 @ ( X0 @ X2 ) ) ) ) ),
    inference(rectify,[],[f1]) ).

thf(f1,axiom,
    ( cD_FOR_X5309
    = ( ^ [X0: ( $i > $o ) > $i,X1: $i] :
        ? [X2: $i > $o] :
          ( ( ( X0 @ X2 )
            = X1 )
          & ~ ( X2 @ ( X0 @ X2 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cD_FOR_X5309_def) ).

thf(f13,plain,
    ( ( cD_FOR_X5309 @ sK0 @ ( sK0 @ ( cD_FOR_X5309 @ sK0 ) ) )
   != $true ),
    inference(cnf_transformation,[],[f11]) ).

thf(f11,plain,
    ( ( cD_FOR_X5309 @ sK0 @ ( sK0 @ ( cD_FOR_X5309 @ sK0 ) ) )
   != $true ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).

thf(f10,plain,
    ( ? [X0: ( $i > $o ) > $i] :
        ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
       != $true )
   => ( ( cD_FOR_X5309 @ sK0 @ ( sK0 @ ( cD_FOR_X5309 @ sK0 ) ) )
     != $true ) ),
    introduced(choice_axiom,[]) ).

thf(f9,plain,
    ? [X0: ( $i > $o ) > $i] :
      ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
     != $true ),
    inference(ennf_transformation,[],[f6]) ).

thf(f6,plain,
    ~ ! [X0: ( $i > $o ) > $i] :
        ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
        = $true ),
    inference(fool_elimination,[],[f5]) ).

thf(f5,plain,
    ~ ! [X0: ( $i > $o ) > $i] : ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ),
    inference(rectify,[],[f3]) ).

thf(f3,negated_conjecture,
    ~ ! [X0: ( $i > $o ) > $i] : ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ),
    inference(negated_conjecture,[],[f2]) ).

thf(f2,conjecture,
    ! [X0: ( $i > $o ) > $i] : ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM144C_pme) ).

thf(f54,plain,
    ( ( sK3 @ ( sK0 @ sK3 ) )
    = $true ),
    inference(equality_resolution,[],[f30]) ).

thf(f30,plain,
    ! [X0: $i > $o] :
      ( ( ( sK0 @ X0 )
       != ( sK0 @ sK3 ) )
      | ( $true
        = ( X0 @ ( sK0 @ X0 ) ) ) ),
    inference(superposition,[],[f20,f28]) ).

thf(f28,plain,
    ( ( sK0
      @ ^ [Y0: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y1: $i > $o] :
              ( ~ ( Y1 @ ( sK0 @ Y1 ) )
              & ( ( sK0 @ Y1 )
                = Y0 ) ) ) )
    = ( sK0 @ sK3 ) ),
    inference(equality_proxy_clausification,[],[f25]) ).

thf(f25,plain,
    ( ( ( sK0 @ sK3 )
      = ( sK0
        @ ^ [Y0: $i] :
            ( ?? @ ( $i > $o )
            @ ^ [Y1: $i > $o] :
                ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                & ( ( sK0 @ Y1 )
                  = Y0 ) ) ) ) )
    = $true ),
    inference(binary_proxy_clausification,[],[f24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEV179^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.11/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.34  % Computer : n023.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % 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   : Sun May 19 18:47:38 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  % (25310)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  % (25311)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  % (25315)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.14/0.37  % (25314)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  % (25313)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37  % (25313)Instruction limit reached!
% 0.14/0.37  % (25313)------------------------------
% 0.14/0.37  % (25313)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (25313)Termination reason: Unknown
% 0.14/0.37  % (25313)Termination phase: Function definition elimination
% 0.14/0.37  % (25314)Instruction limit reached!
% 0.14/0.37  % (25314)------------------------------
% 0.14/0.37  % (25314)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (25314)Termination reason: Unknown
% 0.14/0.37  % (25314)Termination phase: Saturation
% 0.14/0.37  
% 0.14/0.37  % (25314)Memory used [KB]: 895
% 0.14/0.37  % (25314)Time elapsed: 0.003 s
% 0.14/0.37  % (25314)Instructions burned: 2 (million)
% 0.14/0.37  % (25314)------------------------------
% 0.14/0.37  % (25314)------------------------------
% 0.14/0.37  
% 0.14/0.37  % (25313)Memory used [KB]: 895
% 0.14/0.37  % (25313)Time elapsed: 0.003 s
% 0.14/0.37  % (25313)Instructions burned: 2 (million)
% 0.14/0.37  % (25313)------------------------------
% 0.14/0.37  % (25313)------------------------------
% 0.14/0.37  % (25315)Refutation not found, incomplete strategy
% 0.14/0.37  % (25315)------------------------------
% 0.14/0.37  % (25315)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (25315)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37  
% 0.14/0.37  
% 0.14/0.37  % (25315)Memory used [KB]: 5373
% 0.14/0.37  % (25315)Time elapsed: 0.003 s
% 0.14/0.37  % (25315)Instructions burned: 1 (million)
% 0.14/0.37  % (25316)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  % (25315)------------------------------
% 0.14/0.37  % (25315)------------------------------
% 0.14/0.37  % (25311)Instruction limit reached!
% 0.14/0.37  % (25311)------------------------------
% 0.14/0.37  % (25311)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (25311)Termination reason: Unknown
% 0.14/0.37  % (25311)Termination phase: Saturation
% 0.14/0.37  
% 0.14/0.37  % (25311)Memory used [KB]: 5500
% 0.14/0.37  % (25311)Time elapsed: 0.005 s
% 0.14/0.37  % (25311)Instructions burned: 4 (million)
% 0.14/0.37  % (25311)------------------------------
% 0.14/0.37  % (25311)------------------------------
% 0.14/0.37  % (25310)First to succeed.
% 0.14/0.37  % (25316)Also succeeded, but the first one will report.
% 0.14/0.37  % (25317)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.14/0.37  % (25310)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  % (25310)------------------------------
% 0.14/0.37  % (25310)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (25310)Termination reason: Refutation
% 0.14/0.37  
% 0.14/0.37  % (25310)Memory used [KB]: 5500
% 0.14/0.37  % (25310)Time elapsed: 0.008 s
% 0.14/0.37  % (25310)Instructions burned: 5 (million)
% 0.14/0.37  % (25310)------------------------------
% 0.14/0.37  % (25310)------------------------------
% 0.14/0.37  % (25309)Success in time 0.007 s
% 0.14/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------