↑ Up

DT2H2X---1.9.5.THM-Ref.s

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

% Result   : Theorem 1.55s 1.36s
% Output   : Refutation 1.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   72 (  24 equ;   0 cnn)
%            Maximal formula atoms :    6 (   6 avg)
%            Number of connectives :  105 (  15   ~;   6   |;  10   &;  68   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   36 (   2   ^;  20   !;  14   ?;  36   :)

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_0,type,
    q: $i > $i > $o ).

thf(func_def_1,type,
    p: $i > $i > $o ).

thf(func_def_5,type,
    sK0: ( $i > $o ) > $i ).

thf(func_def_6,type,
    sK1: $i > ( $i > $o ) > $i ).

thf(func_def_8,type,
    ph3: 
      !>[X0: $tType] : X0 ).

thf(f16,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[f15]) ).

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

thf(f13,plain,
    ! [X2: $i] :
      ( $true
      = ( ^ [Y0: $i] : $false
        @ ( sK1 @ X2
          @ ^ [Y0: $i] : $false ) ) ),
    inference(primitive_instantiation,[status(thm)],[f11]) ).

thf(f11,plain,
    ! [X2: $i,X0: $i > $o] :
      ( $true
      = ( X0 @ ( sK1 @ X2 @ X0 ) ) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

thf(f9,plain,
    ! [X0: $i > $o,X2: $i] :
      ( ( $true
        = ( X0 @ ( sK1 @ X2 @ X0 ) ) )
      & ( ( ( q @ ( sK0 @ X0 ) @ X2 )
         != $true )
        | ( ( p @ ( sK1 @ X2 @ X0 ) @ X2 )
         != $true ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).

thf(f7,plain,
    ! [X0: $i > $o] :
      ( ? [X1: $i] :
        ! [X2: $i] :
        ? [X3: $i] :
          ( ( ( X0 @ X3 )
            = $true )
          & ( ( ( q @ X1 @ X2 )
             != $true )
            | ( ( p @ X3 @ X2 )
             != $true ) ) )
     => ! [X2: $i] :
        ? [X3: $i] :
          ( ( ( X0 @ X3 )
            = $true )
          & ( ( ( q @ ( sK0 @ X0 ) @ X2 )
             != $true )
            | ( ( p @ X3 @ X2 )
             != $true ) ) ) ),
    introduced(definition,[],[choice_axiom]) ).

thf(f8,plain,
    ! [X0: $i > $o,X2: $i] :
      ( ? [X3: $i] :
          ( ( ( X0 @ X3 )
            = $true )
          & ( ( ( q @ ( sK0 @ X0 ) @ X2 )
             != $true )
            | ( ( p @ X3 @ X2 )
             != $true ) ) )
     => ( ( $true
          = ( X0 @ ( sK1 @ X2 @ X0 ) ) )
        & ( ( ( q @ ( sK0 @ X0 ) @ X2 )
           != $true )
          | ( ( p @ ( sK1 @ X2 @ X0 ) @ X2 )
           != $true ) ) ) ),
    introduced(definition,[],[choice_axiom]) ).

thf(f6,plain,
    ! [X0: $i > $o] :
    ? [X1: $i] :
    ! [X2: $i] :
    ? [X3: $i] :
      ( ( ( X0 @ X3 )
        = $true )
      & ( ( ( q @ X1 @ X2 )
         != $true )
        | ( ( p @ X3 @ X2 )
         != $true ) ) ),
    inference(ennf_transformation,[status(thm)],[f5]) ).

thf(f5,plain,
    ~ ? [X0: $i > $o] :
      ! [X1: $i] :
      ? [X2: $i] :
      ! [X3: $i] :
        ( ( ( X0 @ X3 )
          = $true )
       => ( ( ( p @ X3 @ X2 )
            = $true )
          & ( ( q @ X1 @ X2 )
            = $true ) ) ),
    inference(fool_elimination,[status(thm)],[f4]) ).

thf(f4,plain,
    ~ ? [X0: $i > $o] :
      ! [X1: $i] :
      ? [X2: $i] :
      ! [X3: $i] :
        ( ( X0 @ X3 )
       => ( ( q @ X1 @ X2 )
          & ( p @ X3 @ X2 ) ) ),
    inference(rectify,[status(thm)],[f2]) ).

thf(f2,negated_conjecture,
    ~ ? [X0: $i > $o] :
      ! [X1: $i] :
      ? [X2: $i] :
      ! [X3: $i] :
        ( ( X0 @ X3 )
       => ( ( q @ X1 @ X2 )
          & ( p @ X3 @ X2 ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f1,conjecture,
    ? [X0: $i > $o] :
    ! [X1: $i] :
    ? [X2: $i] :
    ! [X3: $i] :
      ( ( X0 @ X3 )
     => ( ( q @ X1 @ X2 )
        & ( p @ X3 @ X2 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.Jwp3BxiTpi/DTF2THF_30572.p',cBLEDSOE5B) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SYO298^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.10  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.30  % Computer : n022.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit : 300
% 0.11/0.30  % WCLimit  : 300
% 0.11/0.30  % DateTime : Tue Feb 24 14:27:36 EST 2026
% 0.11/0.30  % CPUTime  : 
% 0.11/0.30  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.39  ---- Original DTF file ---
% 0.17/0.40  thf(spec,logic,$$dhol).
% 0.17/0.40  %------------------------------------------------------------------------------
% 0.17/0.40  % File     : SYO298^5 : TPTP v9.2.1. Released v4.0.0.
% 0.17/0.40  % Domain   : Syntactic
% 0.17/0.40  % Problem  : TPS problem from BASIC-HO-THMS
% 0.17/0.40  % Version  : Especial.
% 0.17/0.40  % English  :
% 0.17/0.40  
% 0.17/0.40  % Refs     : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.17/0.40  % Source   : [Bro09]
% 0.17/0.40  % Names    : tps_0755 [Bro09]
% 0.17/0.40  
% 0.17/0.40  % Status   : Theorem
% 0.17/0.40  % Rating   : 0.08 v9.1.0, 0.12 v9.0.0, 0.08 v8.2.0, 0.09 v8.1.0, 0.17 v7.4.0, 0.11 v7.3.0, 0.20 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.2.0, 0.33 v6.1.0, 0.17 v6.0.0, 0.00 v4.0.0
% 0.17/0.40  % Syntax   : Number of formulae    :    3 (   0 unt;   2 typ;   0 def)
% 0.17/0.40  %            Number of atoms       :    2 (   0 equ;   0 cnn)
% 0.17/0.40  %            Maximal formula atoms :    2 (   2 avg)
% 0.17/0.40  %            Number of connectives :    7 (   0   ~;   0   |;   1   &;   5   @)
% 0.17/0.40  %                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
% 0.17/0.40  %            Maximal formula depth :    9 (   9 avg)
% 0.17/0.40  %            Number of types       :    2 (   0 usr)
% 0.17/0.40  %            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
% 0.17/0.40  %            Number of symbols     :    2 (   2 usr;   0 con; 2-2 aty)
% 0.17/0.40  %            Number of variables   :    4 (   0   ^;   2   !;   2   ?;   4   :)
% 0.17/0.40  % SPC      : TH0_THM_NEQ_NAR
% 0.17/0.40  
% 0.17/0.40  % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.17/0.40  %            project in the Department of Mathematical Sciences at Carnegie
% 0.17/0.40  %            Mellon University. Distributed under the Creative Commons copyleft
% 0.17/0.40  %            license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.17/0.40  %------------------------------------------------------------------------------
% 0.17/0.40  thf(q,type,
% 0.17/0.40      q: $i > $i > $o ).
% 0.17/0.40  
% 0.17/0.40  thf(p,type,
% 0.17/0.40      p: $i > $i > $o ).
% 0.17/0.40  
% 0.17/0.40  thf(cBLEDSOE5B,conjecture,
% 0.17/0.40      ? [A: $i > $o] :
% 0.17/0.40      ! [L: $i] :
% 0.17/0.40      ? [Xy: $i] :
% 0.17/0.40      ! [Xz: $i] :
% 0.17/0.40        ( ( A @ Xz )
% 0.17/0.40       => ( ( p @ Xz @ Xy )
% 0.17/0.40          & ( q @ L @ Xy ) ) ) ).
% 0.17/0.40  
% 0.17/0.40  %------------------------------------------------------------------------------
% 0.17/0.40  ------------------------
% 1.55/1.33  ---- Embedded in THF ---
% 1.55/1.33  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.55/1.33  %%% Generated on Tue Feb 24 14:27:37 EST 2026
% 1.55/1.33  %%% using '$$dhol' embedding, version 1.3.0.
% 1.55/1.33  %%% Logic specification used:
% 1.55/1.33  %%% thf(spec, logic, $$dhol).
% 1.55/1.33  
% 1.55/1.33  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.Jwp3BxiTpi/DTF2DTF30572.p
% See solution above
% 1.55/1.33  ------------------------
% 1.55/1.34  ---- Cleaned THF ---
% 1.55/1.34  thf(q,type,
% 1.55/1.34      q: $i > $i > $o ).
% 1.55/1.34  
% 1.55/1.34  thf(p,type,
% 1.55/1.34      p: $i > $i > $o ).
% 1.55/1.34  
% 1.55/1.34  thf(cBLEDSOE5B,conjecture,
% 1.55/1.34      ? [A: $i > $o] :
% 1.55/1.34      ! [L: $i] :
% 1.55/1.34      ? [Xy: $i] :
% 1.55/1.34      ! [Xz: $i] :
% 1.55/1.34        ( ( A @ Xz )
% 1.55/1.34       => ( ( p @ Xz @ Xy )
% 1.55/1.34          & ( q @ L @ Xy ) ) ) ).
% 1.55/1.34  ------------------------
% 1.55/1.36  % (30670)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_30572 for (3000ds/4Mi)
% 1.55/1.36  % (30673)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_30572 for (3000ds/2Mi)
% 1.55/1.36  % (30672)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_30572 for (3000ds/2Mi)
% 1.55/1.36  % (30671)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_30572 for (3000ds/27Mi)
% 1.55/1.36  % (30675)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_30572 for (3000ds/18Mi)
% 1.55/1.36  % (30674)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_30572 for (3000ds/275Mi)
% 1.55/1.36  % (30669)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_30572 for (3000ds/183Mi)
% 1.55/1.36  % (30673)Instruction limit reached!
% 1.55/1.36  % (30673)------------------------------
% 1.55/1.36  % (30673)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.55/1.36  % (30673)Termination reason: Unknown
% 1.55/1.36  % (30673)Termination phase: Saturation
% 1.55/1.36  
% 1.55/1.36  % (30673)Memory used [KB]: 5373
% 1.55/1.36  % (30673)Time elapsed: 0.003 s
% 1.55/1.36  % (30673)Instructions burned: 2 (million)
% 1.55/1.36  % (30673)------------------------------
% 1.55/1.36  % (30673)------------------------------
% 1.55/1.36  % (30674)First to succeed.
% 1.55/1.36  % (30671)Refutation not found, incomplete strategy
% 1.55/1.36  % (30671)------------------------------
% 1.55/1.36  % (30671)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.55/1.36  % (30671)Termination reason: Refutation not found, incomplete strategy
% 1.55/1.36  
% 1.55/1.36  
% 1.55/1.36  % (30671)Memory used [KB]: 5500
% 1.55/1.36  % (30671)Time elapsed: 0.003 s
% 1.55/1.36  % (30671)Instructions burned: 1 (million)
% 1.55/1.36  % (30671)------------------------------
% 1.55/1.36  % (30671)------------------------------
% 1.55/1.36  % (30675)Also succeeded, but the first one will report.
% 1.55/1.36  % (30674)Refutation found. Thanks to Tanya!
% 1.55/1.36  % SZS status Theorem for DTF2THF_30572
% 1.55/1.36  % SZS output start Proof for DTF2THF_30572
% 1.55/1.36  thf(func_def_0, type, q: $i > $i > $o).
% 1.55/1.36  thf(func_def_1, type, p: $i > $i > $o).
% 1.55/1.36  thf(func_def_5, type, sK0: ($i > $o) > $i).
% 1.55/1.36  thf(func_def_6, type, sK1: $i > ($i > $o) > $i).
% 1.55/1.36  thf(func_def_8, type, ph3: !>[X0: $tType]:(X0)).
% 1.55/1.36  thf(f16,plain,(
% 1.55/1.36    $false),
% 1.55/1.36    inference(trivial_inequality_removal,[status(thm)],[f15])).
% 1.55/1.36  thf(f15,plain,(
% 1.55/1.36    ($false = $true)),
% 1.55/1.36    inference(beta_eta_normalization,[status(thm)],[f13])).
% 1.55/1.36  thf(f13,plain,(
% 1.55/1.36    ( ! [X2 : $i] : (($true = ((^[Y0 : $i]: ($false)) @ (sK1 @ X2 @ (^[Y0 : $i]: ($false)))))) )),
% 1.55/1.36    inference(primitive_instantiation,[status(thm)],[f11])).
% 1.55/1.36  thf(f11,plain,(
% 1.55/1.36    ( ! [X2 : $i,X0 : $i > $o] : (($true = (X0 @ (sK1 @ X2 @ X0)))) )),
% 1.55/1.36    inference(cnf_transformation,[status(thm)],[f9])).
% 1.55/1.36  thf(f9,plain,(
% 1.55/1.36    ! [X0 : $i > $o] : ! [X2 : $i] : (($true = (X0 @ (sK1 @ X2 @ X0))) & (((q @ (sK0 @ X0) @ X2) != $true) | ((p @ (sK1 @ X2 @ X0) @ X2) != $true)))),
% 1.55/1.36    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7])).
% 1.55/1.36  thf(f7,plain,(
% 1.55/1.36    ! [X0 : $i > $o] : (? [X1 : $i] : ! [X2 : $i] : ? [X3 : $i] : (((X0 @ X3) = $true) & (((q @ X1 @ X2) != $true) | ((p @ X3 @ X2) != $true))) => ! [X2 : $i] : ? [X3 : $i] : (((X0 @ X3) = $true) & (((q @ (sK0 @ X0) @ X2) != $true) | ((p @ X3 @ X2) != $true))))),
% 1.55/1.36    introduced(definition,[],[choice_axiom])).
% 1.55/1.36  thf(f8,plain,(
% 1.55/1.36    ! [X0 : $i > $o,X2 : $i] : (? [X3 : $i] : (((X0 @ X3) = $true) & (((q @ (sK0 @ X0) @ X2) != $true) | ((p @ X3 @ X2) != $true))) => (($true = (X0 @ (sK1 @ X2 @ X0))) & (((q @ (sK0 @ X0) @ X2) != $true) | ((p @ (sK1 @ X2 @ X0) @ X2) != $true))))),
% 1.55/1.36    introduced(definition,[],[choice_axiom])).
% 1.55/1.36  thf(f6,plain,(
% 1.55/1.36    ! [X0 : $i > $o] : ? [X1 : $i] : ! [X2 : $i] : ? [X3 : $i] : (((X0 @ X3) = $true) & (((q @ X1 @ X2) != $true) | ((p @ X3 @ X2) != $true)))),
% 1.55/1.36    inference(ennf_transformation,[status(thm)],[f5])).
% 1.55/1.36  thf(f5,plain,(
% 1.55/1.36    ~? [X0 : $i > $o] : ! [X1 : $i] : ? [X2 : $i] : ! [X3 : $i] : (((X0 @ X3) = $true) => (((p @ X3 @ X2) = $true) & ((q @ X1 @ X2) = $true)))),
% 1.55/1.36    inference(fool_elimination,[status(thm)],[f4])).
% 1.55/1.36  thf(f4,plain,(
% 1.55/1.36    ~? [X0 : $i > $o] : ! [X1 : $i] : ? [X2 : $i] : ! [X3 : $i] : ((X0 @ X3) => ((q @ X1 @ X2) & (p @ X3 @ X2)))),
% 1.55/1.36    inference(rectify,[status(thm)],[f2])).
% 1.55/1.36  thf(f2,negated_conjecture,(
% 1.55/1.36    ~? [X0 : $i > $o] : ! [X1 : $i] : ? [X2 : $i] : ! [X3 : $i] : ((X0 @ X3) => ((q @ X1 @ X2) & (p @ X3 @ X2)))),
% 1.55/1.36    inference(negated_conjecture,[status(cth)],[f1])).
% 1.55/1.36  thf(f1,conjecture,(
% 1.55/1.36    ? [X0 : $i > $o] : ! [X1 : $i] : ? [X2 : $i] : ! [X3 : $i] : ((X0 @ X3) => ((q @ X1 @ X2) & (p @ X3 @ X2)))),
% 1.55/1.36    file('/export/starexec/sandbox/tmp/tmp.Jwp3BxiTpi/DTF2THF_30572.p',cBLEDSOE5B)).
% 1.55/1.36  % SZS output end Proof for DTF2THF_30572
% 1.55/1.36  % (30674)------------------------------
% 1.55/1.36  % (30674)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.55/1.36  % (30674)Termination reason: Refutation
% 1.55/1.36  
% 1.55/1.36  % (30674)Memory used [KB]: 5500
% 1.55/1.36  % (30674)Time elapsed: 0.003 s
% 1.55/1.36  % (30674)Instructions burned: 2 (million)
% 1.55/1.36  % (30674)------------------------------
% 1.55/1.36  % (30674)------------------------------
% 1.55/1.36  % (30668)Success in time 0.017 s
%------------------------------------------------------------------------------