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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU937^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 : n020.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.21s 0.38s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   28 (   5 unt;  10 typ;   0 def)
%            Number of atoms       :   71 (  70 equ;   0 cnn)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  176 (  27   ~;  16   |;  23   &;  96   @)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    3 (   3 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   74 (   0   ^  54   !;  20   ?;  74   :)

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

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

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

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

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

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

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

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

thf(func_def_8,type,
    sK2: c ).

thf(func_def_9,type,
    sK3: c ).

thf(f25,plain,
    $false,
    inference(subsumption_resolution,[],[f24,f14]) ).

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

thf(f10,plain,
    ( ( sK2 != sK3 )
    & ( ( sK1 @ ( sK0 @ sK2 ) )
      = ( sK1 @ ( sK0 @ sK3 ) ) )
    & ! [X4: b,X5: b] :
        ( ( X4 = X5 )
        | ( ( sK1 @ X5 )
         != ( sK1 @ X4 ) ) )
    & ! [X6: c,X7: c] :
        ( ( X6 = X7 )
        | ( ( sK0 @ X7 )
         != ( sK0 @ X6 ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f9,f8]) ).

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

thf(f9,plain,
    ( ? [X3: c,X2: c] :
        ( ( X2 != X3 )
        & ( ( sK1 @ ( sK0 @ X3 ) )
          = ( sK1 @ ( sK0 @ X2 ) ) ) )
   => ( ( sK2 != sK3 )
      & ( ( sK1 @ ( sK0 @ sK2 ) )
        = ( sK1 @ ( sK0 @ sK3 ) ) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

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

thf(f24,plain,
    sK2 = sK3,
    inference(equality_resolution,[],[f22]) ).

thf(f22,plain,
    ! [X0: c] :
      ( ( ( sK0 @ X0 )
       != ( sK0 @ sK2 ) )
      | ( sK3 = X0 ) ),
    inference(superposition,[],[f11,f20]) ).

thf(f20,plain,
    ( ( sK0 @ sK3 )
    = ( sK0 @ sK2 ) ),
    inference(equality_resolution,[],[f17]) ).

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

thf(f13,plain,
    ( ( sK1 @ ( sK0 @ sK2 ) )
    = ( sK1 @ ( sK0 @ sK3 ) ) ),
    inference(cnf_transformation,[],[f10]) ).

thf(f12,plain,
    ! [X4: b,X5: b] :
      ( ( ( sK1 @ X5 )
       != ( sK1 @ X4 ) )
      | ( X4 = X5 ) ),
    inference(cnf_transformation,[],[f10]) ).

thf(f11,plain,
    ! [X6: c,X7: c] :
      ( ( ( sK0 @ X7 )
       != ( sK0 @ X6 ) )
      | ( X6 = X7 ) ),
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEU937^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 : n020.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 17:35:38 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  % (28079)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  % (28081)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  % (28083)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  % (28080)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  % (28084)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  % (28082)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.21/0.37  % (28085)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  % (28086)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  % (28083)Instruction limit reached!
% 0.21/0.37  % (28083)------------------------------
% 0.21/0.37  % (28083)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (28083)Termination reason: Unknown
% 0.21/0.37  % (28083)Termination phase: Property scanning
% 0.21/0.37  
% 0.21/0.37  % (28083)Memory used [KB]: 895
% 0.21/0.37  % (28083)Time elapsed: 0.003 s
% 0.21/0.37  % (28083)Instructions burned: 2 (million)
% 0.21/0.37  % (28083)------------------------------
% 0.21/0.37  % (28083)------------------------------
% 0.21/0.37  % (28082)Instruction limit reached!
% 0.21/0.37  % (28082)------------------------------
% 0.21/0.37  % (28082)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (28082)Termination reason: Unknown
% 0.21/0.37  % (28082)Termination phase: Saturation
% 0.21/0.37  
% 0.21/0.37  % (28082)Memory used [KB]: 5500
% 0.21/0.37  % (28082)Time elapsed: 0.003 s
% 0.21/0.37  % (28082)Instructions burned: 2 (million)
% 0.21/0.37  % (28082)------------------------------
% 0.21/0.37  % (28082)------------------------------
% 0.21/0.37  % (28079)First to succeed.
% 0.21/0.37  % (28086)Instruction limit reached!
% 0.21/0.37  % (28086)------------------------------
% 0.21/0.37  % (28086)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (28086)Termination reason: Unknown
% 0.21/0.37  % (28086)Termination phase: Saturation
% 0.21/0.37  
% 0.21/0.37  % (28086)Memory used [KB]: 5500
% 0.21/0.37  % (28086)Time elapsed: 0.005 s
% 0.21/0.37  % (28086)Instructions burned: 3 (million)
% 0.21/0.37  % (28086)------------------------------
% 0.21/0.37  % (28086)------------------------------
% 0.21/0.37  % (28084)Also succeeded, but the first one will report.
% 0.21/0.38  % (28079)Refutation found. Thanks to Tanya!
% 0.21/0.38  % SZS status Theorem for theBenchmark
% 0.21/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38  % (28079)------------------------------
% 0.21/0.38  % (28079)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38  % (28079)Termination reason: Refutation
% 0.21/0.38  
% 0.21/0.38  % (28079)Memory used [KB]: 5500
% 0.21/0.38  % (28079)Time elapsed: 0.006 s
% 0.21/0.38  % (28079)Instructions burned: 2 (million)
% 0.21/0.38  % (28079)------------------------------
% 0.21/0.38  % (28079)------------------------------
% 0.21/0.38  % (28078)Success in time 0.006 s
% 0.21/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------