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