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