1.07/1.05	MAYBE
1.07/1.05	Input TRS:
1.07/1.05	    1: a(b(a(a(b(a(b(a(x1)))))))) -> a(a(b(a(b(a(b(a(b(a(b(a(a(b(x1))))))))))))))
1.07/1.05	Number of strict rules: 1
1.07/1.05	Direct POLO(bPol) ... failed.
1.07/1.05	Uncurrying ... failed.
1.07/1.05	Dependency Pairs:
1.07/1.05	   #1: #a(b(a(a(b(a(b(a(x1)))))))) -> #a(a(b(a(b(a(b(a(b(a(b(a(a(b(x1))))))))))))))
1.07/1.05	   #2: #a(b(a(a(b(a(b(a(x1)))))))) -> #a(b(a(b(a(b(a(b(a(b(a(a(b(x1)))))))))))))
1.07/1.05	   #3: #a(b(a(a(b(a(b(a(x1)))))))) -> #a(b(a(b(a(b(a(b(a(a(b(x1)))))))))))
1.07/1.05	   #4: #a(b(a(a(b(a(b(a(x1)))))))) -> #a(b(a(b(a(b(a(a(b(x1)))))))))
1.07/1.05	   #5: #a(b(a(a(b(a(b(a(x1)))))))) -> #a(b(a(b(a(a(b(x1)))))))
1.07/1.05	   #6: #a(b(a(a(b(a(b(a(x1)))))))) -> #a(b(a(a(b(x1)))))
1.07/1.05	   #7: #a(b(a(a(b(a(b(a(x1)))))))) -> #a(a(b(x1)))
1.07/1.05	   #8: #a(b(a(a(b(a(b(a(x1)))))))) -> #a(b(x1))
1.07/1.05	Number of SCCs: 1, DPs: 6
1.07/1.05	  SCC { #2..6 #8 }
1.07/1.05	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
1.07/1.05	Finding a loop...  failed.
1.07/1.06	EOF