YES
TRS:
 {        h(g(x)) -> g(h(f(x))),
           f(a()) -> g(h(a())),
  k(x, h(x), a()) -> h(x),
    k(f(x), y, x) -> f(x)}
 RUF:
  Strict:
   {h(g(x)) -> g(h(f(x))),
     f(a()) -> g(h(a()))}
  Weak:
   {}
  DP:
   Strict:
    {h#(g(x)) -> h#(f(x)),
     h#(g(x)) -> f#(x),
      f#(a()) -> h#(a())}
   Weak:
   {h(g(x)) -> g(h(f(x))),
     f(a()) -> g(h(a()))}
   EDG:
    {(h#(g(x)) -> f#(x), f#(a()) -> h#(a()))
     (h#(g(x)) -> h#(f(x)), h#(g(x)) -> h#(f(x)))
     (h#(g(x)) -> h#(f(x)), h#(g(x)) -> f#(x))}
    SCCS:
     Scc:
      {h#(g(x)) -> h#(f(x))}
     SCC:
      Strict:
       {h#(g(x)) -> h#(f(x))}
      Weak:
      {h(g(x)) -> g(h(f(x))),
        f(a()) -> g(h(a()))}
      UR:
       {f(a()) -> g(h(a()))}
       BOUND:
        Bound: match(-raise)-DP-bounded by 1
        Automaton:
         {  b_0() -> 2*
           f_1(7) -> 8*
           f_0(2) -> 3*
            a_0() -> 4*
          h#_1(8) -> 9*
          h#_0(3) -> 1*
           h_0(4) -> 5*
           g_0(5) -> 6*
                9 -> 1*
                6 -> 3*
                5 -> 7*}
        Strict:
         {}
        Qed