↑ Up

DT2H2X---1.9.5.THM-Ref.s

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

% Result   : Theorem 1.53s 1.37s
% Output   : Refutation 1.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :  100 (  29 equ;   0 cnn)
%            Maximal formula atoms :    8 (   7 avg)
%            Number of connectives :   92 (  16   ~;   6   |;  14   &;  47   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   19 (   0   ^;  12   !;   7   ?;  19   :)

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

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

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

thf(f14,plain,
    $false,
    inference(subsumption_resolution,[status(thm)],[f11,f13]) ).

thf(f13,plain,
    ! [X0: $i] :
      ( ( cP1 @ X0 )
     != $true ),
    inference(subsumption_resolution,[status(thm)],[f12,f10]) ).

thf(f10,plain,
    ! [X0: $i] :
      ( ( cP2 @ X0 )
     != $true ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

thf(f9,plain,
    ! [X0: $i] :
      ( ( ( $true
          = ( cP2 @ ( sK0 @ X0 ) ) )
        | ( ( cP1 @ X0 )
         != $true ) )
      & ( ( cP1 @ ( sK0 @ X0 ) )
        = $true )
      & ( ( cP2 @ X0 )
       != $true ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).

thf(f8,plain,
    ! [X0: $i] :
      ( ? [X1: $i] :
          ( ( ( ( cP2 @ X1 )
              = $true )
            | ( ( cP1 @ X0 )
             != $true ) )
          & ( ( cP1 @ X1 )
            = $true )
          & ( ( cP2 @ X0 )
           != $true ) )
     => ( ( ( $true
            = ( cP2 @ ( sK0 @ X0 ) ) )
          | ( ( cP1 @ X0 )
           != $true ) )
        & ( ( cP1 @ ( sK0 @ X0 ) )
          = $true )
        & ( ( cP2 @ X0 )
         != $true ) ) ),
    introduced(definition,[],[choice_axiom]) ).

thf(f7,plain,
    ! [X0: $i] :
    ? [X1: $i] :
      ( ( ( ( cP2 @ X1 )
          = $true )
        | ( ( cP1 @ X0 )
         != $true ) )
      & ( ( cP1 @ X1 )
        = $true )
      & ( ( cP2 @ X0 )
       != $true ) ),
    inference(flattening,[status(thm)],[f6]) ).

thf(f6,plain,
    ! [X0: $i] :
    ? [X1: $i] :
      ( ( ( cP2 @ X0 )
       != $true )
      & ( ( ( cP2 @ X1 )
          = $true )
        | ( ( cP1 @ X0 )
         != $true ) )
      & ( ( cP1 @ X1 )
        = $true ) ),
    inference(ennf_transformation,[status(thm)],[f5]) ).

thf(f5,plain,
    ~ ? [X0: $i] :
      ! [X1: $i] :
        ( ( ( ( ( cP1 @ X0 )
              = $true )
           => ( ( cP2 @ X1 )
              = $true ) )
          & ( ( cP1 @ X1 )
            = $true ) )
       => ( ( cP2 @ X0 )
          = $true ) ),
    inference(fool_elimination,[status(thm)],[f4]) ).

thf(f4,plain,
    ~ ? [X0: $i] :
      ! [X1: $i] :
        ( ( ( ( cP1 @ X0 )
           => ( cP2 @ X1 ) )
          & ( cP1 @ X1 ) )
       => ( cP2 @ X0 ) ),
    inference(rectify,[status(thm)],[f2]) ).

thf(f2,negated_conjecture,
    ~ ? [X0: $i] :
      ! [X1: $i] :
        ( ( ( ( cP1 @ X0 )
           => ( cP2 @ X1 ) )
          & ( cP1 @ X1 ) )
       => ( cP2 @ X0 ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f1,conjecture,
    ? [X0: $i] :
    ! [X1: $i] :
      ( ( ( ( cP1 @ X0 )
         => ( cP2 @ X1 ) )
        & ( cP1 @ X1 ) )
     => ( cP2 @ X0 ) ),
    file('/export/starexec/sandbox/tmp/tmp.NHJsHBGQT9/DTF2THF_14195.p',cBAFFLER2) ).

thf(f12,plain,
    ! [X0: $i] :
      ( ( $true
        = ( cP2 @ ( sK0 @ X0 ) ) )
      | ( ( cP1 @ X0 )
       != $true ) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

thf(f11,plain,
    ! [X0: $i] :
      ( ( cP1 @ ( sK0 @ X0 ) )
      = $true ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SYO133^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.12/0.30  % Computer : n006.cluster.edu
% 0.12/0.30  % Model    : x86_64 x86_64
% 0.12/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30  % Memory   : 8042.1875MB
% 0.12/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.30  % CPULimit : 300
% 0.12/0.30  % WCLimit  : 300
% 0.12/0.30  % DateTime : Tue Feb 24 14:25:00 EST 2026
% 0.12/0.30  % CPUTime  : 
% 0.12/0.30  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.40  ---- Original DTF file ---
% 0.17/0.40  thf(spec,logic,$$dhol).
% 0.17/0.40  %------------------------------------------------------------------------------
% 0.17/0.40  % File     : SYO133^5 : TPTP v9.2.1. Released v4.0.0.
% 0.17/0.40  % Domain   : Syntactic
% 0.17/0.40  % Problem  : TPS problem from BASIC-FO-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_0715 [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.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.17/0.40  % Syntax   : Number of formulae    :    3 (   0 unt;   2 typ;   0 def)
% 0.17/0.40  %            Number of atoms       :    4 (   0 equ;   0 cnn)
% 0.17/0.40  %            Maximal formula atoms :    4 (   4 avg)
% 0.17/0.40  %            Number of connectives :    7 (   0   ~;   0   |;   1   &;   4   @)
% 0.17/0.40  %                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
% 0.17/0.40  %            Maximal formula depth :    7 (   7 avg)
% 0.17/0.40  %            Number of types       :    2 (   0 usr)
% 0.17/0.40  %            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
% 0.17/0.40  %            Number of symbols     :    2 (   2 usr;   0 con; 1-1 aty)
% 0.17/0.40  %            Number of variables   :    2 (   0   ^;   1   !;   1   ?;   2   :)
% 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(cP2,type,
% 0.17/0.40      cP2: $i > $o ).
% 0.17/0.40  
% 0.17/0.40  thf(cP1,type,
% 0.17/0.40      cP1: $i > $o ).
% 0.17/0.40  
% 0.17/0.40  thf(cBAFFLER2,conjecture,
% 0.17/0.40      ? [Xy: $i] :
% 0.17/0.40      ! [Xx: $i] :
% 0.17/0.40        ( ( ( cP1 @ Xx )
% 0.17/0.40          & ( ( cP1 @ Xy )
% 0.17/0.40           => ( cP2 @ Xx ) ) )
% 0.17/0.40       => ( cP2 @ Xy ) ) ).
% 0.17/0.40  
% 0.17/0.40  %------------------------------------------------------------------------------
% 0.17/0.40  ------------------------
% 1.53/1.34  ---- Embedded in THF ---
% 1.53/1.34  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.53/1.34  %%% Generated on Tue Feb 24 14:25:01 EST 2026
% 1.53/1.34  %%% using '$$dhol' embedding, version 1.3.0.
% 1.53/1.34  %%% Logic specification used:
% 1.53/1.34  %%% thf(spec, logic, $$dhol).
% 1.53/1.34  
% 1.53/1.34  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.NHJsHBGQT9/DTF2DTF14195.p
% See solution above
% 1.53/1.34  ------------------------
% 1.53/1.35  ---- Cleaned THF ---
% 1.53/1.35  thf(cP2,type,
% 1.53/1.35      cP2: $i > $o ).
% 1.53/1.35  
% 1.53/1.35  thf(cP1,type,
% 1.53/1.35      cP1: $i > $o ).
% 1.53/1.35  
% 1.53/1.35  thf(cBAFFLER2,conjecture,
% 1.53/1.35      ? [Xy: $i] :
% 1.53/1.35      ! [Xx: $i] :
% 1.53/1.35        ( ( ( cP1 @ Xx )
% 1.53/1.35          & ( ( cP1 @ Xy )
% 1.53/1.35           => ( cP2 @ Xx ) ) )
% 1.53/1.35       => ( cP2 @ Xy ) ) ).
% 1.53/1.35  ------------------------
% 1.53/1.37  % (14296)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_14195 for (3000ds/2Mi)
% 1.53/1.37  % (14293)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_14195 for (3000ds/183Mi)
% 1.53/1.37  % (14297)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_14195 for (3000ds/2Mi)
% 1.53/1.37  % (14298)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_14195 for (3000ds/275Mi)
% 1.53/1.37  % (14295)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_14195 for (3000ds/27Mi)
% 1.53/1.37  % (14293)First to succeed.
% 1.53/1.37  % (14299)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_14195 for (3000ds/18Mi)
% 1.53/1.37  % (14298)Also succeeded, but the first one will report.
% 1.53/1.37  % (14297)Instruction limit reached!
% 1.53/1.37  % (14297)------------------------------
% 1.53/1.37  % (14297)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.37  % (14297)Termination reason: Unknown
% 1.53/1.37  % (14297)Termination phase: Saturation
% 1.53/1.37  
% 1.53/1.37  % (14297)Memory used [KB]: 5500
% 1.53/1.37  % (14297)Time elapsed: 0.003 s
% 1.53/1.37  % (14297)Instructions burned: 2 (million)
% 1.53/1.37  % (14297)------------------------------
% 1.53/1.37  % (14297)------------------------------
% 1.53/1.37  % (14296)Also succeeded, but the first one will report.
% 1.53/1.37  % (14293)Refutation found. Thanks to Tanya!
% 1.53/1.37  % SZS status Theorem for DTF2THF_14195
% 1.53/1.37  % SZS output start Proof for DTF2THF_14195
% 1.53/1.37  thf(func_def_0, type, cP2: $i > $o).
% 1.53/1.37  thf(func_def_1, type, cP1: $i > $o).
% 1.53/1.37  thf(func_def_5, type, sK0: $i > $i).
% 1.53/1.37  thf(f14,plain,(
% 1.53/1.37    $false),
% 1.53/1.37    inference(subsumption_resolution,[status(thm)],[f11,f13])).
% 1.53/1.37  thf(f13,plain,(
% 1.53/1.37    ( ! [X0 : $i] : (((cP1 @ X0) != $true)) )),
% 1.53/1.37    inference(subsumption_resolution,[status(thm)],[f12,f10])).
% 1.53/1.37  thf(f10,plain,(
% 1.53/1.37    ( ! [X0 : $i] : (((cP2 @ X0) != $true)) )),
% 1.53/1.37    inference(cnf_transformation,[status(thm)],[f9])).
% 1.53/1.37  thf(f9,plain,(
% 1.53/1.37    ! [X0 : $i] : ((($true = (cP2 @ (sK0 @ X0))) | ((cP1 @ X0) != $true)) & ((cP1 @ (sK0 @ X0)) = $true) & ((cP2 @ X0) != $true))),
% 1.53/1.37    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8])).
% 1.53/1.37  thf(f8,plain,(
% 1.53/1.37    ! [X0 : $i] : (? [X1 : $i] : ((((cP2 @ X1) = $true) | ((cP1 @ X0) != $true)) & ((cP1 @ X1) = $true) & ((cP2 @ X0) != $true)) => ((($true = (cP2 @ (sK0 @ X0))) | ((cP1 @ X0) != $true)) & ((cP1 @ (sK0 @ X0)) = $true) & ((cP2 @ X0) != $true)))),
% 1.53/1.37    introduced(definition,[],[choice_axiom])).
% 1.53/1.37  thf(f7,plain,(
% 1.53/1.37    ! [X0 : $i] : ? [X1 : $i] : ((((cP2 @ X1) = $true) | ((cP1 @ X0) != $true)) & ((cP1 @ X1) = $true) & ((cP2 @ X0) != $true))),
% 1.53/1.37    inference(flattening,[status(thm)],[f6])).
% 1.53/1.37  thf(f6,plain,(
% 1.53/1.37    ! [X0 : $i] : ? [X1 : $i] : (((cP2 @ X0) != $true) & ((((cP2 @ X1) = $true) | ((cP1 @ X0) != $true)) & ((cP1 @ X1) = $true)))),
% 1.53/1.37    inference(ennf_transformation,[status(thm)],[f5])).
% 1.53/1.37  thf(f5,plain,(
% 1.53/1.37    ~? [X0 : $i] : ! [X1 : $i] : (((((cP1 @ X0) = $true) => ((cP2 @ X1) = $true)) & ((cP1 @ X1) = $true)) => ((cP2 @ X0) = $true))),
% 1.53/1.37    inference(fool_elimination,[status(thm)],[f4])).
% 1.53/1.37  thf(f4,plain,(
% 1.53/1.37    ~? [X0 : $i] : ! [X1 : $i] : ((((cP1 @ X0) => (cP2 @ X1)) & (cP1 @ X1)) => (cP2 @ X0))),
% 1.53/1.37    inference(rectify,[status(thm)],[f2])).
% 1.53/1.37  thf(f2,negated_conjecture,(
% 1.53/1.37    ~? [X0 : $i] : ! [X1 : $i] : ((((cP1 @ X0) => (cP2 @ X1)) & (cP1 @ X1)) => (cP2 @ X0))),
% 1.53/1.37    inference(negated_conjecture,[status(cth)],[f1])).
% 1.53/1.37  thf(f1,conjecture,(
% 1.53/1.37    ? [X0 : $i] : ! [X1 : $i] : ((((cP1 @ X0) => (cP2 @ X1)) & (cP1 @ X1)) => (cP2 @ X0))),
% 1.53/1.37    file('/export/starexec/sandbox/tmp/tmp.NHJsHBGQT9/DTF2THF_14195.p',cBAFFLER2)).
% 1.53/1.37  thf(f12,plain,(
% 1.53/1.37    ( ! [X0 : $i] : (($true = (cP2 @ (sK0 @ X0))) | ((cP1 @ X0) != $true)) )),
% 1.53/1.37    inference(cnf_transformation,[status(thm)],[f9])).
% 1.53/1.37  thf(f11,plain,(
% 1.53/1.37    ( ! [X0 : $i] : (((cP1 @ (sK0 @ X0)) = $true)) )),
% 1.53/1.37    inference(cnf_transformation,[status(thm)],[f9])).
% 1.53/1.37  % SZS output end Proof for DTF2THF_14195
% 1.53/1.37  % (14293)------------------------------
% 1.53/1.37  % (14293)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.53/1.37  % (14293)Termination reason: Refutation
% 1.53/1.37  
% 1.53/1.37  % (14293)Memory used [KB]: 5373
% 1.53/1.37  % (14293)Time elapsed: 0.003 s
% 1.53/1.37  % (14293)Instructions burned: 1 (million)
% 1.53/1.37  % (14293)------------------------------
% 1.53/1.37  % (14293)------------------------------
% 1.53/1.37  % (14292)Success in time 0.017 s
%------------------------------------------------------------------------------