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