YES
Input TRS:
      1: half(0()) -> 0()
      2: half(s(0())) -> 0()
      3: half(s(s(x))) -> s(half(x))
      4: lastbit(0()) -> 0()
      5: lastbit(s(0())) -> s(0())
      6: lastbit(s(s(x))) -> lastbit(x)
      7: zero(0()) -> true()
      8: zero(s(x)) -> false()
      9: conv(x) -> conviter(x,cons(0(),nil()))
      10: conviter(x,l) -> if(zero(x),x,l)
      11: if(true(),x,l) -> l
      12: if(false(),x,l) -> conviter(half(x),cons(lastbit(x),l))
Number of strict rules: 12
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #lastbit(s(s(x))) -> #lastbit(x)
     #2: #conv(x) -> #conviter(x,cons(0(),nil()))
     #3: #if(false(),x,l) -> #conviter(half(x),cons(lastbit(x),l))
     #4: #if(false(),x,l) -> #half(x)
     #5: #if(false(),x,l) -> #lastbit(x)
     #6: #conviter(x,l) -> #if(zero(x),x,l)
     #7: #conviter(x,l) -> #zero(x)
     #8: #half(s(s(x))) -> #half(x)
Number of SCCs: 3, DPs: 4
  SCC { #8 }
POLO(Sum)... succeeded.
      zero	w: 0
      conv	w: 0
      s 	w: x1 + 1
      #conv	w: 0
      false	w: 0
      #half	w: x1
      #lastbit	w: 0
      true	w: 0
      half	w: 0
      lastbit	w: 0
      #conviter	w: 0
      0 	w: 0
      if	w: 0
      conviter	w: 0
      nil	w: 0
      cons	w: 0
      #if	w: 0
      #zero	w: 0
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 2, DPs: 3
  SCC { #1 }
POLO(Sum)... succeeded.
      zero	w: 0
      conv	w: 0
      s 	w: x1 + 1
      #conv	w: 0
      false	w: 0
      #half	w: 0
      #lastbit	w: x1
      true	w: 0
      half	w: 0
      lastbit	w: 0
      #conviter	w: 0
      0 	w: 0
      if	w: 0
      conviter	w: 0
      nil	w: 0
      cons	w: 0
      #if	w: 0
      #zero	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 2
  SCC { #3 #6 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      zero	w: max(x1 - 1, 0)
      conv	w: 0
      s 	w: max(x1 + 5, 0)
      #conv	w: max(x1 - 1, 0)
      false	w: 4
      #half	w: 0
      #lastbit	w: max(x1 - 1, 0)
      true	w: 0
      half	w: max(x1 - 1, 0)
      lastbit	w: max(x1 + 1, 0)
      #conviter	w: max(x1 + 2, x2 + 3, 0)
      0 	w: 0
      if	w: max(x2 - 1, 0)
      conviter	w: max(x1 - 1, 0)
      nil	w: 0
      cons	w: max(x1 - 34729, 0)
      #if	w: max(x1 - 1, x2 + 1, 0)
      #zero	w: max(x1 - 1, 0)
    USABLE RULES: { 1..8 }
    Removed DPs: #6
Number of SCCs: 0, DPs: 0