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