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