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