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