↑ Up

DT2H2X---1.9.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : DT2H2X---1.9.5
% Problem  : SEV429^1 : TPTP v9.2.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n011.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:41:14 AM UTC 2026

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

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

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

thf(func_def_6,type,
    inv_f_2: $i > $i ).

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

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

thf(f14,plain,
    ( ( sK0 @ inv_f_2 )
   != ( sK0 @ inv_f_2 ) ),
    inference(superposition,[status(thm)],[f11,f12]) ).

thf(f12,plain,
    ! [X0: $i] :
      ( ( inv_f_2 @ ( f @ X0 ) )
      = X0 ),
    inference(injectivity,[status(thm)],[f10]) ).

thf(f10,plain,
    ! [X0: $i,X1: $i] :
      ( ( ( f @ X0 )
       != ( f @ X1 ) )
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

thf(f6,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ( ( f @ X0 )
       != ( f @ X1 ) ) ),
    inference(ennf_transformation,[status(thm)],[f1]) ).

thf(f1,axiom,
    ! [X1: $i,X0: $i] :
      ( ( ( f @ X0 )
        = ( f @ X1 ) )
     => ( X0 = X1 ) ),
    file('/export/starexec/sandbox/tmp/tmp.Ao9CeFpMYO/DTF2THF_8772.p',finj) ).

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

thf(f9,plain,
    ! [X0: $i > $i] :
      ( ( X0 @ ( f @ ( sK0 @ X0 ) ) )
     != ( sK0 @ X0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).

thf(f8,plain,
    ! [X0: $i > $i] :
      ( ? [X1: $i] :
          ( ( X0 @ ( f @ X1 ) )
         != X1 )
     => ( ( X0 @ ( f @ ( sK0 @ X0 ) ) )
       != ( sK0 @ X0 ) ) ),
    introduced(definition,[],[choice_axiom]) ).

thf(f7,plain,
    ! [X0: $i > $i] :
    ? [X1: $i] :
      ( ( X0 @ ( f @ X1 ) )
     != X1 ),
    inference(ennf_transformation,[status(thm)],[f5]) ).

thf(f5,plain,
    ~ ? [X0: $i > $i] :
      ! [X1: $i] :
        ( ( X0 @ ( f @ X1 ) )
        = X1 ),
    inference(rectify,[status(thm)],[f3]) ).

thf(f3,negated_conjecture,
    ~ ? [X2: $i > $i] :
      ! [X0: $i] :
        ( ( X2 @ ( f @ X0 ) )
        = X0 ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

thf(f2,conjecture,
    ? [X2: $i > $i] :
    ! [X0: $i] :
      ( ( X2 @ ( f @ X0 ) )
      = X0 ),
    file('/export/starexec/sandbox/tmp/tmp.Ao9CeFpMYO/DTF2THF_8772.p',invexists) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEV429^1 : TPTP v9.2.1. Released v5.2.0.
% 0.11/0.13  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.18/0.34  % Computer : n011.cluster.edu
% 0.18/0.34  % Model    : x86_64 x86_64
% 0.18/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34  % Memory   : 8042.1875MB
% 0.18/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34  % CPULimit : 300
% 0.18/0.34  % WCLimit  : 300
% 0.18/0.34  % DateTime : Tue Feb 24 12:46:17 EST 2026
% 0.18/0.35  % CPUTime  : 
% 0.18/0.35  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.30/0.46  ---- Original DTF file ---
% 0.30/0.46  thf(spec,logic,$$dhol).
% 0.30/0.46  %------------------------------------------------------------------------------
% 0.30/0.46  % File     : SEV429^1 : TPTP v9.2.1. Released v5.2.0.
% 0.30/0.46  % Domain   : Set Theory
% 0.30/0.46  % Problem  : Injective functions f:I->I have left inverses
% 0.30/0.46  % Version  : Especial.
% 0.30/0.46  % English  :
% 0.30/0.46  
% 0.30/0.46  % Refs     : [Bro11] Brown (2011), Email to Geoff Sutcliffe
% 0.30/0.46  % Source   : [Bro11]
% 0.30/0.46  % Names    : INVEXISTS [Bro11]
% 0.30/0.46  
% 0.30/0.46  % Status   : Theorem
% 0.30/0.46  % Rating   : 0.56 v9.1.0, 0.50 v8.2.0, 0.69 v8.1.0, 0.64 v7.5.0, 0.29 v7.4.0, 0.67 v7.2.0, 0.62 v7.1.0, 0.75 v7.0.0, 0.71 v6.4.0, 0.67 v6.3.0, 0.60 v6.2.0, 0.71 v6.1.0, 0.86 v5.5.0, 1.00 v5.2.0
% 0.30/0.46  % Syntax   : Number of formulae    :    3 (   1 unt;   1 typ;   0 def)
% 0.30/0.46  %            Number of atoms       :    3 (   3 equ;   0 cnn)
% 0.30/0.46  %            Maximal formula atoms :    2 (   1 avg)
% 0.30/0.46  %            Number of connectives :    5 (   0   ~;   0   |;   0   &;   4   @)
% 0.30/0.46  %                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
% 0.30/0.46  %            Maximal formula depth :    4 (   4 avg)
% 0.30/0.46  %            Number of types       :    1 (   0 usr)
% 0.30/0.46  %            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
% 0.30/0.46  %            Number of symbols     :    2 (   1 usr;   0 con; 1-2 aty)
% 0.30/0.46  %            Number of variables   :    4 (   0   ^;   3   !;   1   ?;   4   :)
% 0.30/0.46  % SPC      : TH0_THM_EQU_NAR
% 0.30/0.46  
% 0.30/0.46  % Comments : 
% 0.30/0.46  %------------------------------------------------------------------------------
% 0.30/0.46  thf(f,type,
% 0.30/0.46      f: $i > $i ).
% 0.30/0.46  
% 0.30/0.46  thf(finj,axiom,
% 0.30/0.46      ! [X: $i,Y: $i] :
% 0.30/0.46        ( ( ( f @ X )
% 0.30/0.46          = ( f @ Y ) )
% 0.30/0.46       => ( X = Y ) ) ).
% 0.30/0.46  
% 0.30/0.46  thf(invexists,conjecture,
% 0.30/0.46      ? [G: $i > $i] :
% 0.30/0.46      ! [X: $i] :
% 0.30/0.46        ( ( G @ ( f @ X ) )
% 0.30/0.46        = X ) ).
% 0.30/0.46  
% 0.30/0.46  %------------------------------------------------------------------------------
% 0.30/0.46  ------------------------
% 1.68/1.44  ---- Embedded in THF ---
% 1.68/1.44  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.68/1.44  %%% Generated on Tue Feb 24 12:46:18 EST 2026
% 1.68/1.44  %%% using '$$dhol' embedding, version 1.3.0.
% 1.68/1.44  %%% Logic specification used:
% 1.68/1.44  %%% thf(spec, logic, $$dhol).
% 1.68/1.44  
% 1.68/1.44  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.Ao9CeFpMYO/DTF2DTF8772.p
% See solution above
% 1.68/1.44  ------------------------
% 1.68/1.45  ---- Cleaned THF ---
% 1.68/1.45  thf(f,type,
% 1.68/1.45      f: $i > $i ).
% 1.68/1.45  
% 1.68/1.45  thf(finj,axiom,
% 1.68/1.45      ! [X: $i,Y: $i] :
% 1.68/1.45        ( ( ( f @ X )
% 1.68/1.45          = ( f @ Y ) )
% 1.68/1.45       => ( X = Y ) ) ).
% 1.68/1.45  
% 1.68/1.45  thf(invexists,conjecture,
% 1.68/1.45      ? [G: $i > $i] :
% 1.68/1.45      ! [X: $i] :
% 1.68/1.45        ( ( G @ ( f @ X ) )
% 1.68/1.45        = X ) ).
% 1.68/1.45  ------------------------
% 1.68/1.47  % (8870)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_8772 for (3000ds/4Mi)
% 1.68/1.47  % (8872)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_8772 for (3000ds/2Mi)
% 1.68/1.47  % (8869)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_8772 for (3000ds/183Mi)
% 1.68/1.47  % (8875)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_8772 for (3000ds/18Mi)
% 1.68/1.47  % (8871)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_8772 for (3000ds/27Mi)
% 1.68/1.47  % (8873)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_8772 for (3000ds/2Mi)
% 1.68/1.47  % (8873)Instruction limit reached!
% 1.68/1.47  % (8873)------------------------------
% 1.68/1.47  % (8873)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.47  % (8873)Termination reason: Unknown
% 1.68/1.47  % (8873)Termination phase: Saturation
% 1.68/1.47  
% 1.68/1.47  % (8873)Memory used [KB]: 5373
% 1.68/1.47  % (8873)Time elapsed: 0.002 s
% 1.68/1.47  % (8873)Instructions burned: 2 (million)
% 1.68/1.47  % (8873)------------------------------
% 1.68/1.47  % (8873)------------------------------
% 1.68/1.47  % (8871)Refutation not found, incomplete strategy
% 1.68/1.47  % (8871)------------------------------
% 1.68/1.47  % (8871)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.47  % (8871)Termination reason: Refutation not found, incomplete strategy
% 1.68/1.47  
% 1.68/1.47  
% 1.68/1.47  % (8871)Memory used [KB]: 5500
% 1.68/1.47  % (8871)Time elapsed: 0.002 s
% 1.68/1.47  % (8871)Instructions burned: 1 (million)
% 1.68/1.47  % (8871)------------------------------
% 1.68/1.47  % (8871)------------------------------
% 1.68/1.47  % (8872)First to succeed.
% 1.68/1.47  % (8872)Refutation found. Thanks to Tanya!
% 1.68/1.47  % SZS status Theorem for DTF2THF_8772
% 1.68/1.47  % SZS output start Proof for DTF2THF_8772
% 1.68/1.47  thf(func_def_0, type, f: $i > $i).
% 1.68/1.47  thf(func_def_4, type, sK0: ($i > $i) > $i).
% 1.68/1.47  thf(func_def_6, type, inv_f_2: $i > $i).
% 1.68/1.47  thf(func_def_7, type, ph3: !>[X0: $tType]:(X0)).
% 1.68/1.47  thf(f15,plain,(
% 1.68/1.47    $false),
% 1.68/1.47    inference(trivial_inequality_removal,[status(thm)],[f14])).
% 1.68/1.47  thf(f14,plain,(
% 1.68/1.47    ((sK0 @ inv_f_2) != (sK0 @ inv_f_2))),
% 1.68/1.47    inference(superposition,[status(thm)],[f11,f12])).
% 1.68/1.47  thf(f12,plain,(
% 1.68/1.47    ( ! [X0 : $i] : (((inv_f_2 @ (f @ X0)) = X0)) )),
% 1.68/1.47    inference(injectivity,[status(thm)],[f10])).
% 1.68/1.47  thf(f10,plain,(
% 1.68/1.47    ( ! [X0 : $i,X1 : $i] : (((f @ X0) != (f @ X1)) | (X0 = X1)) )),
% 1.68/1.47    inference(cnf_transformation,[status(thm)],[f6])).
% 1.68/1.47  thf(f6,plain,(
% 1.68/1.47    ! [X0 : $i,X1 : $i] : ((X0 = X1) | ((f @ X0) != (f @ X1)))),
% 1.68/1.47    inference(ennf_transformation,[status(thm)],[f1])).
% 1.68/1.47  thf(f1,axiom,(
% 1.68/1.47    ! [X1 : $i,X0 : $i] : (((f @ X0) = (f @ X1)) => (X0 = X1))),
% 1.68/1.47    file('/export/starexec/sandbox/tmp/tmp.Ao9CeFpMYO/DTF2THF_8772.p',finj)).
% 1.68/1.47  thf(f11,plain,(
% 1.68/1.47    ( ! [X0 : $i > $i] : (((X0 @ (f @ (sK0 @ X0))) != (sK0 @ X0))) )),
% 1.68/1.47    inference(cnf_transformation,[status(thm)],[f9])).
% 1.68/1.47  thf(f9,plain,(
% 1.68/1.47    ! [X0 : $i > $i] : ((X0 @ (f @ (sK0 @ X0))) != (sK0 @ X0))),
% 1.68/1.47    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8])).
% 1.68/1.47  thf(f8,plain,(
% 1.68/1.47    ! [X0 : $i > $i] : (? [X1 : $i] : ((X0 @ (f @ X1)) != X1) => ((X0 @ (f @ (sK0 @ X0))) != (sK0 @ X0)))),
% 1.68/1.47    introduced(definition,[],[choice_axiom])).
% 1.68/1.47  thf(f7,plain,(
% 1.68/1.47    ! [X0 : $i > $i] : ? [X1 : $i] : ((X0 @ (f @ X1)) != X1)),
% 1.68/1.47    inference(ennf_transformation,[status(thm)],[f5])).
% 1.68/1.47  thf(f5,plain,(
% 1.68/1.47    ~? [X0 : $i > $i] : ! [X1 : $i] : ((X0 @ (f @ X1)) = X1)),
% 1.68/1.47    inference(rectify,[status(thm)],[f3])).
% 1.68/1.47  thf(f3,negated_conjecture,(
% 1.68/1.47    ~? [X2 : $i > $i] : ! [X0 : $i] : ((X2 @ (f @ X0)) = X0)),
% 1.68/1.47    inference(negated_conjecture,[status(cth)],[f2])).
% 1.68/1.47  thf(f2,conjecture,(
% 1.68/1.47    ? [X2 : $i > $i] : ! [X0 : $i] : ((X2 @ (f @ X0)) = X0)),
% 1.68/1.47    file('/export/starexec/sandbox/tmp/tmp.Ao9CeFpMYO/DTF2THF_8772.p',invexists)).
% 1.68/1.47  % SZS output end Proof for DTF2THF_8772
% 1.68/1.47  % (8872)------------------------------
% 1.68/1.47  % (8872)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.68/1.47  % (8872)Termination reason: Refutation
% 1.68/1.47  
% 1.68/1.47  % (8872)Memory used [KB]: 5500
% 1.68/1.47  % (8872)Time elapsed: 0.003 s
% 1.68/1.47  % (8872)Instructions burned: 1 (million)
% 1.68/1.47  % (8872)------------------------------
% 1.68/1.47  % (8872)------------------------------
% 1.68/1.47  % (8868)Success in time 0.016 s
%------------------------------------------------------------------------------