0.00/0.08	MAYBE
0.00/0.09	Input TRS:
0.00/0.09	    1: a(x1) -> b(x1)
0.00/0.09	    2: a(b(x1)) -> b(a(c(x1)))
0.00/0.09	    3: b(b(x1)) -> x1
0.00/0.09	    4: c(c(x1)) -> a(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(b(x1)) -> #b(a(c(x1)))
0.00/0.09	   #2: #a(b(x1)) -> #a(c(x1))
0.00/0.09	   #3: #a(b(x1)) -> #c(x1)
0.00/0.09	   #4: #a(x1) -> #b(x1)
0.00/0.09	   #5: #c(c(x1)) -> #a(x1)
0.00/0.09	Number of SCCs: 1, DPs: 3
0.00/0.09	  SCC { #2 #3 #5 }
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.09	EOF