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