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