YES(?,O(n^1))

Problem:
 f(+(x,0())) -> f(x)
 +(x,+(y,z)) -> +(+(x,y),z)

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