YES(?,O(n^1))
0.16/0.23	YES(?,O(n^1))
0.16/0.24	
0.16/0.24	Problem:
0.16/0.24	 and(tt(),X) -> activate(X)
0.16/0.24	 plus(N,0()) -> N
0.16/0.24	 plus(N,s(M)) -> s(plus(N,M))
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: 1
0.16/0.24	  enrichment: match
0.16/0.24	  automaton:
0.16/0.24	   final states: {6,5,4}
0.16/0.24	   transitions:
0.16/0.24	    s1(7) -> 7,5
0.16/0.24	    plus1(3,1) -> 7*
0.16/0.24	    plus1(3,3) -> 7*
0.16/0.24	    plus1(1,2) -> 7*
0.16/0.24	    plus1(2,1) -> 7*
0.16/0.24	    plus1(2,3) -> 7*
0.16/0.24	    plus1(3,2) -> 7*
0.16/0.24	    plus1(1,1) -> 7*
0.16/0.24	    plus1(1,3) -> 7*
0.16/0.24	    plus1(2,2) -> 7*
0.16/0.24	    activate1(2) -> 4*
0.16/0.24	    activate1(1) -> 4*
0.16/0.24	    activate1(3) -> 4*
0.16/0.24	    and0(3,1) -> 4*
0.16/0.24	    and0(3,3) -> 4*
0.16/0.24	    and0(1,2) -> 4*
0.16/0.24	    and0(2,1) -> 4*
0.16/0.24	    and0(2,3) -> 4*
0.16/0.24	    and0(3,2) -> 4*
0.16/0.24	    and0(1,1) -> 4*
0.16/0.24	    and0(1,3) -> 4*
0.16/0.24	    and0(2,2) -> 4*
0.16/0.24	    tt0() -> 1*
0.16/0.24	    activate0(2) -> 6*
0.16/0.24	    activate0(1) -> 6*
0.16/0.24	    activate0(3) -> 6*
0.16/0.24	    plus0(3,1) -> 5*
0.16/0.24	    plus0(3,3) -> 5*
0.16/0.24	    plus0(1,2) -> 5*
0.16/0.24	    plus0(2,1) -> 5*
0.16/0.24	    plus0(2,3) -> 5*
0.16/0.24	    plus0(3,2) -> 5*
0.16/0.24	    plus0(1,1) -> 5*
0.16/0.24	    plus0(1,3) -> 5*
0.16/0.24	    plus0(2,2) -> 5*
0.16/0.24	    00() -> 2*
0.16/0.24	    s0(2) -> 3*
0.16/0.24	    s0(1) -> 3*
0.16/0.24	    s0(3) -> 3*
0.16/0.24	    1 -> 4,7,6,5
0.16/0.24	    2 -> 4,7,6,5
0.16/0.24	    3 -> 4,7,6,5
0.16/0.24	  problem:
0.16/0.24	   
0.16/0.24	  Qed
0.16/0.24	EOF