0.00/0.24	MAYBE
0.00/0.24	Input TRS:
0.00/0.24	    1: b(a(b(a(a(a(x1)))))) -> a(a(a(b(a(b(a(b(a(x1)))))))))
0.00/0.24	Number of strict rules: 1
0.00/0.24	Direct POLO(bPol) ... failed.
0.00/0.24	Uncurrying b
0.00/0.24	1: b^1_a(b^1_a(a(a(x1)))) -> a(a(a(b^1_a(b^1_a(b^1_a(x1))))))
0.00/0.24	2: b(a(_1)) ->= b^1_a(_1)
0.00/0.24	Number of strict rules: 1
0.00/0.24	Direct POLO(bPol) ... removes: 2
0.00/0.24	      a 	w: x1
0.00/0.24	      b 	w: 2 * x1 + 1
0.00/0.24	      b^1_a	w: x1
0.00/0.24	Number of strict rules: 1
0.00/0.24	Direct POLO(bPol) ... failed.
0.00/0.24	Dependency Pairs:
0.00/0.24	   #1: #b^1_a(b^1_a(a(a(x1)))) -> #b^1_a(b^1_a(b^1_a(x1)))
0.00/0.24	   #2: #b^1_a(b^1_a(a(a(x1)))) -> #b^1_a(b^1_a(x1))
0.00/0.24	   #3: #b^1_a(b^1_a(a(a(x1)))) -> #b^1_a(x1)
0.00/0.24	Number of SCCs: 1, DPs: 3
0.00/0.24	  SCC { #1..3 }
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