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