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