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