YES(?,O(n^1))
0.16/0.22	YES(?,O(n^1))
0.16/0.22	
0.16/0.22	Problem:
0.16/0.22	 f(f(x,a()),a()) -> f(f(f(x,a()),f(a(),a())),a())
0.16/0.22	
0.16/0.22	Proof:
0.16/0.22	 Bounds Processor:
0.16/0.22	  bound: 2
0.16/0.22	  enrichment: match
0.16/0.22	  automaton:
0.16/0.22	   final states: {3}
0.16/0.22	   transitions:
0.16/0.22	    f1(3,9) -> 11*
0.16/0.22	    f1(10,9) -> 11*
0.16/0.22	    f1(11,8) -> 10,3
0.16/0.22	    f1(8,8) -> 9*
0.16/0.22	    f1(3,8) -> 10*
0.16/0.22	    a1() -> 8*
0.16/0.22	    f2(11,12) -> 14*
0.16/0.22	    f2(14,13) -> 15*
0.16/0.22	    f2(15,12) -> 10*
0.16/0.22	    f2(12,12) -> 13*
0.16/0.22	    f0(3,3) -> 3*
0.16/0.22	    a2() -> 12*
0.16/0.22	    a0() -> 3*
0.16/0.22	  problem:
0.16/0.22	   
0.16/0.22	  Qed
0.16/0.24	EOF