0.00/0.26	MAYBE
0.00/0.26	Input TRS:
0.00/0.26	    1: b(a(b(a(b(a(a(b(a(x1))))))))) -> a(b(a(b(a(a(b(a(b(a(b(a(b(a(x1))))))))))))))
0.00/0.26	Number of strict rules: 1
0.00/0.26	Direct POLO(bPol) ... failed.
0.00/0.26	Uncurrying b
0.00/0.26	1: b^1_a(b^1_a(b^1_a(a(b^1_a(x1))))) -> a(b^1_a(b^1_a(a(b^1_a(b^1_a(b^1_a(b^1_a(x1))))))))
0.00/0.26	2: b(a(_1)) ->= b^1_a(_1)
0.00/0.26	Number of strict rules: 1
0.00/0.26	Direct POLO(bPol) ... removes: 2
0.00/0.26	      a 	w: x1
0.00/0.26	      b 	w: x1 + 2
0.00/0.26	      b^1_a	w: x1
0.00/0.26	Number of strict rules: 1
0.00/0.26	Direct POLO(bPol) ... failed.
0.00/0.26	Dependency Pairs:
0.00/0.26	   #1: #b^1_a(b^1_a(b^1_a(a(b^1_a(x1))))) -> #b^1_a(b^1_a(a(b^1_a(b^1_a(b^1_a(b^1_a(x1)))))))
0.00/0.26	   #2: #b^1_a(b^1_a(b^1_a(a(b^1_a(x1))))) -> #b^1_a(a(b^1_a(b^1_a(b^1_a(b^1_a(x1))))))
0.00/0.26	   #3: #b^1_a(b^1_a(b^1_a(a(b^1_a(x1))))) -> #b^1_a(b^1_a(b^1_a(b^1_a(x1))))
0.00/0.26	   #4: #b^1_a(b^1_a(b^1_a(a(b^1_a(x1))))) -> #b^1_a(b^1_a(b^1_a(x1)))
0.00/0.26	   #5: #b^1_a(b^1_a(b^1_a(a(b^1_a(x1))))) -> #b^1_a(b^1_a(x1))
0.00/0.26	Number of SCCs: 1, DPs: 3
0.00/0.26	  SCC { #3..5 }
0.00/0.26	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.26	Finding a loop...  failed.
0.00/0.26	EOF