↑ Up

DT2H2X---1.9.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : DT2H2X---1.9.5
% Problem  : SEU833^5 : TPTP v9.2.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300

% 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 : Wed Feb 25 09:37:33 AM UTC 2026

% Result   : Theorem 1.43s 1.26s
% Output   : Refutation 1.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   34 (  10 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :   28 (   9   ~;   0   |;   9   &;   9   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   1 usr;   1 con; 0-2 aty)
%            Number of variables   :   26 (  20   ^;   4   !;   2   ?;  26   :)

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

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

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

thf(f11,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[f10]) ).

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

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

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

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

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

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

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

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

thf(f1,conjecture,
    ! [X0: a > $o] :
      ( ( ^ [X1: a] : $false )
      = ( ^ [X1: a] :
            ( ( X0 @ X1 )
            & $false ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.cRlC2OI0EK/DTF2THF_2031.p',cGAZING_THM24_pme) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SEU833^5 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/0.34  % Computer : n022.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Tue Feb 24 12:35:21 EST 2026
% 0.16/0.34  % CPUTime  : 
% 0.16/0.34  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.30/0.46  ---- Original DTF file ---
% 0.30/0.46  thf(spec,logic,$$dhol).
% 0.30/0.46  %------------------------------------------------------------------------------
% 0.30/0.46  % File     : SEU833^5 : TPTP v9.2.1. Released v4.0.0.
% 0.30/0.46  % Domain   : Set Theory
% 0.30/0.46  % Problem  : TPS problem GAZING-THM24
% 0.30/0.46  % Version  : Especial.
% 0.30/0.46  % English  : Trybulec's 61st Boolean property of sets
% 0.30/0.46  
% 0.30/0.46  % Refs     : [TS89]  Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.30/0.46  %          : [Bar92] Barker-Plummer D (1992), Gazing: An Approach to the Pr
% 0.30/0.46  %          : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.30/0.46  % Source   : [Bro09]
% 0.30/0.46  % Names    : tps_0064 [Bro09]
% 0.30/0.46  %          : 24 [Bar92]
% 0.30/0.46  %          : GAZING-THM24 [TPS]
% 0.30/0.46  %          : BOOL-PROP-61 [TPS]
% 0.30/0.46  
% 0.30/0.46  % Status   : Theorem
% 0.30/0.46  % Rating   : 0.00 v8.2.0, 0.08 v8.1.0, 0.00 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.12 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.00 v6.1.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v4.1.0, 0.00 v4.0.0
% 0.30/0.46  % Syntax   : Number of formulae    :    2 (   1 unt;   1 typ;   0 def)
% 0.30/0.46  %            Number of atoms       :    3 (   1 equ;   0 cnn)
% 0.30/0.46  %            Maximal formula atoms :    1 (   3 avg)
% 0.30/0.46  %            Number of connectives :    2 (   0   ~;   0   |;   1   &;   1   @)
% 0.30/0.46  %                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
% 0.30/0.46  %            Maximal formula depth :    2 (   2 avg)
% 0.30/0.46  %            Number of types       :    2 (   1 usr)
% 0.30/0.46  %            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
% 0.30/0.46  %            Number of symbols     :    2 (   0 usr;   1 con; 0-2 aty)
% 0.30/0.46  %            Number of variables   :    3 (   2   ^;   1   !;   0   ?;   3   :)
% 0.30/0.46  % SPC      : TH0_THM_EQU_NAR
% 0.30/0.46  
% 0.30/0.46  % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.30/0.46  %            project in the Department of Mathematical Sciences at Carnegie
% 0.30/0.46  %            Mellon University. Distributed under the Creative Commons copyleft
% 0.30/0.46  %            license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.30/0.46  %          : Polymorphic definitions expanded.
% 0.30/0.46  %------------------------------------------------------------------------------
% 0.30/0.46  thf(a_type,type,
% 0.30/0.46      a: $tType ).
% 0.30/0.46  
% 0.30/0.46  thf(cGAZING_THM24_pme,conjecture,
% 0.30/0.46      ! [S: a > $o] :
% 0.30/0.46        ( ( ^ [Xx: a] :
% 0.30/0.46              ( ( S @ Xx )
% 0.30/0.46              & $false ) )
% 0.30/0.46        = ( ^ [Xx: a] : $false ) ) ).
% 0.30/0.46  
% 0.30/0.46  %------------------------------------------------------------------------------
% 0.30/0.46  ------------------------
% 1.43/1.23  ---- Embedded in THF ---
% 1.43/1.23  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.43/1.23  %%% Generated on Tue Feb 24 12:35:22 EST 2026
% 1.43/1.23  %%% using '$$dhol' embedding, version 1.3.0.
% 1.43/1.23  %%% Logic specification used:
% 1.43/1.23  %%% thf(spec, logic, $$dhol).
% 1.43/1.23  
% 1.43/1.23  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.cRlC2OI0EK/DTF2DTF2031.p
% See solution above
% 1.43/1.23  ------------------------
% 1.43/1.24  ---- Cleaned THF ---
% 1.43/1.24  thf(a_type,type,
% 1.43/1.24      a: $tType ).
% 1.43/1.24  
% 1.43/1.24  thf(cGAZING_THM24_pme,conjecture,
% 1.43/1.24      ! [S: a > $o] :
% 1.43/1.24        ( ( ^ [Xx: a] :
% 1.43/1.24              ( ( S @ Xx )
% 1.43/1.24              & $false ) )
% 1.43/1.24        = ( ^ [Xx: a] : $false ) ) ).
% 1.43/1.24  ------------------------
% 1.43/1.25  % (2129)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_2031 for (3000ds/183Mi)
% 1.43/1.25  % (2131)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 DTF2THF_2031 for (3000ds/27Mi)
% 1.43/1.25  % (2130)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 DTF2THF_2031 for (3000ds/4Mi)
% 1.43/1.25  % (2129)First to succeed.
% 1.43/1.25  % (2130)Also succeeded, but the first one will report.
% 1.43/1.26  % (2131)Also succeeded, but the first one will report.
% 1.43/1.26  % (2129)Refutation found. Thanks to Tanya!
% 1.43/1.26  % SZS status Theorem for DTF2THF_2031
% 1.43/1.26  % SZS output start Proof for DTF2THF_2031
% 1.43/1.26  thf(type_def_5, type, a: $tType).
% 1.43/1.26  thf(func_def_0, type, a: $tType).
% 1.43/1.26  thf(func_def_7, type, sK0: a > $o).
% 1.43/1.26  thf(f11,plain,(
% 1.43/1.26    $false),
% 1.43/1.26    inference(trivial_inequality_removal,[status(thm)],[f10])).
% 1.43/1.26  thf(f10,plain,(
% 1.43/1.26    ((^[Y0 : a]: ($false)) != (^[Y0 : a]: ($false)))),
% 1.43/1.26    inference(boolean_simplification,[status(thm)],[f9])).
% 1.43/1.26  thf(f9,plain,(
% 1.43/1.26    ((^[Y0 : a]: ($false & (sK0 @ Y0))) != (^[Y0 : a]: ($false)))),
% 1.43/1.26    inference(cnf_transformation,[status(thm)],[f8])).
% 1.43/1.26  thf(f8,plain,(
% 1.43/1.26    ((^[Y0 : a]: ($false & (sK0 @ Y0))) != (^[Y0 : a]: ($false)))),
% 1.43/1.26    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7])).
% 1.43/1.26  thf(f7,plain,(
% 1.43/1.26    ? [X0 : a > $o] : ((^[Y0 : a]: ($false & (X0 @ Y0))) != (^[Y0 : a]: ($false))) => ((^[Y0 : a]: ($false & (sK0 @ Y0))) != (^[Y0 : a]: ($false)))),
% 1.43/1.26    introduced(definition,[],[choice_axiom])).
% 1.43/1.26  thf(f6,plain,(
% 1.43/1.26    ? [X0 : a > $o] : ((^[Y0 : a]: ($false & (X0 @ Y0))) != (^[Y0 : a]: ($false)))),
% 1.43/1.26    inference(ennf_transformation,[status(thm)],[f5])).
% 1.43/1.26  thf(f5,plain,(
% 1.43/1.26    ~! [X0 : a > $o] : ((^[Y0 : a]: ($false & (X0 @ Y0))) = (^[Y0 : a]: ($false)))),
% 1.43/1.26    inference(fool_elimination,[status(thm)],[f4])).
% 1.43/1.26  thf(f4,plain,(
% 1.43/1.26    ~! [X0 : a > $o] : ((^[X1 : a] : ($false)) = (^[X2 : a] : ((X0 @ X2) & $false)))),
% 1.43/1.26    inference(rectify,[status(thm)],[f2])).
% 1.43/1.26  thf(f2,negated_conjecture,(
% 1.43/1.26    ~! [X0 : a > $o] : ((^[X1 : a] : ($false)) = (^[X1 : a] : ((X0 @ X1) & $false)))),
% 1.43/1.26    inference(negated_conjecture,[status(cth)],[f1])).
% 1.43/1.26  thf(f1,conjecture,(
% 1.43/1.26    ! [X0 : a > $o] : ((^[X1 : a] : ($false)) = (^[X1 : a] : ((X0 @ X1) & $false)))),
% 1.43/1.26    file('/export/starexec/sandbox/tmp/tmp.cRlC2OI0EK/DTF2THF_2031.p',cGAZING_THM24_pme)).
% 1.43/1.26  % SZS output end Proof for DTF2THF_2031
% 1.43/1.26  % (2129)------------------------------
% 1.43/1.26  % (2129)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.43/1.26  % (2129)Termination reason: Refutation
% 1.43/1.26  
% 1.43/1.26  % (2129)Memory used [KB]: 5373
% 1.43/1.26  % (2129)Time elapsed: 0.002 s
% 1.43/1.26  % (2129)------------------------------
% 1.43/1.26  % (2129)------------------------------
% 1.43/1.26  % (2128)Success in time 0.012 s
%------------------------------------------------------------------------------