YES(?,O(n^1))

Problem:
 +(x,0()) -> x
 +(x,s(y)) -> s(+(x,y))
 +(0(),s(y)) -> s(y)
 s(+(0(),y)) -> s(y)

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