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