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