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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU839^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 : n002.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:53 EDT 2024

% Result   : Theorem 0.15s 0.38s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   45 (  14 unt;   6 typ;   0 def)
%            Number of atoms       :  164 (  44 equ;   0 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :  171 (  26   ~;  56   |;   0   &;  84   @)
%                                         (   4 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   33 (  20   ^   8   !;   4   ?;  33   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

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

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

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

thf(func_def_8,type,
    sK1: a > $o ).

thf(func_def_10,type,
    ph3: 
      !>[X0: $tType] : X0 ).

thf(func_def_11,type,
    sK4: a ).

thf(f56,plain,
    $false,
    inference(avatar_sat_refutation,[],[f33,f43,f44,f51,f54]) ).

thf(f54,plain,
    ( ~ spl2_1
    | ~ spl2_3 ),
    inference(avatar_contradiction_clause,[],[f53]) ).

thf(f53,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_3 ),
    inference(trivial_inequality_removal,[],[f52]) ).

thf(f52,plain,
    ( ( $false = $true )
    | ~ spl2_1
    | ~ spl2_3 ),
    inference(forward_demodulation,[],[f28,f37]) ).

thf(f37,plain,
    ( ( ( sK1 @ sK4 )
      = $false )
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f35]) ).

thf(f35,plain,
    ( spl2_3
  <=> ( ( sK1 @ sK4 )
      = $false ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

thf(f28,plain,
    ( ( ( sK1 @ sK4 )
      = $true )
    | ~ spl2_1 ),
    inference(avatar_component_clause,[],[f26]) ).

thf(f26,plain,
    ( spl2_1
  <=> ( ( sK1 @ sK4 )
      = $true ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).

thf(f51,plain,
    ( ~ spl2_2
    | ~ spl2_4 ),
    inference(avatar_contradiction_clause,[],[f50]) ).

thf(f50,plain,
    ( $false
    | ~ spl2_2
    | ~ spl2_4 ),
    inference(trivial_inequality_removal,[],[f47]) ).

thf(f47,plain,
    ( ( $false = $true )
    | ~ spl2_2
    | ~ spl2_4 ),
    inference(superposition,[],[f32,f41]) ).

thf(f41,plain,
    ( ( $false
      = ( sK0 @ sK4 ) )
    | ~ spl2_4 ),
    inference(avatar_component_clause,[],[f39]) ).

thf(f39,plain,
    ( spl2_4
  <=> ( $false
      = ( sK0 @ sK4 ) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).

thf(f32,plain,
    ( ( $true
      = ( sK0 @ sK4 ) )
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f30]) ).

thf(f30,plain,
    ( spl2_2
  <=> ( $true
      = ( sK0 @ sK4 ) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).

thf(f44,plain,
    spl2_3,
    inference(avatar_split_clause,[],[f18,f35]) ).

thf(f18,plain,
    ( ( sK1 @ sK4 )
    = $false ),
    inference(duplicate_literal_removal,[],[f16]) ).

thf(f16,plain,
    ( ( ( sK1 @ sK4 )
      = $false )
    | ( ( sK1 @ sK4 )
      = $false ) ),
    inference(binary_proxy_clausification,[],[f15]) ).

thf(f15,plain,
    ( ( $false
      = ( ( sK0 @ sK4 )
        | ( sK1 @ sK4 ) ) )
    | ( ( sK1 @ sK4 )
      = $false ) ),
    inference(binary_proxy_clausification,[],[f13]) ).

thf(f13,plain,
    ( ( $false
      = ( ( sK1 @ sK4 )
        | ( sK0 @ sK4 ) ) )
    | ( $false
      = ( ( sK0 @ sK4 )
        | ( sK1 @ sK4 ) ) ) ),
    inference(binary_proxy_clausification,[],[f11]) ).

thf(f11,plain,
    ( ( ( sK1 @ sK4 )
      | ( sK0 @ sK4 ) )
   != ( ( sK0 @ sK4 )
      | ( sK1 @ sK4 ) ) ),
    inference(beta_eta_normalization,[],[f10]) ).

thf(f10,plain,
    ( ( ^ [Y0: a] :
          ( ( sK1 @ Y0 )
          | ( sK0 @ Y0 ) )
      @ sK4 )
   != ( ^ [Y0: a] :
          ( ( sK0 @ Y0 )
          | ( sK1 @ Y0 ) )
      @ sK4 ) ),
    inference(negative_extensionality,[],[f9]) ).

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

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

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

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

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

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

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

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

thf(f43,plain,
    spl2_4,
    inference(avatar_split_clause,[],[f21,f39]) ).

thf(f21,plain,
    ( $false
    = ( sK0 @ sK4 ) ),
    inference(duplicate_literal_removal,[],[f20]) ).

thf(f20,plain,
    ( ( $false
      = ( sK0 @ sK4 ) )
    | ( $false
      = ( sK0 @ sK4 ) ) ),
    inference(binary_proxy_clausification,[],[f14]) ).

thf(f14,plain,
    ( ( $false
      = ( ( sK0 @ sK4 )
        | ( sK1 @ sK4 ) ) )
    | ( $false
      = ( sK0 @ sK4 ) ) ),
    inference(binary_proxy_clausification,[],[f13]) ).

thf(f33,plain,
    ( spl2_1
    | spl2_2 ),
    inference(avatar_split_clause,[],[f24,f30,f26]) ).

thf(f24,plain,
    ( ( $true
      = ( sK0 @ sK4 ) )
    | ( ( sK1 @ sK4 )
      = $true ) ),
    inference(duplicate_literal_removal,[],[f23]) ).

thf(f23,plain,
    ( ( ( sK1 @ sK4 )
      = $true )
    | ( $true
      = ( sK0 @ sK4 ) )
    | ( ( sK1 @ sK4 )
      = $true )
    | ( $true
      = ( sK0 @ sK4 ) ) ),
    inference(binary_proxy_clausification,[],[f22]) ).

thf(f22,plain,
    ( ( $true
      = ( sK0 @ sK4 ) )
    | ( ( sK1 @ sK4 )
      = $true )
    | ( $true
      = ( ( sK0 @ sK4 )
        | ( sK1 @ sK4 ) ) ) ),
    inference(binary_proxy_clausification,[],[f12]) ).

thf(f12,plain,
    ( ( $true
      = ( ( sK1 @ sK4 )
        | ( sK0 @ sK4 ) ) )
    | ( $true
      = ( ( sK0 @ sK4 )
        | ( sK1 @ sK4 ) ) ) ),
    inference(binary_proxy_clausification,[],[f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEU839^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/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.15/0.36  % Computer : n002.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 17:49:38 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a TH0_THM_EQU_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.15/0.38  % (30517)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.15/0.38  % (30517)First to succeed.
% 0.15/0.38  % (30513)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.15/0.38  % (30518)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.38  % (30512)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.15/0.38  % (30511)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.15/0.38  % (30518)Also succeeded, but the first one will report.
% 0.15/0.38  % (30517)Refutation found. Thanks to Tanya!
% 0.15/0.38  % SZS status Theorem for theBenchmark
% 0.15/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38  % (30517)------------------------------
% 0.15/0.38  % (30517)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (30517)Termination reason: Refutation
% 0.15/0.38  
% 0.15/0.38  % (30517)Memory used [KB]: 5500
% 0.15/0.38  % (30517)Time elapsed: 0.004 s
% 0.15/0.38  % (30517)Instructions burned: 1 (million)
% 0.15/0.38  % (30517)------------------------------
% 0.15/0.38  % (30517)------------------------------
% 0.15/0.38  % (30506)Success in time 0.016 s
% 0.15/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------