MAYBE
MAYBE
TRS:
 {
          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(),
     conviter(x, l) -> if(zero(x), x, l),
            conv(x) -> conviter(x, cons(0(), nil())),
   if(true(), x, l) -> l,
  if(false(), x, l) -> conviter(half(x), cons(lastbit(x), l))
 }
 DUP: We consider a duplicating system.
  Trs:
   {
            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(),
       conviter(x, l) -> if(zero(x), x, l),
              conv(x) -> conviter(x, cons(0(), nil())),
     if(true(), x, l) -> l,
    if(false(), x, l) -> conviter(half(x), cons(lastbit(x), l))
   }
  Fail