YES(?,O(n^1))

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

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