YES(?,O(n^1))

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

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