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