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