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

View Problem - Process Solution

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

% Computer : n017.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:57 EDT 2024

% Result   : Theorem 0.11s 0.36s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    9 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   43 (   9 equ;   0 cnn)
%            Maximal formula atoms :    2 (   4 avg)
%            Number of connectives :   88 (   6   ~;   0   |;   0   &;  81   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   2 con; 0-4 aty)
%            Number of variables   :   18 (   0   ^  12   !;   6   ?;  18   :)

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

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

thf(func_def_4,type,
    sK1: sK0 ).

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

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

thf(f10,plain,
    $false,
    inference(subsumption_resolution,[],[f8,f9]) ).

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

thf(f1,axiom,
    ! [X0: $tType,X1: X0,X2: X0 > $o] :
      ( ( 'const/sets/INSERT' @ X0 @ X1 @ X2 )
      = ( 'const/sets/INSERT' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X1 @ X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/INSERT_INSERT_') ).

thf(f8,plain,
    ( ( 'const/sets/INSERT' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK1 @ sK2 ) )
   != ( 'const/sets/INSERT' @ sK0 @ sK1 @ sK2 ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f7,plain,
    ( ( 'const/sets/INSERT' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK1 @ sK2 ) )
   != ( 'const/sets/INSERT' @ sK0 @ sK1 @ sK2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f6]) ).

thf(f6,plain,
    ( ? [X0: $tType,X1: X0,X2: X0 > $o] :
        ( ( 'const/sets/INSERT' @ X0 @ X1 @ X2 )
       != ( 'const/sets/INSERT' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X1 @ X2 ) ) )
   => ( ( 'const/sets/INSERT' @ sK0 @ sK1 @ ( 'const/sets/INSERT' @ sK0 @ sK1 @ sK2 ) )
     != ( 'const/sets/INSERT' @ sK0 @ sK1 @ sK2 ) ) ),
    introduced(choice_axiom,[]) ).

thf(f5,plain,
    ? [X0: $tType,X1: X0,X2: X0 > $o] :
      ( ( 'const/sets/INSERT' @ X0 @ X1 @ X2 )
     != ( 'const/sets/INSERT' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X1 @ X2 ) ) ),
    inference(ennf_transformation,[],[f3]) ).

thf(f3,negated_conjecture,
    ~ ! [X0: $tType,X1: X0,X2: X0 > $o] :
        ( ( 'const/sets/INSERT' @ X0 @ X1 @ X2 )
        = ( 'const/sets/INSERT' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X1 @ X2 ) ) ),
    inference(negated_conjecture,[],[f2]) ).

thf(f2,conjecture,
    ! [X0: $tType,X1: X0,X2: X0 > $o] :
      ( ( 'const/sets/INSERT' @ X0 @ X1 @ X2 )
      = ( 'const/sets/INSERT' @ X0 @ X1 @ ( 'const/sets/INSERT' @ X0 @ X1 @ X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/INSERT_AC_1') ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SEV457^1 : TPTP v8.2.0. Released v7.0.0.
% 0.11/0.12  % Command    : run_vampire %s %d THM
% 0.11/0.32  % Computer : n017.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Fri Jun 21 18:48:39 EDT 2024
% 0.11/0.33  % CPUTime    : 
% 0.11/0.34  This is a TH1_THM_EQU_NAR problem
% 0.11/0.34  Running higher-order theorem proving
% 0.11/0.34  Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.11/0.36  % (7942)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.11/0.36  % (7939)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.11/0.36  % (7941)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.11/0.36  % (7938)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.11/0.36  % (7943)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.11/0.36  % (7937)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.11/0.36  % (7940)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.11/0.36  % Exception at run slice level
% 0.11/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.11/0.36  % (7942)First to succeed.
% 0.11/0.36  % (7937)Also succeeded, but the first one will report.
% 0.11/0.36  % (7940)Instruction limit reached!
% 0.11/0.36  % (7940)------------------------------
% 0.11/0.36  % (7940)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.11/0.36  % (7940)Termination reason: Unknown
% 0.11/0.36  % (7940)Termination phase: Saturation
% 0.11/0.36  
% 0.11/0.36  % (7940)Memory used [KB]: 5500
% 0.11/0.36  % (7940)Time elapsed: 0.003 s
% 0.11/0.36  % (7940)Instructions burned: 2 (million)
% 0.11/0.36  % (7940)------------------------------
% 0.11/0.36  % (7940)------------------------------
% 0.11/0.36  % (7939)Also succeeded, but the first one will report.
% 0.11/0.36  % (7942)Refutation found. Thanks to Tanya!
% 0.11/0.36  % SZS status Theorem for theBenchmark
% 0.11/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.36  % (7942)------------------------------
% 0.11/0.36  % (7942)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.11/0.36  % (7942)Termination reason: Refutation
% 0.11/0.36  
% 0.11/0.36  % (7942)Memory used [KB]: 5373
% 0.11/0.36  % (7942)Time elapsed: 0.003 s
% 0.11/0.36  % (7942)Instructions burned: 1 (million)
% 0.11/0.36  % (7942)------------------------------
% 0.11/0.36  % (7942)------------------------------
% 0.11/0.36  % (7936)Success in time 0.016 s
%------------------------------------------------------------------------------