YES(?,O(n^1))
0.16/0.22	YES(?,O(n^1))
0.16/0.22	
0.16/0.22	Problem:
0.16/0.22	 +(0(),y) -> y
0.16/0.22	 +(s(x),y) -> s(+(x,y))
0.16/0.22	 -(0(),y) -> 0()
0.16/0.22	 -(x,0()) -> x
0.16/0.22	 -(s(x),s(y)) -> -(x,y)
0.16/0.22	
0.16/0.22	Proof:
0.16/0.22	 Bounds Processor:
0.16/0.22	  bound: 1
0.16/0.22	  enrichment: match
0.16/0.22	  automaton:
0.16/0.22	   final states: {4,3}
0.16/0.22	   transitions:
0.16/0.22	    -1(1,2) -> 4*
0.16/0.22	    -1(2,1) -> 4*
0.16/0.22	    -1(1,1) -> 4*
0.16/0.22	    -1(2,2) -> 4*
0.16/0.22	    01() -> 4*
0.16/0.22	    s1(6) -> 6,3
0.16/0.22	    +1(1,2) -> 6*
0.16/0.22	    +1(2,1) -> 6*
0.16/0.22	    +1(1,1) -> 6*
0.16/0.22	    +1(2,2) -> 6*
0.16/0.22	    +0(1,2) -> 3*
0.16/0.22	    +0(2,1) -> 3*
0.16/0.22	    +0(1,1) -> 3*
0.16/0.22	    +0(2,2) -> 3*
0.16/0.22	    00() -> 1*
0.16/0.22	    s0(2) -> 2*
0.16/0.22	    s0(1) -> 2*
0.16/0.22	    -0(1,2) -> 4*
0.16/0.22	    -0(2,1) -> 4*
0.16/0.22	    -0(1,1) -> 4*
0.16/0.22	    -0(2,2) -> 4*
0.16/0.22	    1 -> 6,4,3
0.16/0.22	    2 -> 6,4,3
0.16/0.22	  problem:
0.16/0.22	   
0.16/0.22	  Qed
0.16/0.22	EOF