Problem:
 zeros() -> cons(0(),n__zeros())
 tail(cons(X,XS)) -> activate(XS)
 zeros() -> n__zeros()
 activate(n__zeros()) -> zeros()
 activate(X) -> X

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {6,5,4}
   transitions:
    zeros1() -> 5,6
    n__zeros1() -> 4,7
    activate1(2) -> 5*
    activate1(1) -> 5*
    activate1(3) -> 5*
    cons1(8,7) -> 4*
    01() -> 8*
    n__zeros2() -> 5,6,13
    cons2(14,6) -> 5*
    cons2(14,13) -> 6*
    zeros0() -> 4*
    02() -> 14*
    cons0(3,1) -> 1*
    cons0(3,3) -> 1*
    cons0(1,2) -> 1*
    cons0(2,1) -> 1*
    cons0(2,3) -> 1*
    cons0(3,2) -> 1*
    cons0(1,1) -> 1*
    cons0(1,3) -> 1*
    cons0(2,2) -> 1*
    00() -> 2*
    n__zeros0() -> 3*
    tail0(2) -> 5*
    tail0(1) -> 5*
    tail0(3) -> 5*
    activate0(2) -> 6*
    activate0(1) -> 6*
    activate0(3) -> 6*
    1 -> 5,6
    2 -> 5,6
    3 -> 5,6
  problem:
   
  Qed