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