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