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	 p(m,n,s(r)) -> p(m,r,n)
0.16/0.22	 p(m,s(n),0()) -> p(0(),n,m)
0.16/0.22	 p(m,0(),0()) -> m
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,5}
0.16/0.22	   transitions:
0.16/0.22	    p1(4,5,5) -> 4*
0.16/0.22	    p1(5,4,5) -> 4*
0.16/0.22	    p1(4,4,4) -> 4*
0.16/0.22	    p1(5,5,4) -> 4*
0.16/0.22	    p1(4,4,5) -> 4*
0.16/0.22	    p1(5,5,5) -> 4*
0.16/0.22	    p1(4,5,4) -> 4*
0.16/0.22	    p1(5,4,4) -> 4*
0.16/0.22	    01() -> 4*
0.16/0.22	    p0(4,5,5) -> 4*
0.16/0.22	    p0(5,4,5) -> 4*
0.16/0.22	    p0(4,4,4) -> 4*
0.16/0.22	    p0(5,5,4) -> 4*
0.16/0.22	    p0(4,4,5) -> 4*
0.16/0.22	    p0(5,5,5) -> 4*
0.16/0.22	    p0(4,5,4) -> 4*
0.16/0.22	    p0(5,4,4) -> 4*
0.16/0.22	    s0(5) -> 5*
0.16/0.22	    s0(4) -> 5*
0.16/0.22	    00() -> 4*
0.16/0.22	    5 -> 4*
0.16/0.22	  problem:
0.16/0.22	   
0.16/0.22	  Qed
0.16/0.22	EOF