YES(?,O(n^1))
0.16/0.25	YES(?,O(n^1))
0.16/0.25	
0.16/0.25	Problem:
0.16/0.25	 a__f(X) -> g(h(f(X)))
0.16/0.25	 mark(f(X)) -> a__f(mark(X))
0.16/0.25	 mark(g(X)) -> g(X)
0.16/0.25	 mark(h(X)) -> h(mark(X))
0.16/0.25	 a__f(X) -> f(X)
0.16/0.25	
0.16/0.25	Proof:
0.16/0.25	 Bounds Processor:
0.16/0.25	  bound: 2
0.16/0.25	  enrichment: match
0.16/0.25	  automaton:
0.16/0.25	   final states: {5,4}
0.16/0.25	   transitions:
0.16/0.25	    f1(16) -> 17*
0.16/0.25	    f1(6) -> 7*
0.16/0.25	    f1(18) -> 19*
0.16/0.25	    h1(50) -> 51*
0.16/0.25	    h1(7) -> 8*
0.16/0.25	    mark1(25) -> 26*
0.16/0.25	    mark1(34) -> 35*
0.16/0.25	    mark1(28) -> 29*
0.16/0.25	    g1(42) -> 43*
0.16/0.25	    g1(44) -> 45*
0.16/0.25	    g1(36) -> 37*
0.16/0.25	    g1(8) -> 9*
0.16/0.25	    a__f1(26) -> 27*
0.16/0.25	    f2(56) -> 57*
0.16/0.25	    a__f0(2) -> 4*
0.16/0.25	    a__f0(1) -> 4*
0.16/0.25	    a__f0(3) -> 4*
0.16/0.25	    g2(58) -> 59*
0.16/0.25	    g0(2) -> 1*
0.16/0.25	    g0(1) -> 1*
0.16/0.25	    g0(3) -> 1*
0.16/0.25	    h2(57) -> 58*
0.16/0.25	    h0(2) -> 2*
0.16/0.25	    h0(1) -> 2*
0.16/0.25	    h0(3) -> 2*
0.16/0.25	    f0(2) -> 3*
0.16/0.25	    f0(1) -> 3*
0.16/0.25	    f0(3) -> 3*
0.16/0.25	    mark0(2) -> 5*
0.16/0.25	    mark0(1) -> 5*
0.16/0.25	    mark0(3) -> 5*
0.16/0.25	    1 -> 42,28,16
0.16/0.25	    2 -> 36,25,18
0.16/0.25	    3 -> 44,34,6
0.16/0.25	    7 -> 4*
0.16/0.25	    9 -> 4*
0.16/0.25	    17 -> 7*
0.16/0.25	    19 -> 7*
0.16/0.25	    26 -> 56,50
0.16/0.25	    27 -> 35,26,50,5
0.16/0.25	    29 -> 26*
0.16/0.25	    35 -> 26*
0.16/0.25	    37 -> 29,26,50,5
0.16/0.25	    43 -> 29,26,50,5
0.16/0.25	    45 -> 29,26,50,5
0.16/0.25	    51 -> 26,50,5
0.16/0.25	    57 -> 27,5
0.16/0.25	    59 -> 27,5
0.16/0.25	  problem:
0.16/0.25	   
0.16/0.25	  Qed
0.16/0.26	EOF