YES(?,O(n^1))

Problem:
 a() -> g(c())
 g(a()) -> b()
 f(g(X),b()) -> f(a(),X)

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {5,4,3}
   transitions:
    g1(6) -> 3*
    c1() -> 6*
    a0() -> 3*
    g0(2) -> 4*
    g0(1) -> 4*
    c0() -> 1*
    b0() -> 2*
    f0(1,2) -> 5*
    f0(2,1) -> 5*
    f0(1,1) -> 5*
    f0(2,2) -> 5*
  problem:
   
  Qed