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