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