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