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