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