YES(?,O(n^1))
TRS:
 {f(a(), f(a(), x)) -> f(a(), f(f(a(), x), f(a(), a())))}
 DUP: We consider a non-duplicating system.
  Trs:
   {f(a(), f(a(), x)) -> f(a(), f(f(a(), x), f(a(), a())))}
  BOUND:
   Bound: match(-raise)-bounded by 2
   Automaton:
    {
         a_2() -> 6*
         a_1() -> 2*
         a_0() -> 1*
     f_2(7, 8) -> 9*
     f_2(6, 9) -> 3*
     f_2(6, 6) -> 8*
     f_2(6, 5) -> 7*
     f_1(3, 4) -> 5*
     f_1(2, 5) -> 3 | 1
     f_1(2, 2) -> 4*
     f_1(2, 1) -> 3*
     f_0(1, 1) -> 1*
    }
   Strict:
    {}
   Qed