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