YES(?,O(n^1))
0.16/0.21	YES(?,O(n^1))
0.16/0.22	
0.16/0.22	Problem:
0.16/0.22	 f(a(),f(a(),x)) -> f(a(),f(f(a(),x),f(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: {2,1}
0.16/0.22	   transitions:
0.16/0.22	    f1(4,2) -> 6*
0.16/0.22	    f1(4,4) -> 5*
0.16/0.22	    f1(4,1) -> 6*
0.16/0.22	    f1(4,7) -> 6,1
0.16/0.22	    f1(6,5) -> 7*
0.16/0.22	    f1(1,5) -> 7*
0.16/0.22	    a1() -> 4*
0.16/0.22	    f2(18,17) -> 19*
0.16/0.22	    f2(16,16) -> 17*
0.16/0.22	    f2(16,7) -> 18*
0.16/0.22	    f2(16,19) -> 6*
0.16/0.22	    f0(1,2) -> 1*
0.16/0.22	    f0(2,1) -> 1*
0.16/0.22	    f0(1,1) -> 1*
0.16/0.22	    f0(2,2) -> 1*
0.16/0.22	    a2() -> 16*
0.16/0.22	    a0() -> 2*
0.16/0.22	  problem:
0.16/0.22	   
0.16/0.22	  Qed
0.16/0.22	EOF