YES(?,O(n^1))

Problem:
 f(g(x)) -> g(g(f(x)))
 f(g(x)) -> g(g(g(x)))

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