↑ Up

DT2H2X---1.9.5.THM-Ref.s

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

% Computer : n025.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:47 AM UTC 2026

% Result   : Theorem 1.84s 1.54s
% Output   : Refutation 1.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   80 (  52 equ;   2 cnn)
%            Maximal formula atoms :    4 (   5 avg)
%            Number of connectives :   24 (  10   ~;   3   |;   4   &;   2   @)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   3 usr;   5 con; 0-2 aty)
%            Number of variables   :   34 (  18   ^;  12   !;   4   ?;  34   :)

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_9,type,
    ph3: 
      !>[X0: $tType] : X0 ).

thf(f20,plain,
    $false,
    inference(subsumption_resolution,[status(thm)],[f19,f10]) ).

thf(f10,plain,
    sK0 != sK1,
    inference(cnf_transformation,[status(thm)],[f8]) ).

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

thf(f7,plain,
    ( ? [X0: $i,X1: $i] :
        ( ( X0 != X1 )
        & ( ( ^ [Y0: $i] : ( X0 = Y0 ) )
          = ( ^ [Y0: $i] : ( X1 = Y0 ) ) ) )
   => ( ( sK0 != sK1 )
      & ( ( ^ [Y0: $i] : ( sK1 = Y0 ) )
        = ( ^ [Y0: $i] : ( sK0 = Y0 ) ) ) ) ),
    introduced(definition,[],[choice_axiom]) ).

thf(f6,plain,
    ? [X0: $i,X1: $i] :
      ( ( X0 != X1 )
      & ( ( ^ [Y0: $i] : ( X0 = Y0 ) )
        = ( ^ [Y0: $i] : ( X1 = Y0 ) ) ) ),
    inference(ennf_transformation,[status(thm)],[f5]) ).

thf(f5,plain,
    ~ ! [X0: $i,X1: $i] :
        ( ( ( ^ [Y0: $i] : ( X0 = Y0 ) )
          = ( ^ [Y0: $i] : ( X1 = Y0 ) ) )
       => ( X0 = X1 ) ),
    inference(fool_elimination,[status(thm)],[f4]) ).

thf(f4,plain,
    ~ ! [X0: $i,X1: $i] :
        ( ( ( ^ [X2: $i] : ( X0 = X2 ) )
          = ( ^ [X3: $i] : ( X1 = X3 ) ) )
       => ( X0 = X1 ) ),
    inference(rectify,[status(thm)],[f2]) ).

thf(f2,negated_conjecture,
    ~ ! [X0: $i,X1: $i] :
        ( ( ( ^ [X2: $i] : ( X0 = X2 ) )
          = ( ^ [X2: $i] : ( X1 = X2 ) ) )
       => ( X0 = X1 ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f1,conjecture,
    ! [X0: $i,X1: $i] :
      ( ( ( ^ [X2: $i] : ( X0 = X2 ) )
        = ( ^ [X2: $i] : ( X1 = X2 ) ) )
     => ( X0 = X1 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.5ms6vpUD0W/DTF2THF_12389.p',cTHM14_pme) ).

thf(f19,plain,
    sK0 = sK1,
    inference(equality_resolution,[status(thm)],[f16]) ).

thf(f16,plain,
    ! [X1: $i] :
      ( ( sK0 != X1 )
      | ( sK1 = X1 ) ),
    inference(equality_proxy_clausification,[status(thm)],[f15]) ).

thf(f15,plain,
    ! [X1: $i] :
      ( ( sK0 != X1 )
      | ( $true
        = ( sK1 = X1 ) ) ),
    inference(equality_proxy_clausification,[status(thm)],[f14]) ).

thf(f14,plain,
    ! [X1: $i] :
      ( ( ( sK0 = X1 )
        = $false )
      | ( $true
        = ( sK1 = X1 ) ) ),
    inference(binary_proxy_clausification,[status(thm)],[f12]) ).

thf(f12,plain,
    ! [X1: $i] :
      ( ( sK0 = X1 )
      = ( sK1 = X1 ) ),
    inference(argument_congruence,[status(thm)],[f11]) ).

thf(f11,plain,
    ( ( (=) @ sK0 )
    = ( (=) @ sK1 ) ),
    inference(beta_eta_normalization,[status(thm)],[f9]) ).

thf(f9,plain,
    ( ( ^ [Y0: $i] : ( sK1 = Y0 ) )
    = ( ^ [Y0: $i] : ( sK0 = Y0 ) ) ),
    inference(cnf_transformation,[status(thm)],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SEU934^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11  % Command  : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/0.32  % Computer : n025.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit : 300
% 0.14/0.32  % WCLimit  : 300
% 0.14/0.32  % DateTime : Tue Feb 24 12:36:42 EST 2026
% 0.14/0.32  % CPUTime  : 
% 0.14/0.32  Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.19/0.43  ---- Original DTF file ---
% 0.19/0.43  thf(spec,logic,$$dhol).
% 0.19/0.43  %------------------------------------------------------------------------------
% 0.19/0.43  % File     : SEU934^5 : TPTP v9.2.1. Released v4.0.0.
% 0.19/0.43  % Domain   : Set Theory (Functions)
% 0.19/0.43  % Problem  : TPS problem THM14
% 0.19/0.43  % Version  : Especial.
% 0.19/0.43  % English  :
% 0.19/0.43  
% 0.19/0.43  % Refs     : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.19/0.43  % Source   : [Bro09]
% 0.19/0.43  % Names    : tps_0280 [Bro09]
% 0.19/0.43  %          : THM14 [TPS]
% 0.19/0.43  
% 0.19/0.43  % Status   : Theorem
% 0.19/0.43  % Rating   : 0.00 v9.0.0, 0.10 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.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.1, 0.33 v4.0.0
% 0.19/0.43  % Syntax   : Number of formulae    :    1 (   0 unt;   0 typ;   0 def)
% 0.19/0.43  %            Number of atoms       :    4 (   4 equ;   0 cnn)
% 0.19/0.43  %            Maximal formula atoms :    2 (   4 avg)
% 0.19/0.43  %            Number of connectives :    1 (   0   ~;   0   |;   0   &;   0   @)
% 0.19/0.43  %                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
% 0.19/0.43  %            Maximal formula depth :    4 (   4 avg)
% 0.19/0.43  %            Number of types       :    1 (   0 usr)
% 0.19/0.43  %            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
% 0.19/0.43  %            Number of symbols     :    1 (   0 usr;   0 con; 2-2 aty)
% 0.19/0.43  %            Number of variables   :    4 (   2   ^;   2   !;   0   ?;   4   :)
% 0.19/0.43  % SPC      : TH0_THM_EQU_NAR
% 0.19/0.43  
% 0.19/0.43  % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.19/0.43  %            project in the Department of Mathematical Sciences at Carnegie
% 0.19/0.43  %            Mellon University. Distributed under the Creative Commons copyleft
% 0.19/0.43  %            license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.19/0.43  %          : Polymorphic definitions expanded.
% 0.19/0.43  %------------------------------------------------------------------------------
% 0.19/0.43  thf(cTHM14_pme,conjecture,
% 0.19/0.43      ! [Xx: $i,Xy: $i] :
% 0.19/0.43        ( ( ( ^ [Y: $i] : ( Y = Xx ) )
% 0.19/0.43          = ( ^ [Y: $i] : ( Y = Xy ) ) )
% 0.19/0.43       => ( Xx = Xy ) ) ).
% 0.19/0.43  
% 0.19/0.43  %------------------------------------------------------------------------------
% 0.19/0.43  ------------------------
% 1.84/1.51  ---- Embedded in THF ---
% 1.84/1.51  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.84/1.51  %%% Generated on Tue Feb 24 12:36:43 EST 2026
% 1.84/1.51  %%% using '$$dhol' embedding, version 1.3.0.
% 1.84/1.51  %%% Logic specification used:
% 1.84/1.51  %%% thf(spec, logic, $$dhol).
% 1.84/1.51  
% 1.84/1.51  % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.5ms6vpUD0W/DTF2DTF12389.p
% See solution above
% 1.84/1.51  ------------------------
% 1.84/1.52  ---- Cleaned THF ---
% 1.84/1.52  thf(cTHM14_pme,conjecture,
% 1.84/1.52      ! [Xx: $i,Xy: $i] :
% 1.84/1.52        ( ( ( ^ [Y: $i] : ( Y = Xx ) )
% 1.84/1.52          = ( ^ [Y: $i] : ( Y = Xy ) ) )
% 1.84/1.52       => ( Xx = Xy ) ) ).
% 1.84/1.52  ------------------------
% 1.84/1.54  % (12493)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_12389 for (2999ds/18Mi)
% 1.84/1.54  % (12489)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_12389 for (2999ds/27Mi)
% 1.84/1.54  % (12487)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_12389 for (2999ds/183Mi)
% 1.84/1.54  % (12488)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_12389 for (2999ds/4Mi)
% 1.84/1.54  % (12490)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_12389 for (2999ds/2Mi)
% 1.84/1.54  % (12492)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on DTF2THF_12389 for (2999ds/275Mi)
% 1.84/1.54  % (12490)Instruction limit reached!
% 1.84/1.54  % (12490)------------------------------
% 1.84/1.54  % (12490)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.84/1.54  % (12490)Termination reason: Unknown
% 1.84/1.54  % (12490)Termination phase: Saturation
% 1.84/1.54  
% 1.84/1.54  % (12493)First to succeed.
% 1.84/1.54  % (12490)Memory used [KB]: 5500
% 1.84/1.54  % (12490)Time elapsed: 0.003 s
% 1.84/1.54  % (12490)Instructions burned: 2 (million)
% 1.84/1.54  % (12490)------------------------------
% 1.84/1.54  % (12490)------------------------------
% 1.84/1.54  % (12492)Also succeeded, but the first one will report.
% 1.84/1.54  % (12491)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_12389 for (2999ds/2Mi)
% 1.84/1.54  % (12487)Also succeeded, but the first one will report.
% 1.84/1.54  % (12493)Refutation found. Thanks to Tanya!
% 1.84/1.54  % SZS status Theorem for DTF2THF_12389
% 1.84/1.54  % SZS output start Proof for DTF2THF_12389
% 1.84/1.54  thf(func_def_9, type, ph3: !>[X0: $tType]:(X0)).
% 1.84/1.54  thf(f20,plain,(
% 1.84/1.54    $false),
% 1.84/1.54    inference(subsumption_resolution,[status(thm)],[f19,f10])).
% 1.84/1.54  thf(f10,plain,(
% 1.84/1.54    (sK0 != sK1)),
% 1.84/1.54    inference(cnf_transformation,[status(thm)],[f8])).
% 1.84/1.54  thf(f8,plain,(
% 1.84/1.54    (sK0 != sK1) & ((^[Y0 : $i]: (sK1 = Y0)) = (^[Y0 : $i]: (sK0 = Y0)))),
% 1.84/1.54    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7])).
% 1.84/1.54  thf(f7,plain,(
% 1.84/1.54    ? [X0 : $i,X1 : $i] : ((X0 != X1) & ((^[Y0 : $i]: (X0 = Y0)) = (^[Y0 : $i]: (X1 = Y0)))) => ((sK0 != sK1) & ((^[Y0 : $i]: (sK1 = Y0)) = (^[Y0 : $i]: (sK0 = Y0))))),
% 1.84/1.54    introduced(definition,[],[choice_axiom])).
% 1.84/1.54  thf(f6,plain,(
% 1.84/1.54    ? [X0 : $i,X1 : $i] : ((X0 != X1) & ((^[Y0 : $i]: (X0 = Y0)) = (^[Y0 : $i]: (X1 = Y0))))),
% 1.84/1.54    inference(ennf_transformation,[status(thm)],[f5])).
% 1.84/1.54  thf(f5,plain,(
% 1.84/1.54    ~! [X0 : $i,X1 : $i] : (((^[Y0 : $i]: (X0 = Y0)) = (^[Y0 : $i]: (X1 = Y0))) => (X0 = X1))),
% 1.84/1.54    inference(fool_elimination,[status(thm)],[f4])).
% 1.84/1.54  thf(f4,plain,(
% 1.84/1.54    ~! [X0 : $i,X1 : $i] : (((^[X2 : $i] : ((X0 = X2))) = (^[X3 : $i] : ((X1 = X3)))) => (X0 = X1))),
% 1.84/1.54    inference(rectify,[status(thm)],[f2])).
% 1.84/1.54  thf(f2,negated_conjecture,(
% 1.84/1.54    ~! [X0 : $i,X1 : $i] : (((^[X2 : $i] : ((X0 = X2))) = (^[X2 : $i] : ((X1 = X2)))) => (X0 = X1))),
% 1.84/1.54    inference(negated_conjecture,[status(cth)],[f1])).
% 1.84/1.54  thf(f1,conjecture,(
% 1.84/1.54    ! [X0 : $i,X1 : $i] : (((^[X2 : $i] : ((X0 = X2))) = (^[X2 : $i] : ((X1 = X2)))) => (X0 = X1))),
% 1.84/1.54    file('/export/starexec/sandbox2/tmp/tmp.5ms6vpUD0W/DTF2THF_12389.p',cTHM14_pme)).
% 1.84/1.54  thf(f19,plain,(
% 1.84/1.54    (sK0 = sK1)),
% 1.84/1.54    inference(equality_resolution,[status(thm)],[f16])).
% 1.84/1.54  thf(f16,plain,(
% 1.84/1.54    ( ! [X1 : $i] : ((sK0 != X1) | (sK1 = X1)) )),
% 1.84/1.54    inference(equality_proxy_clausification,[status(thm)],[f15])).
% 1.84/1.54  thf(f15,plain,(
% 1.84/1.54    ( ! [X1 : $i] : ((sK0 != X1) | ($true = (sK1 = X1))) )),
% 1.84/1.54    inference(equality_proxy_clausification,[status(thm)],[f14])).
% 1.84/1.54  thf(f14,plain,(
% 1.84/1.54    ( ! [X1 : $i] : (((sK0 = X1) = $false) | ($true = (sK1 = X1))) )),
% 1.84/1.54    inference(binary_proxy_clausification,[status(thm)],[f12])).
% 1.84/1.54  thf(f12,plain,(
% 1.84/1.54    ( ! [X1 : $i] : (((sK0 = X1) = (sK1 = X1))) )),
% 1.84/1.54    inference(argument_congruence,[status(thm)],[f11])).
% 1.84/1.54  thf(f11,plain,(
% 1.84/1.54    ((= @ sK0) = (= @ sK1))),
% 1.84/1.54    inference(beta_eta_normalization,[status(thm)],[f9])).
% 1.84/1.54  thf(f9,plain,(
% 1.84/1.54    ((^[Y0 : $i]: (sK1 = Y0)) = (^[Y0 : $i]: (sK0 = Y0)))),
% 1.84/1.54    inference(cnf_transformation,[status(thm)],[f8])).
% 1.84/1.54  % SZS output end Proof for DTF2THF_12389
% 1.84/1.54  % (12493)------------------------------
% 1.84/1.54  % (12493)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.84/1.54  % (12493)Termination reason: Refutation
% 1.84/1.54  
% 1.84/1.54  % (12493)Memory used [KB]: 5500
% 1.84/1.54  % (12493)Time elapsed: 0.004 s
% 1.84/1.54  % (12493)Instructions burned: 1 (million)
% 1.84/1.54  % (12493)------------------------------
% 1.84/1.54  % (12493)------------------------------
% 1.84/1.54  % (12486)Success in time 0.019 s
%------------------------------------------------------------------------------