2.64/1.06	YES
2.64/1.06	
2.64/1.06	Problem:
2.64/1.06	 a(b(x1)) -> d(x1)
2.64/1.06	 b(a(x1)) -> a(b(x1))
2.64/1.06	 d(c(x1)) -> f(a(b(b(c(x1)))))
2.64/1.06	 d(f(x1)) -> f(a(b(x1)))
2.64/1.06	 a(f(x1)) -> a(x1)
2.64/1.06	
2.64/1.06	Proof:
2.64/1.06	 Bounds Processor:
2.64/1.06	  bound: 1
2.64/1.06	  enrichment: match
2.64/1.06	  automaton:
2.64/1.06	   final states: {11,10,5,3,1}
2.64/1.06	   transitions:
2.64/1.06	    d1(12) -> 13*
2.64/1.06	    d1(18) -> 19*
2.64/1.06	    a1(22) -> 23*
2.64/1.06	    a1(24) -> 25*
2.64/1.06	    f50() -> 2*
2.64/1.06	    d0(2) -> 1*
2.64/1.06	    a0(2) -> 11*
2.64/1.06	    a0(4) -> 3*
2.64/1.06	    a0(8) -> 9*
2.64/1.06	    b0(7) -> 8*
2.64/1.06	    b0(2) -> 4*
2.64/1.06	    b0(6) -> 7*
2.64/1.06	    f0(9) -> 5*
2.64/1.06	    f0(3) -> 10*
2.64/1.06	    c0(2) -> 6*
2.64/1.06	    1 -> 11*
2.64/1.06	    2 -> 18*
2.64/1.06	    3 -> 24,4
2.64/1.06	    5 -> 19,1,3
2.64/1.06	    7 -> 12*
2.64/1.06	    9 -> 22*
2.64/1.06	    10 -> 19,1,3
2.64/1.06	    13 -> 9*
2.64/1.06	    19 -> 3*
2.64/1.06	    23 -> 25,3,4
2.64/1.06	    25 -> 3,4
2.64/1.06	  problem:
2.64/1.06	   
2.64/1.06	  Qed
2.64/1.06	EOF