0.00/0.11	YES
0.00/0.11	Input TRS:
0.00/0.11	    1: a(l(x1)) -> l(a(x1))
0.00/0.11	    2: a(c(x1)) -> c(a(x1))
0.00/0.11	    3: c(a(r(x1))) -> r(a(x1))
0.00/0.11	    4: l(r(a(x1))) -> a(l(c(c(r(x1)))))
0.00/0.11	Number of strict rules: 4
0.00/0.11	Direct POLO(bPol) ... failed.
0.00/0.11	Uncurrying ... failed.
0.00/0.11	Dependency Pairs:
0.00/0.11	   #1: #a(c(x1)) -> #c(a(x1))
0.00/0.11	   #2: #a(c(x1)) -> #a(x1)
0.00/0.11	   #3: #c(a(r(x1))) -> #a(x1)
0.00/0.11	   #4: #a(l(x1)) -> #l(a(x1))
0.00/0.11	   #5: #a(l(x1)) -> #a(x1)
0.00/0.11	   #6: #l(r(a(x1))) -> #a(l(c(c(r(x1)))))
0.00/0.11	   #7: #l(r(a(x1))) -> #l(c(c(r(x1))))
0.00/0.11	   #8: #l(r(a(x1))) -> #c(c(r(x1)))
0.00/0.11	   #9: #l(r(a(x1))) -> #c(r(x1))
0.00/0.11	Number of SCCs: 1, DPs: 6
0.00/0.11	  SCC { #1..6 }
0.00/0.11	POLO(Sum)... succeeded.
0.00/0.11	      a 	w: x1 + 1
0.00/0.11	      r 	w: x1 + 2
0.00/0.11	      l 	w: x1 + 1
0.00/0.11	      c 	w: x1
0.00/0.11	      #c 	w: x1
0.00/0.11	      #l 	w: x1 + 2
0.00/0.11	      #a 	w: x1 + 2
0.00/0.11	    USABLE RULES: { 1..4 }
0.00/0.11	    Removed DPs: #1 #3 #5
0.00/0.11	Number of SCCs: 2, DPs: 3
0.00/0.11	  SCC { #2 }
0.00/0.11	POLO(Sum)... succeeded.
0.00/0.11	      a 	w: x1
0.00/0.11	      r 	w: x1 + 2
0.00/0.11	      l 	w: 1
0.00/0.11	      c 	w: x1 + 1
0.00/0.11	      #c 	w: x1
0.00/0.11	      #l 	w: x1 + 2
0.00/0.11	      #a 	w: x1 + 2
0.00/0.11	    USABLE RULES: { 1..4 }
0.00/0.11	    Removed DPs: #2
0.00/0.11	Number of SCCs: 1, DPs: 2
0.00/0.11	  SCC { #4 #6 }
0.00/0.11	POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
0.00/0.11	      a 	w: max(x1 + 6, 0)
0.00/0.11	      r 	w: 9
0.00/0.11	      l 	w: max(x1 + 10, 0)
0.00/0.11	      c 	w: max(x1 - 4, 0)
0.00/0.11	      #c 	w: max(x1 - 1, 0)
0.00/0.11	      #l 	w: max(x1 + 2, 0)
0.00/0.11	      #a 	w: max(x1 - 1, 0)
0.00/0.11	    USABLE RULES: { 1..4 }
0.00/0.11	    Removed DPs: #4 #6
0.00/0.11	Number of SCCs: 0, DPs: 0
0.00/0.11	EOF