YES
TRS:
 {f(f(a(), a()), x) -> f(f(x, f(a(), f(a(), a()))), a())}
 DP:
  Strict:
   {f#(f(a(), a()), x) -> f#(x, f(a(), f(a(), a()))),
    f#(f(a(), a()), x) -> f#(f(x, f(a(), f(a(), a()))), a()),
    f#(f(a(), a()), x) -> f#(a(), f(a(), a()))}
  Weak:
  {f(f(a(), a()), x) -> f(f(x, f(a(), f(a(), a()))), a())}
  EDG:
   {(f#(f(a(), a()), x) -> f#(x, f(a(), f(a(), a()))), f#(f(a(), a()), x) -> f#(x, f(a(), f(a(), a()))))
    (f#(f(a(), a()), x) -> f#(x, f(a(), f(a(), a()))), f#(f(a(), a()), x) -> f#(f(x, f(a(), f(a(), a()))), a()))
    (f#(f(a(), a()), x) -> f#(x, f(a(), f(a(), a()))), f#(f(a(), a()), x) -> f#(a(), f(a(), a())))}
   SCCS:
    Scc:
     {f#(f(a(), a()), x) -> f#(x, f(a(), f(a(), a())))}
    SCC:
     Strict:
      {f#(f(a(), a()), x) -> f#(x, f(a(), f(a(), a())))}
     Weak:
     {f(f(a(), a()), x) -> f(f(x, f(a(), f(a(), a()))), a())}
     UR:
      {}
      BOUND:
       Bound: match(-raise)-DP-bounded by 0
       Automaton:
        {     b_0() -> 2*
              a_0() -> 3*
         f#_0(5, 5) -> 1*
         f#_0(2, 5) -> 1*
          f_0(3, 4) -> 5*
          f_0(3, 3) -> 4*}
       Strict:
        {}
       Qed