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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV081^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 : n018.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:11:55 EDT 2024

% Result   : Theorem 0.14s 0.38s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   20 (   2 unt;   5 typ;   0 def)
%            Number of atoms       :  122 (  43 equ;   0 cnn)
%            Maximal formula atoms :    6 (   8 avg)
%            Number of connectives :  205 (  29   ~;  14   |;  24   &; 132   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   8 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :  134 ( 134   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   78 (  14   ^  35   !;  28   ?;  78   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

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

thf(func_def_4,type,
    sK1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).

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

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

thf(func_def_9,type,
    ph5: 
      !>[X0: $tType] : X0 ).

thf(f26,plain,
    $false,
    inference(trivial_inequality_removal,[],[f25]) ).

thf(f25,plain,
    $true != $true,
    inference(duplicate_literal_removal,[],[f24]) ).

thf(f24,plain,
    ( ( $true != $true )
    | ( $true != $true )
    | ( $true != $true ) ),
    inference(beta_eta_normalization,[],[f18]) ).

thf(f18,plain,
    ! [X2: $i > $o,X1: $i > $o] :
      ( ( ( ^ [Y0: $i > $o,Y1: $i > $o] : $true
          @ ( sK0
            @ ^ [Y0: $i > $o,Y1: $i > $o] : $true )
          @ ( sK1
            @ ^ [Y0: $i > $o,Y1: $i > $o] : $true ) )
       != $true )
      | ( ( ^ [Y0: $i > $o,Y1: $i > $o] : $true
          @ ( sK3
            @ ^ [Y0: $i > $o,Y1: $i > $o] : $true )
          @ ( sK3
            @ ^ [Y0: $i > $o,Y1: $i > $o] : $true ) )
       != $true )
      | ( ( ^ [Y0: $i > $o,Y1: $i > $o] : $true
          @ X1
          @ X2 )
       != $true ) ),
    inference(primitive_instantiation,[],[f12]) ).

thf(f12,plain,
    ! [X2: $i > $o,X0: ( $i > $o ) > ( $i > $o ) > $o,X1: $i > $o] :
      ( ( ( X0 @ ( sK3 @ X0 ) @ ( sK3 @ X0 ) )
       != $true )
      | ( ( X0 @ X1 @ X2 )
       != $true )
      | ( ( X0 @ ( sK0 @ X0 ) @ ( sK1 @ X0 ) )
       != $true ) ),
    inference(cnf_transformation,[],[f11]) ).

thf(f11,plain,
    ! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
      ( ! [X1: $i > $o,X2: $i > $o] :
          ( ( X0 @ X1 @ X2 )
         != $true )
      | ( ( ( X0 @ ( sK2 @ X0 ) @ ( sK1 @ X0 ) )
          = $true )
        & ( ( X0 @ ( sK0 @ X0 ) @ ( sK2 @ X0 ) )
          = $true )
        & ( ( X0 @ ( sK0 @ X0 ) @ ( sK1 @ X0 ) )
         != $true ) )
      | ( ( X0 @ ( sK3 @ X0 ) @ ( sK3 @ X0 ) )
       != $true ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f10,f9]) ).

thf(f9,plain,
    ! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
      ( ? [X3: $i > $o,X4: $i > $o,X5: $i > $o] :
          ( ( ( X0 @ X5 @ X4 )
            = $true )
          & ( ( X0 @ X3 @ X5 )
            = $true )
          & ( ( X0 @ X3 @ X4 )
           != $true ) )
     => ( ( ( X0 @ ( sK2 @ X0 ) @ ( sK1 @ X0 ) )
          = $true )
        & ( ( X0 @ ( sK0 @ X0 ) @ ( sK2 @ X0 ) )
          = $true )
        & ( ( X0 @ ( sK0 @ X0 ) @ ( sK1 @ X0 ) )
         != $true ) ) ),
    introduced(choice_axiom,[]) ).

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

thf(f8,plain,
    ! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
      ( ! [X1: $i > $o,X2: $i > $o] :
          ( ( X0 @ X1 @ X2 )
         != $true )
      | ? [X3: $i > $o,X4: $i > $o,X5: $i > $o] :
          ( ( ( X0 @ X5 @ X4 )
            = $true )
          & ( ( X0 @ X3 @ X5 )
            = $true )
          & ( ( X0 @ X3 @ X4 )
           != $true ) )
      | ? [X6: $i > $o] :
          ( $true
         != ( X0 @ X6 @ X6 ) ) ),
    inference(rectify,[],[f7]) ).

thf(f7,plain,
    ! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
      ( ! [X1: $i > $o,X2: $i > $o] :
          ( ( X0 @ X1 @ X2 )
         != $true )
      | ? [X6: $i > $o,X5: $i > $o,X4: $i > $o] :
          ( ( ( X0 @ X4 @ X5 )
            = $true )
          & ( $true
            = ( X0 @ X6 @ X4 ) )
          & ( ( X0 @ X6 @ X5 )
           != $true ) )
      | ? [X3: $i > $o] :
          ( ( X0 @ X3 @ X3 )
         != $true ) ),
    inference(flattening,[],[f6]) ).

thf(f6,plain,
    ! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
      ( ? [X3: $i > $o] :
          ( ( X0 @ X3 @ X3 )
         != $true )
      | ! [X1: $i > $o,X2: $i > $o] :
          ( ( X0 @ X1 @ X2 )
         != $true )
      | ? [X4: $i > $o,X5: $i > $o,X6: $i > $o] :
          ( ( ( X0 @ X6 @ X5 )
           != $true )
          & ( $true
            = ( X0 @ X6 @ X4 ) )
          & ( ( X0 @ X4 @ X5 )
            = $true ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f5,plain,
    ~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
        ( ! [X3: $i > $o] :
            ( ( X0 @ X3 @ X3 )
            = $true )
        & ? [X1: $i > $o,X2: $i > $o] :
            ( ( X0 @ X1 @ X2 )
            = $true )
        & ! [X4: $i > $o,X5: $i > $o,X6: $i > $o] :
            ( ( ( $true
                = ( X0 @ X6 @ X4 ) )
              & ( ( X0 @ X4 @ X5 )
                = $true ) )
           => ( ( X0 @ X6 @ X5 )
              = $true ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f4,plain,
    ~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
        ( ? [X1: $i > $o,X2: $i > $o] : ( X0 @ X1 @ X2 )
        & ! [X3: $i > $o] : ( X0 @ X3 @ X3 )
        & ! [X4: $i > $o,X5: $i > $o,X6: $i > $o] :
            ( ( ( X0 @ X4 @ X5 )
              & ( X0 @ X6 @ X4 ) )
           => ( X0 @ X6 @ X5 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
        ( ? [X1: $i > $o,X2: $i > $o] : ( X0 @ X1 @ X2 )
        & ! [X3: $i > $o] : ( X0 @ X3 @ X3 )
        & ! [X4: $i > $o,X5: $i > $o,X3: $i > $o] :
            ( ( ( X0 @ X4 @ X5 )
              & ( X0 @ X3 @ X4 ) )
           => ( X0 @ X3 @ X5 ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
      ( ? [X1: $i > $o,X2: $i > $o] : ( X0 @ X1 @ X2 )
      & ! [X3: $i > $o] : ( X0 @ X3 @ X3 )
      & ! [X4: $i > $o,X5: $i > $o,X3: $i > $o] :
          ( ( ( X0 @ X4 @ X5 )
            & ( X0 @ X3 @ X4 ) )
         => ( X0 @ X3 @ X5 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM120_1_pme) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem    : SEV081^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/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.35  % Computer : n018.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % 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:38:07 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_NEQ_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/sandbox/benchmark/theBenchmark.p
% 0.14/0.37  % (8842)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  % (8838)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37  % (8836)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  % (8839)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  % (8837)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.14/0.37  % (8841)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  % (8840)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  % (8835)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  % (8838)Instruction limit reached!
% 0.14/0.37  % (8838)------------------------------
% 0.14/0.37  % (8838)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (8838)Termination reason: Unknown
% 0.14/0.37  % (8838)Termination phase: Saturation
% 0.14/0.37  % (8839)Instruction limit reached!
% 0.14/0.37  % (8839)------------------------------
% 0.14/0.37  % (8839)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  
% 0.14/0.37  % (8838)Memory used [KB]: 5500
% 0.14/0.37  % (8838)Time elapsed: 0.003 s
% 0.14/0.37  % (8838)Instructions burned: 2 (million)
% 0.14/0.37  % (8838)------------------------------
% 0.14/0.37  % (8838)------------------------------
% 0.14/0.37  % (8839)Termination reason: Unknown
% 0.14/0.37  % (8839)Termination phase: Preprocessing 3
% 0.14/0.37  
% 0.14/0.37  % (8839)Memory used [KB]: 895
% 0.14/0.37  % (8839)Time elapsed: 0.002 s
% 0.14/0.37  % (8839)Instructions burned: 2 (million)
% 0.14/0.37  % (8839)------------------------------
% 0.14/0.37  % (8839)------------------------------
% 0.14/0.37  % (8842)Instruction limit reached!
% 0.14/0.37  % (8842)------------------------------
% 0.14/0.37  % (8842)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (8842)Termination reason: Unknown
% 0.14/0.37  % (8842)Termination phase: Saturation
% 0.14/0.37  
% 0.14/0.37  % (8842)Memory used [KB]: 5500
% 0.14/0.37  % (8842)Time elapsed: 0.004 s
% 0.14/0.37  % (8842)Instructions burned: 3 (million)
% 0.14/0.37  % (8842)------------------------------
% 0.14/0.37  % (8842)------------------------------
% 0.14/0.38  % (8837)Refutation not found, incomplete strategy
% 0.14/0.38  % (8837)------------------------------
% 0.14/0.38  % (8837)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (8837)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38  
% 0.14/0.38  
% 0.14/0.38  % (8837)Memory used [KB]: 5500
% 0.14/0.38  % (8837)Time elapsed: 0.003 s
% 0.14/0.38  % (8837)Instructions burned: 2 (million)
% 0.14/0.38  % (8836)First to succeed.
% 0.14/0.38  % (8837)------------------------------
% 0.14/0.38  % (8837)------------------------------
% 0.14/0.38  % (8841)Also succeeded, but the first one will report.
% 0.14/0.38  % (8840)Also succeeded, but the first one will report.
% 0.14/0.38  % (8836)Refutation found. Thanks to Tanya!
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38  % (8836)------------------------------
% 0.14/0.38  % (8836)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (8836)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (8836)Memory used [KB]: 5500
% 0.14/0.38  % (8836)Time elapsed: 0.004 s
% 0.14/0.38  % (8836)Instructions burned: 2 (million)
% 0.14/0.38  % (8836)------------------------------
% 0.14/0.38  % (8836)------------------------------
% 0.14/0.38  % (8834)Success in time 0.007 s
% 0.14/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------