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