↑ Up

DT2H2X---1.9.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : DT2H2X---1.9.5
% Problem  : SEU922^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 : 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:45 AM UTC 2026

% Result   : Theorem 1.49s 1.33s
% Output   : Refutation 1.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   62 (  19 equ;   0 cnn)
%            Maximal formula atoms :    5 (   4 avg)
%            Number of connectives :  122 (   8   ~;   0   |;   4   &; 102   @)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   18 (  16   ^;   2   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_1,type,
    f: $i > $i ).

thf(func_def_2,type,
    g: $i > $i ).

thf(func_def_3,type,
    cP: $i > $o ).

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

thf(f15,plain,
    $false,
    inference(subsumption_resolution,[status(thm)],[f14,f9]) ).

thf(f9,plain,
    ( ( cP @ ( f @ ( f @ ( g @ a ) ) ) )
    = $true ),
    inference(cnf_transformation,[status(thm)],[f7]) ).

thf(f7,plain,
    ( ( ( cP @ ( g @ ( f @ ( f @ a ) ) ) )
     != $true )
    & ( ( cP @ ( f @ ( f @ ( g @ a ) ) ) )
      = $true )
    & ( ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) )
      = ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) ) ) ),
    inference(flattening,[status(thm)],[f6]) ).

thf(f6,plain,
    ( ( ( cP @ ( g @ ( f @ ( f @ a ) ) ) )
     != $true )
    & ( ( cP @ ( f @ ( f @ ( g @ a ) ) ) )
      = $true )
    & ( ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) )
      = ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) ) ) ),
    inference(ennf_transformation,[status(thm)],[f5]) ).

thf(f5,plain,
    ~ ( ( ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) )
        = ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) ) )
     => ( ( ( cP @ ( f @ ( f @ ( g @ a ) ) ) )
          = $true )
       => ( ( cP @ ( g @ ( f @ ( f @ a ) ) ) )
          = $true ) ) ),
    inference(fool_elimination,[status(thm)],[f4]) ).

thf(f4,plain,
    ~ ( ( ( ^ [X0: $i] : ( g @ ( f @ X0 ) ) )
        = ( ^ [X1: $i] : ( f @ ( g @ X1 ) ) ) )
     => ( ( cP @ ( f @ ( f @ ( g @ a ) ) ) )
       => ( cP @ ( g @ ( f @ ( f @ a ) ) ) ) ) ),
    inference(rectify,[status(thm)],[f2]) ).

thf(f2,negated_conjecture,
    ~ ( ( ( ^ [X0: $i] : ( g @ ( f @ X0 ) ) )
        = ( ^ [X0: $i] : ( f @ ( g @ X0 ) ) ) )
     => ( ( cP @ ( f @ ( f @ ( g @ a ) ) ) )
       => ( cP @ ( g @ ( f @ ( f @ a ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f1,conjecture,
    ( ( ( ^ [X0: $i] : ( g @ ( f @ X0 ) ) )
      = ( ^ [X0: $i] : ( f @ ( g @ X0 ) ) ) )
   => ( ( cP @ ( f @ ( f @ ( g @ a ) ) ) )
     => ( cP @ ( g @ ( f @ ( f @ a ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.ozqCesimWr/DTF2THF_14083.p',cTHM128_pme) ).

thf(f14,plain,
    ( ( cP @ ( f @ ( f @ ( g @ a ) ) ) )
   != $true ),
    inference(superposition,[status(thm)],[f13,f12]) ).

thf(f12,plain,
    ! [X1: $i] :
      ( ( f @ ( g @ X1 ) )
      = ( g @ ( f @ X1 ) ) ),
    inference(beta_eta_normalization,[status(thm)],[f11]) ).

thf(f11,plain,
    ! [X1: $i] :
      ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) )
        @ X1 )
      = ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) )
        @ X1 ) ),
    inference(argument_congruence,[status(thm)],[f8]) ).

thf(f8,plain,
    ( ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) )
    = ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) ) ),
    inference(cnf_transformation,[status(thm)],[f7]) ).

thf(f13,plain,
    ( $true
   != ( cP @ ( f @ ( g @ ( f @ a ) ) ) ) ),
    inference(superposition,[status(thm)],[f10,f12]) ).

thf(f10,plain,
    ( ( cP @ ( g @ ( f @ ( f @ a ) ) ) )
   != $true ),
    inference(cnf_transformation,[status(thm)],[f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SEU922^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.31  % Computer : n025.cluster.edu
% 0.12/0.31  % Model    : x86_64 x86_64
% 0.12/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31  % Memory   : 8042.1875MB
% 0.12/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31  % CPULimit : 300
% 0.12/0.31  % WCLimit  : 300
% 0.12/0.31  % DateTime : Tue Feb 24 12:37:12 EST 2026
% 0.12/0.31  % CPUTime  : 
% 0.12/0.31  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/0.40  ---- Original DTF file ---
% 0.15/0.40  thf(spec,logic,$$dhol).
% 0.15/0.40  %------------------------------------------------------------------------------
% 0.15/0.40  % File     : SEU922^5 : TPTP v9.2.1. Released v4.0.0.
% 0.15/0.40  % Domain   : Set Theory (Functions)
% 0.15/0.40  % Problem  : TPS problem THM128
% 0.15/0.40  % Version  : Especial.
% 0.15/0.40  % English  : 
% 0.15/0.40  
% 0.15/0.40  % Refs     : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.15/0.40  % Source   : [Bro09]
% 0.15/0.40  % Names    : tps_0118 [Bro09]
% 0.15/0.40  %          : THM128 [TPS]
% 0.15/0.40  
% 0.15/0.40  % Status   : Theorem
% 0.15/0.40  % 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.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.15/0.40  % Syntax   : Number of formulae    :    5 (   0 unt;   4 typ;   0 def)
% 0.15/0.40  %            Number of atoms       :    3 (   1 equ;   0 cnn)
% 0.15/0.40  %            Maximal formula atoms :    3 (   3 avg)
% 0.15/0.40  %            Number of connectives :   14 (   0   ~;   0   |;   0   &;  12   @)
% 0.15/0.40  %                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
% 0.15/0.40  %            Maximal formula depth :    7 (   7 avg)
% 0.15/0.40  %            Number of types       :    2 (   0 usr)
% 0.15/0.40  %            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
% 0.15/0.40  %            Number of symbols     :    5 (   4 usr;   1 con; 0-2 aty)
% 0.15/0.40  %            Number of variables   :    2 (   2   ^;   0   !;   0   ?;   2   :)
% 0.15/0.40  % SPC      : TH0_THM_EQU_NAR
% 0.15/0.40  
% 0.15/0.40  % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.15/0.40  %            project in the Department of Mathematical Sciences at Carnegie
% 0.15/0.40  %            Mellon University. Distributed under the Creative Commons copyleft
% 0.15/0.40  %            license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.15/0.40  %          : Polymorphic definitions expanded.
% 0.15/0.40  %------------------------------------------------------------------------------
% 0.15/0.40  thf(a,type,
% 0.15/0.40      a: $i ).
% 0.15/0.40  
% 0.15/0.40  thf(f,type,
% 0.15/0.40      f: $i > $i ).
% 0.15/0.40  
% 0.15/0.40  thf(g,type,
% 0.15/0.40      g: $i > $i ).
% 0.15/0.40  
% 0.15/0.40  thf(cP,type,
% 0.15/0.40      cP: $i > $o ).
% 0.15/0.40  
% 0.15/0.40  thf(cTHM128_pme,conjecture,
% 0.15/0.40      ( ( ( ^ [Xx: $i] : ( f @ ( g @ Xx ) ) )
% 0.15/0.40        = ( ^ [Xx: $i] : ( g @ ( f @ Xx ) ) ) )
% 0.15/0.40     => ( ( cP @ ( f @ ( f @ ( g @ a ) ) ) )
% 0.15/0.40       => ( cP @ ( g @ ( f @ ( f @ a ) ) ) ) ) ) ).
% 0.15/0.40  
% 0.15/0.40  %------------------------------------------------------------------------------
% 0.15/0.40  ------------------------
% 1.30/1.29  ---- Embedded in THF ---
% 1.49/1.30  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.49/1.30  %%% Generated on Tue Feb 24 12:37:13 EST 2026
% 1.49/1.30  %%% using '$$dhol' embedding, version 1.3.0.
% 1.49/1.30  %%% Logic specification used:
% 1.49/1.30  %%% thf(spec, logic, $$dhol).
% 1.49/1.30  
% 1.49/1.30  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.ozqCesimWr/DTF2DTF14083.p
% See solution above
% 1.49/1.30  ------------------------
% 1.49/1.30  ---- Cleaned THF ---
% 1.49/1.30  thf(a,type,
% 1.49/1.30      a: $i ).
% 1.49/1.30  
% 1.49/1.30  thf(f,type,
% 1.49/1.30      f: $i > $i ).
% 1.49/1.30  
% 1.49/1.30  thf(g,type,
% 1.49/1.30      g: $i > $i ).
% 1.49/1.30  
% 1.49/1.30  thf(cP,type,
% 1.49/1.30      cP: $i > $o ).
% 1.49/1.30  
% 1.49/1.30  thf(cTHM128_pme,conjecture,
% 1.49/1.30      ( ( ( ^ [Xx: $i] : ( f @ ( g @ Xx ) ) )
% 1.49/1.30        = ( ^ [Xx: $i] : ( g @ ( f @ Xx ) ) ) )
% 1.49/1.30     => ( ( cP @ ( f @ ( f @ ( g @ a ) ) ) )
% 1.49/1.30       => ( cP @ ( g @ ( f @ ( f @ a ) ) ) ) ) ) ).
% 1.49/1.30  ------------------------
% 1.49/1.32  % (14184)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_14083 for (2999ds/183Mi)
% 1.49/1.32  % (14184)First to succeed.
% 1.49/1.32  % (14189)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_14083 for (2999ds/275Mi)
% 1.49/1.32  % (14187)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_14083 for (2999ds/2Mi)
% 1.49/1.32  % (14186)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_14083 for (2999ds/27Mi)
% 1.49/1.32  % (14190)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_14083 for (2999ds/18Mi)
% 1.49/1.32  % (14188)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_14083 for (2999ds/2Mi)
% 1.49/1.32  % (14185)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_14083 for (2999ds/4Mi)
% 1.49/1.33  % (14184)Refutation found. Thanks to Tanya!
% 1.49/1.33  % SZS status Theorem for DTF2THF_14083
% 1.49/1.33  % SZS output start Proof for DTF2THF_14083
% 1.49/1.33  thf(func_def_1, type, f: $i > $i).
% 1.49/1.33  thf(func_def_2, type, g: $i > $i).
% 1.49/1.33  thf(func_def_3, type, cP: $i > $o).
% 1.49/1.33  thf(func_def_10, type, ph1: !>[X0: $tType]:(X0)).
% 1.49/1.33  thf(f15,plain,(
% 1.49/1.33    $false),
% 1.49/1.33    inference(subsumption_resolution,[status(thm)],[f14,f9])).
% 1.49/1.33  thf(f9,plain,(
% 1.49/1.33    ((cP @ (f @ (f @ (g @ a)))) = $true)),
% 1.49/1.33    inference(cnf_transformation,[status(thm)],[f7])).
% 1.49/1.33  thf(f7,plain,(
% 1.49/1.33    ((cP @ (g @ (f @ (f @ a)))) != $true) & ((cP @ (f @ (f @ (g @ a)))) = $true) & ((^[Y0 : $i]: (g @ (f @ Y0))) = (^[Y0 : $i]: (f @ (g @ Y0))))),
% 1.49/1.33    inference(flattening,[status(thm)],[f6])).
% 1.49/1.33  thf(f6,plain,(
% 1.49/1.33    (((cP @ (g @ (f @ (f @ a)))) != $true) & ((cP @ (f @ (f @ (g @ a)))) = $true)) & ((^[Y0 : $i]: (g @ (f @ Y0))) = (^[Y0 : $i]: (f @ (g @ Y0))))),
% 1.49/1.33    inference(ennf_transformation,[status(thm)],[f5])).
% 1.49/1.33  thf(f5,plain,(
% 1.49/1.33    ~(((^[Y0 : $i]: (g @ (f @ Y0))) = (^[Y0 : $i]: (f @ (g @ Y0)))) => (((cP @ (f @ (f @ (g @ a)))) = $true) => ((cP @ (g @ (f @ (f @ a)))) = $true)))),
% 1.49/1.33    inference(fool_elimination,[status(thm)],[f4])).
% 1.49/1.33  thf(f4,plain,(
% 1.49/1.33    ~(((^[X0 : $i] : (g @ (f @ X0))) = (^[X1 : $i] : (f @ (g @ X1)))) => ((cP @ (f @ (f @ (g @ a)))) => (cP @ (g @ (f @ (f @ a))))))),
% 1.49/1.33    inference(rectify,[status(thm)],[f2])).
% 1.49/1.33  thf(f2,negated_conjecture,(
% 1.49/1.33    ~(((^[X0 : $i] : (g @ (f @ X0))) = (^[X0 : $i] : (f @ (g @ X0)))) => ((cP @ (f @ (f @ (g @ a)))) => (cP @ (g @ (f @ (f @ a))))))),
% 1.49/1.33    inference(negated_conjecture,[status(cth)],[f1])).
% 1.49/1.33  thf(f1,conjecture,(
% 1.49/1.33    ((^[X0 : $i] : (g @ (f @ X0))) = (^[X0 : $i] : (f @ (g @ X0)))) => ((cP @ (f @ (f @ (g @ a)))) => (cP @ (g @ (f @ (f @ a)))))),
% 1.49/1.33    file('/export/starexec/sandbox/tmp/tmp.ozqCesimWr/DTF2THF_14083.p',cTHM128_pme)).
% 1.49/1.33  thf(f14,plain,(
% 1.49/1.33    ((cP @ (f @ (f @ (g @ a)))) != $true)),
% 1.49/1.33    inference(superposition,[status(thm)],[f13,f12])).
% 1.49/1.33  thf(f12,plain,(
% 1.49/1.33    ( ! [X1 : $i] : (((f @ (g @ X1)) = (g @ (f @ X1)))) )),
% 1.49/1.33    inference(beta_eta_normalization,[status(thm)],[f11])).
% 1.49/1.33  thf(f11,plain,(
% 1.49/1.33    ( ! [X1 : $i] : ((((^[Y0 : $i]: (f @ (g @ Y0))) @ X1) = ((^[Y0 : $i]: (g @ (f @ Y0))) @ X1))) )),
% 1.49/1.33    inference(argument_congruence,[status(thm)],[f8])).
% 1.49/1.33  thf(f8,plain,(
% 1.49/1.33    ((^[Y0 : $i]: (g @ (f @ Y0))) = (^[Y0 : $i]: (f @ (g @ Y0))))),
% 1.49/1.33    inference(cnf_transformation,[status(thm)],[f7])).
% 1.49/1.33  thf(f13,plain,(
% 1.49/1.33    ($true != (cP @ (f @ (g @ (f @ a)))))),
% 1.49/1.33    inference(superposition,[status(thm)],[f10,f12])).
% 1.49/1.33  thf(f10,plain,(
% 1.49/1.33    ((cP @ (g @ (f @ (f @ a)))) != $true)),
% 1.49/1.33    inference(cnf_transformation,[status(thm)],[f7])).
% 1.49/1.33  % SZS output end Proof for DTF2THF_14083
% 1.49/1.33  % (14184)------------------------------
% 1.49/1.33  % (14184)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.33  % (14184)Termination reason: Refutation
% 1.49/1.33  
% 1.49/1.33  % (14184)Memory used [KB]: 5500
% 1.49/1.33  % (14184)Time elapsed: 0.002 s
% 1.49/1.33  % (14184)Instructions burned: 2 (million)
% 1.49/1.33  % (14184)------------------------------
% 1.49/1.33  % (14184)------------------------------
% 1.49/1.33  % (14183)Success in time 0.007 s
%------------------------------------------------------------------------------