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	 zeros() -> cons(0(),n__zeros())
0.16/0.24	 tail(cons(X,XS)) -> activate(XS)
0.16/0.24	 zeros() -> n__zeros()
0.16/0.24	 activate(n__zeros()) -> zeros()
0.16/0.24	 activate(X) -> X
0.16/0.24	
0.16/0.24	Proof:
0.16/0.24	 Bounds Processor:
0.16/0.24	  bound: 3
0.16/0.24	  enrichment: match
0.16/0.24	  automaton:
0.16/0.24	   final states: {7}
0.16/0.24	   transitions:
0.16/0.24	    zeros1() -> 7*
0.16/0.24	    n__zeros1() -> 7,10
0.16/0.24	    activate1(10) -> 7*
0.16/0.24	    activate1(12) -> 7*
0.16/0.24	    activate1(7) -> 7*
0.16/0.24	    activate1(14) -> 7*
0.16/0.24	    cons1(11,10) -> 7*
0.16/0.24	    01() -> 11*
0.16/0.24	    zeros2() -> 7*
0.16/0.24	    n__zeros2() -> 7,12
0.16/0.24	    zeros0() -> 7*
0.16/0.24	    cons2(13,12) -> 7*
0.16/0.24	    cons0(7,7) -> 7*
0.16/0.24	    02() -> 13*
0.16/0.24	    00() -> 7*
0.16/0.24	    n__zeros3() -> 7,14
0.16/0.24	    n__zeros0() -> 7*
0.16/0.24	    cons3(15,14) -> 7*
0.16/0.24	    tail0(7) -> 7*
0.16/0.24	    03() -> 15*
0.16/0.24	    activate0(7) -> 7*
0.16/0.24	    10 -> 7*
0.16/0.24	    12 -> 7*
0.16/0.24	    14 -> 7*
0.16/0.24	  problem:
0.16/0.24	   
0.16/0.24	  Qed
0.16/0.25	EOF