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