0.00/0.23	MAYBE
0.00/0.24	Input TRS:
0.00/0.24	    1: a(a(x1)) -> b(b(b(c(x1))))
0.00/0.24	    2: b(c(b(x1))) -> a(b(c(x1)))
0.00/0.24	Number of strict rules: 2
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(c(b(x1))) -> #a(b(c(x1)))
0.00/0.24	   #2: #b(c(b(x1))) -> #b(c(x1))
0.00/0.24	   #3: #a(a(x1)) -> #b(b(b(c(x1))))
0.00/0.24	   #4: #a(a(x1)) -> #b(b(c(x1)))
0.00/0.24	   #5: #a(a(x1)) -> #b(c(x1))
0.00/0.24	Number of SCCs: 1, DPs: 3
0.00/0.24	  SCC { #1 #2 #5 }
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