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