YES(?,O(n^1))

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

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