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