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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU936^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n005.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:15 EDT 2024

% Result   : Theorem 0.12s 0.35s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   24 (   4 unt;  10 typ;   0 def)
%            Number of atoms       :   44 (  43 equ;   0 cnn)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  109 (  17   ~;   7   |;  12   &;  62   @)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    3 (   3 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   47 (   0   ^  31   !;  16   ?;  47   :)

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

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

thf(type_def_8,type,
    c: $tType ).

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

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

thf(func_def_2,type,
    c: $tType ).

thf(func_def_6,type,
    sK0: a > b ).

thf(func_def_7,type,
    sK1: b > c ).

thf(func_def_8,type,
    sK2: a ).

thf(func_def_9,type,
    sK3: a ).

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

thf(f10,plain,
    sK3 != sK2,
    inference(cnf_transformation,[],[f9]) ).

thf(f9,plain,
    ( ! [X2: a,X3: a] :
        ( ( ( sK1 @ ( sK0 @ X3 ) )
         != ( sK1 @ ( sK0 @ X2 ) ) )
        | ( X2 = X3 ) )
    & ( ( sK0 @ sK2 )
      = ( sK0 @ sK3 ) )
    & ( sK3 != sK2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f6,f8,f7]) ).

thf(f7,plain,
    ( ? [X0: a > b,X1: b > c] :
        ( ! [X2: a,X3: a] :
            ( ( ( X1 @ ( X0 @ X2 ) )
             != ( X1 @ ( X0 @ X3 ) ) )
            | ( X2 = X3 ) )
        & ? [X4: a,X5: a] :
            ( ( ( X0 @ X4 )
              = ( X0 @ X5 ) )
            & ( X4 != X5 ) ) )
   => ( ! [X3: a,X2: a] :
          ( ( ( sK1 @ ( sK0 @ X3 ) )
           != ( sK1 @ ( sK0 @ X2 ) ) )
          | ( X2 = X3 ) )
      & ? [X5: a,X4: a] :
          ( ( ( sK0 @ X4 )
            = ( sK0 @ X5 ) )
          & ( X4 != X5 ) ) ) ),
    introduced(choice_axiom,[]) ).

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

thf(f6,plain,
    ? [X0: a > b,X1: b > c] :
      ( ! [X2: a,X3: a] :
          ( ( ( X1 @ ( X0 @ X2 ) )
           != ( X1 @ ( X0 @ X3 ) ) )
          | ( X2 = X3 ) )
      & ? [X4: a,X5: a] :
          ( ( ( X0 @ X4 )
            = ( X0 @ X5 ) )
          & ( X4 != X5 ) ) ),
    inference(rectify,[],[f5]) ).

thf(f5,plain,
    ? [X0: a > b,X1: b > c] :
      ( ! [X2: a,X3: a] :
          ( ( ( X1 @ ( X0 @ X2 ) )
           != ( X1 @ ( X0 @ X3 ) ) )
          | ( X2 = X3 ) )
      & ? [X5: a,X4: a] :
          ( ( ( X0 @ X4 )
            = ( X0 @ X5 ) )
          & ( X4 != X5 ) ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f4,plain,
    ~ ! [X1: b > c,X0: a > b] :
        ( ! [X2: a,X3: a] :
            ( ( ( X1 @ ( X0 @ X2 ) )
              = ( X1 @ ( X0 @ X3 ) ) )
           => ( X2 = X3 ) )
       => ! [X4: a,X5: a] :
            ( ( ( X0 @ X4 )
              = ( X0 @ X5 ) )
           => ( X4 = X5 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ! [X0: a > b,X1: b > c] :
        ( ! [X2: a,X3: a] :
            ( ( ( X1 @ ( X0 @ X2 ) )
              = ( X1 @ ( X0 @ X3 ) ) )
           => ( X2 = X3 ) )
       => ! [X3: a,X2: a] :
            ( ( ( X0 @ X2 )
              = ( X0 @ X3 ) )
           => ( X2 = X3 ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ! [X0: a > b,X1: b > c] :
      ( ! [X2: a,X3: a] :
          ( ( ( X1 @ ( X0 @ X2 ) )
            = ( X1 @ ( X0 @ X3 ) ) )
         => ( X2 = X3 ) )
     => ! [X3: a,X2: a] :
          ( ( ( X0 @ X2 )
            = ( X0 @ X3 ) )
         => ( X2 = X3 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cFN_THM_3_pme) ).

thf(f17,plain,
    sK3 = sK2,
    inference(equality_resolution,[],[f13]) ).

thf(f13,plain,
    ! [X0: a] :
      ( ( ( sK1 @ ( sK0 @ X0 ) )
       != ( sK1 @ ( sK0 @ sK2 ) ) )
      | ( sK3 = X0 ) ),
    inference(superposition,[],[f12,f11]) ).

thf(f11,plain,
    ( ( sK0 @ sK2 )
    = ( sK0 @ sK3 ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f12,plain,
    ! [X2: a,X3: a] :
      ( ( ( sK1 @ ( sK0 @ X3 ) )
       != ( sK1 @ ( sK0 @ X2 ) ) )
      | ( X2 = X3 ) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SEU936^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.12  % 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.12/0.33  % Computer : n005.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Sun May 19 16:05:53 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  This is a TH0_THM_EQU_NAR problem
% 0.12/0.33  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.12/0.34  % (31791)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.12/0.34  % (31788)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.12/0.34  % (31794)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.12/0.34  % (31790)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.12/0.34  % (31793)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.12/0.35  % (31789)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.12/0.35  % (31795)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.12/0.35  % (31792)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.12/0.35  % (31791)Instruction limit reached!
% 0.12/0.35  % (31791)------------------------------
% 0.12/0.35  % (31791)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (31791)Termination reason: Unknown
% 0.12/0.35  % (31791)Termination phase: Saturation
% 0.12/0.35  
% 0.12/0.35  % (31791)Memory used [KB]: 5500
% 0.12/0.35  % (31791)Time elapsed: 0.003 s
% 0.12/0.35  % (31791)Instructions burned: 2 (million)
% 0.12/0.35  % (31791)------------------------------
% 0.12/0.35  % (31791)------------------------------
% 0.12/0.35  % (31788)First to succeed.
% 0.12/0.35  % (31792)Instruction limit reached!
% 0.12/0.35  % (31792)------------------------------
% 0.12/0.35  % (31792)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (31793)Also succeeded, but the first one will report.
% 0.12/0.35  % (31792)Termination reason: Unknown
% 0.12/0.35  % (31792)Termination phase: Saturation
% 0.12/0.35  
% 0.12/0.35  % (31792)Memory used [KB]: 5500
% 0.12/0.35  % (31792)Time elapsed: 0.003 s
% 0.12/0.35  % (31792)Instructions burned: 2 (million)
% 0.12/0.35  % (31792)------------------------------
% 0.12/0.35  % (31792)------------------------------
% 0.12/0.35  % (31789)Also succeeded, but the first one will report.
% 0.12/0.35  % (31788)Refutation found. Thanks to Tanya!
% 0.12/0.35  % SZS status Theorem for theBenchmark
% 0.12/0.35  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.35  % (31788)------------------------------
% 0.12/0.35  % (31788)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35  % (31788)Termination reason: Refutation
% 0.12/0.35  
% 0.12/0.35  % (31788)Memory used [KB]: 5500
% 0.12/0.35  % (31788)Time elapsed: 0.003 s
% 0.12/0.35  % (31788)Instructions burned: 1 (million)
% 0.12/0.35  % (31788)------------------------------
% 0.12/0.35  % (31788)------------------------------
% 0.12/0.35  % (31787)Success in time 0.004 s
% 0.12/0.35  % Vampire---4.8 exiting
%------------------------------------------------------------------------------