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