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