↑ Up

DT2H2X---1.9.5.THM-Ref.s

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

% Computer : n014.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:28:28 AM UTC 2026

% Result   : Theorem 1.64s 1.45s
% Output   : Refutation 1.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (  20 unt;   0 typ;   0 def)
%            Number of atoms       :   85 (  18 equ;   0 cnn)
%            Maximal formula atoms :    2 (   4 avg)
%            Number of connectives :  146 (  10   ~;   0   |;   9   &;  98   @)
%                                         (   0 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (  11   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   4 usr;   4 con; 0-2 aty)
%                                         (  11  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   32 (  22   ^;   8   !;   2   ?;  32   :)

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

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

thf(func_def_14,type,
    sK2: $i > $o ).

thf(f26,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[f25]) ).

thf(f25,plain,
    $true = $false,
    inference(forward_demodulation,[status(thm)],[f21,f18]) ).

thf(f18,plain,
    ( $false
    = ( sK2 @ sK0 ) ),
    inference(binary_proxy_clausification,[status(thm)],[f17]) ).

thf(f17,plain,
    ( ( ( ( sK2 @ sK0 )
        & ( !! @ $i
          @ ^ [Y0: $i] :
              ( ( sK2 @ Y0 )
             => ( sK2 @ ( s @ ( s @ Y0 ) ) ) ) ) )
     => ( sK2 @ sK0 ) )
    = $false ),
    inference(beta_eta_normalization,[status(thm)],[f16]) ).

thf(f16,plain,
    ( ( ^ [Y0: $i > $o] :
          ( ( ( Y0 @ sK0 )
            & ( !! @ $i
              @ ^ [Y1: $i] :
                  ( ( Y0 @ Y1 )
                 => ( Y0 @ ( s @ ( s @ Y1 ) ) ) ) ) )
         => ( Y0 @ sK0 ) )
      @ sK2 )
    = $false ),
    inference(sigma_clausification,[status(thm)],[f15]) ).

thf(f15,plain,
    ( $true
   != ( !! @ ( $i > $o )
      @ ^ [Y0: $i > $o] :
          ( ( ( Y0 @ sK0 )
            & ( !! @ $i
              @ ^ [Y1: $i] :
                  ( ( Y0 @ Y1 )
                 => ( Y0 @ ( s @ ( s @ Y1 ) ) ) ) ) )
         => ( Y0 @ sK0 ) ) ) ),
    inference(beta_eta_normalization,[status(thm)],[f14]) ).

thf(f14,plain,
    ( $true
   != ( ^ [Y0: $i,Y1: $i] :
          ( !! @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ( ( Y2 @ Y0 )
                & ( !! @ $i
                  @ ^ [Y3: $i] :
                      ( ( Y2 @ Y3 )
                     => ( Y2 @ ( s @ ( s @ Y3 ) ) ) ) ) )
             => ( Y2 @ Y1 ) ) )
      @ sK0
      @ sK0 ) ),
    inference(definition_unfolding,[status(thm)],[f13,f12]) ).

thf(f12,plain,
    ( cCKB_E2
    = ( ^ [Y0: $i,Y1: $i] :
          ( !! @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ( ( Y2 @ Y0 )
                & ( !! @ $i
                  @ ^ [Y3: $i] :
                      ( ( Y2 @ Y3 )
                     => ( Y2 @ ( s @ ( s @ Y3 ) ) ) ) ) )
             => ( Y2 @ Y1 ) ) ) ) ),
    inference(cnf_transformation,[status(thm)],[f8]) ).

thf(f8,plain,
    ( cCKB_E2
    = ( ^ [Y0: $i,Y1: $i] :
          ( !! @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ( ( Y2 @ Y0 )
                & ( !! @ $i
                  @ ^ [Y3: $i] :
                      ( ( Y2 @ Y3 )
                     => ( Y2 @ ( s @ ( s @ Y3 ) ) ) ) ) )
             => ( Y2 @ Y1 ) ) ) ) ),
    inference(fool_elimination,[status(thm)],[f7]) ).

thf(f7,plain,
    ( cCKB_E2
    = ( ^ [X0: $i,X1: $i] :
        ! [X2: $i > $o] :
          ( ( ! [X3: $i] :
                ( ( X2 @ X3 )
               => ( X2 @ ( s @ ( s @ X3 ) ) ) )
            & ( X2 @ X0 ) )
         => ( X2 @ X1 ) ) ) ),
    inference(rectify,[status(thm)],[f1]) ).

thf(f1,axiom,
    ( cCKB_E2
    = ( ^ [X0: $i,X1: $i] :
        ! [X2: $i > $o] :
          ( ( ! [X3: $i] :
                ( ( X2 @ X3 )
               => ( X2 @ ( s @ ( s @ X3 ) ) ) )
            & ( X2 @ X0 ) )
         => ( X2 @ X1 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.8YWlBYsmUc/DTF2THF_24133.p',cCKB_E2_def) ).

thf(f13,plain,
    ( $true
   != ( cCKB_E2 @ sK0 @ sK0 ) ),
    inference(cnf_transformation,[status(thm)],[f11]) ).

thf(f11,plain,
    ( $true
   != ( cCKB_E2 @ sK0 @ sK0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).

thf(f10,plain,
    ( ? [X0: $i] :
        ( ( cCKB_E2 @ X0 @ X0 )
       != $true )
   => ( $true
     != ( cCKB_E2 @ sK0 @ sK0 ) ) ),
    introduced(definition,[],[choice_axiom]) ).

thf(f9,plain,
    ? [X0: $i] :
      ( ( cCKB_E2 @ X0 @ X0 )
     != $true ),
    inference(ennf_transformation,[status(thm)],[f6]) ).

thf(f6,plain,
    ~ ! [X0: $i] :
        ( ( cCKB_E2 @ X0 @ X0 )
        = $true ),
    inference(fool_elimination,[status(thm)],[f5]) ).

thf(f5,plain,
    ~ ! [X0: $i] : ( cCKB_E2 @ X0 @ X0 ),
    inference(rectify,[status(thm)],[f3]) ).

thf(f3,negated_conjecture,
    ~ ! [X0: $i] : ( cCKB_E2 @ X0 @ X0 ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

thf(f2,conjecture,
    ! [X0: $i] : ( cCKB_E2 @ X0 @ X0 ),
    file('/export/starexec/sandbox/tmp/tmp.8YWlBYsmUc/DTF2THF_24133.p',cCKB_L32000) ).

thf(f21,plain,
    ( $true
    = ( sK2 @ sK0 ) ),
    inference(binary_proxy_clausification,[status(thm)],[f19]) ).

thf(f19,plain,
    ( $true
    = ( ( sK2 @ sK0 )
      & ( !! @ $i
        @ ^ [Y0: $i] :
            ( ( sK2 @ Y0 )
           => ( sK2 @ ( s @ ( s @ Y0 ) ) ) ) ) ) ),
    inference(binary_proxy_clausification,[status(thm)],[f17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : PUZ100^5 : TPTP v9.2.1. Bugfixed v5.2.0.
% 0.00/0.12  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/0.33  % Computer : n014.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 11:32:57 EST 2026
% 0.15/0.33  % CPUTime  : 
% 0.15/0.33  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.19/0.46  ---- Original DTF file ---
% 0.19/0.46  thf(spec,logic,$$dhol).
% 0.19/0.46  %------------------------------------------------------------------------------
% 0.19/0.46  % File     : PUZ100^5 : TPTP v9.2.1. Bugfixed v5.2.0.
% 0.19/0.46  % Domain   : Puzzles
% 0.19/0.46  % Problem  : TPS problem from CHECKERBOARD-THMS
% 0.19/0.46  % Version  : Especial.
% 0.19/0.46  % English  :
% 0.19/0.46  
% 0.19/0.46  % Refs     : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.19/0.46  % Source   : [Bro09]
% 0.19/0.46  % Names    : tps_0596 [Bro09]
% 0.19/0.46  
% 0.19/0.46  % Status   : Theorem
% 0.19/0.46  % Rating   : 0.00 v8.2.0, 0.08 v8.1.0, 0.00 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.2.0
% 0.19/0.46  % Syntax   : Number of formulae    :    4 (   2 unt;   2 typ;   1 def)
% 0.19/0.46  %            Number of atoms       :    3 (   1 equ;   0 cnn)
% 0.19/0.46  %            Maximal formula atoms :    1 (   1 avg)
% 0.19/0.46  %            Number of connectives :   11 (   0   ~;   0   |;   1   &;   8   @)
% 0.19/0.46  %                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
% 0.19/0.46  %            Maximal formula depth :    4 (   3 avg)
% 0.19/0.46  %            Number of types       :    2 (   0 usr)
% 0.19/0.46  %            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
% 0.19/0.46  %            Number of symbols     :    3 (   2 usr;   0 con; 1-2 aty)
% 0.19/0.46  %            Number of variables   :    5 (   2   ^;   3   !;   0   ?;   5   :)
% 0.19/0.46  % SPC      : TH0_THM_EQU_NAR
% 0.19/0.46  
% 0.19/0.46  % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.19/0.46  %            project in the Department of Mathematical Sciences at Carnegie
% 0.19/0.46  %            Mellon University. Distributed under the Creative Commons copyleft
% 0.19/0.46  %            license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.19/0.46  % Bugfixes : v5.2.0 - Added missing type declarations.
% 0.19/0.46  %------------------------------------------------------------------------------
% 0.19/0.46  thf(s_type,type,
% 0.19/0.46      s: $i > $i ).
% 0.19/0.46  
% 0.19/0.46  thf(cCKB_E2_type,type,
% 0.19/0.46      cCKB_E2: $i > $i > $o ).
% 0.19/0.46  
% 0.19/0.46  thf(cCKB_E2_def,definition,
% 0.19/0.46      ( cCKB_E2
% 0.19/0.46      = ( ^ [Xx: $i,Xy: $i] :
% 0.19/0.46          ! [Xp: $i > $o] :
% 0.19/0.46            ( ( ( Xp @ Xx )
% 0.19/0.46              & ! [Xu: $i] :
% 0.19/0.46                  ( ( Xp @ Xu )
% 0.19/0.46                 => ( Xp @ ( s @ ( s @ Xu ) ) ) ) )
% 0.19/0.46           => ( Xp @ Xy ) ) ) ) ).
% 0.19/0.46  
% 0.19/0.46  thf(cCKB_L32000,conjecture,
% 0.19/0.46      ! [Xx: $i] : ( cCKB_E2 @ Xx @ Xx ) ).
% 0.19/0.47  
% 0.19/0.47  %------------------------------------------------------------------------------
% 0.19/0.47  ------------------------
% 1.64/1.42  ---- Embedded in THF ---
% 1.64/1.42  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.64/1.42  %%% Generated on Tue Feb 24 11:32:58 EST 2026
% 1.64/1.42  %%% using '$$dhol' embedding, version 1.3.0.
% 1.64/1.42  %%% Logic specification used:
% 1.64/1.42  %%% thf(spec, logic, $$dhol).
% 1.64/1.42  
% 1.64/1.42  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.8YWlBYsmUc/DTF2DTF24133.p
% See solution above
% 1.64/1.42  ------------------------
% 1.64/1.43  ---- Cleaned THF ---
% 1.64/1.43  thf(s_type,type,
% 1.64/1.43      s: $i > $i ).
% 1.64/1.43  
% 1.64/1.43  thf(cCKB_E2_type,type,
% 1.64/1.43      cCKB_E2: $i > $i > $o ).
% 1.64/1.43  
% 1.64/1.43  thf(cCKB_E2_def,definition,
% 1.64/1.43      ( cCKB_E2
% 1.64/1.43      = ( ^ [Xx: $i,Xy: $i] :
% 1.64/1.43          ! [Xp: $i > $o] :
% 1.64/1.43            ( ( ( Xp @ Xx )
% 1.64/1.43              & ! [Xu: $i] :
% 1.64/1.43                  ( ( Xp @ Xu )
% 1.64/1.43                 => ( Xp @ ( s @ ( s @ Xu ) ) ) ) )
% 1.64/1.43           => ( Xp @ Xy ) ) ) ) ).
% 1.64/1.43  
% 1.64/1.43  thf(cCKB_L32000,conjecture,
% 1.64/1.43      ! [Xx: $i] : ( cCKB_E2 @ Xx @ Xx ) ).
% 1.64/1.43  ------------------------
% 1.64/1.45  % (24234)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_24133 for (2999ds/2Mi)
% 1.64/1.45  % (24232)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_24133 for (2999ds/27Mi)
% 1.64/1.45  % (24235)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_24133 for (2999ds/275Mi)
% 1.64/1.45  % (24236)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_24133 for (2999ds/18Mi)
% 1.64/1.45  % (24230)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_24133 for (2999ds/183Mi)
% 1.64/1.45  % (24231)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_24133 for (2999ds/4Mi)
% 1.64/1.45  % (24233)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_24133 for (2999ds/2Mi)
% 1.64/1.45  % (24233)Instruction limit reached!
% 1.64/1.45  % (24233)------------------------------
% 1.64/1.45  % (24233)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.45  % (24233)Termination reason: Unknown
% 1.64/1.45  % (24233)Termination phase: Saturation
% 1.64/1.45  
% 1.64/1.45  % (24233)Memory used [KB]: 5373
% 1.64/1.45  % (24233)Time elapsed: 0.003 s
% 1.64/1.45  % (24233)Instructions burned: 2 (million)
% 1.64/1.45  % (24233)------------------------------
% 1.64/1.45  % (24233)------------------------------
% 1.64/1.45  % (24235)Refutation not found, incomplete strategy
% 1.64/1.45  % (24235)------------------------------
% 1.64/1.45  % (24235)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.45  % (24235)Termination reason: Refutation not found, incomplete strategy
% 1.64/1.45  
% 1.64/1.45  
% 1.64/1.45  % (24235)Memory used [KB]: 5373
% 1.64/1.45  % (24235)Time elapsed: 0.003 s
% 1.64/1.45  % (24235)Instructions burned: 1 (million)
% 1.64/1.45  % (24235)------------------------------
% 1.64/1.45  % (24235)------------------------------
% 1.64/1.45  % (24236)First to succeed.
% 1.64/1.45  % (24234)Instruction limit reached!
% 1.64/1.45  % (24234)------------------------------
% 1.64/1.45  % (24234)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.45  % (24234)Termination reason: Unknown
% 1.64/1.45  % (24234)Termination phase: Saturation
% 1.64/1.45  
% 1.64/1.45  % (24234)Memory used [KB]: 5500
% 1.64/1.45  % (24234)Time elapsed: 0.004 s
% 1.64/1.45  % (24234)Instructions burned: 2 (million)
% 1.64/1.45  % (24234)------------------------------
% 1.64/1.45  % (24234)------------------------------
% 1.64/1.45  % (24230)Also succeeded, but the first one will report.
% 1.64/1.45  % (24236)Refutation found. Thanks to Tanya!
% 1.64/1.45  % SZS status Theorem for DTF2THF_24133
% 1.64/1.45  % SZS output start Proof for DTF2THF_24133
% 1.64/1.45  thf(func_def_0, type, s: $i > $i).
% 1.64/1.45  thf(func_def_1, type, cCKB_E2: $i > $i > $o).
% 1.64/1.45  thf(func_def_14, type, sK2: $i > $o).
% 1.64/1.45  thf(f26,plain,(
% 1.64/1.45    $false),
% 1.64/1.45    inference(trivial_inequality_removal,[status(thm)],[f25])).
% 1.64/1.45  thf(f25,plain,(
% 1.64/1.45    ($true = $false)),
% 1.64/1.45    inference(forward_demodulation,[status(thm)],[f21,f18])).
% 1.64/1.45  thf(f18,plain,(
% 1.64/1.45    ($false = (sK2 @ sK0))),
% 1.64/1.45    inference(binary_proxy_clausification,[status(thm)],[f17])).
% 1.64/1.45  thf(f17,plain,(
% 1.64/1.45    ((((sK2 @ sK0) & (!! @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) => (sK2 @ (s @ (s @ Y0))))))) => (sK2 @ sK0)) = $false)),
% 1.64/1.45    inference(beta_eta_normalization,[status(thm)],[f16])).
% 1.64/1.45  thf(f16,plain,(
% 1.64/1.45    (((^[Y0 : $i > $o]: (((Y0 @ sK0) & (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (s @ (s @ Y1))))))) => (Y0 @ sK0))) @ sK2) = $false)),
% 1.64/1.45    inference(sigma_clausification,[status(thm)],[f15])).
% 1.64/1.45  thf(f15,plain,(
% 1.64/1.45    ($true != (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((Y0 @ sK0) & (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (s @ (s @ Y1))))))) => (Y0 @ sK0)))))),
% 1.64/1.45    inference(beta_eta_normalization,[status(thm)],[f14])).
% 1.64/1.45  thf(f14,plain,(
% 1.64/1.45    ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (((Y2 @ Y0) & (!! @ $i @ (^[Y3 : $i]: ((Y2 @ Y3) => (Y2 @ (s @ (s @ Y3))))))) => (Y2 @ Y1))))))) @ sK0 @ sK0))),
% 1.64/1.45    inference(definition_unfolding,[status(thm)],[f13,f12])).
% 1.64/1.45  thf(f12,plain,(
% 1.64/1.45    (cCKB_E2 = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (((Y2 @ Y0) & (!! @ $i @ (^[Y3 : $i]: ((Y2 @ Y3) => (Y2 @ (s @ (s @ Y3))))))) => (Y2 @ Y1))))))))),
% 1.64/1.45    inference(cnf_transformation,[status(thm)],[f8])).
% 1.64/1.45  thf(f8,plain,(
% 1.64/1.45    (cCKB_E2 = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (((Y2 @ Y0) & (!! @ $i @ (^[Y3 : $i]: ((Y2 @ Y3) => (Y2 @ (s @ (s @ Y3))))))) => (Y2 @ Y1))))))))),
% 1.64/1.45    inference(fool_elimination,[status(thm)],[f7])).
% 1.64/1.45  thf(f7,plain,(
% 1.64/1.45    (cCKB_E2 = (^[X0 : $i, X1 : $i] : (! [X2 : $i > $o] : ((! [X3 : $i] : ((X2 @ X3) => (X2 @ (s @ (s @ X3)))) & (X2 @ X0)) => (X2 @ X1)))))),
% 1.64/1.45    inference(rectify,[status(thm)],[f1])).
% 1.64/1.45  thf(f1,axiom,(
% 1.64/1.45    (cCKB_E2 = (^[X0 : $i, X1 : $i] : (! [X2 : $i > $o] : ((! [X3 : $i] : ((X2 @ X3) => (X2 @ (s @ (s @ X3)))) & (X2 @ X0)) => (X2 @ X1)))))),
% 1.64/1.45    file('/export/starexec/sandbox/tmp/tmp.8YWlBYsmUc/DTF2THF_24133.p',cCKB_E2_def)).
% 1.64/1.45  thf(f13,plain,(
% 1.64/1.45    ($true != (cCKB_E2 @ sK0 @ sK0))),
% 1.64/1.45    inference(cnf_transformation,[status(thm)],[f11])).
% 1.64/1.45  thf(f11,plain,(
% 1.64/1.45    ($true != (cCKB_E2 @ sK0 @ sK0))),
% 1.64/1.45    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 1.64/1.45  thf(f10,plain,(
% 1.64/1.45    ? [X0 : $i] : ((cCKB_E2 @ X0 @ X0) != $true) => ($true != (cCKB_E2 @ sK0 @ sK0))),
% 1.64/1.45    introduced(definition,[],[choice_axiom])).
% 1.64/1.45  thf(f9,plain,(
% 1.64/1.45    ? [X0 : $i] : ((cCKB_E2 @ X0 @ X0) != $true)),
% 1.64/1.45    inference(ennf_transformation,[status(thm)],[f6])).
% 1.64/1.45  thf(f6,plain,(
% 1.64/1.45    ~! [X0 : $i] : ((cCKB_E2 @ X0 @ X0) = $true)),
% 1.64/1.45    inference(fool_elimination,[status(thm)],[f5])).
% 1.64/1.45  thf(f5,plain,(
% 1.64/1.45    ~! [X0 : $i] : (cCKB_E2 @ X0 @ X0)),
% 1.64/1.45    inference(rectify,[status(thm)],[f3])).
% 1.64/1.45  thf(f3,negated_conjecture,(
% 1.64/1.45    ~! [X0 : $i] : (cCKB_E2 @ X0 @ X0)),
% 1.64/1.45    inference(negated_conjecture,[status(cth)],[f2])).
% 1.64/1.45  thf(f2,conjecture,(
% 1.64/1.45    ! [X0 : $i] : (cCKB_E2 @ X0 @ X0)),
% 1.64/1.45    file('/export/starexec/sandbox/tmp/tmp.8YWlBYsmUc/DTF2THF_24133.p',cCKB_L32000)).
% 1.64/1.45  thf(f21,plain,(
% 1.64/1.45    ($true = (sK2 @ sK0))),
% 1.64/1.45    inference(binary_proxy_clausification,[status(thm)],[f19])).
% 1.64/1.45  thf(f19,plain,(
% 1.64/1.45    ($true = ((sK2 @ sK0) & (!! @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) => (sK2 @ (s @ (s @ Y0))))))))),
% 1.64/1.45    inference(binary_proxy_clausification,[status(thm)],[f17])).
% 1.64/1.45  % SZS output end Proof for DTF2THF_24133
% 1.64/1.45  % (24236)------------------------------
% 1.64/1.45  % (24236)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.64/1.45  % (24236)Termination reason: Refutation
% 1.64/1.45  
% 1.64/1.45  % (24236)Memory used [KB]: 5500
% 1.64/1.45  % (24236)Time elapsed: 0.004 s
% 1.64/1.45  % (24236)Instructions burned: 2 (million)
% 1.64/1.45  % (24236)------------------------------
% 1.64/1.45  % (24236)------------------------------
% 1.64/1.45  % (24229)Success in time 0.018 s
%------------------------------------------------------------------------------