YES(?,O(n^1))
TRS:
 {f(X, X) -> f(a(), b()),
      b() -> c()}
 DUP: We consider a non-duplicating system.
  Trs:
   {f(X, X) -> f(a(), b()),
        b() -> c()}
  BOUND:
   Bound: match(-raise)-bounded by 2
   Automaton:
    {
         c_2() -> 6* | 4 | 1
         c_1() -> 1*
         c_0() -> 1*
         b_1() -> 4* | 3 | 1
         b_0() -> 1*
         a_1() -> 5* | 2 | 1
         a_0() -> 1*
     f_1(5, 6) -> 1*
     f_1(5, 4) -> 1*
     f_1(5, 3) -> 1*
     f_1(2, 6) -> 1*
     f_1(2, 4) -> 1*
     f_1(2, 3) -> 1*
     f_0(6, 6) -> 1*
     f_0(6, 5) -> 1*
     f_0(6, 4) -> 1*
     f_0(6, 1) -> 1*
     f_0(5, 6) -> 1*
     f_0(5, 5) -> 1*
     f_0(5, 4) -> 1*
     f_0(5, 1) -> 1*
     f_0(4, 6) -> 1*
     f_0(4, 5) -> 1*
     f_0(4, 4) -> 1*
     f_0(4, 1) -> 1*
     f_0(1, 6) -> 1*
     f_0(1, 5) -> 1*
     f_0(1, 4) -> 1*
     f_0(1, 1) -> 1*
    }
   Strict:
    {}
   Qed