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