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