TSTP Solution File: SEV394^5 by Vampire---4.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.9
% Problem  : SEV394^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire %s %d THM

% Computer : n022.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 : Mon Jun 24 16:03:42 EDT 2024

% Result   : Theorem 0.06s 0.28s
% Output   : Refutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   26 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :  198 (  77 equ;   0 cnn)
%            Maximal formula atoms :   12 (   7 avg)
%            Number of connectives :  230 (  44   ~;  18   |;  43   &; 105   @)
%                                         (   0 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   27 (  27   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   80 (  26   ^  40   !;  14   ?;  80   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(func_def_0,type,
    a: $tType ).

thf(func_def_8,type,
    sK0: a > $o ).

thf(func_def_9,type,
    sK1: a > $o ).

thf(func_def_10,type,
    sK2: a > $o ).

thf(func_def_11,type,
    sK3: a ).

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

thf(f28,plain,
    $false,
    inference(trivial_inequality_removal,[],[f27]) ).

thf(f27,plain,
    $true = $false,
    inference(superposition,[],[f19,f25]) ).

thf(f25,plain,
    ( $false
    = ( sK1 @ sK3 ) ),
    inference(trivial_inequality_removal,[],[f24]) ).

thf(f24,plain,
    ( ( $false
      = ( sK1 @ sK3 ) )
    | ( $true != $true ) ),
    inference(superposition,[],[f14,f23]) ).

thf(f23,plain,
    ! [X1: a] :
      ( ( $true
        = ( sK2 @ X1 ) )
      | ( ( sK1 @ X1 )
        = $false ) ),
    inference(not_proxy_clausification,[],[f22]) ).

thf(f22,plain,
    ! [X1: a] :
      ( ( ( ~ ( sK2 @ X1 ) )
        = $false )
      | ( ( sK1 @ X1 )
        = $false ) ),
    inference(binary_proxy_clausification,[],[f21]) ).

thf(f21,plain,
    ! [X1: a] :
      ( ( ~ ( sK2 @ X1 )
        & ( sK1 @ X1 ) )
      = $false ),
    inference(beta_eta_normalization,[],[f20]) ).

thf(f20,plain,
    ! [X1: a] :
      ( ( ^ [Y0: a] :
            ( ~ ( sK2 @ Y0 )
            & ( sK1 @ Y0 ) )
        @ X1 )
      = ( ^ [Y0: a] : $false
        @ X1 ) ),
    inference(argument_congruence,[],[f16]) ).

thf(f16,plain,
    ( ( ^ [Y0: a] : $false )
    = ( ^ [Y0: a] :
          ( ~ ( sK2 @ Y0 )
          & ( sK1 @ Y0 ) ) ) ),
    inference(cnf_transformation,[],[f12]) ).

thf(f12,plain,
    ( ( ( ^ [Y0: a] : $false )
      = ( ^ [Y0: a] :
            ( ~ ( sK2 @ Y0 )
            & ( sK1 @ Y0 ) ) ) )
    & ! [X3: a] :
        ( ( $true
          = ( sK2 @ X3 ) )
        | ( $true
          = ( sK1 @ X3 ) )
        | ( $true
         != ( sK0 @ X3 ) ) )
    & ( $true
     != ( sK2 @ sK3 ) )
    & ( $true
      = ( sK0 @ sK3 ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f9,f11,f10]) ).

thf(f10,plain,
    ( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ( ^ [Y0: a] : $false )
          = ( ^ [Y0: a] :
                ( ~ ( X2 @ Y0 )
                & ( X1 @ Y0 ) ) ) )
        & ! [X3: a] :
            ( ( ( X2 @ X3 )
              = $true )
            | ( ( X1 @ X3 )
              = $true )
            | ( ( X0 @ X3 )
             != $true ) )
        & ? [X4: a] :
            ( ( $true
             != ( X2 @ X4 ) )
            & ( ( X0 @ X4 )
              = $true ) ) )
   => ( ( ( ^ [Y0: a] : $false )
        = ( ^ [Y0: a] :
              ( ~ ( sK2 @ Y0 )
              & ( sK1 @ Y0 ) ) ) )
      & ! [X3: a] :
          ( ( $true
            = ( sK2 @ X3 ) )
          | ( $true
            = ( sK1 @ X3 ) )
          | ( $true
           != ( sK0 @ X3 ) ) )
      & ? [X4: a] :
          ( ( $true
           != ( sK2 @ X4 ) )
          & ( $true
            = ( sK0 @ X4 ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f11,plain,
    ( ? [X4: a] :
        ( ( $true
         != ( sK2 @ X4 ) )
        & ( $true
          = ( sK0 @ X4 ) ) )
   => ( ( $true
       != ( sK2 @ sK3 ) )
      & ( $true
        = ( sK0 @ sK3 ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f9,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ( ( ^ [Y0: a] : $false )
        = ( ^ [Y0: a] :
              ( ~ ( X2 @ Y0 )
              & ( X1 @ Y0 ) ) ) )
      & ! [X3: a] :
          ( ( ( X2 @ X3 )
            = $true )
          | ( ( X1 @ X3 )
            = $true )
          | ( ( X0 @ X3 )
           != $true ) )
      & ? [X4: a] :
          ( ( $true
           != ( X2 @ X4 ) )
          & ( ( X0 @ X4 )
            = $true ) ) ),
    inference(flattening,[],[f8]) ).

thf(f8,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ? [X4: a] :
          ( ( $true
           != ( X2 @ X4 ) )
          & ( ( X0 @ X4 )
            = $true ) )
      & ( ( ^ [Y0: a] : $false )
        = ( ^ [Y0: a] :
              ( ~ ( X2 @ Y0 )
              & ( X1 @ Y0 ) ) ) )
      & ! [X3: a] :
          ( ( ( X2 @ X3 )
            = $true )
          | ( ( X0 @ X3 )
           != $true )
          | ( ( X1 @ X3 )
            = $true ) ) ),
    inference(ennf_transformation,[],[f7]) ).

thf(f7,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ( ( ^ [Y0: a] : $false )
            = ( ^ [Y0: a] :
                  ( ~ ( X2 @ Y0 )
                  & ( X1 @ Y0 ) ) ) )
          & ! [X3: a] :
              ( ( ( ( X0 @ X3 )
                  = $true )
                & ( ( X1 @ X3 )
                 != $true ) )
             => ( ( X2 @ X3 )
                = $true ) ) )
       => ! [X4: a] :
            ( ( ( X0 @ X4 )
              = $true )
           => ( $true
              = ( X2 @ X4 ) ) ) ),
    inference(flattening,[],[f6]) ).

thf(f6,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ( ( ^ [Y0: a] : $false )
            = ( ^ [Y0: a] :
                  ( ~ ( X2 @ Y0 )
                  & ( X1 @ Y0 ) ) ) )
          & ! [X3: a] :
              ( ( ( ( X0 @ X3 )
                  = $true )
                & ( ( X1 @ X3 )
                 != $true ) )
             => ( ( X2 @ X3 )
                = $true ) ) )
       => ! [X4: a] :
            ( ( ( X0 @ X4 )
              = $true )
           => ( $true
              = ( X2 @ X4 ) ) ) ),
    inference(rectify,[],[f5]) ).

thf(f5,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ( ( ^ [Y0: a] : $false )
            = ( ^ [Y0: a] :
                  ( ~ ( X2 @ Y0 )
                  & ( X1 @ Y0 ) ) ) )
          & ! [X5: a] :
              ( ( ( $true
                  = ( X0 @ X5 ) )
                & ( $true
                 != ( X1 @ X5 ) ) )
             => ( ( X2 @ X5 )
                = $true ) ) )
       => ! [X6: a] :
            ( ( ( X0 @ X6 )
              = $true )
           => ( $true
              = ( X2 @ X6 ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

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

thf(f2,negated_conjecture,
    ~ ! [X0: a > $o,X2: a > $o,X1: a > $o] :
        ( ( ( ( ^ [X3: a] :
                  ( ( X2 @ X3 )
                  & ~ ( X1 @ X3 ) ) )
            = ( ^ [X3: a] : $false ) )
          & ! [X3: a] :
              ( ( ( X0 @ X3 )
                & ~ ( X2 @ X3 ) )
             => ( X1 @ X3 ) ) )
       => ! [X3: a] :
            ( ( X0 @ X3 )
           => ( X1 @ X3 ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ! [X0: a > $o,X2: a > $o,X1: a > $o] :
      ( ( ( ( ^ [X3: a] :
                ( ( X2 @ X3 )
                & ~ ( X1 @ X3 ) ) )
          = ( ^ [X3: a] : $false ) )
        & ! [X3: a] :
            ( ( ( X0 @ X3 )
              & ~ ( X2 @ X3 ) )
           => ( X1 @ X3 ) ) )
     => ! [X3: a] :
          ( ( X0 @ X3 )
         => ( X1 @ X3 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM269_pme) ).

thf(f14,plain,
    ( $true
   != ( sK2 @ sK3 ) ),
    inference(cnf_transformation,[],[f12]) ).

thf(f19,plain,
    ( $true
    = ( sK1 @ sK3 ) ),
    inference(subsumption_resolution,[],[f18,f13]) ).

thf(f13,plain,
    ( $true
    = ( sK0 @ sK3 ) ),
    inference(cnf_transformation,[],[f12]) ).

thf(f18,plain,
    ( ( $true
     != ( sK0 @ sK3 ) )
    | ( $true
      = ( sK1 @ sK3 ) ) ),
    inference(trivial_inequality_removal,[],[f17]) ).

thf(f17,plain,
    ( ( $true
      = ( sK1 @ sK3 ) )
    | ( $true != $true )
    | ( $true
     != ( sK0 @ sK3 ) ) ),
    inference(superposition,[],[f14,f15]) ).

thf(f15,plain,
    ! [X3: a] :
      ( ( $true
        = ( sK2 @ X3 ) )
      | ( $true
       != ( sK0 @ X3 ) )
      | ( $true
        = ( sK1 @ X3 ) ) ),
    inference(cnf_transformation,[],[f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.07  % Problem    : SEV394^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.07  % Command    : run_vampire %s %d THM
% 0.06/0.25  % Computer : n022.cluster.edu
% 0.06/0.25  % Model    : x86_64 x86_64
% 0.06/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25  % Memory   : 8042.1875MB
% 0.06/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25  % CPULimit   : 300
% 0.06/0.25  % WCLimit    : 300
% 0.06/0.25  % DateTime   : Fri Jun 21 19:01:23 EDT 2024
% 0.06/0.25  % CPUTime    : 
% 0.06/0.26  This is a TH0_THM_EQU_NAR problem
% 0.06/0.26  Running higher-order theorem proving
% 0.06/0.26  Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.06/0.28  % (23319)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.06/0.28  % (23323)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.06/0.28  % (23324)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.06/0.28  % (23322)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.06/0.28  % (23325)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.06/0.28  % (23320)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.06/0.28  % (23321)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.06/0.28  % (23322)Instruction limit reached!
% 0.06/0.28  % (23322)------------------------------
% 0.06/0.28  % (23322)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.06/0.28  % (23322)Termination reason: Unknown
% 0.06/0.28  % (23322)Termination phase: Saturation
% 0.06/0.28  
% 0.06/0.28  % (23322)Memory used [KB]: 5500
% 0.06/0.28  % (23322)Time elapsed: 0.003 s
% 0.06/0.28  % (23322)Instructions burned: 2 (million)
% 0.06/0.28  % (23322)------------------------------
% 0.06/0.28  % (23322)------------------------------
% 0.06/0.28  % (23323)Instruction limit reached!
% 0.06/0.28  % (23323)------------------------------
% 0.06/0.28  % (23323)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.06/0.28  % (23323)Termination reason: Unknown
% 0.06/0.28  % (23323)Termination phase: Saturation
% 0.06/0.28  
% 0.06/0.28  % (23323)Memory used [KB]: 5500
% 0.06/0.28  % (23323)Time elapsed: 0.003 s
% 0.06/0.28  % (23323)Instructions burned: 3 (million)
% 0.06/0.28  % (23323)------------------------------
% 0.06/0.28  % (23323)------------------------------
% 0.06/0.28  % (23319)First to succeed.
% 0.06/0.28  % (23324)Also succeeded, but the first one will report.
% 0.06/0.28  % (23319)Refutation found. Thanks to Tanya!
% 0.06/0.28  % SZS status Theorem for theBenchmark
% 0.06/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.28  % (23319)------------------------------
% 0.06/0.28  % (23319)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.06/0.28  % (23319)Termination reason: Refutation
% 0.06/0.28  
% 0.06/0.28  % (23319)Memory used [KB]: 5500
% 0.06/0.28  % (23319)Time elapsed: 0.004 s
% 0.06/0.28  % (23319)Instructions burned: 2 (million)
% 0.06/0.28  % (23319)------------------------------
% 0.06/0.28  % (23319)------------------------------
% 0.06/0.28  % (23317)Success in time 0.011 s
%------------------------------------------------------------------------------