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