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