0.00/0.33	MAYBE
0.00/0.33	Input TRS:
0.00/0.33	    1: c(c(a(x1))) -> a(a(c(x1)))
0.00/0.33	    2: b(b(a(x1))) -> b(b(b(x1)))
0.00/0.33	    3: b(c(b(x1))) ->= c(b(c(x1)))
0.00/0.33	    4: b(a(a(x1))) ->= c(a(c(x1)))
0.00/0.33	    5: c(a(a(x1))) ->= a(a(c(x1)))
0.00/0.33	    6: c(c(b(x1))) ->= c(b(a(x1)))
0.00/0.33	Number of strict rules: 2
0.00/0.33	Direct POLO(bPol) ... failed.
0.00/0.33	Uncurrying ... failed.
0.00/0.33	Dependency Pairs:
0.00/0.33	   #1: #b(b(a(x1))) -> #b(b(b(x1)))
0.00/0.33	   #2: #b(b(a(x1))) -> #b(b(x1))
0.00/0.33	   #3: #b(b(a(x1))) -> #b(x1)
0.00/0.33	   #4: #c(c(b(x1))) ->? #c(b(a(x1)))
0.00/0.33	   #5: #c(c(b(x1))) ->? #b(a(x1))
0.00/0.33	   #6: #c(a(a(x1))) ->? #c(x1)
0.00/0.33	   #7: #b(c(b(x1))) ->? #c(b(c(x1)))
0.00/0.33	   #8: #b(c(b(x1))) ->? #b(c(x1))
0.00/0.33	   #9: #b(c(b(x1))) ->? #c(x1)
0.00/0.33	   #10: #c(c(a(x1))) -> #c(x1)
0.00/0.33	   #11: #b(a(a(x1))) ->? #c(a(c(x1)))
0.00/0.33	   #12: #b(a(a(x1))) ->? #c(x1)
0.00/0.33	Number of SCCs: 3, DPs: 10
0.00/0.33	  SCC { #8 }
0.00/0.33	POLO(Sum)... succeeded.
0.00/0.33	      a 	w: x1 + 1
0.00/0.33	      b 	w: x1 + 1
0.00/0.33	      c 	w: x1 + 1
0.00/0.33	      #c 	w: 0
0.00/0.33	      #b 	w: x1
0.00/0.33	    USABLE RULES: { 1 4..6 }
0.00/0.33	    Removed DPs: #8
0.00/0.33	Number of SCCs: 2, DPs: 9
0.00/0.33	  SCC { #1..3 }
0.00/0.33	POLO(Sum)... succeeded.
0.00/0.33	      a 	w: x1 + 1
0.00/0.33	      b 	w: x1 + 1
0.00/0.33	      c 	w: x1 + 1
0.00/0.33	      #c 	w: 0
0.00/0.33	      #b 	w: x1
0.00/0.33	    USABLE RULES: { 1..6 }
0.00/0.33	    Removed DPs: #2 #3
0.00/0.33	Number of SCCs: 2, DPs: 7
0.00/0.33	  SCC { #1 }
0.00/0.33	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
0.00/0.33	Finding a loop...  failed.
0.00/0.33	EOF