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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM418^1 : TPTP v8.2.0. Released v3.6.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n016.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 01:41:57 EDT 2024

% Result   : Theorem 0.12s 0.35s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   30 (  15 unt;  15 typ;   0 def)
%            Number of atoms       :   15 (  14 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   61 (   6   ~;   0   |;   0   &;  55   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :  125 ( 125   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  15 usr;   1 con; 0-4 aty)
%            Number of variables   :   42 (  34   ^   4   !;   3   ?;  42   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

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

thf(func_def_1,type,
    one: ( $i > $i ) > $i > $i ).

thf(func_def_2,type,
    two: ( $i > $i ) > $i > $i ).

thf(func_def_3,type,
    three: ( $i > $i ) > $i > $i ).

thf(func_def_4,type,
    four: ( $i > $i ) > $i > $i ).

thf(func_def_5,type,
    five: ( $i > $i ) > $i > $i ).

thf(func_def_6,type,
    six: ( $i > $i ) > $i > $i ).

thf(func_def_7,type,
    seven: ( $i > $i ) > $i > $i ).

thf(func_def_8,type,
    eight: ( $i > $i ) > $i > $i ).

thf(func_def_9,type,
    nine: ( $i > $i ) > $i > $i ).

thf(func_def_10,type,
    ten: ( $i > $i ) > $i > $i ).

thf(func_def_11,type,
    succ: ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).

thf(func_def_12,type,
    plus: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).

thf(func_def_13,type,
    mult: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).

thf(func_def_23,type,
    ph1: 
      !>[X0: $tType] : X0 ).

thf(f55,plain,
    $false,
    inference(equality_resolution,[],[f53]) ).

thf(f53,plain,
    ! [X0: ( $i > $i ) > $i > $i] :
      ( ( ^ [Y0: $i > $i,Y1: $i] : ( X0 @ Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) )
     != ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
    inference(beta_eta_normalization,[],[f52]) ).

thf(f52,plain,
    ! [X0: ( $i > $i ) > $i > $i] :
      ( ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) )
     != ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ Y2 @ ( Y1 @ Y2 @ Y3 ) )
        @ X0
        @ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
    inference(definition_unfolding,[],[f45,f48,f44,f48]) ).

thf(f44,plain,
    ( plus
    = ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ Y2 @ ( Y1 @ Y2 @ Y3 ) ) ) ),
    inference(cnf_transformation,[],[f34]) ).

thf(f34,plain,
    ( plus
    = ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ Y2 @ ( Y1 @ Y2 @ Y3 ) ) ) ),
    inference(fool_elimination,[],[f33]) ).

thf(f33,plain,
    ( ( ^ [X0: ( $i > $i ) > $i > $i,X1: ( $i > $i ) > $i > $i,X2: $i > $i,X3: $i] : ( X0 @ X2 @ ( X1 @ X2 @ X3 ) ) )
    = plus ),
    inference(rectify,[],[f13]) ).

thf(f13,axiom,
    ( ( ^ [X3: ( $i > $i ) > $i > $i,X2: ( $i > $i ) > $i > $i,X0: $i > $i,X1: $i] : ( X3 @ X0 @ ( X2 @ X0 @ X1 ) ) )
    = plus ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_ax) ).

thf(f48,plain,
    ( three
    = ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f28]) ).

thf(f28,plain,
    ( three
    = ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f4,axiom,
    ( three
    = ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ ( X0 @ X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',three_ax) ).

thf(f45,plain,
    ! [X0: ( $i > $i ) > $i > $i] :
      ( three
     != ( plus @ X0 @ three ) ),
    inference(cnf_transformation,[],[f36]) ).

thf(f36,plain,
    ! [X0: ( $i > $i ) > $i > $i] :
      ( three
     != ( plus @ X0 @ three ) ),
    inference(ennf_transformation,[],[f35]) ).

thf(f35,plain,
    ~ ? [X0: ( $i > $i ) > $i > $i] :
        ( three
        = ( plus @ X0 @ three ) ),
    inference(rectify,[],[f16]) ).

thf(f16,negated_conjecture,
    ~ ? [X2: ( $i > $i ) > $i > $i] :
        ( three
        = ( plus @ X2 @ three ) ),
    inference(negated_conjecture,[],[f15]) ).

thf(f15,conjecture,
    ? [X2: ( $i > $i ) > $i > $i] :
      ( three
      = ( plus @ X2 @ three ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : NUM418^1 : TPTP v8.2.0. Released v3.6.0.
% 0.02/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon May 20 04:35:08 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  This is a TH0_THM_EQU_NAR problem
% 0.12/0.33  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/sandbox2/benchmark/theBenchmark.p
% 0.12/0.35  % (32083)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 (2999ds/2Mi)
% 0.12/0.35  % (32080)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 (2999ds/4Mi)
% 0.12/0.35  % (32082)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.35  % (32081)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 (2999ds/27Mi)
% 0.12/0.35  % (32085)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.12/0.35  % (32084)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 (2999ds/275Mi)
% 0.12/0.35  % (32086)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.12/0.35  % (32082)Instruction limit reached!
% 0.12/0.35  % (32082)------------------------------
% 0.12/0.35  % (32082)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (32082)Termination reason: Unknown
% 0.12/0.35  % (32082)Termination phase: Property scanning
% 0.12/0.35  % (32083)Instruction limit reached!
% 0.12/0.35  % (32083)------------------------------
% 0.12/0.35  % (32083)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (32083)Termination reason: Unknown
% 0.12/0.35  % (32083)Termination phase: Property scanning
% 0.12/0.35  
% 0.12/0.35  % (32083)Memory used [KB]: 895
% 0.12/0.35  % (32083)Time elapsed: 0.003 s
% 0.12/0.35  % (32083)Instructions burned: 3 (million)
% 0.12/0.35  % (32083)------------------------------
% 0.12/0.35  % (32083)------------------------------
% 0.12/0.35  
% 0.12/0.35  % (32082)Memory used [KB]: 895
% 0.12/0.35  % (32082)Time elapsed: 0.003 s
% 0.12/0.35  % (32082)Instructions burned: 3 (million)
% 0.12/0.35  % (32082)------------------------------
% 0.12/0.35  % (32082)------------------------------
% 0.12/0.35  % (32086)Instruction limit reached!
% 0.12/0.35  % (32086)------------------------------
% 0.12/0.35  % (32086)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (32086)Termination reason: Unknown
% 0.12/0.35  % (32086)Termination phase: Function definition elimination
% 0.12/0.35  
% 0.12/0.35  % (32086)Memory used [KB]: 895
% 0.12/0.35  % (32086)Time elapsed: 0.003 s
% 0.12/0.35  % (32086)Instructions burned: 3 (million)
% 0.12/0.35  % (32086)------------------------------
% 0.12/0.35  % (32086)------------------------------
% 0.12/0.35  % (32084)Refutation not found, incomplete strategy
% 0.12/0.35  % (32084)------------------------------
% 0.12/0.35  % (32084)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (32084)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.35  
% 0.12/0.35  
% 0.12/0.35  % (32084)Memory used [KB]: 5500
% 0.12/0.35  % (32084)Time elapsed: 0.003 s
% 0.12/0.35  % (32084)Instructions burned: 3 (million)
% 0.12/0.35  % (32084)------------------------------
% 0.12/0.35  % (32084)------------------------------
% 0.12/0.35  % (32079)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.12/0.35  % (32080)Instruction limit reached!
% 0.12/0.35  % (32080)------------------------------
% 0.12/0.35  % (32080)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (32080)Termination reason: Unknown
% 0.12/0.35  % (32080)Termination phase: Saturation
% 0.12/0.35  
% 0.12/0.35  % (32080)Memory used [KB]: 5500
% 0.12/0.35  % (32080)Time elapsed: 0.003 s
% 0.12/0.35  % (32080)Instructions burned: 4 (million)
% 0.12/0.35  % (32080)------------------------------
% 0.12/0.35  % (32080)------------------------------
% 0.12/0.35  % (32081)Refutation not found, incomplete strategy
% 0.12/0.35  % (32081)------------------------------
% 0.12/0.35  % (32081)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (32081)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.35  
% 0.12/0.35  
% 0.12/0.35  % (32081)Memory used [KB]: 5500
% 0.12/0.35  % (32081)Time elapsed: 0.003 s
% 0.12/0.35  % (32081)Instructions burned: 3 (million)
% 0.12/0.35  % (32081)------------------------------
% 0.12/0.35  % (32081)------------------------------
% 0.12/0.35  % (32085)First to succeed.
% 0.12/0.35  % (32085)Refutation found. Thanks to Tanya!
% 0.12/0.35  % SZS status Theorem for theBenchmark
% 0.12/0.35  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.35  % (32085)------------------------------
% 0.12/0.35  % (32085)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (32085)Termination reason: Refutation
% 0.12/0.35  
% 0.12/0.35  % (32085)Memory used [KB]: 5500
% 0.12/0.35  % (32085)Time elapsed: 0.004 s
% 0.12/0.35  % (32085)Instructions burned: 3 (million)
% 0.12/0.35  % (32085)------------------------------
% 0.12/0.35  % (32085)------------------------------
% 0.12/0.35  % (32078)Success in time 0.016 s
% 0.12/0.35  % Vampire---4.8 exiting
%------------------------------------------------------------------------------