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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV014^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 : n007.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 04:11:41 EDT 2024

% Result   : Theorem 0.22s 0.39s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   19 (   4 unt;   5 typ;   0 def)
%            Number of atoms       :  128 (  54 equ;   0 cnn)
%            Maximal formula atoms :   14 (   9 avg)
%            Number of connectives :  241 (  31   ~;  18   |;  30   &; 148   @)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   8 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   20 (  20   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   3 con; 0-2 aty)
%            Number of variables   :   80 (   0   ^  69   !;  10   ?;  80   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

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

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

thf(func_def_2,type,
    vEPSILON: 
      !>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).

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

thf(func_def_6,type,
    sK1: a ).

thf(f17,plain,
    $false,
    inference(trivial_inequality_removal,[],[f16]) ).

thf(f16,plain,
    $true != $true,
    inference(superposition,[],[f14,f13]) ).

thf(f13,plain,
    ! [X4: a] :
      ( ( sK0 @ X4 @ X4 )
      = $true ),
    inference(cnf_transformation,[],[f11]) ).

thf(f11,plain,
    ( ! [X1: a,X2: a] :
        ( ( ( sK0 @ X1 @ X2 )
          = $true )
        | ( ( sK0 @ X2 @ X1 )
         != $true ) )
    & ( ( sK0 @ sK1 @ sK1 )
     != $true )
    & ! [X4: a] :
        ( ( sK0 @ X4 @ X4 )
        = $true )
    & ! [X5: a,X6: a,X7: a] :
        ( ( ( sK0 @ X5 @ X6 )
          = $true )
        | ( $true
         != ( sK0 @ X7 @ X6 ) )
        | ( $true
         != ( sK0 @ X5 @ X7 ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9]) ).

thf(f9,plain,
    ( ? [X0: a > a > $o] :
        ( ! [X1: a,X2: a] :
            ( ( ( X0 @ X1 @ X2 )
              = $true )
            | ( ( X0 @ X2 @ X1 )
             != $true ) )
        & ? [X3: a] :
            ( $true
           != ( X0 @ X3 @ X3 ) )
        & ! [X4: a] :
            ( $true
            = ( X0 @ X4 @ X4 ) )
        & ! [X5: a,X6: a,X7: a] :
            ( ( ( X0 @ X5 @ X6 )
              = $true )
            | ( ( X0 @ X7 @ X6 )
             != $true )
            | ( $true
             != ( X0 @ X5 @ X7 ) ) ) )
   => ( ! [X2: a,X1: a] :
          ( ( ( sK0 @ X1 @ X2 )
            = $true )
          | ( ( sK0 @ X2 @ X1 )
           != $true ) )
      & ? [X3: a] :
          ( ( sK0 @ X3 @ X3 )
         != $true )
      & ! [X4: a] :
          ( ( sK0 @ X4 @ X4 )
          = $true )
      & ! [X7: a,X6: a,X5: a] :
          ( ( ( sK0 @ X5 @ X6 )
            = $true )
          | ( $true
           != ( sK0 @ X7 @ X6 ) )
          | ( $true
           != ( sK0 @ X5 @ X7 ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f10,plain,
    ( ? [X3: a] :
        ( ( sK0 @ X3 @ X3 )
       != $true )
   => ( ( sK0 @ sK1 @ sK1 )
     != $true ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

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

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

thf(f14,plain,
    ( ( sK0 @ sK1 @ sK1 )
   != $true ),
    inference(cnf_transformation,[],[f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SEV014^5 : TPTP v8.2.0. Released v4.0.0.
% 0.15/0.15  % 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.15/0.36  % Computer : n007.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Sun May 19 19:18:38 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a TH0_THM_NEQ_NAR problem
% 0.15/0.36  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.22/0.38  % (28642)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.22/0.38  % (28643)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.22/0.38  % (28644)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.22/0.38  % (28647)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.22/0.38  % (28646)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.22/0.38  % (28648)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.22/0.38  % (28649)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.22/0.38  % (28645)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.22/0.38  % (28645)Instruction limit reached!
% 0.22/0.38  % (28645)------------------------------
% 0.22/0.38  % (28645)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38  % (28645)Termination reason: Unknown
% 0.22/0.38  % (28645)Termination phase: Saturation
% 0.22/0.38  % (28646)Instruction limit reached!
% 0.22/0.38  % (28646)------------------------------
% 0.22/0.38  % (28646)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38  
% 0.22/0.38  % (28645)Memory used [KB]: 895
% 0.22/0.38  % (28645)Time elapsed: 0.003 s
% 0.22/0.38  % (28645)Instructions burned: 2 (million)
% 0.22/0.38  % (28645)------------------------------
% 0.22/0.38  % (28645)------------------------------
% 0.22/0.38  % (28644)First to succeed.
% 0.22/0.38  % (28646)Termination reason: Unknown
% 0.22/0.38  % (28646)Termination phase: Saturation
% 0.22/0.38  
% 0.22/0.38  % (28646)Memory used [KB]: 5500
% 0.22/0.38  % (28646)Time elapsed: 0.003 s
% 0.22/0.38  % (28646)Instructions burned: 2 (million)
% 0.22/0.38  % (28646)------------------------------
% 0.22/0.38  % (28646)------------------------------
% 0.22/0.39  % (28648)Also succeeded, but the first one will report.
% 0.22/0.39  % (28644)Refutation found. Thanks to Tanya!
% 0.22/0.39  % SZS status Theorem for theBenchmark
% 0.22/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.39  % (28644)------------------------------
% 0.22/0.39  % (28644)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39  % (28644)Termination reason: Refutation
% 0.22/0.39  
% 0.22/0.39  % (28644)Memory used [KB]: 5500
% 0.22/0.39  % (28644)Time elapsed: 0.005 s
% 0.22/0.39  % (28644)Instructions burned: 2 (million)
% 0.22/0.39  % (28644)------------------------------
% 0.22/0.39  % (28644)------------------------------
% 0.22/0.39  % (28641)Success in time 0.017 s
% 0.22/0.39  % Vampire---4.8 exiting
%------------------------------------------------------------------------------