TSTP Solution File: SEV451^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV451^1 : TPTP v8.2.0. Released v7.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 : n023.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:13:50 EDT 2024

% Result   : Theorem 0.18s 0.37s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   49 (  12 unt;   9 typ;   0 def)
%            Number of atoms       :  176 (  42 equ;   0 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :  233 (  17   ~;  23   |;   0   &; 190   @)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   40 (  40   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  10 usr;   5 con; 0-4 aty)
%            Number of variables   :   70 (   0   ^  60   !;   4   ?;  70   :)
%                                         (   6  !>;   0  ?*;   0  @-;   0  @+)

% 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/UNION': 
      !>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).

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

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

thf(func_def_12,type,
    sK1: sK0 > $o ).

thf(func_def_14,type,
    sK3: 
      !>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).

thf(func_def_15,type,
    ph4: 
      !>[X0: $tType] : X0 ).

thf(func_def_16,type,
    sK5: sK0 ).

thf(f164,plain,
    $false,
    inference(avatar_sat_refutation,[],[f69,f79,f161]) ).

thf(f161,plain,
    ~ spl2_4,
    inference(avatar_contradiction_clause,[],[f160]) ).

thf(f160,plain,
    ( $false
    | ~ spl2_4 ),
    inference(trivial_inequality_removal,[],[f149]) ).

thf(f149,plain,
    ( ( $true = $false )
    | ~ spl2_4 ),
    inference(superposition,[],[f145,f19]) ).

thf(f19,plain,
    ! [X0: $tType,X1: X0] :
      ( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
      = $true ),
    inference(cnf_transformation,[],[f11]) ).

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

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

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

thf(f145,plain,
    ( ( ( 'const/sets/IN' @ sK0 @ sK5 @ 'const/sets/UNIV' @ sK0 )
      = $false )
    | ~ spl2_4 ),
    inference(trivial_inequality_removal,[],[f144]) ).

thf(f144,plain,
    ( ( $true = $false )
    | ( ( 'const/sets/IN' @ sK0 @ sK5 @ 'const/sets/UNIV' @ sK0 )
      = $false )
    | ~ spl2_4 ),
    inference(superposition,[],[f68,f121]) ).

thf(f121,plain,
    ! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
      ( ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 )
        = $true )
      | ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
        = $false ) ),
    inference(trivial_inequality_removal,[],[f115]) ).

thf(f115,plain,
    ! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
      ( ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 @ X1 )
        = $true )
      | ( $true = $false )
      | ( ( 'const/sets/IN' @ X0 @ X1 @ X3 )
        = $false ) ),
    inference(superposition,[],[f26,f43]) ).

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

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

thf(f14,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(f26,plain,
    ! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
      ( ( $true
        = ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ) )
      | ( $false
        = ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ),
    inference(binary_proxy_clausification,[],[f23]) ).

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

thf(f22,plain,
    ! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
      ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
      = ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
        | ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f13,plain,
    ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
      ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
      = ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
        | ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ),
    inference(fool_elimination,[],[f12]) ).

thf(f12,plain,
    ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
      ( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
        = ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
      | ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ),
    inference(rectify,[],[f3]) ).

thf(f3,axiom,
    ! [X0: $tType,X1: X0 > $o,X3: X0 > $o,X4: X0] :
      ( ( ( 'const/sets/IN' @ X0 @ X4 @ ( 'const/sets/UNION' @ X0 @ X1 @ X3 ) )
        = ( 'const/sets/IN' @ X0 @ X4 @ X3 ) )
      | ( 'const/sets/IN' @ X0 @ X4 @ X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_UNION_') ).

thf(f68,plain,
    ( ( ( 'const/sets/UNION' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK5 )
      = $false )
    | ~ spl2_4 ),
    inference(avatar_component_clause,[],[f66]) ).

thf(f66,plain,
    ( spl2_4
  <=> ( ( 'const/sets/UNION' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK5 )
      = $false ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).

thf(f79,plain,
    ~ spl2_3,
    inference(avatar_contradiction_clause,[],[f78]) ).

thf(f78,plain,
    ( $false
    | ~ spl2_3 ),
    inference(trivial_inequality_removal,[],[f75]) ).

thf(f75,plain,
    ( ( $true = $false )
    | ~ spl2_3 ),
    inference(superposition,[],[f64,f47]) ).

thf(f47,plain,
    ! [X0: $tType,X1: X0] :
      ( ( 'const/sets/UNIV' @ X0 @ X1 )
      = $true ),
    inference(trivial_inequality_removal,[],[f46]) ).

thf(f46,plain,
    ! [X0: $tType,X1: X0] :
      ( ( $true = $false )
      | ( ( 'const/sets/UNIV' @ X0 @ X1 )
        = $true ) ),
    inference(superposition,[],[f19,f43]) ).

thf(f64,plain,
    ( ( ( 'const/sets/UNIV' @ sK0 @ sK5 )
      = $false )
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f62]) ).

thf(f62,plain,
    ( spl2_3
  <=> ( ( 'const/sets/UNIV' @ sK0 @ sK5 )
      = $false ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

thf(f69,plain,
    ( spl2_3
    | spl2_4 ),
    inference(avatar_split_clause,[],[f51,f66,f62]) ).

thf(f51,plain,
    ( ( ( 'const/sets/UNION' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK5 )
      = $false )
    | ( ( 'const/sets/UNIV' @ sK0 @ sK5 )
      = $false ) ),
    inference(binary_proxy_clausification,[],[f49]) ).

thf(f49,plain,
    ( ( 'const/sets/UNIV' @ sK0 @ sK5 )
   != ( 'const/sets/UNION' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 @ sK5 ) ),
    inference(negative_extensionality,[],[f20]) ).

thf(f20,plain,
    ( 'const/sets/UNIV'
    @ ( sK0
     != ( 'const/sets/UNION' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 ) ) ),
    inference(cnf_transformation,[],[f17]) ).

thf(f17,plain,
    ( 'const/sets/UNIV'
    @ ( sK0
     != ( 'const/sets/UNION' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f15,f16]) ).

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

thf(f15,plain,
    ? [X0: $tType,X1: X0 > $o] :
      ( 'const/sets/UNIV'
      @ ( X0
       != ( 'const/sets/UNION' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ) ) ),
    inference(ennf_transformation,[],[f6]) ).

thf(f6,negated_conjecture,
    ~ ! [X0: $tType,X1: X0 > $o] :
        ( 'const/sets/UNIV'
        @ ( X0
          = ( 'const/sets/UNION' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ) ) ),
    inference(negated_conjecture,[],[f5]) ).

thf(f5,conjecture,
    ! [X0: $tType,X1: X0 > $o] :
      ( 'const/sets/UNIV'
      @ ( X0
        = ( 'const/sets/UNION' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/UNION_UNIV_1') ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SEV451^1 : TPTP v8.2.0. Released v7.0.0.
% 0.12/0.13  % 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.12/0.34  % Computer : n023.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sun May 19 18:43:23 EDT 2024
% 0.18/0.34  % CPUTime    : 
% 0.18/0.34  This is a TH1_THM_EQU_NAR problem
% 0.18/0.34  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.18/0.36  % (19429)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.36  % (19430)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 (2999ds/2Mi)
% 0.18/0.36  % (19431)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 (2999ds/275Mi)
% 0.18/0.36  % (19432)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.18/0.36  % (19433)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.36  % Exception at run slice level
% 0.18/0.36  User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.18/0.36  % (19429)Instruction limit reached!
% 0.18/0.36  % (19429)------------------------------
% 0.18/0.36  % (19429)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.36  % (19429)Termination reason: Unknown
% 0.18/0.36  % (19429)Termination phase: Saturation
% 0.18/0.36  
% 0.18/0.36  % (19429)Memory used [KB]: 5373
% 0.18/0.36  % (19429)Time elapsed: 0.003 s
% 0.18/0.36  % (19429)Instructions burned: 2 (million)
% 0.18/0.36  % (19429)------------------------------
% 0.18/0.36  % (19429)------------------------------
% 0.18/0.36  % (19428)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.18/0.36  % (19431)Refutation not found, incomplete strategy
% 0.18/0.36  % (19431)------------------------------
% 0.18/0.36  % (19431)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.36  % (19431)Termination reason: Refutation not found, incomplete strategy
% 0.18/0.36  
% 0.18/0.36  
% 0.18/0.36  % (19431)Memory used [KB]: 5500
% 0.18/0.36  % (19431)Time elapsed: 0.003 s
% 0.18/0.36  % (19431)Instructions burned: 2 (million)
% 0.18/0.36  % (19431)------------------------------
% 0.18/0.36  % (19431)------------------------------
% 0.18/0.36  % (19433)Instruction limit reached!
% 0.18/0.36  % (19433)------------------------------
% 0.18/0.36  % (19433)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.36  % (19433)Termination reason: Unknown
% 0.18/0.36  % (19433)Termination phase: Saturation
% 0.18/0.36  
% 0.18/0.36  % (19433)Memory used [KB]: 5500
% 0.18/0.36  % (19433)Time elapsed: 0.004 s
% 0.18/0.36  % (19433)Instructions burned: 4 (million)
% 0.18/0.36  % (19433)------------------------------
% 0.18/0.36  % (19433)------------------------------
% 0.18/0.36  % (19426)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.18/0.37  % (19432)Instruction limit reached!
% 0.18/0.37  % (19432)------------------------------
% 0.18/0.37  % (19432)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.37  % (19432)Termination reason: Unknown
% 0.18/0.37  % (19432)Termination phase: Saturation
% 0.18/0.37  
% 0.18/0.37  % (19432)Memory used [KB]: 5628
% 0.18/0.37  % (19432)Time elapsed: 0.012 s
% 0.18/0.37  % (19432)Instructions burned: 19 (million)
% 0.18/0.37  % (19432)------------------------------
% 0.18/0.37  % (19432)------------------------------
% 0.18/0.37  % (19427)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 (2999ds/4Mi)
% 0.18/0.37  % (19435)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.18/0.37  % (19428)First to succeed.
% 0.18/0.37  % (19434)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.18/0.37  % Exception at run slice level
% 0.18/0.37  % (19436)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.37  User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.18/0.37  % (19427)Instruction limit reached!
% 0.18/0.37  % (19427)------------------------------
% 0.18/0.37  % (19427)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.37  % (19427)Termination reason: Unknown
% 0.18/0.37  % (19427)Termination phase: Saturation
% 0.18/0.37  
% 0.18/0.37  % (19427)Memory used [KB]: 5500
% 0.18/0.37  % (19427)Time elapsed: 0.005 s
% 0.18/0.37  % (19427)Instructions burned: 5 (million)
% 0.18/0.37  % (19427)------------------------------
% 0.18/0.37  % (19427)------------------------------
% 0.18/0.37  % (19428)Refutation found. Thanks to Tanya!
% 0.18/0.37  % SZS status Theorem for theBenchmark
% 0.18/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.38  % (19428)------------------------------
% 0.18/0.38  % (19428)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.38  % (19428)Termination reason: Refutation
% 0.18/0.38  
% 0.18/0.38  % (19428)Memory used [KB]: 5628
% 0.18/0.38  % (19428)Time elapsed: 0.016 s
% 0.18/0.38  % (19428)Instructions burned: 18 (million)
% 0.18/0.38  % (19428)------------------------------
% 0.18/0.38  % (19428)------------------------------
% 0.18/0.38  % (19425)Success in time 0.027 s
% 0.18/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------