↑ Up

DT2H2X---1.9.5.THM-Ref.s

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

% Computer : n018.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:24:44 AM UTC 2026

% Result   : Theorem 1.46s 1.28s
% Output   : Refutation 1.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :  110 (  32 equ;   0 cnn)
%            Maximal formula atoms :    3 (   4 avg)
%            Number of connectives :  136 (  26   ~;   9   |;   1   &;  88   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (   0   ^;  14   !;   0   ?;  14   :)

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

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

thf(func_def_1,type,
    x0: rat ).

thf(func_def_2,type,
    y0: rat ).

thf(func_def_3,type,
    more: rat > rat > $o ).

thf(func_def_4,type,
    is: rat > rat > $o ).

thf(func_def_6,type,
    less: rat > rat > $o ).

thf(f32,plain,
    $false,
    inference(subsumption_resolution,[status(thm)],[f31,f25]) ).

thf(f25,plain,
    ( ( more @ x0 @ y0 )
   != $true ),
    inference(cnf_transformation,[status(thm)],[f21]) ).

thf(f21,plain,
    ( ( ( is @ x0 @ y0 )
     != $true )
    & ( ( more @ x0 @ y0 )
     != $true ) ),
    inference(ennf_transformation,[status(thm)],[f16]) ).

thf(f16,plain,
    ~ ( ( ( more @ x0 @ y0 )
       != $true )
     => ( ( is @ x0 @ y0 )
        = $true ) ),
    inference(flattening,[status(thm)],[f10]) ).

thf(f10,plain,
    ~ ( ( ( more @ x0 @ y0 )
       != $true )
     => ( ( is @ x0 @ y0 )
        = $true ) ),
    inference(fool_elimination,[status(thm)],[f9]) ).

thf(f9,plain,
    ~ ( ~ ( more @ x0 @ y0 )
     => ( is @ x0 @ y0 ) ),
    inference(rectify,[status(thm)],[f1]) ).

thf(f1,axiom,
    ~ ( ~ ( more @ x0 @ y0 )
     => ( is @ x0 @ y0 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.lHRQeTpRHq/DTF2THF_13940.p',n) ).

thf(f31,plain,
    ( ( more @ x0 @ y0 )
    = $true ),
    inference(subsumption_resolution,[status(thm)],[f30,f26]) ).

thf(f26,plain,
    ( ( is @ x0 @ y0 )
   != $true ),
    inference(cnf_transformation,[status(thm)],[f21]) ).

thf(f30,plain,
    ( ( ( is @ x0 @ y0 )
      = $true )
    | ( ( more @ x0 @ y0 )
      = $true ) ),
    inference(trivial_inequality_removal,[status(thm)],[f29]) ).

thf(f29,plain,
    ( ( ( is @ x0 @ y0 )
      = $true )
    | ( ( more @ x0 @ y0 )
      = $true )
    | ( $true != $true ) ),
    inference(superposition,[status(thm)],[f23,f24]) ).

thf(f24,plain,
    ! [X0: rat,X1: rat] :
      ( ( ( less @ X0 @ X1 )
        = $true )
      | ( ( is @ X0 @ X1 )
        = $true )
      | ( ( more @ X0 @ X1 )
        = $true ) ),
    inference(cnf_transformation,[status(thm)],[f20]) ).

thf(f20,plain,
    ! [X0: rat,X1: rat] :
      ( ( ( more @ X0 @ X1 )
        = $true )
      | ( ( is @ X0 @ X1 )
        = $true )
      | ( ( less @ X0 @ X1 )
        = $true ) ),
    inference(flattening,[status(thm)],[f19]) ).

thf(f19,plain,
    ! [X1: rat,X0: rat] :
      ( ( ( less @ X0 @ X1 )
        = $true )
      | ( ( more @ X0 @ X1 )
        = $true )
      | ( ( is @ X0 @ X1 )
        = $true ) ),
    inference(ennf_transformation,[status(thm)],[f15]) ).

thf(f15,plain,
    ! [X1: rat,X0: rat] :
      ( ( ( is @ X0 @ X1 )
       != $true )
     => ( ( ( more @ X0 @ X1 )
         != $true )
       => ( ( less @ X0 @ X1 )
          = $true ) ) ),
    inference(flattening,[status(thm)],[f8]) ).

thf(f8,plain,
    ! [X0: rat,X1: rat] :
      ( ( ( is @ X0 @ X1 )
       != $true )
     => ( ( ( more @ X0 @ X1 )
         != $true )
       => ( ( less @ X0 @ X1 )
          = $true ) ) ),
    inference(fool_elimination,[status(thm)],[f7]) ).

thf(f7,plain,
    ! [X0: rat,X1: rat] :
      ( ~ ( is @ X0 @ X1 )
     => ( ~ ( more @ X0 @ X1 )
       => ( less @ X0 @ X1 ) ) ),
    inference(rectify,[status(thm)],[f2]) ).

thf(f2,axiom,
    ! [X0: rat,X1: rat] :
      ( ~ ( is @ X0 @ X1 )
     => ( ~ ( more @ X0 @ X1 )
       => ( less @ X0 @ X1 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.lHRQeTpRHq/DTF2THF_13940.p',satz81a) ).

thf(f23,plain,
    ( ( less @ x0 @ y0 )
   != $true ),
    inference(cnf_transformation,[status(thm)],[f18]) ).

thf(f18,plain,
    ( ( less @ x0 @ y0 )
   != $true ),
    inference(flattening,[status(thm)],[f14]) ).

thf(f14,plain,
    ( ( less @ x0 @ y0 )
   != $true ),
    inference(fool_elimination,[status(thm)],[f13]) ).

thf(f13,plain,
    ~ ( less @ x0 @ y0 ),
    inference(rectify,[status(thm)],[f5]) ).

thf(f5,negated_conjecture,
    ~ ( less @ x0 @ y0 ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

thf(f4,conjecture,
    less @ x0 @ y0,
    file('/export/starexec/sandbox2/tmp/tmp.lHRQeTpRHq/DTF2THF_13940.p',satz81j) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM790^1 : TPTP v9.2.1. Released v3.7.0.
% 0.11/0.13  % Command  : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.34  % Computer : n018.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Tue Feb 24 11:14:16 EST 2026
% 0.17/0.34  % CPUTime  : 
% 0.17/0.34  Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.26/0.47  ---- Original DTF file ---
% 0.26/0.47  thf(spec,logic,$$dhol).
% 0.26/0.47  %------------------------------------------------------------------------------
% 0.26/0.47  % File     : NUM790^1 : TPTP v9.2.1. Released v3.7.0.
% 0.26/0.47  % Domain   : Number Theory
% 0.26/0.47  % Problem  : Landau theorem 81j
% 0.26/0.47  % Version  : Especial.
% 0.26/0.47  % English  : less x0 y0
% 0.26/0.47  
% 0.26/0.47  % Refs     : [Lan30] Landau (1930), Grundlagen der Analysis
% 0.26/0.47  %          : [vBJ79] van Benthem Jutting (1979), Checking Landau's "Grundla
% 0.26/0.47  %          : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.26/0.47  % Source   : [Bro09]
% 0.26/0.47  % Names    : satz81j [Lan30]
% 0.26/0.47  %          : satz41j [Lan30]
% 0.26/0.47  
% 0.26/0.47  % Status   : Theorem
% 0.26/0.47  %          : Without extensionality : Theorem
% 0.26/0.47  % Rating   : 0.08 v9.1.0, 0.00 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v3.7.0
% 0.26/0.47  % Syntax   : Number of formulae    :   10 (   1 unt;   6 typ;   0 def)
% 0.26/0.47  %            Number of atoms       :    6 (   0 equ;   0 cnn)
% 0.26/0.47  %            Maximal formula atoms :    3 (   1 avg)
% 0.26/0.47  %            Number of connectives :   22 (   6   ~;   0   |;   0   &;  12   @)
% 0.26/0.47  %                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
% 0.26/0.47  %            Maximal formula depth :    8 (   6 avg)
% 0.26/0.47  %            Number of types       :    2 (   1 usr)
% 0.26/0.47  %            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
% 0.26/0.47  %            Number of symbols     :    5 (   5 usr;   2 con; 0-2 aty)
% 0.26/0.47  %            Number of variables   :    3 (   0   ^;   3   !;   0   ?;   3   :)
% 0.26/0.47  % SPC      : TH0_THM_NEQ_NAR
% 0.26/0.47  
% 0.26/0.47  % Comments : 
% 0.26/0.47  %------------------------------------------------------------------------------
% 0.26/0.47  thf(rat_type,type,
% 0.26/0.47      rat: $tType ).
% 0.26/0.47  
% 0.26/0.47  thf(x0,type,
% 0.26/0.47      x0: rat ).
% 0.26/0.47  
% 0.26/0.47  thf(y0,type,
% 0.26/0.47      y0: rat ).
% 0.26/0.47  
% 0.26/0.47  thf(more,type,
% 0.26/0.47      more: rat > rat > $o ).
% 0.26/0.47  
% 0.26/0.47  thf(is,type,
% 0.26/0.47      is: rat > rat > $o ).
% 0.26/0.47  
% 0.26/0.47  thf(n,axiom,
% 0.26/0.47      ~ ( ~ ( more @ x0 @ y0 )
% 0.26/0.47       => ( is @ x0 @ y0 ) ) ).
% 0.26/0.47  
% 0.26/0.47  thf(less,type,
% 0.26/0.47      less: rat > rat > $o ).
% 0.26/0.47  
% 0.26/0.47  thf(satz81a,axiom,
% 0.26/0.47      ! [Xx0: rat,Xy0: rat] :
% 0.26/0.47        ( ~ ( is @ Xx0 @ Xy0 )
% 0.26/0.47       => ( ~ ( more @ Xx0 @ Xy0 )
% 0.26/0.47         => ( less @ Xx0 @ Xy0 ) ) ) ).
% 0.26/0.47  
% 0.26/0.47  thf(et,axiom,
% 0.26/0.47      ! [Xa: $o] :
% 0.26/0.47        ( ~ ~ Xa
% 0.26/0.47       => Xa ) ).
% 0.26/0.47  
% 0.26/0.47  thf(satz81j,conjecture,
% 0.26/0.47      less @ x0 @ y0 ).
% 0.26/0.47  
% 0.26/0.47  %------------------------------------------------------------------------------
% 0.26/0.47  ------------------------
% 1.46/1.26  ---- Embedded in THF ---
% 1.46/1.26  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.46/1.26  %%% Generated on Tue Feb 24 11:14:16 EST 2026
% 1.46/1.26  %%% using '$$dhol' embedding, version 1.3.0.
% 1.46/1.26  %%% Logic specification used:
% 1.46/1.26  %%% thf(spec, logic, $$dhol).
% 1.46/1.26  
% 1.46/1.26  % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.lHRQeTpRHq/DTF2DTF13940.p
% See solution above
% 1.46/1.26  ------------------------
% 1.46/1.27  ---- Cleaned THF ---
% 1.46/1.27  thf(rat_type,type,
% 1.46/1.27      rat: $tType ).
% 1.46/1.27  
% 1.46/1.27  thf(x0,type,
% 1.46/1.27      x0: rat ).
% 1.46/1.27  
% 1.46/1.27  thf(y0,type,
% 1.46/1.27      y0: rat ).
% 1.46/1.27  
% 1.46/1.27  thf(more,type,
% 1.46/1.27      more: rat > rat > $o ).
% 1.46/1.27  
% 1.46/1.27  thf(is,type,
% 1.46/1.27      is: rat > rat > $o ).
% 1.46/1.27  
% 1.46/1.27  thf(n,axiom,
% 1.46/1.27      ~ ( ~ ( more @ x0 @ y0 )
% 1.46/1.27       => ( is @ x0 @ y0 ) ) ).
% 1.46/1.27  
% 1.46/1.27  thf(less,type,
% 1.46/1.27      less: rat > rat > $o ).
% 1.46/1.27  
% 1.46/1.27  thf(satz81a,axiom,
% 1.46/1.27      ! [Xx0: rat,Xy0: rat] :
% 1.46/1.27        ( ~ ( is @ Xx0 @ Xy0 )
% 1.46/1.27       => ( ~ ( more @ Xx0 @ Xy0 )
% 1.46/1.27         => ( less @ Xx0 @ Xy0 ) ) ) ).
% 1.46/1.27  
% 1.46/1.27  thf(et,axiom,
% 1.46/1.27      ! [Xa: $o] :
% 1.46/1.27        ( ~ ~ Xa
% 1.46/1.27       => Xa ) ).
% 1.46/1.27  
% 1.46/1.27  thf(satz81j,conjecture,
% 1.46/1.27      less @ x0 @ y0 ).
% 1.46/1.27  ------------------------
% 1.46/1.28  % (14043)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_13940 for (3000ds/18Mi)
% 1.46/1.28  % (14037)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_13940 for (3000ds/183Mi)
% 1.46/1.28  % (14039)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_13940 for (3000ds/27Mi)
% 1.46/1.28  % (14043)First to succeed.
% 1.46/1.28  % (14043)Refutation found. Thanks to Tanya!
% 1.46/1.28  % SZS status Theorem for DTF2THF_13940
% 1.46/1.28  % SZS output start Proof for DTF2THF_13940
% 1.46/1.28  thf(type_def_5, type, rat: $tType).
% 1.46/1.28  thf(func_def_0, type, rat: $tType).
% 1.46/1.28  thf(func_def_1, type, x0: rat).
% 1.46/1.28  thf(func_def_2, type, y0: rat).
% 1.46/1.28  thf(func_def_3, type, more: rat > rat > $o).
% 1.46/1.28  thf(func_def_4, type, is: rat > rat > $o).
% 1.46/1.28  thf(func_def_6, type, less: rat > rat > $o).
% 1.46/1.28  thf(f32,plain,(
% 1.46/1.28    $false),
% 1.46/1.28    inference(subsumption_resolution,[status(thm)],[f31,f25])).
% 1.46/1.28  thf(f25,plain,(
% 1.46/1.28    ((more @ x0 @ y0) != $true)),
% 1.46/1.28    inference(cnf_transformation,[status(thm)],[f21])).
% 1.46/1.28  thf(f21,plain,(
% 1.46/1.28    ((is @ x0 @ y0) != $true) & ((more @ x0 @ y0) != $true)),
% 1.46/1.28    inference(ennf_transformation,[status(thm)],[f16])).
% 1.46/1.28  thf(f16,plain,(
% 1.46/1.28    ~(((more @ x0 @ y0) != $true) => ((is @ x0 @ y0) = $true))),
% 1.46/1.28    inference(flattening,[status(thm)],[f10])).
% 1.46/1.28  thf(f10,plain,(
% 1.46/1.28    ~(~((more @ x0 @ y0) = $true) => ((is @ x0 @ y0) = $true))),
% 1.46/1.28    inference(fool_elimination,[status(thm)],[f9])).
% 1.46/1.28  thf(f9,plain,(
% 1.46/1.28    ~(~(more @ x0 @ y0) => (is @ x0 @ y0))),
% 1.46/1.28    inference(rectify,[status(thm)],[f1])).
% 1.46/1.28  thf(f1,axiom,(
% 1.46/1.28    ~(~(more @ x0 @ y0) => (is @ x0 @ y0))),
% 1.46/1.28    file('/export/starexec/sandbox2/tmp/tmp.lHRQeTpRHq/DTF2THF_13940.p',n)).
% 1.46/1.28  thf(f31,plain,(
% 1.46/1.28    ((more @ x0 @ y0) = $true)),
% 1.46/1.28    inference(subsumption_resolution,[status(thm)],[f30,f26])).
% 1.46/1.28  thf(f26,plain,(
% 1.46/1.28    ((is @ x0 @ y0) != $true)),
% 1.46/1.28    inference(cnf_transformation,[status(thm)],[f21])).
% 1.46/1.28  thf(f30,plain,(
% 1.46/1.28    ((is @ x0 @ y0) = $true) | ((more @ x0 @ y0) = $true)),
% 1.46/1.28    inference(trivial_inequality_removal,[status(thm)],[f29])).
% 1.46/1.28  thf(f29,plain,(
% 1.46/1.28    ((is @ x0 @ y0) = $true) | ((more @ x0 @ y0) = $true) | ($true != $true)),
% 1.46/1.28    inference(superposition,[status(thm)],[f23,f24])).
% 1.46/1.28  thf(f24,plain,(
% 1.46/1.28    ( ! [X0 : rat,X1 : rat] : (((less @ X0 @ X1) = $true) | ((is @ X0 @ X1) = $true) | ((more @ X0 @ X1) = $true)) )),
% 1.46/1.28    inference(cnf_transformation,[status(thm)],[f20])).
% 1.46/1.28  thf(f20,plain,(
% 1.46/1.28    ! [X0 : rat,X1 : rat] : (((more @ X0 @ X1) = $true) | ((is @ X0 @ X1) = $true) | ((less @ X0 @ X1) = $true))),
% 1.46/1.28    inference(flattening,[status(thm)],[f19])).
% 1.46/1.28  thf(f19,plain,(
% 1.46/1.28    ! [X1 : rat,X0 : rat] : ((((less @ X0 @ X1) = $true) | ((more @ X0 @ X1) = $true)) | ((is @ X0 @ X1) = $true))),
% 1.46/1.28    inference(ennf_transformation,[status(thm)],[f15])).
% 1.46/1.28  thf(f15,plain,(
% 1.46/1.28    ! [X1 : rat,X0 : rat] : (((is @ X0 @ X1) != $true) => (((more @ X0 @ X1) != $true) => ((less @ X0 @ X1) = $true)))),
% 1.46/1.28    inference(flattening,[status(thm)],[f8])).
% 1.46/1.28  thf(f8,plain,(
% 1.46/1.28    ! [X0 : rat,X1 : rat] : (~((is @ X0 @ X1) = $true) => (~((more @ X0 @ X1) = $true) => ((less @ X0 @ X1) = $true)))),
% 1.46/1.28    inference(fool_elimination,[status(thm)],[f7])).
% 1.46/1.28  thf(f7,plain,(
% 1.46/1.28    ! [X0 : rat,X1 : rat] : (~(is @ X0 @ X1) => (~(more @ X0 @ X1) => (less @ X0 @ X1)))),
% 1.46/1.28    inference(rectify,[status(thm)],[f2])).
% 1.46/1.28  thf(f2,axiom,(
% 1.46/1.28    ! [X0 : rat,X1 : rat] : (~(is @ X0 @ X1) => (~(more @ X0 @ X1) => (less @ X0 @ X1)))),
% 1.46/1.28    file('/export/starexec/sandbox2/tmp/tmp.lHRQeTpRHq/DTF2THF_13940.p',satz81a)).
% 1.46/1.28  thf(f23,plain,(
% 1.46/1.28    ((less @ x0 @ y0) != $true)),
% 1.46/1.28    inference(cnf_transformation,[status(thm)],[f18])).
% 1.46/1.28  thf(f18,plain,(
% 1.46/1.28    ((less @ x0 @ y0) != $true)),
% 1.46/1.28    inference(flattening,[status(thm)],[f14])).
% 1.46/1.28  thf(f14,plain,(
% 1.46/1.28    ~((less @ x0 @ y0) = $true)),
% 1.46/1.28    inference(fool_elimination,[status(thm)],[f13])).
% 1.46/1.28  thf(f13,plain,(
% 1.46/1.28    ~(less @ x0 @ y0)),
% 1.46/1.28    inference(rectify,[status(thm)],[f5])).
% 1.46/1.28  thf(f5,negated_conjecture,(
% 1.46/1.28    ~(less @ x0 @ y0)),
% 1.46/1.28    inference(negated_conjecture,[status(cth)],[f4])).
% 1.46/1.28  thf(f4,conjecture,(
% 1.46/1.28    (less @ x0 @ y0)),
% 1.46/1.28    file('/export/starexec/sandbox2/tmp/tmp.lHRQeTpRHq/DTF2THF_13940.p',satz81j)).
% 1.46/1.28  % SZS output end Proof for DTF2THF_13940
% 1.46/1.28  % (14043)------------------------------
% 1.46/1.28  % (14043)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.46/1.28  % (14043)Termination reason: Refutation
% 1.46/1.28  
% 1.46/1.28  % (14043)Memory used [KB]: 5500
% 1.46/1.28  % (14043)Time elapsed: 0.002 s
% 1.46/1.28  % (14043)Instructions burned: 2 (million)
% 1.46/1.28  % (14043)------------------------------
% 1.46/1.28  % (14043)------------------------------
% 1.46/1.28  % (14036)Success in time 0.011 s
%------------------------------------------------------------------------------