%------------------------------------------------------------------------------
% File     : DAT425^1 : TPTP v9.2.1. Released v9.2.0.
% Domain   : Data Structures
% Problem  : Reversal of a red-black-tree is an involution, RT leaf
% Version  : Especial.
% English  :

% Refs     : [RRB23] Rothgang et al. (2023), Theorem Proving in Dependently
%          : [Rot25] Rothgang (2025), Email to Geoff Sutcliffe
%          : [RK+25] Ranalter et al. (2025), The Dependently Typed Higher-O
% Source   : [Rot25]
% Names    : RedBlackTree/rbt-rev-invol-base-RTLeaf.p [Rot25]

% Status   : Theorem
% Rating   : ? v9.2.0
% Syntax   : Number of formulae    :   22 (   7 unt;  11 typ;   0 def)
%            Number of atoms       :   19 (  19 equ;   0 cnn)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :  201 (   7   ~;   2   |;   6   &; 182   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type decls  :   11 (   4 !>P;   3 !>D)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   9 usr;   3 con; 0-7 aty)
%            Number of variables   :   54 (   0   ^;  29   !;  15   ?;  54   :)
%                                         (  10  !>;   0  ?*;   0  @-;   0  @+)
% SPC      : DH1_THM_EQU_NAR

% Comments :
%------------------------------------------------------------------------------
thf(color_type,type,
    color: $tType ).

thf(black_type,type,
    black: color ).

thf(red_type,type,
    red: color ).

thf(red_black,axiom,
    ! [C: color] :
      ( ( ( C = red )
        & ( C != black ) )
      | ( ( C != red )
        & ( C = black ) ) ) ).

thf(nat_type,type,
    nat: $tType ).

thf(zero_type,type,
    zero: nat ).

thf(suc_type,type,
    suc: nat > nat ).

thf(peano1,axiom,
    ! [N: nat] :
      ( ( suc @ N )
     != zero ) ).

thf(peano2,axiom,
    ! [N: nat,M: nat] :
      ( ( N != M )
     => ( ( suc @ N )
       != ( suc @ M ) ) ) ).

thf(peano3,axiom,
    ! [P: nat > $o] :
      ( ( P @ zero )
     => ( ! [M: nat] :
            ( ( P @ M )
           => ( P @ ( suc @ M ) ) )
       => ! [N: nat] : ( P @ N ) ) ) ).

thf(tree_type,type,
    tree: $tType > color > nat > $tType ).

thf(leaf_type,type,
    leaf: 
      !>[A: $tType] : ( tree @ A @ black @ zero ) ).

thf(redTree_type,type,
    rt: 
      !>[A: $tType,N: nat] : ( ( tree @ A @ black @ N ) > A > ( tree @ A @ black @ N ) > ( tree @ A @ red @ N ) ) ).

thf(rt_cons,axiom,
    ! [A: $tType,N: nat,T: tree @ A @ red @ N] :
    ? [X: A,T1: tree @ A @ black @ N,T2: tree @ A @ black @ N] :
      ( T
      = ( rt @ A @ N @ T1 @ X @ T2 ) ) ).

thf(blackTree_type,type,
    bt: 
      !>[A: $tType,N: nat,C1: color,C2: color] : ( ( tree @ A @ C1 @ N ) > A > ( tree @ A @ C2 @ N ) > ( tree @ A @ black @ ( suc @ N ) ) ) ).

thf(bt_cons,axiom,
    ! [A: $tType,N: nat,T: tree @ A @ black @ N] :
      ( ( ( T
         != ( leaf @ A ) )
        & ? [X: A,M: nat,C1: color,C2: color,T1: tree @ A @ C1 @ M,T2: tree @ A @ C2 @ M] :
            ( ( N
              = ( suc @ M ) )
            & ( T
              = ( bt @ A @ M @ C1 @ C2 @ T1 @ X @ T2 ) ) ) )
      | ( ( T
          = ( leaf @ A ) )
        & ~ ? [X: A,M: nat,C1: color,C2: color,T1: tree @ A @ C1 @ M,T2: tree @ A @ C2 @ M] :
              ( ( N
                = ( suc @ M ) )
              & ( T
                = ( bt @ A @ M @ C1 @ C2 @ T1 @ X @ T2 ) ) ) ) ) ).

thf(rbt_rev,type,
    rev: 
      !>[A: $tType,C: color,N: nat] : ( ( tree @ A @ C @ N ) > ( tree @ A @ C @ N ) ) ).

thf(rev_leaf,axiom,
    ! [A: $tType] :
      ( ( rev @ A @ black @ zero @ ( leaf @ A ) )
      = ( leaf @ A ) ) ).

thf(rev_bt,axiom,
    ! [A: $tType,X: A,N: nat,C1: color,C2: color,T1: tree @ A @ C1 @ N,T2: tree @ A @ C2 @ N] :
      ( ( rev @ A @ black @ ( suc @ N ) @ ( bt @ A @ N @ C1 @ C2 @ T1 @ X @ T2 ) )
      = ( bt @ A @ N @ C1 @ C2 @ ( rev @ A @ C2 @ N @ T2 ) @ X @ ( rev @ A @ C1 @ N @ T1 ) ) ) ).

thf(rev_rt,axiom,
    ! [A: $tType,X: A,N: nat,T1: tree @ A @ black @ N,T2: tree @ A @ black @ N] :
      ( ( rev @ A @ red @ N @ ( rt @ A @ N @ T1 @ X @ T2 ) )
      = ( rt @ A @ N @ ( rev @ A @ black @ N @ T2 ) @ X @ ( rev @ A @ black @ N @ T1 ) ) ) ).

thf(bt_base,axiom,
    ! [A: $tType] :
      ( ( rev @ A @ black @ zero @ ( rev @ A @ black @ zero @ ( leaf @ A ) ) )
      = ( leaf @ A ) ) ).

thf(rt_base,conjecture,
    ! [A: $tType,X: A] :
      ( ( rev @ A @ red @ zero @ ( rev @ A @ red @ zero @ ( rt @ A @ zero @ ( leaf @ A ) @ X @ ( leaf @ A ) ) ) )
      = ( rt @ A @ zero @ ( leaf @ A ) @ X @ ( leaf @ A ) ) ) ).

%------------------------------------------------------------------------------