YES(?,O(n^1))

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

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {3}
   transitions:
    f1(6,16) -> 17*
    f1(17,1) -> 18,15,3
    f1(7,1) -> 18,15,3
    f1(6,5) -> 7*
    f1(17,2) -> 18,15,3
    f1(7,2) -> 18,15,3
    a1() -> 6*
    h1(15) -> 16*
    h1(2) -> 4*
    h1(4) -> 5*
    h1(1) -> 15*
    f2(20,19) -> 21*
    f2(21,7) -> 19,16
    f2(21,17) -> 19,16
    h0(2) -> 3*
    h0(1) -> 3*
    a2() -> 20*
    f0(1,2) -> 1*
    f0(2,1) -> 1*
    f0(1,1) -> 1*
    f0(2,2) -> 1*
    h2(2) -> 18*
    h2(1) -> 18*
    h2(18) -> 19*
    a0() -> 2*
  problem:
   
  Qed