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