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