0.00/0.34	MAYBE
0.00/0.34	Input TRS:
0.00/0.34	    1: c(b(a(x1))) -> c(b(b(x1)))
0.00/0.34	    2: b(a(c(x1))) -> b(b(c(x1)))
0.00/0.34	    3: c(c(c(x1))) -> b(c(c(x1)))
0.00/0.34	    4: a(c(a(x1))) -> b(c(b(x1)))
0.00/0.34	    5: b(c(b(x1))) -> c(b(c(x1)))
0.00/0.34	    6: a(c(b(x1))) -> b(a(c(x1)))
0.00/0.34	    7: b(b(a(x1))) ->= c(b(b(x1)))
0.00/0.34	Number of strict rules: 6
0.00/0.34	Direct POLO(bPol) ... removes: 4 1 7 6 2
0.00/0.34	      a 	w: 2 * x1 + 2
0.00/0.34	      b 	w: x1 + 1
0.00/0.34	      c 	w: x1 + 1
0.00/0.34	Number of strict rules: 2
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(c(b(x1))) -> #c(b(c(x1)))
0.00/0.34	   #2: #b(c(b(x1))) -> #b(c(x1))
0.00/0.34	   #3: #b(c(b(x1))) -> #c(x1)
0.00/0.34	   #4: #c(c(c(x1))) -> #b(c(c(x1)))
0.00/0.34	Number of SCCs: 1, DPs: 4
0.00/0.34	  SCC { #1..4 }
0.00/0.34	POLO(Sum)... succeeded.
0.00/0.34	      a 	w: 0
0.00/0.34	      b 	w: x1 + 1
0.00/0.34	      c 	w: x1 + 1
0.00/0.34	      #c 	w: x1
0.00/0.34	      #b 	w: x1
0.00/0.34	    USABLE RULES: { 3 5 }
0.00/0.34	    Removed DPs: #2 #3
0.00/0.34	Number of SCCs: 1, DPs: 2
0.00/0.34	  SCC { #1 #4 }
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