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