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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV290^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/sandbox2/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 04:12:40 EDT 2024

% Result   : Theorem 0.22s 0.39s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   17 (   4 unt;   6 typ;   0 def)
%            Number of atoms       :   52 (  13 equ;   0 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :   48 (   7   ~;   0   |;   4   &;  32   @)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   66 (  66   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   17 (   2   ^   8   !;   6   ?;  17   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

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

thf(func_def_1,type,
    cSUCC: ( ( $i > $o ) > $o ) > ( $i > $o ) > $o ).

thf(func_def_2,type,
    c_less__eq_: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).

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

thf(func_def_18,type,
    sK2: ( ( ( $i > $o ) > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).

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

thf(f35,plain,
    $false,
    inference(trivial_inequality_removal,[],[f34]) ).

thf(f34,plain,
    $false = $true,
    inference(beta_eta_normalization,[],[f32]) ).

thf(f32,plain,
    ( $true
    = ( ^ [Y0: ( $i > $o ) > $o] : $false
      @ ( sK0
        @ ^ [Y0: ( $i > $o ) > $o] : $false ) ) ),
    inference(primitive_instantiation,[],[f16]) ).

thf(f16,plain,
    ! [X0: ( ( $i > $o ) > $o ) > $o] :
      ( ( X0 @ ( sK0 @ X0 ) )
      = $true ),
    inference(cnf_transformation,[],[f14]) ).

thf(f14,plain,
    ! [X0: ( ( $i > $o ) > $o ) > $o] :
      ( ( ( X0 @ ( sK0 @ X0 ) )
        = $true )
      & ( $true
       != ( c_less__eq_ @ ( sK0 @ X0 ) @ c0 ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f13]) ).

thf(f13,plain,
    ! [X0: ( ( $i > $o ) > $o ) > $o] :
      ( ? [X1: ( $i > $o ) > $o] :
          ( ( $true
            = ( X0 @ X1 ) )
          & ( $true
           != ( c_less__eq_ @ X1 @ c0 ) ) )
     => ( ( ( X0 @ ( sK0 @ X0 ) )
          = $true )
        & ( $true
         != ( c_less__eq_ @ ( sK0 @ X0 ) @ c0 ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f12,plain,
    ! [X0: ( ( $i > $o ) > $o ) > $o] :
    ? [X1: ( $i > $o ) > $o] :
      ( ( $true
        = ( X0 @ X1 ) )
      & ( $true
       != ( c_less__eq_ @ X1 @ c0 ) ) ),
    inference(ennf_transformation,[],[f7]) ).

thf(f7,plain,
    ~ ? [X0: ( ( $i > $o ) > $o ) > $o] :
      ! [X1: ( $i > $o ) > $o] :
        ( ( $true
          = ( X0 @ X1 ) )
       => ( $true
          = ( c_less__eq_ @ X1 @ c0 ) ) ),
    inference(fool_elimination,[],[f6]) ).

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

thf(f4,negated_conjecture,
    ~ ? [X6: ( ( $i > $o ) > $o ) > $o] :
      ! [X2: ( $i > $o ) > $o] :
        ( ( X6 @ X2 )
       => ( c_less__eq_ @ X2 @ c0 ) ),
    inference(negated_conjecture,[],[f3]) ).

thf(f3,conjecture,
    ? [X6: ( ( $i > $o ) > $o ) > $o] :
    ! [X2: ( $i > $o ) > $o] :
      ( ( X6 @ X2 )
     => ( c_less__eq_ @ X2 @ c0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SEV290^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.04/0.14  % 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.14/0.36  % Computer : n017.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sun May 19 18:22:08 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a TH0_THM_EQU_NAR problem
% 0.14/0.36  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.22/0.39  % (6205)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.39  % (6205)Instruction limit reached!
% 0.22/0.39  % (6205)------------------------------
% 0.22/0.39  % (6205)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39  % (6205)Termination reason: Unknown
% 0.22/0.39  % (6205)Termination phase: Function definition elimination
% 0.22/0.39  
% 0.22/0.39  % (6205)Memory used [KB]: 895
% 0.22/0.39  % (6205)Time elapsed: 0.003 s
% 0.22/0.39  % (6206)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.22/0.39  % (6205)Instructions burned: 2 (million)
% 0.22/0.39  % (6205)------------------------------
% 0.22/0.39  % (6205)------------------------------
% 0.22/0.39  % (6206)Instruction limit reached!
% 0.22/0.39  % (6206)------------------------------
% 0.22/0.39  % (6206)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39  % (6206)Termination reason: Unknown
% 0.22/0.39  % (6206)Termination phase: Saturation
% 0.22/0.39  
% 0.22/0.39  % (6206)Memory used [KB]: 895
% 0.22/0.39  % (6206)Time elapsed: 0.003 s
% 0.22/0.39  % (6206)Instructions burned: 2 (million)
% 0.22/0.39  % (6206)------------------------------
% 0.22/0.39  % (6206)------------------------------
% 0.22/0.39  % (6204)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.22/0.39  % (6202)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.22/0.39  % (6203)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.22/0.39  % (6208)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.39  % (6207)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.22/0.39  % (6204)Refutation not found, incomplete strategy
% 0.22/0.39  % (6204)------------------------------
% 0.22/0.39  % (6204)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39  % (6204)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.39  
% 0.22/0.39  % (6202)First to succeed.
% 0.22/0.39  
% 0.22/0.39  % (6204)Memory used [KB]: 5500
% 0.22/0.39  % (6204)Time elapsed: 0.004 s
% 0.22/0.39  % (6204)Instructions burned: 4 (million)
% 0.22/0.39  % (6204)------------------------------
% 0.22/0.39  % (6204)------------------------------
% 0.22/0.39  % (6209)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.22/0.39  % (6207)Also succeeded, but the first one will report.
% 0.22/0.39  % (6203)Instruction limit reached!
% 0.22/0.39  % (6203)------------------------------
% 0.22/0.39  % (6203)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39  % (6203)Termination reason: Unknown
% 0.22/0.39  % (6203)Termination phase: Saturation
% 0.22/0.39  
% 0.22/0.39  % (6203)Memory used [KB]: 5500
% 0.22/0.39  % (6203)Time elapsed: 0.005 s
% 0.22/0.39  % (6203)Instructions burned: 4 (million)
% 0.22/0.39  % (6202)Refutation found. Thanks to Tanya!
% 0.22/0.39  % SZS status Theorem for theBenchmark
% 0.22/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.39  % (6202)------------------------------
% 0.22/0.39  % (6202)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39  % (6202)Termination reason: Refutation
% 0.22/0.39  
% 0.22/0.39  % (6202)Memory used [KB]: 5500
% 0.22/0.39  % (6202)Time elapsed: 0.004 s
% 0.22/0.39  % (6202)Instructions burned: 3 (million)
% 0.22/0.39  % (6202)------------------------------
% 0.22/0.39  % (6202)------------------------------
% 0.22/0.39  % (6199)Success in time 0.021 s
% 0.22/0.39  % Vampire---4.8 exiting
%------------------------------------------------------------------------------