YES(?,O(n^1))

Problem:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {5,4,3,2}
   transitions:
    g1(10) -> 11*
    g1(12) -> 13*
    g1(13) -> 14*
    d1(9) -> 10*
    a0(1) -> 2*
    g0(1) -> 5*
    d0(1) -> 1*
    b0(1) -> 3*
    c0(1) -> 4*
    1 -> 12,9
    11 -> 2*
    14 -> 4*
  problem:
   
  Qed