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