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	 f(X,X) -> f(a(),n__b())
0.16/0.24	 b() -> a()
0.16/0.24	 b() -> n__b()
0.16/0.24	 activate(n__b()) -> b()
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: 2
0.16/0.24	  enrichment: match
0.16/0.24	  automaton:
0.16/0.24	   final states: {10,9,6}
0.16/0.24	   transitions:
0.16/0.24	    f1(8,7) -> 6*
0.16/0.24	    f1(8,9) -> 6*
0.16/0.24	    f1(10,7) -> 6*
0.16/0.24	    f1(10,9) -> 6*
0.16/0.24	    n__b2() -> 7,9*,6
0.16/0.24	    a2() -> 8,10*,6
0.16/0.24	    f0(9,6) -> 6*
0.16/0.24	    f0(9,10) -> 6*
0.16/0.24	    f0(10,9) -> 6*
0.16/0.24	    f0(6,6) -> 6*
0.16/0.24	    f0(6,10) -> 6*
0.16/0.24	    f0(9,9) -> 6*
0.16/0.24	    f0(10,6) -> 6*
0.16/0.24	    f0(10,10) -> 6*
0.16/0.24	    f0(6,9) -> 6*
0.16/0.24	    activate0(10) -> 6*
0.16/0.24	    activate0(9) -> 6*
0.16/0.24	    activate0(6) -> 6*
0.16/0.24	    b1() -> 6*
0.16/0.24	    9 -> 6*
0.16/0.24	    10 -> 6*
0.16/0.24	  problem:
0.16/0.24	   
0.16/0.24	  Qed
0.16/0.24	EOF