TSTP Solution File: SEV445^1 by Vampire---4.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.9
% Problem  : SEV445^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire %s %d THM

% Computer : n022.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 : Mon Jun 24 16:03:54 EDT 2024

% Result   : Theorem 0.12s 0.37s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   67 (  19 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :   73 (  10   ~;   2   |;   0   &;  60   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   3 con; 0-3 aty)
%            Number of variables   :   33 (   6   ^  23   !;   4   ?;  33   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_6,type,
    sK0: $tType ).

thf(func_def_0,type,
    'const/sets/UNIV': 
      !>[X0: $tType] : ( X0 > $o ) ).

thf(func_def_1,type,
    'const/sets/IN': 
      !>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).

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

thf(func_def_7,type,
    sK1: sK0 ).

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

thf(f27,plain,
    $false,
    inference(trivial_inequality_removal,[],[f26]) ).

thf(f26,plain,
    $false = $true,
    inference(beta_eta_normalization,[],[f25]) ).

thf(f25,plain,
    ( $false
    = ( ^ [Y0: sK0] : $true
      @ sK1 ) ),
    inference(trivial_inequality_removal,[],[f22]) ).

thf(f22,plain,
    ( ( $false
      = ( ^ [Y0: sK0] : $true
        @ sK1 ) )
    | ( $true != $true ) ),
    inference(superposition,[],[f16,f18]) ).

thf(f18,plain,
    ! [X0: $tType,X2: X0,X1: X0 > $o] :
      ( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
        = $true )
      | ( $false
        = ( X1 @ X2 ) ) ),
    inference(binary_proxy_clausification,[],[f15]) ).

thf(f15,plain,
    ! [X0: $tType,X2: X0,X1: X0 > $o] :
      ( ( X1 @ X2 )
      = ( 'const/sets/IN' @ X0 @ X2 @ X1 ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f9,plain,
    ! [X0: $tType,X1: X0 > $o,X2: X0] :
      ( ( X1 @ X2 )
      = ( 'const/sets/IN' @ X0 @ X2 @ X1 ) ),
    inference(rectify,[],[f2]) ).

thf(f2,axiom,
    ! [X0: $tType,X2: X0 > $o,X1: X0] :
      ( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
      = ( X2 @ X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_') ).

thf(f16,plain,
    ( ( 'const/sets/IN' @ sK0 @ sK1
      @ ^ [Y0: sK0] : $true )
   != $true ),
    inference(definition_unfolding,[],[f14,f13]) ).

thf(f13,plain,
    ! [X0: $tType] :
      ( 'const/sets/UNIV'
      @ ( X0
        = ( ^ [Y0: X0] : $true ) ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f6,plain,
    ! [X0: $tType] :
      ( 'const/sets/UNIV'
      @ ( X0
        = ( ^ [Y0: X0] : $true ) ) ),
    inference(fool_elimination,[],[f1]) ).

thf(f1,axiom,
    ! [X0: $tType] :
      ( 'const/sets/UNIV'
      @ ( X0
        = ( ^ [X1: X0] : $true ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/UNIV_') ).

thf(f14,plain,
    ( ( 'const/sets/IN' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 )
   != $true ),
    inference(cnf_transformation,[],[f12]) ).

thf(f12,plain,
    ( ( 'const/sets/IN' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 )
   != $true ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f10,f11]) ).

thf(f11,plain,
    ( ? [X0: $tType,X1: X0] :
        ( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
       != $true )
   => ( ( 'const/sets/IN' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 )
     != $true ) ),
    introduced(choice_axiom,[]) ).

thf(f10,plain,
    ? [X0: $tType,X1: X0] :
      ( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
     != $true ),
    inference(ennf_transformation,[],[f8]) ).

thf(f8,plain,
    ~ ! [X0: $tType,X1: X0] :
        ( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
        = $true ),
    inference(fool_elimination,[],[f7]) ).

thf(f7,plain,
    ~ ! [X0: $tType,X1: X0] : ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ),
    inference(rectify,[],[f4]) ).

thf(f4,negated_conjecture,
    ~ ! [X0: $tType,X1: X0] : ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ),
    inference(negated_conjecture,[],[f3]) ).

thf(f3,conjecture,
    ! [X0: $tType,X1: X0] : ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_UNIV_') ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEV445^1 : TPTP v8.2.0. Released v7.0.0.
% 0.07/0.12  % Command    : run_vampire %s %d THM
% 0.12/0.33  % Computer : n022.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   : Fri Jun 21 19:02:09 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.35  This is a TH1_THM_EQU_NAR problem
% 0.12/0.35  Running higher-order theorem proving
% 0.12/0.35  Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/benchmark/theBenchmark.p -m 16384 -t 300
% 0.12/0.37  % (26933)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 (2999ds/27Mi)
% 0.12/0.37  % (26933)First to succeed.
% 0.12/0.37  % (26930)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.12/0.37  % (26933)Refutation found. Thanks to Tanya!
% 0.12/0.37  % SZS status Theorem for theBenchmark
% 0.12/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.37  % (26933)------------------------------
% 0.12/0.37  % (26933)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.37  % (26933)Termination reason: Refutation
% 0.12/0.37  
% 0.12/0.37  % (26933)Memory used [KB]: 5500
% 0.12/0.37  % (26933)Time elapsed: 0.004 s
% 0.12/0.37  % (26933)Instructions burned: 2 (million)
% 0.12/0.37  % (26933)------------------------------
% 0.12/0.37  % (26933)------------------------------
% 0.12/0.37  % (26928)Success in time 0.016 s
%------------------------------------------------------------------------------