YES(?,O(n^1))
0.16/0.23	YES(?,O(n^1))
0.16/0.23	
0.16/0.23	Problem:
0.16/0.23	 a(x,y) -> b(x,b(0(),c(y)))
0.16/0.23	 c(b(y,c(x))) -> c(c(b(a(0(),0()),y)))
0.16/0.23	 b(y,0()) -> y
0.16/0.23	
0.16/0.23	Proof:
0.16/0.23	 Bounds Processor:
0.16/0.23	  bound: 3
0.16/0.23	  enrichment: match
0.16/0.23	  automaton:
0.16/0.23	   final states: {5}
0.16/0.23	   transitions:
0.16/0.23	    b3(18,26) -> 20*
0.16/0.23	    b3(25,24) -> 26*
0.16/0.23	    c1(5) -> 9*
0.16/0.23	    c1(14) -> 9,5
0.16/0.23	    c1(23) -> 13*
0.16/0.23	    c1(13) -> 14*
0.16/0.23	    03() -> 25*
0.16/0.23	    b1(10,9) -> 11*
0.16/0.23	    b1(5,11) -> 5*
0.16/0.23	    b1(12,5) -> 13*
0.16/0.23	    b1(12,12) -> 23*
0.16/0.23	    c3(18) -> 24*
0.16/0.23	    a1(10,10) -> 12*
0.16/0.23	    01() -> 10*
0.16/0.23	    c2(10) -> 17*
0.16/0.23	    c2(22) -> 14*
0.16/0.23	    c2(21) -> 22*
0.16/0.23	    a0(5,5) -> 5*
0.16/0.23	    b2(18,17) -> 19*
0.16/0.23	    b2(10,19) -> 12*
0.16/0.23	    b2(20,12) -> 21*
0.16/0.23	    b0(5,5) -> 5*
0.16/0.23	    a2(18,18) -> 20*
0.16/0.23	    00() -> 5*
0.16/0.23	    02() -> 18*
0.16/0.23	    c0(5) -> 5*
0.16/0.23	    12 -> 13*
0.16/0.23	  problem:
0.16/0.23	   
0.16/0.23	  Qed
0.16/0.23	EOF