↑ Up

DT2H2X---1.9.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : DT2H2X---1.9.5
% Problem  : SET603^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 : 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 : Wed Feb 25 09:31:52 AM UTC 2026

% Result   : Theorem 1.45s 1.28s
% Output   : Refutation 1.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   45 (  17 equ;   0 cnn)
%            Maximal formula atoms :    1 (   3 avg)
%            Number of connectives :   48 (  13   ~;   0   |;   6   &;  22   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   18 (  18   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   2 usr;   3 con; 0-2 aty)
%                                         (   7  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   18 (  15   ^;   3   !;   0   ?;  18   :)

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

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

thf(func_def_12,type,
    ph1: 
      !>[X0: $tType] : X0 ).

thf(func_def_13,type,
    sK2: a > $o ).

thf(f14,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[f13]) ).

thf(f13,plain,
    $true = $false,
    inference(beta_eta_normalization,[status(thm)],[f12]) ).

thf(f12,plain,
    ( ( ^ [Y0: a > $o] : $true
      @ sK2 )
    = $false ),
    inference(sigma_clausification,[status(thm)],[f11]) ).

thf(f11,plain,
    ( ( !! @ ( a > $o )
      @ ^ [Y0: a > $o] : $true )
    = $false ),
    inference(not_proxy_clausification,[status(thm)],[f10]) ).

thf(f10,plain,
    ( ( ~ ( !! @ ( a > $o )
          @ ^ [Y0: a > $o] : $true ) )
    = $true ),
    inference(boolean_simplification,[status(thm)],[f9]) ).

thf(f9,plain,
    ( $true
    = ( ~ ( !! @ ( a > $o )
          @ ^ [Y0: a > $o] : ( Y0 = Y0 ) ) ) ),
    inference(beta_eta_normalization,[status(thm)],[f8]) ).

thf(f8,plain,
    ( $true
    = ( ~ ( !! @ ( a > $o )
          @ ^ [Y0: a > $o] :
              ( Y0
              = ( ^ [Y1: a] : ( Y0 @ Y1 ) ) ) ) ) ),
    inference(boolean_simplification,[status(thm)],[f7]) ).

thf(f7,plain,
    ( $true
    = ( ~ ( !! @ ( a > $o )
          @ ^ [Y0: a > $o] :
              ( Y0
              = ( ^ [Y1: a] :
                    ( $true
                    & ( Y0 @ Y1 ) ) ) ) ) ) ),
    inference(boolean_simplification,[status(thm)],[f6]) ).

thf(f6,plain,
    ( $true
    = ( ~ ( !! @ ( a > $o )
          @ ^ [Y0: a > $o] :
              ( Y0
              = ( ^ [Y1: a] :
                    ( ~ $false
                    & ( Y0 @ Y1 ) ) ) ) ) ) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET603^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.15/0.33  % Computer : n017.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit : 300
% 0.15/0.33  % WCLimit  : 300
% 0.15/0.33  % DateTime : Tue Feb 24 11:59:11 EST 2026
% 0.15/0.33  % CPUTime  : 
% 0.15/0.34  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.28/0.46  ---- Original DTF file ---
% 0.28/0.46  thf(spec,logic,$$dhol).
% 0.28/0.46  %------------------------------------------------------------------------------
% 0.28/0.46  % File     : SET603^5 : TPTP v9.2.1. Released v4.0.0.
% 0.28/0.46  % Domain   : Set Theory
% 0.28/0.46  % Problem  : TPS problem BOOL-PROP-74
% 0.28/0.46  % Version  : Especial.
% 0.28/0.46  % English  : Trybulec's 74th Boolean property of sets
% 0.28/0.46  
% 0.28/0.46  % Refs     : [TS89]  Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.28/0.46  %          : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.28/0.46  % Source   : [Bro09]
% 0.28/0.46  % Names    : tps_0041 [Bro09]
% 0.28/0.46  %          : BOOL-PROP-74 [TPS]
% 0.28/0.46  
% 0.28/0.46  % Status   : Theorem
% 0.28/0.46  % Rating   : 0.11 v9.1.0, 0.12 v9.0.0, 0.20 v8.2.0, 0.23 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.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.28/0.46  % Syntax   : Number of formulae    :    2 (   1 unt;   1 typ;   0 def)
% 0.28/0.46  %            Number of atoms       :    2 (   1 equ;   0 cnn)
% 0.28/0.46  %            Maximal formula atoms :    1 (   2 avg)
% 0.28/0.46  %            Number of connectives :    3 (   1   ~;   0   |;   1   &;   1   @)
% 0.28/0.46  %                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
% 0.28/0.46  %            Maximal formula depth :    2 (   2 avg)
% 0.28/0.46  %            Number of types       :    2 (   1 usr)
% 0.28/0.46  %            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
% 0.28/0.46  %            Number of symbols     :    2 (   0 usr;   1 con; 0-2 aty)
% 0.28/0.46  %            Number of variables   :    2 (   1   ^;   1   !;   0   ?;   2   :)
% 0.28/0.46  % SPC      : TH0_THM_EQU_NAR
% 0.28/0.46  
% 0.28/0.46  % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.28/0.46  %            project in the Department of Mathematical Sciences at Carnegie
% 0.28/0.46  %            Mellon University. Distributed under the Creative Commons copyleft
% 0.28/0.46  %            license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.28/0.46  %          : Polymorphic definitions expanded.
% 0.28/0.46  %------------------------------------------------------------------------------
% 0.28/0.46  thf(a_type,type,
% 0.28/0.46      a: $tType ).
% 0.28/0.46  
% 0.28/0.46  thf(cBOOL_PROP_74_pme,conjecture,
% 0.28/0.46      ! [X: a > $o] :
% 0.28/0.46        ( ( ^ [Xx: a] :
% 0.28/0.46              ( ( X @ Xx )
% 0.28/0.46              & ~ $false ) )
% 0.28/0.46        = X ) ).
% 0.28/0.46  
% 0.28/0.46  %------------------------------------------------------------------------------
% 0.28/0.46  ------------------------
% 1.45/1.25  ---- Embedded in THF ---
% 1.45/1.26  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.45/1.26  %%% Generated on Tue Feb 24 11:59:11 EST 2026
% 1.45/1.26  %%% using '$$dhol' embedding, version 1.3.0.
% 1.45/1.26  %%% Logic specification used:
% 1.45/1.26  %%% thf(spec, logic, $$dhol).
% 1.45/1.26  
% 1.45/1.26  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.EXdqyz5F3S/DTF2DTF25156.p
% See solution above
% 1.45/1.26  ------------------------
% 1.45/1.27  ---- Cleaned THF ---
% 1.45/1.27  thf(a_type,type,
% 1.45/1.27      a: $tType ).
% 1.45/1.27  
% 1.45/1.27  thf(cBOOL_PROP_74_pme,conjecture,
% 1.45/1.27      ! [X: a > $o] :
% 1.45/1.27        ( ( ^ [Xx: a] :
% 1.45/1.27              ( ( X @ Xx )
% 1.45/1.27              & ~ $false ) )
% 1.45/1.27        = X ) ).
% 1.45/1.27  ------------------------
% 1.45/1.28  % (25433)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on DTF2THF_25156 for (2999ds/2Mi)
% 1.45/1.28  % (25431)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_25156 for (2999ds/27Mi)
% 1.45/1.28  % (25433)First to succeed.
% 1.45/1.28  % (25431)Also succeeded, but the first one will report.
% 1.45/1.28  % (25433)Refutation found. Thanks to Tanya!
% 1.45/1.28  % SZS status Theorem for DTF2THF_25156
% 1.45/1.28  % SZS output start Proof for DTF2THF_25156
% 1.45/1.28  thf(type_def_5, type, a: $tType).
% 1.45/1.28  thf(func_def_0, type, a: $tType).
% 1.45/1.28  thf(func_def_12, type, ph1: !>[X0: $tType]:(X0)).
% 1.45/1.28  thf(func_def_13, type, sK2: a > $o).
% 1.45/1.28  thf(f14,plain,(
% 1.45/1.28    $false),
% 1.45/1.28    inference(trivial_inequality_removal,[status(thm)],[f13])).
% 1.45/1.28  thf(f13,plain,(
% 1.45/1.28    ($true = $false)),
% 1.45/1.28    inference(beta_eta_normalization,[status(thm)],[f12])).
% 1.45/1.28  thf(f12,plain,(
% 1.45/1.28    (((^[Y0 : a > $o]: ($true)) @ sK2) = $false)),
% 1.45/1.28    inference(sigma_clausification,[status(thm)],[f11])).
% 1.45/1.28  thf(f11,plain,(
% 1.45/1.28    ((!! @ (a > $o) @ (^[Y0 : a > $o]: ($true))) = $false)),
% 1.45/1.28    inference(not_proxy_clausification,[status(thm)],[f10])).
% 1.45/1.28  thf(f10,plain,(
% 1.45/1.28    ((~ (!! @ (a > $o) @ (^[Y0 : a > $o]: ($true)))) = $true)),
% 1.45/1.28    inference(boolean_simplification,[status(thm)],[f9])).
% 1.45/1.28  thf(f9,plain,(
% 1.45/1.28    ($true = (~ (!! @ (a > $o) @ (^[Y0 : a > $o]: (Y0 = Y0)))))),
% 1.45/1.28    inference(beta_eta_normalization,[status(thm)],[f8])).
% 1.45/1.28  thf(f8,plain,(
% 1.45/1.28    ($true = (~ (!! @ (a > $o) @ (^[Y0 : a > $o]: (Y0 = (^[Y1 : a]: (Y0 @ Y1)))))))),
% 1.45/1.28    inference(boolean_simplification,[status(thm)],[f7])).
% 1.45/1.28  thf(f7,plain,(
% 1.45/1.28    ($true = (~ (!! @ (a > $o) @ (^[Y0 : a > $o]: (Y0 = (^[Y1 : a]: ($true & (Y0 @ Y1))))))))),
% 1.45/1.28    inference(boolean_simplification,[status(thm)],[f6])).
% 1.45/1.28  thf(f6,plain,(
% 1.45/1.28    ($true = (~ (!! @ (a > $o) @ (^[Y0 : a > $o]: (Y0 = (^[Y1 : a]: ((~ $false) & (Y0 @ Y1))))))))),
% 1.45/1.28    inference(cnf_transformation,[status(thm)],[f5])).
% 1.45/1.28  thf(f5,plain,(
% 1.45/1.28    ($true = (~ (!! @ (a > $o) @ (^[Y0 : a > $o]: (Y0 = (^[Y1 : a]: ((~ $false) & (Y0 @ Y1))))))))),
% 1.45/1.28    inference(fool_elimination,[status(thm)],[f4])).
% 1.45/1.28  thf(f4,plain,(
% 1.45/1.28    ~! [X0 : a > $o] : (X0 = (^[X1 : a] : ((X0 @ X1) & ~$false)))),
% 1.45/1.28    inference(rectify,[status(thm)],[f2])).
% 1.45/1.28  thf(f2,negated_conjecture,(
% 1.45/1.28    ~! [X0 : a > $o] : (X0 = (^[X1 : a] : ((X0 @ X1) & ~$false)))),
% 1.45/1.28    inference(negated_conjecture,[status(cth)],[f1])).
% 1.45/1.28  thf(f1,conjecture,(
% 1.45/1.28    ! [X0 : a > $o] : (X0 = (^[X1 : a] : ((X0 @ X1) & ~$false)))),
% 1.45/1.28    file('/export/starexec/sandbox/tmp/tmp.EXdqyz5F3S/DTF2THF_25156.p',cBOOL_PROP_74_pme)).
% 1.45/1.29  % SZS output end Proof for DTF2THF_25156
% 1.45/1.29  % (25433)------------------------------
% 1.45/1.29  % (25433)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.45/1.29  % (25433)Termination reason: Refutation
% 1.45/1.29  
% 1.45/1.29  % (25433)Memory used [KB]: 5500
% 1.45/1.29  % (25433)Time elapsed: 0.003 s
% 1.45/1.29  % (25433)Instructions burned: 1 (million)
% 1.45/1.29  % (25433)------------------------------
% 1.45/1.29  % (25433)------------------------------
% 1.45/1.29  % (25428)Success in time 0.013 s
%------------------------------------------------------------------------------