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