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