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