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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET008^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n020.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:07:36 EDT 2024

% Result   : Theorem 0.15s 0.39s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   15 (  10 unt;   4 typ;   0 def)
%            Number of atoms       :   35 (  11 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :   67 (  19   ~;   0   |;  19   &;  28   @)
%                                         (   0 <=>;   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     :    4 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   34 (  22   ^   8   !;   4   ?;  34   :)

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

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

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

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

thf(f12,plain,
    $false,
    inference(trivial_inequality_removal,[],[f11]) ).

thf(f11,plain,
    ( ( ^ [Y0: a] : $false )
   != ( ^ [Y0: a] : $false ) ),
    inference(boolean_simplification,[],[f10]) ).

thf(f10,plain,
    ( ( ^ [Y0: a] :
          ( $false
          & ( sK0 @ Y0 ) ) )
   != ( ^ [Y0: a] : $false ) ),
    inference(boolean_simplification,[],[f9]) ).

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

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

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

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

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

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

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

thf(f1,conjecture,
    ! [X0: a > $o,X1: a > $o] :
      ( ( ^ [X2: a] : $false )
      = ( ^ [X2: a] :
            ( ( X0 @ X2 )
            & ~ ( X1 @ X2 )
            & ( X1 @ X2 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_78_pme) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SET008^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36  % Computer : n020.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   : Mon May 20 11:54:08 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.15/0.37  This is a TH0_THM_EQU_NAR problem
% 0.15/0.37  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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.39  % (13634)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.39  % (13635)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.15/0.39  % (13633)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.39  % (13634)First to succeed.
% 0.15/0.39  % (13630)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.39  % (13629)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.39  % (13628)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.39  % (13635)Refutation not found, incomplete strategy
% 0.15/0.39  % (13635)------------------------------
% 0.15/0.39  % (13635)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39  % (13635)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39  
% 0.15/0.39  % (13631)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.39  
% 0.15/0.39  % (13635)Memory used [KB]: 5500
% 0.15/0.39  % (13635)Time elapsed: 0.003 s
% 0.15/0.39  % (13635)Instructions burned: 2 (million)
% 0.15/0.39  % (13635)------------------------------
% 0.15/0.39  % (13635)------------------------------
% 0.15/0.39  % (13633)Also succeeded, but the first one will report.
% 0.15/0.39  % (13632)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.15/0.39  % (13631)Also succeeded, but the first one will report.
% 0.15/0.39  % (13634)Refutation found. Thanks to Tanya!
% 0.15/0.39  % SZS status Theorem for theBenchmark
% 0.15/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39  % (13634)------------------------------
% 0.15/0.39  % (13634)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39  % (13634)Termination reason: Refutation
% 0.15/0.39  
% 0.15/0.39  % (13634)Memory used [KB]: 5373
% 0.15/0.39  % (13634)Time elapsed: 0.003 s
% 0.15/0.39  % (13634)Instructions burned: 1 (million)
% 0.15/0.39  % (13634)------------------------------
% 0.15/0.39  % (13634)------------------------------
% 0.15/0.39  % (13627)Success in time 0.005 s
% 0.15/0.39  % Vampire---4.8 exiting
%------------------------------------------------------------------------------