MAYBE
MAYBE
TRS:
 {
                           from(X) -> cons(X, n__from(n__s(X))),
                           from(X) -> n__from(X),
             sel(0(), cons(X, XS)) -> X,
            sel(s(N), cons(X, XS)) -> sel(N, activate(XS)),
                       activate(X) -> X,
              activate(n__from(X)) -> from(activate(X)),
                 activate(n__s(X)) -> s(activate(X)),
       activate(n__zWquot(X1, X2)) -> zWquot(activate(X1), activate(X2)),
                              s(X) -> n__s(X),
                     minus(X, 0()) -> 0(),
                 minus(s(X), s(Y)) -> minus(X, Y),
                   quot(0(), s(Y)) -> 0(),
                  quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y))),
                 zWquot(XS, nil()) -> nil(),
                    zWquot(X1, X2) -> n__zWquot(X1, X2),
  zWquot(cons(X, XS), cons(Y, YS)) ->
  cons(quot(X, Y), n__zWquot(activate(XS), activate(YS))),
                 zWquot(nil(), XS) -> nil()
 }
 DUP: We consider a duplicating system.
  Trs:
   {
                             from(X) -> cons(X, n__from(n__s(X))),
                             from(X) -> n__from(X),
               sel(0(), cons(X, XS)) -> X,
              sel(s(N), cons(X, XS)) -> sel(N, activate(XS)),
                         activate(X) -> X,
                activate(n__from(X)) -> from(activate(X)),
                   activate(n__s(X)) -> s(activate(X)),
         activate(n__zWquot(X1, X2)) -> zWquot(activate(X1), activate(X2)),
                                s(X) -> n__s(X),
                       minus(X, 0()) -> 0(),
                   minus(s(X), s(Y)) -> minus(X, Y),
                     quot(0(), s(Y)) -> 0(),
                    quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y))),
                   zWquot(XS, nil()) -> nil(),
                      zWquot(X1, X2) -> n__zWquot(X1, X2),
    zWquot(cons(X, XS), cons(Y, YS)) ->
    cons(quot(X, Y), n__zWquot(activate(XS), activate(YS))),
                   zWquot(nil(), XS) -> nil()
   }
  Fail