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