YES(?,O(n^1))

Problem:
 f(s(X),Y) -> h(s(f(h(Y),X)))

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