YES
LCTRS
  Theories
    Core, Ints
  Signature
    a: Int
    f: Int -> Int
    g: Int -> Int
  Rules
    f(?6) -> g(?7)
    g(?8) -> a [?8 = ?8]
Confluent by Almost Development Closedness with proof:
    * Critical Pair
      Inner Rule
        f(?6') -> g(?7')
      Outer Rule
        f(?6") -> g(?7")
      Pair
        g(?7') ≈ g(?7") [?7' = ?7', ?7" = ?7"]
    which reaches the trivial constrained equation
      g(?7') ≈ g(?7") [?7' = ?7', ?7" = ?7"]
        -o-> a ≈ g(?7") [?7' = ?7', ?7" = ?7"]
        -o-> a ≈ a [?7' = ?7', ?7" = ?7"]

Elapsed Time:  81.81 ms