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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU885^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 : n010.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 03:52:04 EDT 2024

% Result   : Theorem 0.08s 0.31s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   26 (   5 unt;   9 typ;   0 def)
%            Number of atoms       :  115 (  48 equ;   0 cnn)
%            Maximal formula atoms :    8 (   6 avg)
%            Number of connectives :  126 (  22   ~;  10   |;  20   &;  60   @)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   31 (   0   ^  17   !;  14   ?;  31   :)

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

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

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

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

thf(func_def_2,type,
    cF: b > a ).

thf(func_def_3,type,
    cV: b > $o ).

thf(func_def_4,type,
    cU: b > $o ).

thf(func_def_8,type,
    sK0: a ).

thf(func_def_9,type,
    sK1: b ).

thf(f18,plain,
    $false,
    inference(subsumption_resolution,[],[f17,f11]) ).

thf(f11,plain,
    ( $true
    = ( cU @ sK1 ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f9,plain,
    ( ! [X0: b] :
        ( ( ( cV @ X0 )
          = $true )
        | ( ( cU @ X0 )
         != $true ) )
    & ( ( cF @ sK1 )
      = sK0 )
    & ( $true
      = ( cU @ sK1 ) )
    & ! [X3: b] :
        ( ( sK0
         != ( cF @ X3 ) )
        | ( ( cV @ X3 )
         != $true ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).

thf(f7,plain,
    ( ? [X1: a] :
        ( ? [X2: b] :
            ( ( ( cF @ X2 )
              = X1 )
            & ( $true
              = ( cU @ X2 ) ) )
        & ! [X3: b] :
            ( ( ( cF @ X3 )
             != X1 )
            | ( ( cV @ X3 )
             != $true ) ) )
   => ( ? [X2: b] :
          ( ( ( cF @ X2 )
            = sK0 )
          & ( $true
            = ( cU @ X2 ) ) )
      & ! [X3: b] :
          ( ( sK0
           != ( cF @ X3 ) )
          | ( ( cV @ X3 )
           != $true ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f8,plain,
    ( ? [X2: b] :
        ( ( ( cF @ X2 )
          = sK0 )
        & ( $true
          = ( cU @ X2 ) ) )
   => ( ( ( cF @ sK1 )
        = sK0 )
      & ( $true
        = ( cU @ sK1 ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f6,plain,
    ( ! [X0: b] :
        ( ( ( cV @ X0 )
          = $true )
        | ( ( cU @ X0 )
         != $true ) )
    & ? [X1: a] :
        ( ? [X2: b] :
            ( ( ( cF @ X2 )
              = X1 )
            & ( $true
              = ( cU @ X2 ) ) )
        & ! [X3: b] :
            ( ( ( cF @ X3 )
             != X1 )
            | ( ( cV @ X3 )
             != $true ) ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f5,plain,
    ~ ( ! [X0: b] :
          ( ( ( cU @ X0 )
            = $true )
         => ( ( cV @ X0 )
            = $true ) )
     => ! [X1: a] :
          ( ? [X2: b] :
              ( ( ( cF @ X2 )
                = X1 )
              & ( $true
                = ( cU @ X2 ) ) )
         => ? [X3: b] :
              ( ( ( cF @ X3 )
                = X1 )
              & ( ( cV @ X3 )
                = $true ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f4,plain,
    ~ ( ! [X0: b] :
          ( ( cU @ X0 )
         => ( cV @ X0 ) )
     => ! [X1: a] :
          ( ? [X2: b] :
              ( ( cU @ X2 )
              & ( ( cF @ X2 )
                = X1 ) )
         => ? [X3: b] :
              ( ( cV @ X3 )
              & ( ( cF @ X3 )
                = X1 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ( ! [X0: b] :
          ( ( cU @ X0 )
         => ( cV @ X0 ) )
     => ! [X0: a] :
          ( ? [X1: b] :
              ( ( cU @ X1 )
              & ( ( cF @ X1 )
                = X0 ) )
         => ? [X1: b] :
              ( ( cV @ X1 )
              & ( ( cF @ X1 )
                = X0 ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ( ! [X0: b] :
        ( ( cU @ X0 )
       => ( cV @ X0 ) )
   => ! [X0: a] :
        ( ? [X1: b] :
            ( ( cU @ X1 )
            & ( ( cF @ X1 )
              = X0 ) )
       => ? [X1: b] :
            ( ( cV @ X1 )
            & ( ( cF @ X1 )
              = X0 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM30A_pme) ).

thf(f17,plain,
    ( $true
   != ( cU @ sK1 ) ),
    inference(trivial_inequality_removal,[],[f16]) ).

thf(f16,plain,
    ( ( $true
     != ( cU @ sK1 ) )
    | ( $true != $true ) ),
    inference(superposition,[],[f15,f13]) ).

thf(f13,plain,
    ! [X0: b] :
      ( ( ( cV @ X0 )
        = $true )
      | ( ( cU @ X0 )
       != $true ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f15,plain,
    ( $true
   != ( cV @ sK1 ) ),
    inference(equality_resolution,[],[f14]) ).

thf(f14,plain,
    ! [X3: b] :
      ( ( ( cF @ sK1 )
       != ( cF @ X3 ) )
      | ( ( cV @ X3 )
       != $true ) ),
    inference(definition_unfolding,[],[f10,f12]) ).

thf(f12,plain,
    ( ( cF @ sK1 )
    = sK0 ),
    inference(cnf_transformation,[],[f9]) ).

thf(f10,plain,
    ! [X3: b] :
      ( ( sK0
       != ( cF @ X3 ) )
      | ( ( cV @ X3 )
       != $true ) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08  % Problem    : SEU885^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.09  % 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.08/0.29  % Computer : n010.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit   : 300
% 0.08/0.29  % WCLimit    : 300
% 0.08/0.29  % DateTime   : Sun May 19 15:38:08 EDT 2024
% 0.08/0.29  % CPUTime    : 
% 0.08/0.29  This is a TH0_THM_EQU_NAR problem
% 0.08/0.29  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.08/0.30  % (23319)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.08/0.30  % (23321)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.08/0.30  % (23322)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.08/0.30  % (23322)Instruction limit reached!
% 0.08/0.30  % (23322)------------------------------
% 0.08/0.30  % (23322)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30  % (23322)Termination reason: Unknown
% 0.08/0.30  % (23322)Termination phase: Saturation
% 0.08/0.30  
% 0.08/0.30  % (23322)Memory used [KB]: 5373
% 0.08/0.30  % (23322)Time elapsed: 0.003 s
% 0.08/0.30  % (23322)Instructions burned: 2 (million)
% 0.08/0.30  % (23322)------------------------------
% 0.08/0.30  % (23322)------------------------------
% 0.08/0.30  % (23323)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.08/0.30  % (23324)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.08/0.30  % (23325)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.08/0.30  % (23323)First to succeed.
% 0.08/0.31  % (23325)Also succeeded, but the first one will report.
% 0.08/0.31  % (23321)Instruction limit reached!
% 0.08/0.31  % (23321)------------------------------
% 0.08/0.31  % (23321)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.31  % (23321)Termination reason: Unknown
% 0.08/0.31  % (23321)Termination phase: Saturation
% 0.08/0.31  
% 0.08/0.31  % (23321)Memory used [KB]: 5500
% 0.08/0.31  % (23321)Time elapsed: 0.003 s
% 0.08/0.31  % (23321)Instructions burned: 2 (million)
% 0.08/0.31  % (23321)------------------------------
% 0.08/0.31  % (23321)------------------------------
% 0.08/0.31  % (23323)Refutation found. Thanks to Tanya!
% 0.08/0.31  % SZS status Theorem for theBenchmark
% 0.08/0.31  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.31  % (23323)------------------------------
% 0.08/0.31  % (23323)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.31  % (23323)Termination reason: Refutation
% 0.08/0.31  
% 0.08/0.31  % (23323)Memory used [KB]: 5500
% 0.08/0.31  % (23323)Time elapsed: 0.003 s
% 0.08/0.31  % (23323)Instructions burned: 1 (million)
% 0.08/0.31  % (23323)------------------------------
% 0.08/0.31  % (23323)------------------------------
% 0.08/0.31  % (23317)Success in time 0.014 s
% 0.08/0.31  % Vampire---4.8 exiting
%------------------------------------------------------------------------------