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