YES(?,O(n^1))
TRS:
 {
      f f x -> f c f x,
      f f x -> f d f x,
      g h x -> g x,
      g c x -> x,
  g c h 0() -> g d 1(),
    g c 1() -> g d h 0(),
      g d x -> x
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
        f f x -> f c f x,
        f f x -> f d f x,
        g h x -> g x,
        g c x -> x,
    g c h 0() -> g d 1(),
      g c 1() -> g d h 0(),
        g d x -> x
   }
  BOUND:
   Bound: match(-raise)-bounded by 2
   Automaton:
    {
        0_1() -> 12*
        0_0() -> 1*
        1_1() -> 4*
        1_0() -> 1*
      d_2(18) -> 19*
      d_1(10) -> 11*
       d_1(4) -> 5*
       d_0(1) -> 1*
      c_2(15) -> 16*
       c_1(7) -> 8*
       c_0(1) -> 1*
      h_1(12) -> 13*
       h_0(1) -> 1*
      g_2(22) -> 23*
      g_1(20) -> 21*
       g_1(2) -> 3*
       g_0(1) -> 1*
      f_2(16) -> 17*
      f_2(14) -> 15*
       f_1(8) -> 9*
       f_1(6) -> 7*
     f_0(1) -> 1*
         23 -> 3*
         21 -> 1*
         19 -> 16*
         17 -> 7*
         15 -> 18*
         13 -> 4*
         12 -> 22 | 20
         11 -> 8*
          9 -> 7 | 1
          8 -> 14*
          7 -> 10*
          5 -> 2*
          4 -> 3*
          3 -> 1*
          1 -> 6 | 3 | 2
    }
   Strict:
    {}
   Qed