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