YES(?,O(n^1))

Problem:
 g(a()) -> g(b())
 b() -> f(a(),a())
 f(a(),a()) -> g(d())

Proof:
 Bounds Processor:
  bound: 3
  enrichment: match
  automaton:
   final states: {5,4,3}
   transitions:
    d3() -> 16*
    g1(7) -> 3*
    g1(11) -> 5*
    d1() -> 11*
    f1(8,8) -> 4*
    a1() -> 8*
    b1() -> 7*
    g2(15) -> 4*
    g0(2) -> 3*
    g0(1) -> 3*
    d2() -> 15*
    a0() -> 1*
    f2(12,12) -> 7*
    b0() -> 4*
    a2() -> 12*
    f0(1,2) -> 5*
    f0(2,1) -> 5*
    f0(1,1) -> 5*
    f0(2,2) -> 5*
    g3(16) -> 7*
    d0() -> 2*
  problem:
   
  Qed