(STRATEGY
    INNERMOST)

(VAR
    N X X1 X2 XS Y YS)
(DATATYPES
    A = µX.< 0, n__incr(X), n__oddNs, s(X), nil, n__take(X, X), pair(X, X), n__zip(X, X), n__cons(X, X), n__repItems(X) >)
(SIGNATURES
    pairNs :: [] -> A
    oddNs :: [] -> A
    incr :: [A] -> A
    take :: [A x A] -> A
    zip :: [A x A] -> A
    tail :: [A] -> A
    repItems :: [A] -> A
    cons :: [A x A] -> A
    activate :: [A] -> A)
(RULES
    pairNs() -> cons(0()
                    ,n__incr(n__oddNs()))
    oddNs() -> incr(pairNs())
    incr(cons(X,XS)) -> cons(s(X)
                            ,n__incr(activate(XS)))
    take(0(),XS) -> nil()
    take(s(N),cons(X,XS)) -> cons(X
                                 ,n__take(N,activate(XS)))
    zip(nil(),XS) -> nil()
    zip(X,nil()) -> nil()
    zip(cons(X,XS),cons(Y,YS)) ->
      cons(pair(X,Y)
          ,n__zip(activate(XS)
                 ,activate(YS)))
    tail(cons(X,XS)) -> activate(XS)
    repItems(nil()) -> nil()
    repItems(cons(X,XS)) -> cons(X
                                ,n__cons(X
                                        ,n__repItems(activate(XS))))
    incr(X) -> n__incr(X)
    oddNs() -> n__oddNs()
    take(X1,X2) -> n__take(X1,X2)
    zip(X1,X2) -> n__zip(X1,X2)
    cons(X1,X2) -> n__cons(X1,X2)
    repItems(X) -> n__repItems(X)
    activate(n__incr(X)) ->
      incr(activate(X))
    activate(n__oddNs()) -> oddNs()
    activate(n__take(X1,X2)) ->
      take(activate(X1),activate(X2))
    activate(n__zip(X1,X2)) ->
      zip(activate(X1),activate(X2))
    activate(n__cons(X1,X2)) ->
      cons(activate(X1),X2)
    activate(n__repItems(X)) ->
      repItems(activate(X))
    activate(X) -> X)