↑ Up

DT2H2X---1.9.5.THM-Ref.s

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

% Result   : Theorem 1.59s 1.31s
% Output   : Refutation 1.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   38 (   9 unt;   0 typ;   3 def)
%            Number of atoms       :  196 (  37 equ;   0 cnn)
%            Maximal formula atoms :    6 (   5 avg)
%            Number of connectives :  163 (  31   ~;  30   |;   1   &;  88   @)
%                                         (   3 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   25 (  25   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   27 (   0   ^;  21   !;   6   ?;  27   :)

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

thf(func_def_2,type,
    epsoo: ( ( $o > $o ) > $o ) > $o > $o ).

thf(func_def_6,type,
    ph1: 
      !>[X0: $tType] : X0 ).

thf(f134,plain,
    $false,
    inference(avatar_sat_refutation,[status(thm)],[f23,f28,f36,f133]) ).

thf(f133,plain,
    ( spl0_2
    | ~ spl0_3 ),
    inference(avatar_contradiction_clause,[status(thm)],[f132]) ).

thf(f132,plain,
    ( $false
    | spl0_2
    | ~ spl0_3 ),
    inference(subsumption_resolution,[status(thm)],[f118,f85]) ).

thf(f85,plain,
    ( ! [X0: $o] : ( $false = X0 )
    | spl0_2
    | ~ spl0_3 ),
    inference(leibniz_equality_elimination,[status(thm)],[f76]) ).

thf(f76,plain,
    ( ! [X0: $o > $o,X1: $o] :
        ( ( ( X0 @ X1 )
         != $true )
        | ( ( X0 @ $false )
          = $true ) )
    | spl0_2
    | ~ spl0_3 ),
    inference(superposition,[status(thm)],[f16,f62]) ).

thf(f62,plain,
    ( ! [X0: $o > $o] :
        ( ( epso @ X0 )
        = $false )
    | spl0_2
    | ~ spl0_3 ),
    inference(trivial_inequality_removal,[status(thm)],[f59]) ).

thf(f59,plain,
    ( ! [X0: $o > $o] :
        ( ( $true != $true )
        | ( ( epso @ X0 )
          = $false ) )
    | spl0_2
    | ~ spl0_3 ),
    inference(fool_paramodulation,[status(thm)],[f52]) ).

thf(f52,plain,
    ( ! [X0: $o > $o] :
        ( ( epso @ X0 )
       != $true )
    | spl0_2
    | ~ spl0_3 ),
    inference(subsumption_resolution,[status(thm)],[f50,f27]) ).

thf(f27,plain,
    ( ( $true
     != ( epsoo @ epso @ $true ) )
    | spl0_2 ),
    inference(avatar_component_clause,[status(thm)],[f25]) ).

thf(f25,definition,
    ( spl0_2
  <=> ( $true
      = ( epsoo @ epso @ $true ) ) ),
    introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition]) ).

thf(f50,plain,
    ( ! [X0: $o > $o] :
        ( ( ( epso @ X0 )
         != $true )
        | ( $true
          = ( epsoo @ epso @ $true ) ) )
    | ~ spl0_3 ),
    inference(superposition,[status(thm)],[f35,f15]) ).

thf(f15,plain,
    ! [X0: ( $o > $o ) > $o,X1: $o > $o] :
      ( ( ( X0 @ ( epsoo @ X0 ) )
        = $true )
      | ( ( X0 @ X1 )
       != $true ) ),
    inference(cnf_transformation,[status(thm)],[f13]) ).

thf(f13,plain,
    ! [X0: ( $o > $o ) > $o] :
      ( ! [X1: $o > $o] :
          ( ( X0 @ X1 )
         != $true )
      | ( ( X0 @ ( epsoo @ X0 ) )
        = $true ) ),
    inference(ennf_transformation,[status(thm)],[f7]) ).

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

thf(f6,plain,
    ! [X0: ( $o > $o ) > $o] :
      ( ? [X1: $o > $o] : ( X0 @ X1 )
     => ( X0 @ ( epsoo @ X0 ) ) ),
    inference(rectify,[status(thm)],[f2]) ).

thf(f2,axiom,
    ! [X0: ( $o > $o ) > $o] :
      ( ? [X1: $o > $o] : ( X0 @ X1 )
     => ( X0 @ ( epsoo @ X0 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.YfkMAcyZZO/DTF2THF_4755.p',choiceaxoo) ).

thf(f35,plain,
    ( ( ( epsoo @ epso @ ( epso @ ( epsoo @ epso ) ) )
      = $true )
    | ~ spl0_3 ),
    inference(avatar_component_clause,[status(thm)],[f33]) ).

thf(f33,definition,
    ( spl0_3
  <=> ( ( epsoo @ epso @ ( epso @ ( epsoo @ epso ) ) )
      = $true ) ),
    introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition]) ).

thf(f16,plain,
    ! [X0: $o > $o,X1: $o] :
      ( ( ( X0 @ X1 )
       != $true )
      | ( ( X0 @ ( epso @ X0 ) )
        = $true ) ),
    inference(cnf_transformation,[status(thm)],[f14]) ).

thf(f14,plain,
    ! [X0: $o > $o] :
      ( ! [X1: $o] :
          ( ( X0 @ X1 )
         != $true )
      | ( ( X0 @ ( epso @ X0 ) )
        = $true ) ),
    inference(ennf_transformation,[status(thm)],[f9]) ).

thf(f9,plain,
    ! [X0: $o > $o] :
      ( ? [X1: $o] :
          ( ( X0 @ X1 )
          = $true )
     => ( ( X0 @ ( epso @ X0 ) )
        = $true ) ),
    inference(fool_elimination,[status(thm)],[f8]) ).

thf(f8,plain,
    ! [X0: $o > $o] :
      ( ? [X1: $o] : ( X0 @ X1 )
     => ( X0 @ ( epso @ X0 ) ) ),
    inference(rectify,[status(thm)],[f1]) ).

thf(f1,axiom,
    ! [X0: $o > $o] :
      ( ? [X1: $o] : ( X0 @ X1 )
     => ( X0 @ ( epso @ X0 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.YfkMAcyZZO/DTF2THF_4755.p',choiceaxo) ).

thf(f118,plain,
    ( ( $false
     != ( epsoo @ epso @ $false ) )
    | spl0_2
    | ~ spl0_3 ),
    inference(superposition,[status(thm)],[f27,f85]) ).

thf(f36,plain,
    ( spl0_3
    | ~ spl0_1 ),
    inference(avatar_split_clause,[status(thm)],[f31,f20,f33]) ).

thf(f20,definition,
    ( spl0_1
  <=> ( ( epsoo @ epso @ $false )
      = $true ) ),
    introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition]) ).

thf(f31,plain,
    ( ( ( epsoo @ epso @ ( epso @ ( epsoo @ epso ) ) )
      = $true )
    | ~ spl0_1 ),
    inference(trivial_inequality_removal,[status(thm)],[f30]) ).

thf(f30,plain,
    ( ( ( epsoo @ epso @ ( epso @ ( epsoo @ epso ) ) )
      = $true )
    | ( $true != $true )
    | ~ spl0_1 ),
    inference(superposition,[status(thm)],[f16,f22]) ).

thf(f22,plain,
    ( ( ( epsoo @ epso @ $false )
      = $true )
    | ~ spl0_1 ),
    inference(avatar_component_clause,[status(thm)],[f20]) ).

thf(f28,plain,
    ~ spl0_2,
    inference(avatar_split_clause,[status(thm)],[f18,f25]) ).

thf(f18,plain,
    ( $true
   != ( epsoo @ epso @ $true ) ),
    inference(cnf_transformation,[status(thm)],[f12]) ).

thf(f12,plain,
    ( ( $true
     != ( epsoo @ epso @ $true ) )
    & ( ( epsoo @ epso @ $false )
      = $true ) ),
    inference(ennf_transformation,[status(thm)],[f11]) ).

thf(f11,plain,
    ~ ( ( ( epsoo @ epso @ $false )
        = $true )
     => ( $true
        = ( epsoo @ epso @ $true ) ) ),
    inference(fool_elimination,[status(thm)],[f10]) ).

thf(f10,plain,
    ~ ( ( epsoo @ epso @ $false )
     => ( epsoo @ epso @ $true ) ),
    inference(rectify,[status(thm)],[f4]) ).

thf(f4,negated_conjecture,
    ~ ( ( epsoo @ epso @ $false )
     => ( epsoo @ epso @ $true ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f3,conjecture,
    ( ( epsoo @ epso @ $false )
   => ( epsoo @ epso @ $true ) ),
    file('/export/starexec/sandbox/tmp/tmp.YfkMAcyZZO/DTF2THF_4755.p',c) ).

thf(f23,plain,
    spl0_1,
    inference(avatar_split_clause,[status(thm)],[f17,f20]) ).

thf(f17,plain,
    ( ( epsoo @ epso @ $false )
    = $true ),
    inference(cnf_transformation,[status(thm)],[f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYO559^1 : TPTP v9.2.1. Released v5.2.0.
% 0.00/0.13  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.18/0.34  % Computer : n016.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 14:34:21 EST 2026
% 0.18/0.34  % CPUTime  : 
% 0.18/0.34  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.20/0.45  ---- Original DTF file ---
% 0.20/0.45  thf(spec,logic,$$dhol).
% 0.20/0.45  %------------------------------------------------------------------------------
% 0.20/0.45  % File     : SYO559^1 : TPTP v9.2.1. Released v5.2.0.
% 0.20/0.45  % Domain   : Syntactic
% 0.20/0.45  % Problem  : Choice on $o>$o applied to choice on $o cannot be negatio
% 0.20/0.45  % Version  : Especial.
% 0.20/0.45  % English  :
% 0.20/0.45  
% 0.20/0.45  % Refs     : [Bro11] Brown (2011), Email to Geoff Sutcliffe
% 0.20/0.45  % Source   : [Bro11]
% 0.20/0.45  % Names    : CHOICE31 [Bro11]
% 0.20/0.45  
% 0.20/0.45  % Status   : Theorem
% 0.20/0.45  % Rating   : 0.17 v9.1.0, 0.25 v9.0.0, 0.17 v8.2.0, 0.18 v8.1.0, 0.25 v7.5.0, 0.33 v7.4.0, 0.22 v7.3.0, 0.20 v7.2.0, 0.25 v7.1.0, 0.29 v7.0.0, 0.25 v6.4.0, 0.29 v6.3.0, 0.33 v6.2.0, 0.50 v6.0.0, 0.33 v5.5.0, 0.40 v5.4.0, 0.75 v5.2.0
% 0.20/0.45  % Syntax   : Number of formulae    :    5 (   2 unt;   2 typ;   0 def)
% 0.20/0.45  %            Number of atoms       :    8 (   0 equ;   0 cnn)
% 0.20/0.45  %            Maximal formula atoms :    6 (   2 avg)
% 0.20/0.45  %            Number of connectives :   13 (   0   ~;   0   |;   0   &;  10   @)
% 0.20/0.45  %                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
% 0.20/0.45  %            Maximal formula depth :    5 (   5 avg)
% 0.20/0.45  %            Number of types       :    1 (   0 usr)
% 0.20/0.45  %            Number of type conns  :   10 (  10   >;   0   *;   0   +;   0  <<)
% 0.20/0.45  %            Number of symbols     :    4 (   2 usr;   2 con; 0-2 aty)
% 0.20/0.45  %            Number of variables   :    4 (   0   ^;   2   !;   2   ?;   4   :)
% 0.20/0.45  % SPC      : TH0_THM_NEQ_NAR
% 0.20/0.45  
% 0.20/0.45  % Comments : Assume epso and epsoo are choice operators on $o and $o>$o, 
% 0.20/0.45  %            respectively. epso can also be viewed as a predicate on $o>$o, 
% 0.20/0.45  %            so we can apply epsoo to epso. The term (epsoo @ epso) is of 
% 0.20/0.45  %            type $o>$o. This function is such that if it is true for $false, 
% 0.20/0.45  %            then it is true for $true. Proof Sketch: If the conjecture were 
% 0.20/0.45  %            not true, then (epsoo @ epso) would be the negation function.
% 0.20/0.45  %            However, negation is the only function $o>$o for which we are 
% 0.20/0.45  %            certain epso returns $false.
% 0.20/0.45  %------------------------------------------------------------------------------
% 0.20/0.45  thf(epso,type,
% 0.20/0.45      epso: ( $o > $o ) > $o ).
% 0.20/0.45  
% 0.20/0.45  thf(choiceaxo,axiom,
% 0.20/0.45      ! [P: $o > $o] :
% 0.20/0.45        ( ? [X: $o] : ( P @ X )
% 0.20/0.45       => ( P @ ( epso @ P ) ) ) ).
% 0.20/0.45  
% 0.20/0.45  thf(epsoo,type,
% 0.20/0.45      epsoo: ( ( $o > $o ) > $o ) > $o > $o ).
% 0.20/0.45  
% 0.20/0.45  thf(choiceaxoo,axiom,
% 0.20/0.45      ! [P: ( $o > $o ) > $o] :
% 0.20/0.45        ( ? [X: $o > $o] : ( P @ X )
% 0.20/0.45       => ( P @ ( epsoo @ P ) ) ) ).
% 0.20/0.45  
% 0.20/0.45  thf(c,conjecture,
% 0.20/0.45      ( ( epsoo @ epso @ $false )
% 0.20/0.45     => ( epsoo @ epso @ $true ) ) ).
% 0.20/0.45  
% 0.20/0.45  %------------------------------------------------------------------------------
% 0.20/0.45  ------------------------
% 1.51/1.25  ---- Embedded in THF ---
% 1.51/1.25  %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.51/1.25  %%% Generated on Tue Feb 24 14:34:22 EST 2026
% 1.51/1.25  %%% using '$$dhol' embedding, version 1.3.0.
% 1.51/1.25  %%% Logic specification used:
% 1.51/1.25  %%% thf(spec, logic, $$dhol).
% 1.51/1.25  
% 1.51/1.25  % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.YfkMAcyZZO/DTF2DTF4755.p
% See solution above
% 1.51/1.25  ------------------------
% 1.51/1.26  ---- Cleaned THF ---
% 1.51/1.26  thf(epso,type,
% 1.51/1.26      epso: ( $o > $o ) > $o ).
% 1.51/1.26  
% 1.51/1.26  thf(choiceaxo,axiom,
% 1.51/1.26      ! [P: $o > $o] :
% 1.51/1.26        ( ? [X: $o] : ( P @ X )
% 1.51/1.26       => ( P @ ( epso @ P ) ) ) ).
% 1.51/1.26  
% 1.51/1.26  thf(epsoo,type,
% 1.51/1.26      epsoo: ( ( $o > $o ) > $o ) > $o > $o ).
% 1.51/1.26  
% 1.51/1.26  thf(choiceaxoo,axiom,
% 1.51/1.26      ! [P: ( $o > $o ) > $o] :
% 1.51/1.26        ( ? [X: $o > $o] : ( P @ X )
% 1.51/1.26       => ( P @ ( epsoo @ P ) ) ) ).
% 1.51/1.26  
% 1.51/1.26  thf(c,conjecture,
% 1.51/1.26      ( ( epsoo @ epso @ $false )
% 1.51/1.26     => ( epsoo @ epso @ $true ) ) ).
% 1.51/1.26  ------------------------
% 1.51/1.28  % (5089)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_4755 for (2999ds/18Mi)
% 1.51/1.28  % (5088)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_4755 for (2999ds/275Mi)
% 1.51/1.28  % (5088)Refutation not found, incomplete strategy
% 1.51/1.28  % (5088)------------------------------
% 1.51/1.28  % (5088)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.51/1.28  % (5088)Termination reason: Refutation not found, incomplete strategy
% 1.51/1.28  
% 1.51/1.28  
% 1.51/1.28  % (5088)Memory used [KB]: 5500
% 1.51/1.28  % (5088)Time elapsed: 0.002 s
% 1.51/1.28  % (5088)Instructions burned: 1 (million)
% 1.51/1.28  % (5088)------------------------------
% 1.51/1.28  % (5088)------------------------------
% 1.51/1.28  % (5089)Instruction limit reached!
% 1.51/1.28  % (5089)------------------------------
% 1.51/1.28  % (5089)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.51/1.28  % (5089)Termination reason: Unknown
% 1.51/1.28  % (5089)Termination phase: Saturation
% 1.51/1.28  
% 1.51/1.28  % (5089)Memory used [KB]: 5628
% 1.51/1.28  % (5089)Time elapsed: 0.008 s
% 1.51/1.28  % (5089)Instructions burned: 18 (million)
% 1.51/1.28  % (5089)------------------------------
% 1.51/1.28  % (5089)------------------------------
% 1.51/1.28  % (5083)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_4755 for (2999ds/183Mi)
% 1.51/1.28  % (5084)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_4755 for (2999ds/4Mi)
% 1.51/1.28  % (5085)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_4755 for (2999ds/27Mi)
% 1.51/1.28  % (5086)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_4755 for (2999ds/2Mi)
% 1.51/1.28  % (5087)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_4755 for (2999ds/2Mi)
% 1.51/1.28  % (5087)Instruction limit reached!
% 1.51/1.28  % (5087)------------------------------
% 1.51/1.28  % (5087)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.51/1.28  % (5087)Termination reason: Unknown
% 1.51/1.28  % (5087)Termination phase: Saturation
% 1.51/1.28  
% 1.51/1.28  % (5087)Memory used [KB]: 895
% 1.51/1.28  % (5087)Time elapsed: 0.003 s
% 1.51/1.28  % (5087)Instructions burned: 2 (million)
% 1.51/1.28  % (5087)------------------------------
% 1.51/1.28  % (5087)------------------------------
% 1.51/1.29  % (5086)Instruction limit reached!
% 1.51/1.29  % (5086)------------------------------
% 1.51/1.29  % (5086)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.51/1.29  % (5086)Termination reason: Unknown
% 1.51/1.29  % (5086)Termination phase: Saturation
% 1.51/1.29  
% 1.51/1.29  % (5086)Memory used [KB]: 5500
% 1.51/1.29  % (5086)Time elapsed: 0.004 s
% 1.51/1.29  % (5086)Instructions burned: 2 (million)
% 1.51/1.29  % (5086)------------------------------
% 1.51/1.29  % (5086)------------------------------
% 1.51/1.29  % (5084)Instruction limit reached!
% 1.51/1.29  % (5084)------------------------------
% 1.51/1.29  % (5084)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.51/1.29  % (5084)Termination reason: Unknown
% 1.51/1.29  % (5084)Termination phase: Saturation
% 1.51/1.29  
% 1.51/1.29  % (5084)Memory used [KB]: 5500
% 1.51/1.29  % (5084)Time elapsed: 0.005 s
% 1.51/1.29  % (5084)Instructions burned: 4 (million)
% 1.51/1.29  % (5084)------------------------------
% 1.51/1.29  % (5084)------------------------------
% 1.51/1.29  % (5085)Refutation not found, incomplete strategy
% 1.51/1.29  % (5085)------------------------------
% 1.51/1.29  % (5085)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.51/1.29  % (5085)Termination reason: Refutation not found, incomplete strategy
% 1.51/1.29  
% 1.51/1.29  
% 1.51/1.29  % (5085)Memory used [KB]: 5500
% 1.51/1.29  % (5085)Time elapsed: 0.005 s
% 1.51/1.29  % (5085)Instructions burned: 3 (million)
% 1.51/1.29  % (5085)------------------------------
% 1.51/1.29  % (5085)------------------------------
% 1.51/1.29  % (5090)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_4755 for (2999ds/3Mi)
% 1.51/1.29  % (5090)Instruction limit reached!
% 1.51/1.29  % (5090)------------------------------
% 1.51/1.29  % (5090)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.51/1.29  % (5090)Termination reason: Unknown
% 1.51/1.29  % (5090)Termination phase: Saturation
% 1.51/1.29  
% 1.51/1.29  % (5090)Memory used [KB]: 5500
% 1.51/1.29  % (5090)Time elapsed: 0.003 s
% 1.51/1.29  % (5090)Instructions burned: 3 (million)
% 1.51/1.29  % (5090)------------------------------
% 1.51/1.29  % (5090)------------------------------
% 1.51/1.29  % (5091)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on DTF2THF_4755 for (2999ds/37Mi)
% 1.59/1.30  % (5092)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on DTF2THF_4755 for (2999ds/15Mi)
% 1.59/1.30  % (5096)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on DTF2THF_4755 for (2999ds/16Mi)
% 1.59/1.30  % (5093)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on DTF2THF_4755 for (2999ds/3Mi)
% 1.59/1.30  % (5094)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on DTF2THF_4755 for (2999ds/1041Mi)
% 1.59/1.30  % (5091)Instruction limit reached!
% 1.59/1.30  % (5091)------------------------------
% 1.59/1.30  % (5091)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.59/1.30  % (5091)Termination reason: Unknown
% 1.59/1.30  % (5091)Termination phase: Saturation
% 1.59/1.30  
% 1.59/1.30  % (5091)Memory used [KB]: 5756
% 1.59/1.30  % (5091)Time elapsed: 0.013 s
% 1.59/1.30  % (5091)Instructions burned: 39 (million)
% 1.59/1.30  % (5091)------------------------------
% 1.59/1.30  % (5091)------------------------------
% 1.59/1.31  % (5093)Instruction limit reached!
% 1.59/1.31  % (5093)------------------------------
% 1.59/1.31  % (5093)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.59/1.31  % (5093)Termination reason: Unknown
% 1.59/1.31  % (5093)Termination phase: Saturation
% 1.59/1.31  
% 1.59/1.31  % (5093)Memory used [KB]: 5500
% 1.59/1.31  % (5093)Time elapsed: 0.004 s
% 1.59/1.31  % (5093)Instructions burned: 3 (million)
% 1.59/1.31  % (5093)------------------------------
% 1.59/1.31  % (5093)------------------------------
% 1.59/1.31  % (5095)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on DTF2THF_4755 for (2999ds/7Mi)
% 1.59/1.31  % (5092)First to succeed.
% 1.59/1.31  % (5096)Instruction limit reached!
% 1.59/1.31  % (5096)------------------------------
% 1.59/1.31  % (5096)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.59/1.31  % (5096)Termination reason: Unknown
% 1.59/1.31  % (5096)Termination phase: Saturation
% 1.59/1.31  
% 1.59/1.31  % (5096)Memory used [KB]: 5628
% 1.59/1.31  % (5096)Time elapsed: 0.008 s
% 1.59/1.31  % (5096)Instructions burned: 17 (million)
% 1.59/1.31  % (5096)------------------------------
% 1.59/1.31  % (5096)------------------------------
% 1.59/1.31  % (5092)Refutation found. Thanks to Tanya!
% 1.59/1.31  % SZS status Theorem for DTF2THF_4755
% 1.59/1.31  % SZS output start Proof for DTF2THF_4755
% 1.59/1.31  thf(func_def_0, type, epso: ($o > $o) > $o).
% 1.59/1.31  thf(func_def_2, type, epsoo: (($o > $o) > $o) > $o > $o).
% 1.59/1.31  thf(func_def_6, type, ph1: !>[X0: $tType]:(X0)).
% 1.59/1.31  thf(f134,plain,(
% 1.59/1.31    $false),
% 1.59/1.31    inference(avatar_sat_refutation,[status(thm)],[f23,f28,f36,f133])).
% 1.59/1.31  thf(f133,plain,(
% 1.59/1.31    spl0_2 | ~spl0_3),
% 1.59/1.31    inference(avatar_contradiction_clause,[status(thm)],[f132])).
% 1.59/1.31  thf(f132,plain,(
% 1.59/1.31    $false | (spl0_2 | ~spl0_3)),
% 1.59/1.31    inference(subsumption_resolution,[status(thm)],[f118,f85])).
% 1.59/1.31  thf(f85,plain,(
% 1.59/1.31    ( ! [X0 : $o] : (($false = X0)) ) | (spl0_2 | ~spl0_3)),
% 1.59/1.31    inference(leibniz_equality_elimination,[status(thm)],[f76])).
% 1.59/1.31  thf(f76,plain,(
% 1.59/1.31    ( ! [X0 : $o > $o,X1 : $o] : (((X0 @ X1) != $true) | ((X0 @ $false) = $true)) ) | (spl0_2 | ~spl0_3)),
% 1.59/1.31    inference(superposition,[status(thm)],[f16,f62])).
% 1.59/1.31  thf(f62,plain,(
% 1.59/1.31    ( ! [X0 : $o > $o] : (((epso @ X0) = $false)) ) | (spl0_2 | ~spl0_3)),
% 1.59/1.31    inference(trivial_inequality_removal,[status(thm)],[f59])).
% 1.59/1.31  thf(f59,plain,(
% 1.59/1.31    ( ! [X0 : $o > $o] : (($true != $true) | ((epso @ X0) = $false)) ) | (spl0_2 | ~spl0_3)),
% 1.59/1.31    inference(fool_paramodulation,[status(thm)],[f52])).
% 1.59/1.31  thf(f52,plain,(
% 1.59/1.31    ( ! [X0 : $o > $o] : (((epso @ X0) != $true)) ) | (spl0_2 | ~spl0_3)),
% 1.59/1.31    inference(subsumption_resolution,[status(thm)],[f50,f27])).
% 1.59/1.31  thf(f27,plain,(
% 1.59/1.31    ($true != (epsoo @ epso @ $true)) | spl0_2),
% 1.59/1.31    inference(avatar_component_clause,[status(thm)],[f25])).
% 1.59/1.31  thf(f25,definition,(
% 1.59/1.31    spl0_2 <=> ($true = (epsoo @ epso @ $true))),
% 1.59/1.31    introduced(definition,[new_symbols(naming,[spl0_2])],[avatar_definition])).
% 1.59/1.31  thf(f50,plain,(
% 1.59/1.31    ( ! [X0 : $o > $o] : (((epso @ X0) != $true) | ($true = (epsoo @ epso @ $true))) ) | ~spl0_3),
% 1.59/1.31    inference(superposition,[status(thm)],[f35,f15])).
% 1.59/1.31  thf(f15,plain,(
% 1.59/1.31    ( ! [X0 : ($o > $o) > $o,X1 : $o > $o] : (((X0 @ (epsoo @ X0)) = $true) | ((X0 @ X1) != $true)) )),
% 1.59/1.31    inference(cnf_transformation,[status(thm)],[f13])).
% 1.59/1.31  thf(f13,plain,(
% 1.59/1.31    ! [X0 : ($o > $o) > $o] : (! [X1 : $o > $o] : ((X0 @ X1) != $true) | ((X0 @ (epsoo @ X0)) = $true))),
% 1.59/1.31    inference(ennf_transformation,[status(thm)],[f7])).
% 1.59/1.31  thf(f7,plain,(
% 1.59/1.31    ! [X0 : ($o > $o) > $o] : (? [X1 : $o > $o] : ((X0 @ X1) = $true) => ((X0 @ (epsoo @ X0)) = $true))),
% 1.59/1.31    inference(fool_elimination,[status(thm)],[f6])).
% 1.59/1.31  thf(f6,plain,(
% 1.59/1.31    ! [X0 : ($o > $o) > $o] : (? [X1 : $o > $o] : (X0 @ X1) => (X0 @ (epsoo @ X0)))),
% 1.59/1.31    inference(rectify,[status(thm)],[f2])).
% 1.59/1.31  thf(f2,axiom,(
% 1.59/1.31    ! [X0 : ($o > $o) > $o] : (? [X1 : $o > $o] : (X0 @ X1) => (X0 @ (epsoo @ X0)))),
% 1.59/1.31    file('/export/starexec/sandbox/tmp/tmp.YfkMAcyZZO/DTF2THF_4755.p',choiceaxoo)).
% 1.59/1.31  thf(f35,plain,(
% 1.59/1.31    ((epsoo @ epso @ (epso @ (epsoo @ epso))) = $true) | ~spl0_3),
% 1.59/1.31    inference(avatar_component_clause,[status(thm)],[f33])).
% 1.59/1.31  thf(f33,definition,(
% 1.59/1.31    spl0_3 <=> ((epsoo @ epso @ (epso @ (epsoo @ epso))) = $true)),
% 1.59/1.31    introduced(definition,[new_symbols(naming,[spl0_3])],[avatar_definition])).
% 1.59/1.31  thf(f16,plain,(
% 1.59/1.31    ( ! [X0 : $o > $o,X1 : $o] : (((X0 @ X1) != $true) | ((X0 @ (epso @ X0)) = $true)) )),
% 1.59/1.31    inference(cnf_transformation,[status(thm)],[f14])).
% 1.59/1.31  thf(f14,plain,(
% 1.59/1.31    ! [X0 : $o > $o] : (! [X1 : $o] : ((X0 @ X1) != $true) | ((X0 @ (epso @ X0)) = $true))),
% 1.59/1.31    inference(ennf_transformation,[status(thm)],[f9])).
% 1.59/1.31  thf(f9,plain,(
% 1.59/1.31    ! [X0 : $o > $o] : (? [X1 : $o] : ((X0 @ X1) = $true) => ((X0 @ (epso @ X0)) = $true))),
% 1.59/1.31    inference(fool_elimination,[status(thm)],[f8])).
% 1.59/1.31  thf(f8,plain,(
% 1.59/1.31    ! [X0 : $o > $o] : (? [X1 : $o] : (X0 @ X1) => (X0 @ (epso @ X0)))),
% 1.59/1.31    inference(rectify,[status(thm)],[f1])).
% 1.59/1.31  thf(f1,axiom,(
% 1.59/1.31    ! [X0 : $o > $o] : (? [X1 : $o] : (X0 @ X1) => (X0 @ (epso @ X0)))),
% 1.59/1.31    file('/export/starexec/sandbox/tmp/tmp.YfkMAcyZZO/DTF2THF_4755.p',choiceaxo)).
% 1.59/1.31  thf(f118,plain,(
% 1.59/1.31    ($false != (epsoo @ epso @ $false)) | (spl0_2 | ~spl0_3)),
% 1.59/1.31    inference(superposition,[status(thm)],[f27,f85])).
% 1.59/1.31  thf(f36,plain,(
% 1.59/1.31    spl0_3 | ~spl0_1),
% 1.59/1.31    inference(avatar_split_clause,[status(thm)],[f31,f20,f33])).
% 1.59/1.31  thf(f20,definition,(
% 1.59/1.31    spl0_1 <=> ((epsoo @ epso @ $false) = $true)),
% 1.59/1.31    introduced(definition,[new_symbols(naming,[spl0_1])],[avatar_definition])).
% 1.59/1.31  thf(f31,plain,(
% 1.59/1.31    ((epsoo @ epso @ (epso @ (epsoo @ epso))) = $true) | ~spl0_1),
% 1.59/1.31    inference(trivial_inequality_removal,[status(thm)],[f30])).
% 1.59/1.31  thf(f30,plain,(
% 1.59/1.31    ((epsoo @ epso @ (epso @ (epsoo @ epso))) = $true) | ($true != $true) | ~spl0_1),
% 1.59/1.31    inference(superposition,[status(thm)],[f16,f22])).
% 1.59/1.31  thf(f22,plain,(
% 1.59/1.31    ((epsoo @ epso @ $false) = $true) | ~spl0_1),
% 1.59/1.31    inference(avatar_component_clause,[status(thm)],[f20])).
% 1.59/1.31  thf(f28,plain,(
% 1.59/1.31    ~spl0_2),
% 1.59/1.31    inference(avatar_split_clause,[status(thm)],[f18,f25])).
% 1.59/1.31  thf(f18,plain,(
% 1.59/1.31    ($true != (epsoo @ epso @ $true))),
% 1.59/1.31    inference(cnf_transformation,[status(thm)],[f12])).
% 1.59/1.31  thf(f12,plain,(
% 1.59/1.31    ($true != (epsoo @ epso @ $true)) & ((epsoo @ epso @ $false) = $true)),
% 1.59/1.31    inference(ennf_transformation,[status(thm)],[f11])).
% 1.59/1.31  thf(f11,plain,(
% 1.59/1.31    ~(((epsoo @ epso @ $false) = $true) => ($true = (epsoo @ epso @ $true)))),
% 1.59/1.31    inference(fool_elimination,[status(thm)],[f10])).
% 1.59/1.31  thf(f10,plain,(
% 1.59/1.31    ~((epsoo @ epso @ $false) => (epsoo @ epso @ $true))),
% 1.59/1.31    inference(rectify,[status(thm)],[f4])).
% 1.59/1.31  thf(f4,negated_conjecture,(
% 1.59/1.31    ~((epsoo @ epso @ $false) => (epsoo @ epso @ $true))),
% 1.59/1.31    inference(negated_conjecture,[status(cth)],[f3])).
% 1.59/1.31  thf(f3,conjecture,(
% 1.59/1.31    (epsoo @ epso @ $false) => (epsoo @ epso @ $true)),
% 1.59/1.31    file('/export/starexec/sandbox/tmp/tmp.YfkMAcyZZO/DTF2THF_4755.p',c)).
% 1.59/1.31  thf(f23,plain,(
% 1.59/1.31    spl0_1),
% 1.59/1.31    inference(avatar_split_clause,[status(thm)],[f17,f20])).
% 1.59/1.31  thf(f17,plain,(
% 1.59/1.31    ((epsoo @ epso @ $false) = $true)),
% 1.59/1.31    inference(cnf_transformation,[status(thm)],[f12])).
% 1.59/1.31  % SZS output end Proof for DTF2THF_4755
% 1.59/1.31  % (5092)------------------------------
% 1.59/1.31  % (5092)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.59/1.31  % (5092)Termination reason: Refutation
% 1.59/1.31  
% 1.59/1.31  % (5092)Memory used [KB]: 5500
% 1.59/1.31  % (5092)Time elapsed: 0.008 s
% 1.59/1.31  % (5092)Instructions burned: 7 (million)
% 1.59/1.31  % (5092)------------------------------
% 1.59/1.31  % (5092)------------------------------
% 1.59/1.31  % (5082)Success in time 0.037 s
%------------------------------------------------------------------------------