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