YES(?,O(n^1))

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

Proof:
 Bounds Processor:
  bound: 0
  enrichment: match
  automaton:
   final states: {2}
   transitions:
    f0(1) -> 2*
    g0(1) -> 1*
  problem:
   
  Qed