YES(?,O(n^1))

Problem:
 f(x,y) -> g(x,y)
 g(h(x),y) -> h(f(x,y))
 g(h(x),y) -> h(g(x,y))

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