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