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