↑ Up

DT2H2X---1.9.5.THM-Ref.s

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

% Result   : Theorem 1.60s 1.36s
% Output   : Refutation 1.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   70 (  19 equ)
%            Maximal formula atoms :    4 (   5 avg)
%            Number of connectives :   30 (  10   ~;   4   |;   8   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of FOOLs       :   38 (  38 fml;   0 var)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   2 usr;   4 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f14,plain,
    $false,
    inference(subsumption_resolution,[status(thm)],[f13,f9]) ).

tff(f9,plain,
    cQ != $true,
    inference(cnf_transformation,[status(thm)],[f8]) ).

tff(f8,plain,
    ( ( cP = $true )
    & ( ( cQ = $true )
      | ( cP != $true ) )
    & ( cQ != $true ) ),
    inference(flattening,[status(thm)],[f7]) ).

tff(f7,plain,
    ( ( cQ != $true )
    & ( ( cQ = $true )
      | ( cP != $true ) )
    & ( cP = $true ) ),
    inference(ennf_transformation,[status(thm)],[f6]) ).

tff(f6,plain,
    ~ ( ( ( ( cP = $true )
         => ( cQ = $true ) )
        & ( cP = $true ) )
     => ( cQ = $true ) ),
    inference(fool_elimination,[status(thm)],[f5]) ).

tff(f5,plain,
    ~ ( ( ( cP
         => cQ )
        & cP )
     => cQ ),
    inference(rectify,[status(thm)],[f2]) ).

tff(f2,negated_conjecture,
    ~ ( ( ( cP
         => cQ )
        & cP )
     => cQ ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f1,conjecture,
    ( ( ( cP
       => cQ )
      & cP )
   => cQ ),
    file('/export/starexec/sandbox/tmp/tmp.4Namb2pglT/DTF2THF_13269.p',cTHM114) ).

tff(f13,plain,
    cQ = $true,
    inference(trivial_inequality_removal,[status(thm)],[f12]) ).

tff(f12,plain,
    ( ( $true != $true )
    | ( cQ = $true ) ),
    inference(definition_unfolding,[status(thm)],[f10,f11]) ).

tff(f11,plain,
    cP = $true,
    inference(cnf_transformation,[status(thm)],[f8]) ).

tff(f10,plain,
    ( ( cQ = $true )
    | ( cP != $true ) ),
    inference(cnf_transformation,[status(thm)],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYO076^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.17/0.34  % Computer : n017.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 14:22:26 EST 2026
% 0.17/0.34  % CPUTime  : 
% 0.17/0.34  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/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     : SYO076^5 : TPTP v9.2.1. Released v4.0.0.
% 0.26/0.47  % Domain   : Syntactic
% 0.26/0.47  % Problem  : TPS problem THM114
% 0.26/0.47  % Version  : Especial.
% 0.26/0.47  % English  : 
% 0.26/0.47  
% 0.26/0.47  % Refs     : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.26/0.47  % Source   : [Bro09]
% 0.26/0.47  % Names    : tps_0018 [Bro09]
% 0.26/0.47  %          : THM114 [TPS]
% 0.26/0.47  
% 0.26/0.47  % Status   : Theorem
% 0.26/0.47  % Rating   : 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v4.0.0
% 0.26/0.47  % Syntax   : Number of formulae    :    3 (   0 unt;   2 typ;   0 def)
% 0.26/0.47  %            Number of atoms       :    4 (   0 equ;   0 cnn)
% 0.26/0.47  %            Maximal formula atoms :    4 (   4 avg)
% 0.26/0.47  %            Number of connectives :    3 (   0   ~;   0   |;   1   &;   0   @)
% 0.26/0.47  %                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
% 0.26/0.47  %            Maximal formula depth :    4 (   4 avg)
% 0.26/0.47  %            Number of types       :    1 (   0 usr)
% 0.26/0.47  %            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
% 0.26/0.47  %            Number of symbols     :    2 (   2 usr;   2 con; 0-0 aty)
% 0.26/0.47  %            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)
% 0.26/0.47  % SPC      : TH0_THM_NEQ_NAR
% 0.26/0.47  
% 0.26/0.47  % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.26/0.47  %            project in the Department of Mathematical Sciences at Carnegie
% 0.26/0.47  %            Mellon University. Distributed under the Creative Commons copyleft
% 0.26/0.47  %            license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.26/0.47  %------------------------------------------------------------------------------
% 0.26/0.47  thf(cQ,type,
% 0.26/0.47      cQ: $o ).
% 0.26/0.47  
% 0.26/0.47  thf(cP,type,
% 0.26/0.47      cP: $o ).
% 0.26/0.47  
% 0.26/0.47  thf(cTHM114,conjecture,
% 0.26/0.47      ( ( cP
% 0.26/0.47        & ( cP
% 0.26/0.47         => cQ ) )
% 0.26/0.47     => cQ ) ).
% 0.26/0.47  
% 0.26/0.47  %------------------------------------------------------------------------------
% 0.26/0.47  ------------------------
% 1.60/1.33  ---- Embedded in THF ---
% 1.60/1.33  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.60/1.33  %%% Generated on Tue Feb 24 14:22:27 EST 2026
% 1.60/1.33  %%% using '$$dhol' embedding, version 1.3.0.
% 1.60/1.33  %%% Logic specification used:
% 1.60/1.33  %%% thf(spec, logic, $$dhol).
% 1.60/1.33  
% 1.60/1.33  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.4Namb2pglT/DTF2DTF13269.p
% See solution above
% 1.60/1.33  ------------------------
% 1.60/1.35  ---- Cleaned THF ---
% 1.60/1.35  thf(cQ,type,
% 1.60/1.35      cQ: $o ).
% 1.60/1.35  
% 1.60/1.35  thf(cP,type,
% 1.60/1.35      cP: $o ).
% 1.60/1.35  
% 1.60/1.35  thf(cTHM114,conjecture,
% 1.60/1.35      ( ( cP
% 1.60/1.35        & ( cP
% 1.60/1.35         => cQ ) )
% 1.60/1.35     => cQ ) ).
% 1.60/1.35  ------------------------
% 1.60/1.36  % (13556)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_13269 for (3000ds/183Mi)
% 1.60/1.36  % (13556)First to succeed.
% 1.60/1.36  % (13556)Refutation found. Thanks to Tanya!
% 1.60/1.36  % SZS status Theorem for DTF2THF_13269
% 1.60/1.36  % SZS output start Proof for DTF2THF_13269
% 1.60/1.36  tff(f14,plain,(
% 1.60/1.36    $false),
% 1.60/1.36    inference(subsumption_resolution,[status(thm)],[f13,f9])).
% 1.60/1.36  tff(f9,plain,(
% 1.60/1.36    (cQ != $true)),
% 1.60/1.36    inference(cnf_transformation,[status(thm)],[f8])).
% 1.60/1.36  tff(f8,plain,(
% 1.60/1.36    (cP = $true) & ((cQ = $true) | (cP != $true)) & (cQ != $true)),
% 1.60/1.36    inference(flattening,[status(thm)],[f7])).
% 1.60/1.36  tff(f7,plain,(
% 1.60/1.36    (cQ != $true) & (((cQ = $true) | (cP != $true)) & (cP = $true))),
% 1.60/1.36    inference(ennf_transformation,[status(thm)],[f6])).
% 1.60/1.36  tff(f6,plain,(
% 1.60/1.36    ~((((cP = $true) => (cQ = $true)) & (cP = $true)) => (cQ = $true))),
% 1.60/1.36    inference(fool_elimination,[status(thm)],[f5])).
% 1.60/1.36  tff(f5,plain,(
% 1.60/1.36    ~(((cP => cQ) & cP) => cQ)),
% 1.60/1.36    inference(rectify,[status(thm)],[f2])).
% 1.60/1.36  tff(f2,negated_conjecture,(
% 1.60/1.36    ~(((cP => cQ) & cP) => cQ)),
% 1.60/1.36    inference(negated_conjecture,[status(cth)],[f1])).
% 1.60/1.36  tff(f1,conjecture,(
% 1.60/1.36    ((cP => cQ) & cP) => cQ),
% 1.60/1.36    file('/export/starexec/sandbox/tmp/tmp.4Namb2pglT/DTF2THF_13269.p',cTHM114)).
% 1.60/1.36  tff(f13,plain,(
% 1.60/1.36    (cQ = $true)),
% 1.60/1.36    inference(trivial_inequality_removal,[status(thm)],[f12])).
% 1.60/1.36  tff(f12,plain,(
% 1.60/1.36    ($true != $true) | (cQ = $true)),
% 1.60/1.36    inference(definition_unfolding,[status(thm)],[f10,f11])).
% 1.60/1.36  tff(f11,plain,(
% 1.60/1.36    (cP = $true)),
% 1.60/1.36    inference(cnf_transformation,[status(thm)],[f8])).
% 1.60/1.36  tff(f10,plain,(
% 1.60/1.36    (cQ = $true) | (cP != $true)),
% 1.60/1.36    inference(cnf_transformation,[status(thm)],[f8])).
% 1.60/1.36  % SZS output end Proof for DTF2THF_13269
% 1.60/1.36  % (13556)------------------------------
% 1.60/1.36  % (13556)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.60/1.36  % (13556)Termination reason: Refutation
% 1.60/1.36  
% 1.60/1.36  % (13556)Memory used [KB]: 5373
% 1.60/1.36  % (13556)Time elapsed: 0.002 s
% 1.60/1.36  % (13556)Instructions burned: 1 (million)
% 1.60/1.36  % (13556)------------------------------
% 1.60/1.36  % (13556)------------------------------
% 1.60/1.36  % (13555)Success in time 0.013 s
%------------------------------------------------------------------------------