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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU847^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 : n029.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:51:54 EDT 2024

% Result   : Theorem 0.21s 0.37s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (  13 unt;   3 typ;   0 def)
%            Number of atoms       :   58 (  14 equ;   0 cnn)
%            Maximal formula atoms :    2 (   4 avg)
%            Number of connectives :   91 (  33   ~;  12   |;  21   &;  24   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    7 (   7   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   1 usr;   2 con; 0-2 aty)
%            Number of variables   :   19 (  13   ^   4   !;   2   ?;  19   :)

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

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

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

thf(f15,plain,
    $false,
    inference(trivial_inequality_removal,[],[f14]) ).

thf(f14,plain,
    sK0 != sK0,
    inference(beta_eta_normalization,[],[f13]) ).

thf(f13,plain,
    ( sK0
   != ( ^ [Y0: a] : ( sK0 @ Y0 ) ) ),
    inference(boolean_simplification,[],[f12]) ).

thf(f12,plain,
    ( sK0
   != ( ^ [Y0: a] :
          ( $false
          | ( sK0 @ Y0 ) ) ) ),
    inference(boolean_simplification,[],[f11]) ).

thf(f11,plain,
    ( sK0
   != ( ^ [Y0: a] :
          ( ( ~ ( sK0 @ Y0 )
            & $false )
          | ( sK0 @ Y0 ) ) ) ),
    inference(boolean_simplification,[],[f10]) ).

thf(f10,plain,
    ( sK0
   != ( ^ [Y0: a] :
          ( ( ~ ( sK0 @ Y0 )
            & $false )
          | ( ( sK0 @ Y0 )
            & $true ) ) ) ),
    inference(boolean_simplification,[],[f9]) ).

thf(f9,plain,
    ( sK0
   != ( ^ [Y0: a] :
          ( ( ~ ( sK0 @ Y0 )
            & $false )
          | ( ( sK0 @ Y0 )
            & ~ $false ) ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f8,plain,
    ( sK0
   != ( ^ [Y0: a] :
          ( ( ~ ( sK0 @ Y0 )
            & $false )
          | ( ( sK0 @ Y0 )
            & ~ $false ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).

thf(f7,plain,
    ( ? [X0: a > $o] :
        ( ( ^ [Y0: a] :
              ( ( ~ ( X0 @ Y0 )
                & $false )
              | ( ( X0 @ Y0 )
                & ~ $false ) ) )
       != X0 )
   => ( sK0
     != ( ^ [Y0: a] :
            ( ( ~ ( sK0 @ Y0 )
              & $false )
            | ( ( sK0 @ Y0 )
              & ~ $false ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f6,plain,
    ? [X0: a > $o] :
      ( ( ^ [Y0: a] :
            ( ( ~ ( X0 @ Y0 )
              & $false )
            | ( ( X0 @ Y0 )
              & ~ $false ) ) )
     != X0 ),
    inference(ennf_transformation,[],[f5]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEU847^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/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 : n029.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 16:31:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_EQU_NAR problem
% 0.14/0.35  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.21/0.37  % (26477)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.21/0.37  % (26475)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.21/0.37  % (26478)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.21/0.37  % (26479)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.21/0.37  % (26476)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.21/0.37  % (26481)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.21/0.37  % (26480)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.21/0.37  % (26482)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.21/0.37  % (26475)First to succeed.
% 0.21/0.37  % (26481)Also succeeded, but the first one will report.
% 0.21/0.37  % (26479)Also succeeded, but the first one will report.
% 0.21/0.37  % (26475)Refutation found. Thanks to Tanya!
% 0.21/0.37  % SZS status Theorem for theBenchmark
% 0.21/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.37  % (26475)------------------------------
% 0.21/0.37  % (26475)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (26475)Termination reason: Refutation
% 0.21/0.37  
% 0.21/0.37  % (26475)Memory used [KB]: 5373
% 0.21/0.37  % (26475)Time elapsed: 0.003 s
% 0.21/0.37  % (26475)Instructions burned: 1 (million)
% 0.21/0.37  % (26475)------------------------------
% 0.21/0.37  % (26475)------------------------------
% 0.21/0.37  % (26474)Success in time 0.006 s
% 0.21/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------