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