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