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