YES(?,O(n^1))
TRS:
 {
    f c X -> X,
  f c a() -> f d b(),
  f c b() -> f d a(),
    f a() -> f c a(),
    f a() -> f d a(),
    f d X -> X,
    e g X -> e X
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
      f c X -> X,
    f c a() -> f d b(),
    f c b() -> f d a(),
      f a() -> f c a(),
      f a() -> f d a(),
      f d X -> X,
      e g X -> e X
   }
  BOUND:
   Bound: match(-raise)-bounded by 2
   Automaton:
    {
       e_1(3) -> 4*
       e_0(2) -> 1*
       e_0(1) -> 1*
        b_2() -> 11*
        b_1() -> 10*
        b_0() -> 1*
      d_2(11) -> 12*
       d_1(8) -> 9*
       d_0(2) -> 1*
       d_0(1) -> 1*
        a_1() -> 5*
        a_0() -> 1*
       c_1(5) -> 6*
       c_0(2) -> 1*
       c_0(1) -> 1*
       g_0(2) -> 2*
       g_0(1) -> 2*
      f_2(12) -> 13*
       f_1(6) -> 7*
     f_0(2) -> 1*
     f_0(1) -> 1*
         13 -> 7*
         11 -> 13*
         10 -> 8*
          9 -> 6*
          8 -> 7*
          7 -> 1*
          5 -> 8 | 7
          4 -> 1*
          2 -> 1*
          1 -> 3*
    }
   Strict:
    {}
   Qed