MAYBE
MAYBE
TRS:
 {
                   from(X) -> cons(X, n__from(n__s(X))),
                   from(X) -> n__from(X),
            after(0(), XS) -> XS,
  after(s(N), cons(X, XS)) -> after(N, activate(XS)),
               activate(X) -> X,
      activate(n__from(X)) -> from(activate(X)),
         activate(n__s(X)) -> s(activate(X)),
                      s(X) -> n__s(X)
 }
 DUP: We consider a duplicating system.
  Trs:
   {
                     from(X) -> cons(X, n__from(n__s(X))),
                     from(X) -> n__from(X),
              after(0(), XS) -> XS,
    after(s(N), cons(X, XS)) -> after(N, activate(XS)),
                 activate(X) -> X,
        activate(n__from(X)) -> from(activate(X)),
           activate(n__s(X)) -> s(activate(X)),
                        s(X) -> n__s(X)
   }
  Fail