YES(?,O(n^1))
0.16/0.24	YES(?,O(n^1))
0.16/0.24	
0.16/0.24	Problem:
0.16/0.24	 c(c(c(y))) -> c(c(a(y,0())))
0.16/0.24	 c(a(a(0(),x),y)) -> a(c(c(c(0()))),y)
0.16/0.24	 c(y) -> y
0.16/0.24	
0.16/0.24	Proof:
0.16/0.24	 Bounds Processor:
0.16/0.24	  bound: 2
0.16/0.24	  enrichment: match
0.16/0.24	  automaton:
0.16/0.24	   final states: {3}
0.16/0.24	   transitions:
0.16/0.24	    a1(11,2) -> 3*
0.16/0.24	    a1(11,1) -> 3*
0.16/0.24	    c1(10) -> 11*
0.16/0.24	    c1(9) -> 10*
0.16/0.24	    c1(8) -> 9*
0.16/0.24	    01() -> 8*
0.16/0.24	    c2(17) -> 11*
0.16/0.24	    c2(16) -> 17*
0.16/0.24	    c0(2) -> 3*
0.16/0.24	    c0(1) -> 3*
0.16/0.24	    a2(8,15) -> 16*
0.16/0.24	    a0(1,2) -> 1*
0.16/0.24	    a0(2,1) -> 1*
0.16/0.24	    a0(1,1) -> 1*
0.16/0.24	    a0(2,2) -> 1*
0.16/0.24	    02() -> 15*
0.16/0.24	    00() -> 2*
0.16/0.24	    1 -> 3*
0.16/0.24	    2 -> 3*
0.16/0.24	    8 -> 9*
0.16/0.24	    9 -> 10*
0.16/0.24	    10 -> 11*
0.16/0.24	    16 -> 17*
0.16/0.24	    17 -> 11*
0.16/0.24	  problem:
0.16/0.24	   
0.16/0.24	  Qed
0.16/0.25	EOF