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