↑ Up

DT2H2X---1.9.5.THM-Ref.s

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

% Result   : Theorem 1.49s 1.27s
% Output   : Refutation 1.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :  121 (  34 equ)
%            Maximal formula atoms :    6 (   8 avg)
%            Number of connectives :   63 (  25   ~;   7   |;   6   &)
%                                         (   0 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of FOOLs       :   68 (  68 fml;   0 var)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   3 usr;   5 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f17,plain,
    $false,
    inference(subsumption_resolution,[status(thm)],[f15,f16]) ).

tff(f16,plain,
    q != $true,
    inference(subsumption_resolution,[status(thm)],[f13,f10]) ).

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

tff(f9,plain,
    ( ( ( q != $true )
      | ( r = $true ) )
    & ( ( q = $true )
      | ( p != $true ) )
    & ( p = $true )
    & ( r != $true ) ),
    inference(flattening,[status(thm)],[f8]) ).

tff(f8,plain,
    ( ( r != $true )
    & ( p = $true )
    & ( ( q = $true )
      | ( p != $true ) )
    & ( ( q != $true )
      | ( r = $true ) ) ),
    inference(ennf_transformation,[status(thm)],[f7]) ).

tff(f7,plain,
    ~ ( ( ( q = $true )
       => ( r = $true ) )
     => ( ( ( q != $true )
         => ( p != $true ) )
       => ( ( p = $true )
         => ( r = $true ) ) ) ),
    inference(flattening,[status(thm)],[f6]) ).

tff(f6,plain,
    ~ ( ( ( q = $true )
       => ( r = $true ) )
     => ( ( ( q != $true )
         => ( p != $true ) )
       => ( ( p = $true )
         => ( r = $true ) ) ) ),
    inference(fool_elimination,[status(thm)],[f5]) ).

tff(f5,plain,
    ~ ( ( q
       => r )
     => ( ( ~ q
         => ~ p )
       => ( p
         => r ) ) ),
    inference(rectify,[status(thm)],[f2]) ).

tff(f2,negated_conjecture,
    ~ ( ( q
       => r )
     => ( ( ~ q
         => ~ p )
       => ( p
         => r ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f1,conjecture,
    ( ( q
     => r )
   => ( ( ~ q
       => ~ p )
     => ( p
       => r ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.HkXbkLoPja/DTF2THF_7840.p',cPROP_2003_3_13) ).

tff(f13,plain,
    ( ( r = $true )
    | ( q != $true ) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

tff(f15,plain,
    q = $true,
    inference(trivial_inequality_removal,[status(thm)],[f14]) ).

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

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

tff(f12,plain,
    ( ( q = $true )
    | ( p != $true ) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYO203^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12  % Command  : /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.33  % Computer : n016.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit : 300
% 0.15/0.33  % WCLimit  : 300
% 0.15/0.33  % DateTime : Tue Feb 24 14:27:06 EST 2026
% 0.15/0.33  % CPUTime  : 
% 0.15/0.33  Running /export/starexec/sandbox2/solver/bin/run_DT2H2X /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.18/0.45  ---- Original DTF file ---
% 0.18/0.45  thf(spec,logic,$$dhol).
% 0.18/0.45  %------------------------------------------------------------------------------
% 0.18/0.45  % File     : SYO203^5 : TPTP v9.2.1. Released v4.0.0.
% 0.18/0.45  % Domain   : Syntactic
% 0.18/0.45  % Problem  : TPS problem PROP-2003-3-13
% 0.18/0.45  % Version  : Especial.
% 0.18/0.45  % English  : 
% 0.18/0.45  
% 0.18/0.45  % Refs     : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.18/0.45  % Source   : [Bro09]
% 0.18/0.45  % Names    : tps_0068 [Bro09]
% 0.18/0.45  %          : PROP-2003-3-13 [TPS]
% 0.18/0.45  
% 0.18/0.45  % Status   : Theorem
% 0.18/0.45  % Rating   : 0.17 v9.1.0, 0.12 v9.0.0, 0.17 v8.2.0, 0.18 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 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.0.0, 0.00 v4.0.0
% 0.18/0.45  % Syntax   : Number of formulae    :    4 (   0 unt;   3 typ;   0 def)
% 0.18/0.45  %            Number of atoms       :    6 (   0 equ;   0 cnn)
% 0.18/0.45  %            Maximal formula atoms :    6 (   6 avg)
% 0.18/0.45  %            Number of connectives :    7 (   2   ~;   0   |;   0   &;   0   @)
% 0.18/0.45  %                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
% 0.18/0.45  %            Maximal formula depth :    5 (   5 avg)
% 0.18/0.45  %            Number of types       :    1 (   0 usr)
% 0.18/0.45  %            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
% 0.18/0.45  %            Number of symbols     :    3 (   3 usr;   3 con; 0-0 aty)
% 0.18/0.45  %            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)
% 0.18/0.45  % SPC      : TH0_THM_NEQ_NAR
% 0.18/0.45  
% 0.18/0.45  % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.18/0.45  %            project in the Department of Mathematical Sciences at Carnegie
% 0.18/0.45  %            Mellon University. Distributed under the Creative Commons copyleft
% 0.18/0.45  %            license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.18/0.45  %------------------------------------------------------------------------------
% 0.18/0.45  thf(r,type,
% 0.18/0.45      r: $o ).
% 0.18/0.45  
% 0.18/0.45  thf(p,type,
% 0.18/0.45      p: $o ).
% 0.18/0.45  
% 0.18/0.45  thf(q,type,
% 0.18/0.45      q: $o ).
% 0.18/0.45  
% 0.18/0.45  thf(cPROP_2003_3_13,conjecture,
% 0.18/0.45      ( ( q
% 0.18/0.45       => r )
% 0.18/0.45     => ( ( ~ q
% 0.18/0.45         => ~ p )
% 0.18/0.45       => ( p
% 0.18/0.45         => r ) ) ) ).
% 0.18/0.45  
% 0.18/0.45  %------------------------------------------------------------------------------
% 0.18/0.45  ------------------------
% 1.49/1.24  ---- Embedded in THF ---
% 1.49/1.24  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.49/1.24  %%% Generated on Tue Feb 24 14:27:07 EST 2026
% 1.49/1.24  %%% using '$$dhol' embedding, version 1.3.0.
% 1.49/1.24  %%% Logic specification used:
% 1.49/1.24  %%% thf(spec, logic, $$dhol).
% 1.49/1.24  
% 1.49/1.24  % SZS output start ListOfTHF for /export/starexec/sandbox2/tmp/tmp.HkXbkLoPja/DTF2DTF7840.p
% See solution above
% 1.49/1.24  ------------------------
% 1.49/1.25  ---- Cleaned THF ---
% 1.49/1.25  thf(r,type,
% 1.49/1.25      r: $o ).
% 1.49/1.25  
% 1.49/1.25  thf(p,type,
% 1.49/1.25      p: $o ).
% 1.49/1.25  
% 1.49/1.25  thf(q,type,
% 1.49/1.25      q: $o ).
% 1.49/1.25  
% 1.49/1.25  thf(cPROP_2003_3_13,conjecture,
% 1.49/1.25      ( ( q
% 1.49/1.25       => r )
% 1.49/1.25     => ( ( ~ q
% 1.49/1.25         => ~ p )
% 1.49/1.25       => ( p
% 1.49/1.25         => r ) ) ) ).
% 1.49/1.25  ------------------------
% 1.49/1.27  % (8011)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_7840 for (3000ds/183Mi)
% 1.49/1.27  % (8016)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_7840 for (3000ds/275Mi)
% 1.49/1.27  % (8011)First to succeed.
% 1.49/1.27  % (8016)Also succeeded, but the first one will report.
% 1.49/1.27  % (8011)Refutation found. Thanks to Tanya!
% 1.49/1.27  % SZS status Theorem for DTF2THF_7840
% 1.49/1.27  % SZS output start Proof for DTF2THF_7840
% 1.49/1.27  tff(f17,plain,(
% 1.49/1.27    $false),
% 1.49/1.27    inference(subsumption_resolution,[status(thm)],[f15,f16])).
% 1.49/1.27  tff(f16,plain,(
% 1.49/1.27    (q != $true)),
% 1.49/1.27    inference(subsumption_resolution,[status(thm)],[f13,f10])).
% 1.49/1.27  tff(f10,plain,(
% 1.49/1.27    (r != $true)),
% 1.49/1.27    inference(cnf_transformation,[status(thm)],[f9])).
% 1.49/1.27  tff(f9,plain,(
% 1.49/1.27    ((q != $true) | (r = $true)) & ((q = $true) | (p != $true)) & (p = $true) & (r != $true)),
% 1.49/1.27    inference(flattening,[status(thm)],[f8])).
% 1.49/1.27  tff(f8,plain,(
% 1.49/1.27    (((r != $true) & (p = $true)) & ((q = $true) | (p != $true))) & ((q != $true) | (r = $true))),
% 1.49/1.27    inference(ennf_transformation,[status(thm)],[f7])).
% 1.49/1.27  tff(f7,plain,(
% 1.49/1.27    ~(((q = $true) => (r = $true)) => (((q != $true) => (p != $true)) => ((p = $true) => (r = $true))))),
% 1.49/1.27    inference(flattening,[status(thm)],[f6])).
% 1.49/1.27  tff(f6,plain,(
% 1.49/1.27    ~(((q = $true) => (r = $true)) => ((~(q = $true) => ~(p = $true)) => ((p = $true) => (r = $true))))),
% 1.49/1.27    inference(fool_elimination,[status(thm)],[f5])).
% 1.49/1.27  tff(f5,plain,(
% 1.49/1.27    ~((q => r) => ((~q => ~p) => (p => r)))),
% 1.49/1.27    inference(rectify,[status(thm)],[f2])).
% 1.49/1.27  tff(f2,negated_conjecture,(
% 1.49/1.27    ~((q => r) => ((~q => ~p) => (p => r)))),
% 1.49/1.27    inference(negated_conjecture,[status(cth)],[f1])).
% 1.49/1.27  tff(f1,conjecture,(
% 1.49/1.27    (q => r) => ((~q => ~p) => (p => r))),
% 1.49/1.27    file('/export/starexec/sandbox2/tmp/tmp.HkXbkLoPja/DTF2THF_7840.p',cPROP_2003_3_13)).
% 1.49/1.27  tff(f13,plain,(
% 1.49/1.27    (r = $true) | (q != $true)),
% 1.49/1.27    inference(cnf_transformation,[status(thm)],[f9])).
% 1.49/1.27  tff(f15,plain,(
% 1.49/1.27    (q = $true)),
% 1.49/1.27    inference(trivial_inequality_removal,[status(thm)],[f14])).
% 1.49/1.27  tff(f14,plain,(
% 1.49/1.27    (q = $true) | ($true != $true)),
% 1.49/1.27    inference(definition_unfolding,[status(thm)],[f12,f11])).
% 1.49/1.27  tff(f11,plain,(
% 1.49/1.27    (p = $true)),
% 1.49/1.27    inference(cnf_transformation,[status(thm)],[f9])).
% 1.49/1.27  tff(f12,plain,(
% 1.49/1.27    (q = $true) | (p != $true)),
% 1.49/1.27    inference(cnf_transformation,[status(thm)],[f9])).
% 1.49/1.27  % SZS output end Proof for DTF2THF_7840
% 1.49/1.27  % (8011)------------------------------
% 1.49/1.27  % (8011)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.49/1.27  % (8011)Termination reason: Refutation
% 1.49/1.27  
% 1.49/1.27  % (8011)Memory used [KB]: 5373
% 1.49/1.27  % (8011)Time elapsed: 0.002 s
% 1.49/1.27  % (8011)------------------------------
% 1.49/1.27  % (8011)------------------------------
% 1.49/1.27  % (8010)Success in time 0.004 s
%------------------------------------------------------------------------------