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