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