↑ Up

DT2H2X---1.9.5.THM-Ref.s

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

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

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_3,type,
    sK0: $i > $i > $o ).

thf(f12,plain,
    $false,
    inference(subsumption_resolution,[status(thm)],[f11,f10]) ).

thf(f10,plain,
    ( ( sK0 @ sK1 @ sK2 )
   != $true ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

thf(f9,plain,
    ( ( ( sK0 @ sK1 @ sK2 )
      = $true )
    & ( ( sK0 @ sK1 @ sK2 )
     != $true ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f8]) ).

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

thf(f7,plain,
    ? [X0: $i > $i > $o,X1: $i,X2: $i] :
      ( ( ( X0 @ X1 @ X2 )
        = $true )
      & ( ( X0 @ X1 @ X2 )
       != $true ) ),
    inference(rectify,[status(thm)],[f6]) ).

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

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

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

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

thf(f1,conjecture,
    ! [X1: $i,X2: $i,X0: $i > $i > $o] :
      ( ( X0 @ X1 @ X2 )
     => ( X0 @ X1 @ X2 ) ),
    file('/export/starexec/sandbox/tmp/tmp.rE1lDWfUOE/DTF2THF_13717.p',cTHM175_pme) ).

thf(f11,plain,
    ( ( sK0 @ sK1 @ sK2 )
    = $true ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SEV047^5 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.13/0.31  % Computer : n026.cluster.edu
% 0.13/0.31  % Model    : x86_64 x86_64
% 0.13/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31  % Memory   : 8042.1875MB
% 0.13/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31  % CPULimit : 300
% 0.13/0.32  % WCLimit  : 300
% 0.13/0.32  % DateTime : Tue Feb 24 12:39:40 EST 2026
% 0.13/0.32  % CPUTime  : 
% 0.13/0.32  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.42  ---- Original DTF file ---
% 0.17/0.42  thf(spec,logic,$$dhol).
% 0.17/0.42  %------------------------------------------------------------------------------
% 0.17/0.42  % File     : SEV047^5 : TPTP v9.2.1. Released v4.0.0.
% 0.17/0.42  % Domain   : Set Theory (Relations)
% 0.17/0.42  % Problem  : TPS problem THM175
% 0.17/0.42  % Version  : Especial.
% 0.17/0.42  % English  : Reflexivity of subrelation.
% 0.17/0.42  
% 0.17/0.42  % Refs     : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.17/0.42  % Source   : [Bro09]
% 0.17/0.42  % Names    : tps_0072 [Bro09]
% 0.17/0.42  %          : THM175 [TPS]
% 0.17/0.42  
% 0.17/0.42  % Status   : Theorem
% 0.17/0.42  % Rating   : 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v4.0.0
% 0.17/0.42  % Syntax   : Number of formulae    :    1 (   0 unt;   0 typ;   0 def)
% 0.17/0.42  %            Number of atoms       :    0 (   0 equ;   0 cnn)
% 0.17/0.42  %            Maximal formula atoms :    0 (   0 avg)
% 0.17/0.42  %            Number of connectives :    5 (   0   ~;   0   |;   0   &;   4   @)
% 0.17/0.42  %                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
% 0.17/0.42  %            Maximal formula depth :    7 (   7 avg)
% 0.17/0.42  %            Number of types       :    2 (   0 usr)
% 0.17/0.42  %            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
% 0.17/0.42  %            Number of symbols     :    0 (   0 usr;   0 con; --- aty)
% 0.17/0.42  %            Number of variables   :    3 (   0   ^;   3   !;   0   ?;   3   :)
% 0.17/0.42  % SPC      : TH0_THM_NEQ_NAR
% 0.17/0.42  
% 0.17/0.42  % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.17/0.42  %            project in the Department of Mathematical Sciences at Carnegie
% 0.17/0.42  %            Mellon University. Distributed under the Creative Commons copyleft
% 0.17/0.42  %            license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.17/0.42  %          : Polymorphic definitions expanded.
% 0.17/0.42  %------------------------------------------------------------------------------
% 0.17/0.42  thf(cTHM175_pme,conjecture,
% 0.17/0.42      ! [Xs: $i > $i > $o,Xx: $i,Xy: $i] :
% 0.17/0.42        ( ( Xs @ Xx @ Xy )
% 0.17/0.42       => ( Xs @ Xx @ Xy ) ) ).
% 0.17/0.42  
% 0.17/0.42  %------------------------------------------------------------------------------
% 0.17/0.42  ------------------------
% 1.63/1.45  ---- Embedded in THF ---
% 1.63/1.46  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.63/1.46  %%% Generated on Tue Feb 24 12:39:41 EST 2026
% 1.63/1.46  %%% using '$$dhol' embedding, version 1.3.0.
% 1.63/1.46  %%% Logic specification used:
% 1.63/1.46  %%% thf(spec, logic, $$dhol).
% 1.63/1.46  
% 1.63/1.46  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.rE1lDWfUOE/DTF2DTF13717.p
% See solution above
% 1.63/1.46  ------------------------
% 1.63/1.47  ---- Cleaned THF ---
% 1.63/1.47  thf(cTHM175_pme,conjecture,
% 1.63/1.47      ! [Xs: $i > $i > $o,Xx: $i,Xy: $i] :
% 1.63/1.47        ( ( Xs @ Xx @ Xy )
% 1.63/1.47       => ( Xs @ Xx @ Xy ) ) ).
% 1.63/1.47  ------------------------
% 1.63/1.49  % (13820)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_13717 for (3000ds/183Mi)
% 1.63/1.49  % (13821)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_13717 for (3000ds/4Mi)
% 1.63/1.49  % (13824)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_13717 for (3000ds/2Mi)
% 1.63/1.49  % (13822)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_13717 for (3000ds/27Mi)
% 1.63/1.49  % (13820)First to succeed.
% 1.63/1.49  % (13821)Also succeeded, but the first one will report.
% 1.63/1.49  % (13826)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_13717 for (3000ds/18Mi)
% 1.63/1.49  % (13823)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_13717 for (3000ds/2Mi)
% 1.63/1.49  % (13825)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_13717 for (3000ds/275Mi)
% 1.63/1.49  % (13822)Also succeeded, but the first one will report.
% 1.63/1.49  % (13820)Refutation found. Thanks to Tanya!
% 1.63/1.49  % SZS status Theorem for DTF2THF_13717
% 1.63/1.49  % SZS output start Proof for DTF2THF_13717
% 1.63/1.49  thf(func_def_3, type, sK0: $i > $i > $o).
% 1.63/1.49  thf(f12,plain,(
% 1.63/1.49    $false),
% 1.63/1.49    inference(subsumption_resolution,[status(thm)],[f11,f10])).
% 1.63/1.49  thf(f10,plain,(
% 1.63/1.49    ((sK0 @ sK1 @ sK2) != $true)),
% 1.63/1.49    inference(cnf_transformation,[status(thm)],[f9])).
% 1.63/1.49  thf(f9,plain,(
% 1.63/1.49    ((sK0 @ sK1 @ sK2) = $true) & ((sK0 @ sK1 @ sK2) != $true)),
% 1.63/1.49    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f8])).
% 1.63/1.49  thf(f8,plain,(
% 1.63/1.49    ? [X0 : $i > $i > $o,X1 : $i,X2 : $i] : (((X0 @ X1 @ X2) = $true) & ((X0 @ X1 @ X2) != $true)) => (((sK0 @ sK1 @ sK2) = $true) & ((sK0 @ sK1 @ sK2) != $true))),
% 1.63/1.49    introduced(definition,[],[choice_axiom])).
% 1.63/1.49  thf(f7,plain,(
% 1.63/1.49    ? [X0 : $i > $i > $o,X1 : $i,X2 : $i] : (((X0 @ X1 @ X2) = $true) & ((X0 @ X1 @ X2) != $true))),
% 1.63/1.49    inference(rectify,[status(thm)],[f6])).
% 1.63/1.49  thf(f6,plain,(
% 1.63/1.49    ? [X2 : $i > $i > $o,X0 : $i,X1 : $i] : (($true = (X2 @ X0 @ X1)) & ($true != (X2 @ X0 @ X1)))),
% 1.63/1.49    inference(ennf_transformation,[status(thm)],[f5])).
% 1.63/1.49  thf(f5,plain,(
% 1.63/1.49    ~! [X2 : $i > $i > $o,X1 : $i,X0 : $i] : (($true = (X2 @ X0 @ X1)) => ($true = (X2 @ X0 @ X1)))),
% 1.63/1.49    inference(fool_elimination,[status(thm)],[f4])).
% 1.63/1.49  thf(f4,plain,(
% 1.63/1.49    ~! [X0 : $i,X1 : $i,X2 : $i > $i > $o] : ((X2 @ X0 @ X1) => (X2 @ X0 @ X1))),
% 1.63/1.49    inference(rectify,[status(thm)],[f2])).
% 1.63/1.49  thf(f2,negated_conjecture,(
% 1.63/1.49    ~! [X1 : $i,X2 : $i,X0 : $i > $i > $o] : ((X0 @ X1 @ X2) => (X0 @ X1 @ X2))),
% 1.63/1.49    inference(negated_conjecture,[status(cth)],[f1])).
% 1.63/1.49  thf(f1,conjecture,(
% 1.63/1.49    ! [X1 : $i,X2 : $i,X0 : $i > $i > $o] : ((X0 @ X1 @ X2) => (X0 @ X1 @ X2))),
% 1.63/1.49    file('/export/starexec/sandbox/tmp/tmp.rE1lDWfUOE/DTF2THF_13717.p',cTHM175_pme)).
% 1.63/1.49  thf(f11,plain,(
% 1.63/1.49    ((sK0 @ sK1 @ sK2) = $true)),
% 1.63/1.49    inference(cnf_transformation,[status(thm)],[f9])).
% 1.63/1.49  % SZS output end Proof for DTF2THF_13717
% 1.63/1.49  % (13820)------------------------------
% 1.63/1.49  % (13820)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.63/1.49  % (13820)Termination reason: Refutation
% 1.63/1.49  
% 1.63/1.49  % (13820)Memory used [KB]: 5373
% 1.63/1.49  % (13820)Time elapsed: 0.003 s
% 1.63/1.49  % (13820)Instructions burned: 1 (million)
% 1.63/1.49  % (13820)------------------------------
% 1.63/1.49  % (13820)------------------------------
% 1.63/1.49  % (13819)Success in time 0.019 s
%------------------------------------------------------------------------------