YES
O(n)
TRS:
 {f(f(a(), x), a()) -> f(a(), f(f(x, f(a(), a())), a()))}
 DUP: We consider a non-duplicating system.
  Trs:
   {f(f(a(), x), a()) -> f(a(), f(f(x, f(a(), a())), a()))}
  BOUND:
   Automaton:
    {
          a_1() -> 3,
          a_0() -> 2,
     f_1(11, 3) -> 12,
      f_1(6, 4) -> 5,
      f_1(5, 3) -> 6,
      f_1(4, 4) -> 11,
     f_1(3, 12) -> 6,
      f_1(3, 6) -> 2,
      f_1(3, 3) -> 4,
      f_1(2, 4) -> 5,
      f_0(2, 2) -> 2
    }
   Strict:
    {}
   Qed