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