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