YES
We show the termination of the TRS R:

  half(|0|()) -> |0|()
  half(s(|0|())) -> |0|()
  half(s(s(x))) -> s(half(x))
  lastbit(|0|()) -> |0|()
  lastbit(s(|0|())) -> s(|0|())
  lastbit(s(s(x))) -> lastbit(x)
  zero(|0|()) -> true()
  zero(s(x)) -> false()
  conv(x) -> conviter(x,cons(|0|(),nil()))
  conviter(x,l) -> if(zero(x),x,l)
  if(true(),x,l) -> l
  if(false(),x,l) -> conviter(half(x),cons(lastbit(x),l))


-- SCC decomposition.

Consider the dependency pair problem (P, R), where P consists of

p1: half#(s(s(x))) -> half#(x)
p2: lastbit#(s(s(x))) -> lastbit#(x)
p3: conv#(x) -> conviter#(x,cons(|0|(),nil()))
p4: conviter#(x,l) -> if#(zero(x),x,l)
p5: conviter#(x,l) -> zero#(x)
p6: if#(false(),x,l) -> conviter#(half(x),cons(lastbit(x),l))
p7: if#(false(),x,l) -> half#(x)
p8: if#(false(),x,l) -> lastbit#(x)

and R consists of:

r1: half(|0|()) -> |0|()
r2: half(s(|0|())) -> |0|()
r3: half(s(s(x))) -> s(half(x))
r4: lastbit(|0|()) -> |0|()
r5: lastbit(s(|0|())) -> s(|0|())
r6: lastbit(s(s(x))) -> lastbit(x)
r7: zero(|0|()) -> true()
r8: zero(s(x)) -> false()
r9: conv(x) -> conviter(x,cons(|0|(),nil()))
r10: conviter(x,l) -> if(zero(x),x,l)
r11: if(true(),x,l) -> l
r12: if(false(),x,l) -> conviter(half(x),cons(lastbit(x),l))

The estimated dependency graph contains the following SCCs:

  {p4, p6}
  {p1}
  {p2}


-- Reduction pair.

Consider the dependency pair problem (P, R), where P consists of

p1: conviter#(x,l) -> if#(zero(x),x,l)
p2: if#(false(),x,l) -> conviter#(half(x),cons(lastbit(x),l))

and R consists of:

r1: half(|0|()) -> |0|()
r2: half(s(|0|())) -> |0|()
r3: half(s(s(x))) -> s(half(x))
r4: lastbit(|0|()) -> |0|()
r5: lastbit(s(|0|())) -> s(|0|())
r6: lastbit(s(s(x))) -> lastbit(x)
r7: zero(|0|()) -> true()
r8: zero(s(x)) -> false()
r9: conv(x) -> conviter(x,cons(|0|(),nil()))
r10: conviter(x,l) -> if(zero(x),x,l)
r11: if(true(),x,l) -> l
r12: if(false(),x,l) -> conviter(half(x),cons(lastbit(x),l))

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        conviter#_A(x1,x2) = max{x1 + 37, x2 + 13}
        if#_A(x1,x2,x3) = max{36, x1 + 8, x2 + 15, x3 + 13}
        zero_A(x1) = max{4, x1 - 3}
        false_A = 49
        half_A(x1) = max{14, x1 - 38}
        cons_A(x1,x2) = max{16, x1 - 34}
        lastbit_A(x1) = 56
        |0|_A = 2
        s_A(x1) = x1 + 53
        true_A = 3
  
    base order 2:
  
      precedence:
      
        conviter# > if# = s > half = lastbit > zero = false = |0| > cons = true
      
  
    partial status:
  
      pi(conviter#) = [1, 2]
      pi(if#) = [1]
      pi(zero) = []
      pi(false) = []
      pi(half) = []
      pi(cons) = []
      pi(lastbit) = []
      pi(|0|) = []
      pi(s) = [1]
      pi(true) = []

The following rules are removed:

  p2



-- SCC decomposition.

Consider the dependency pair problem (P, R), where P consists of

p1: conviter#(x,l) -> if#(zero(x),x,l)

and R consists of:

r1: half(|0|()) -> |0|()
r2: half(s(|0|())) -> |0|()
r3: half(s(s(x))) -> s(half(x))
r4: lastbit(|0|()) -> |0|()
r5: lastbit(s(|0|())) -> s(|0|())
r6: lastbit(s(s(x))) -> lastbit(x)
r7: zero(|0|()) -> true()
r8: zero(s(x)) -> false()
r9: conv(x) -> conviter(x,cons(|0|(),nil()))
r10: conviter(x,l) -> if(zero(x),x,l)
r11: if(true(),x,l) -> l
r12: if(false(),x,l) -> conviter(half(x),cons(lastbit(x),l))

The estimated dependency graph contains the following SCCs:

  (no SCCs)

-- Reduction pair.

Consider the dependency pair problem (P, R), where P consists of

p1: half#(s(s(x))) -> half#(x)

and R consists of:

r1: half(|0|()) -> |0|()
r2: half(s(|0|())) -> |0|()
r3: half(s(s(x))) -> s(half(x))
r4: lastbit(|0|()) -> |0|()
r5: lastbit(s(|0|())) -> s(|0|())
r6: lastbit(s(s(x))) -> lastbit(x)
r7: zero(|0|()) -> true()
r8: zero(s(x)) -> false()
r9: conv(x) -> conviter(x,cons(|0|(),nil()))
r10: conviter(x,l) -> if(zero(x),x,l)
r11: if(true(),x,l) -> l
r12: if(false(),x,l) -> conviter(half(x),cons(lastbit(x),l))

The set of usable rules consists of

  r1, r2, r4, r5, r8

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        half#_A(x1) = max{4, x1 - 1}
        s_A(x1) = max{8, x1 + 3}
        half_A(x1) = max{7, x1 - 15}
        |0|_A = 6
        lastbit_A(x1) = max{10, x1 - 15}
        zero_A(x1) = max{5, x1 - 20}
        false_A = 4
  
    base order 2:
  
      precedence:
      
        s = lastbit > half# = half = zero > |0| = false
      
  
    partial status:
  
      pi(half#) = []
      pi(s) = [1]
      pi(half) = []
      pi(|0|) = []
      pi(lastbit) = []
      pi(zero) = []
      pi(false) = []

The following rules are removed:

  p1

Then no dependency pair remains.

-- Reduction pair.

Consider the dependency pair problem (P, R), where P consists of

p1: lastbit#(s(s(x))) -> lastbit#(x)

and R consists of:

r1: half(|0|()) -> |0|()
r2: half(s(|0|())) -> |0|()
r3: half(s(s(x))) -> s(half(x))
r4: lastbit(|0|()) -> |0|()
r5: lastbit(s(|0|())) -> s(|0|())
r6: lastbit(s(s(x))) -> lastbit(x)
r7: zero(|0|()) -> true()
r8: zero(s(x)) -> false()
r9: conv(x) -> conviter(x,cons(|0|(),nil()))
r10: conviter(x,l) -> if(zero(x),x,l)
r11: if(true(),x,l) -> l
r12: if(false(),x,l) -> conviter(half(x),cons(lastbit(x),l))

The set of usable rules consists of

  r1, r2, r4, r5, r8

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        lastbit#_A(x1) = max{4, x1 - 1}
        s_A(x1) = max{8, x1 + 3}
        half_A(x1) = max{7, x1 - 15}
        |0|_A = 6
        lastbit_A(x1) = max{10, x1 - 15}
        zero_A(x1) = max{5, x1 - 20}
        false_A = 4
  
    base order 2:
  
      precedence:
      
        s = lastbit > lastbit# = half = zero > |0| = false
      
  
    partial status:
  
      pi(lastbit#) = []
      pi(s) = [1]
      pi(half) = []
      pi(|0|) = []
      pi(lastbit) = []
      pi(zero) = []
      pi(false) = []

The following rules are removed:

  p1

Then no dependency pair remains.