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