YES
TRS:
 {                   minus(x, 0()) -> x,
             minus(minus(x, y), z) -> minus(x, plus(y, z)),
                 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))),
                      plus(0(), y) -> y,
                     plus(s(x), y) -> s(plus(x, y)),
                     app(l, nil()) -> l,
                     app(nil(), k) -> k,
                app(cons(x, l), k) -> cons(x, app(l, k)),
  sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
               sum(cons(x, nil())) -> cons(x, nil()),
          sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
 DP:
  Strict:
   {           minus#(minus(x, y), z) -> minus#(x, plus(y, z)),
               minus#(minus(x, y), z) -> plus#(y, z),
                   minus#(s(x), s(y)) -> minus#(x, y),
                    quot#(s(x), s(y)) -> minus#(x, y),
                    quot#(s(x), s(y)) -> quot#(minus(x, y), s(y)),
                       plus#(s(x), y) -> plus#(x, y),
                  app#(cons(x, l), k) -> app#(l, k),
    sum#(app(l, cons(x, cons(y, k)))) -> app#(l, sum(cons(x, cons(y, k)))),
    sum#(app(l, cons(x, cons(y, k)))) -> sum#(app(l, sum(cons(x, cons(y, k))))),
    sum#(app(l, cons(x, cons(y, k)))) -> sum#(cons(x, cons(y, k))),
            sum#(cons(x, cons(y, l))) -> plus#(x, y),
            sum#(cons(x, cons(y, l))) -> sum#(cons(plus(x, y), l))}
  Weak:
  {                   minus(x, 0()) -> x,
              minus(minus(x, y), z) -> minus(x, plus(y, z)),
                  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))),
                       plus(0(), y) -> y,
                      plus(s(x), y) -> s(plus(x, y)),
                      app(l, nil()) -> l,
                      app(nil(), k) -> k,
                 app(cons(x, l), k) -> cons(x, app(l, k)),
   sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
                sum(cons(x, nil())) -> cons(x, nil()),
           sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
  EDG:
   {(sum#(app(l, cons(x, cons(y, k)))) -> sum#(cons(x, cons(y, k))), sum#(cons(x, cons(y, l))) -> sum#(cons(plus(x, y), l)))
    (sum#(app(l, cons(x, cons(y, k)))) -> sum#(cons(x, cons(y, k))), sum#(cons(x, cons(y, l))) -> plus#(x, y))
    (sum#(app(l, cons(x, cons(y, k)))) -> app#(l, sum(cons(x, cons(y, k)))), app#(cons(x, l), k) -> app#(l, k))
    (app#(cons(x, l), k) -> app#(l, k), app#(cons(x, l), k) -> app#(l, k))
    (minus#(s(x), s(y)) -> minus#(x, y), minus#(s(x), s(y)) -> minus#(x, y))
    (minus#(s(x), s(y)) -> minus#(x, y), minus#(minus(x, y), z) -> plus#(y, z))
    (minus#(s(x), s(y)) -> minus#(x, y), minus#(minus(x, y), z) -> minus#(x, plus(y, z)))
    (plus#(s(x), y) -> plus#(x, y), plus#(s(x), y) -> plus#(x, y))
    (sum#(app(l, cons(x, cons(y, k)))) -> sum#(app(l, sum(cons(x, cons(y, k))))), sum#(cons(x, cons(y, l))) -> sum#(cons(plus(x, y), l)))
    (sum#(app(l, cons(x, cons(y, k)))) -> sum#(app(l, sum(cons(x, cons(y, k))))), sum#(cons(x, cons(y, l))) -> plus#(x, y))
    (sum#(app(l, cons(x, cons(y, k)))) -> sum#(app(l, sum(cons(x, cons(y, k))))), sum#(app(l, cons(x, cons(y, k)))) -> sum#(cons(x, cons(y, k))))
    (sum#(app(l, cons(x, cons(y, k)))) -> sum#(app(l, sum(cons(x, cons(y, k))))), sum#(app(l, cons(x, cons(y, k)))) -> sum#(app(l, sum(cons(x, cons(y, k))))))
    (sum#(app(l, cons(x, cons(y, k)))) -> sum#(app(l, sum(cons(x, cons(y, k))))), sum#(app(l, cons(x, cons(y, k)))) -> app#(l, sum(cons(x, cons(y, k)))))
    (sum#(cons(x, cons(y, l))) -> plus#(x, y), plus#(s(x), y) -> plus#(x, y))
    (quot#(s(x), s(y)) -> minus#(x, y), minus#(minus(x, y), z) -> minus#(x, plus(y, z)))
    (quot#(s(x), s(y)) -> minus#(x, y), minus#(minus(x, y), z) -> plus#(y, z))
    (quot#(s(x), s(y)) -> minus#(x, y), minus#(s(x), s(y)) -> minus#(x, y))
    (minus#(minus(x, y), z) -> plus#(y, z), plus#(s(x), y) -> plus#(x, y))
    (minus#(minus(x, y), z) -> minus#(x, plus(y, z)), minus#(minus(x, y), z) -> minus#(x, plus(y, z)))
    (minus#(minus(x, y), z) -> minus#(x, plus(y, z)), minus#(minus(x, y), z) -> plus#(y, z))
    (minus#(minus(x, y), z) -> minus#(x, plus(y, z)), minus#(s(x), s(y)) -> minus#(x, y))
    (sum#(cons(x, cons(y, l))) -> sum#(cons(plus(x, y), l)), sum#(cons(x, cons(y, l))) -> plus#(x, y))
    (sum#(cons(x, cons(y, l))) -> sum#(cons(plus(x, y), l)), sum#(cons(x, cons(y, l))) -> sum#(cons(plus(x, y), l)))
    (quot#(s(x), s(y)) -> quot#(minus(x, y), s(y)), quot#(s(x), s(y)) -> minus#(x, y))
    (quot#(s(x), s(y)) -> quot#(minus(x, y), s(y)), quot#(s(x), s(y)) -> quot#(minus(x, y), s(y)))}
   SCCS:
    Scc:
     {sum#(cons(x, cons(y, l))) -> sum#(cons(plus(x, y), l))}
    Scc:
     {sum#(app(l, cons(x, cons(y, k)))) -> sum#(app(l, sum(cons(x, cons(y, k)))))}
    Scc:
     {app#(cons(x, l), k) -> app#(l, k)}
    Scc:
     {plus#(s(x), y) -> plus#(x, y)}
    Scc:
     {quot#(s(x), s(y)) -> quot#(minus(x, y), s(y))}
    Scc:
     {minus#(minus(x, y), z) -> minus#(x, plus(y, z)),
          minus#(s(x), s(y)) -> minus#(x, y)}
    SCC:
     Strict:
      {sum#(cons(x, cons(y, l))) -> sum#(cons(plus(x, y), l))}
     Weak:
     {                   minus(x, 0()) -> x,
                 minus(minus(x, y), z) -> minus(x, plus(y, z)),
                     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))),
                          plus(0(), y) -> y,
                         plus(s(x), y) -> s(plus(x, y)),
                         app(l, nil()) -> l,
                         app(nil(), k) -> k,
                    app(cons(x, l), k) -> cons(x, app(l, k)),
      sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
                   sum(cons(x, nil())) -> cons(x, nil()),
              sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
     POLY:
      Argument Filtering:
       pi(sum#) = [0], pi(sum) = [], pi(cons) = [1], pi(nil) = [], pi(app) = [], pi(plus) = [], pi(quot) = [], pi(s) = [], pi(0) = [], pi(minus) = []
      Usable Rules:
       {}
      Interpretation:
       [sum#](x0) = x0 + 1,
       [cons](x0) = x0 + 1
      Strict:
       {}
      Weak:
       {                   minus(x, 0()) -> x,
                   minus(minus(x, y), z) -> minus(x, plus(y, z)),
                       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))),
                            plus(0(), y) -> y,
                           plus(s(x), y) -> s(plus(x, y)),
                           app(l, nil()) -> l,
                           app(nil(), k) -> k,
                      app(cons(x, l), k) -> cons(x, app(l, k)),
        sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
                     sum(cons(x, nil())) -> cons(x, nil()),
                sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
      Qed
    SCC:
     Strict:
      {sum#(app(l, cons(x, cons(y, k)))) -> sum#(app(l, sum(cons(x, cons(y, k)))))}
     Weak:
     {                   minus(x, 0()) -> x,
                 minus(minus(x, y), z) -> minus(x, plus(y, z)),
                     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))),
                          plus(0(), y) -> y,
                         plus(s(x), y) -> s(plus(x, y)),
                         app(l, nil()) -> l,
                         app(nil(), k) -> k,
                    app(cons(x, l), k) -> cons(x, app(l, k)),
      sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
                   sum(cons(x, nil())) -> cons(x, nil()),
              sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
     POLY:
      Argument Filtering:
       pi(sum#) = 0, pi(sum) = [], pi(cons) = [1], pi(nil) = [], pi(app) = [0,1], pi(plus) = [], pi(quot) = [], pi(s) = [], pi(0) = [], pi(minus) = []
      Usable Rules:
       {}
      Interpretation:
       [cons](x0) = x0 + 1,
       [app](x0, x1) = x0 + x1 + 1,
       [sum] = 1
      Strict:
       {}
      Weak:
       {                   minus(x, 0()) -> x,
                   minus(minus(x, y), z) -> minus(x, plus(y, z)),
                       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))),
                            plus(0(), y) -> y,
                           plus(s(x), y) -> s(plus(x, y)),
                           app(l, nil()) -> l,
                           app(nil(), k) -> k,
                      app(cons(x, l), k) -> cons(x, app(l, k)),
        sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
                     sum(cons(x, nil())) -> cons(x, nil()),
                sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
      Qed
    SCC:
     Strict:
      {app#(cons(x, l), k) -> app#(l, k)}
     Weak:
     {                   minus(x, 0()) -> x,
                 minus(minus(x, y), z) -> minus(x, plus(y, z)),
                     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))),
                          plus(0(), y) -> y,
                         plus(s(x), y) -> s(plus(x, y)),
                         app(l, nil()) -> l,
                         app(nil(), k) -> k,
                    app(cons(x, l), k) -> cons(x, app(l, k)),
      sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
                   sum(cons(x, nil())) -> cons(x, nil()),
              sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
     SPSC:
      Simple Projection:
       pi(app#) = 0
      Strict:
       {}
      Qed
    SCC:
     Strict:
      {plus#(s(x), y) -> plus#(x, y)}
     Weak:
     {                   minus(x, 0()) -> x,
                 minus(minus(x, y), z) -> minus(x, plus(y, z)),
                     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))),
                          plus(0(), y) -> y,
                         plus(s(x), y) -> s(plus(x, y)),
                         app(l, nil()) -> l,
                         app(nil(), k) -> k,
                    app(cons(x, l), k) -> cons(x, app(l, k)),
      sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
                   sum(cons(x, nil())) -> cons(x, nil()),
              sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
     SPSC:
      Simple Projection:
       pi(plus#) = 0
      Strict:
       {}
      Qed
    SCC:
     Strict:
      {quot#(s(x), s(y)) -> quot#(minus(x, y), s(y))}
     Weak:
     {                   minus(x, 0()) -> x,
                 minus(minus(x, y), z) -> minus(x, plus(y, z)),
                     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))),
                          plus(0(), y) -> y,
                         plus(s(x), y) -> s(plus(x, y)),
                         app(l, nil()) -> l,
                         app(nil(), k) -> k,
                    app(cons(x, l), k) -> cons(x, app(l, k)),
      sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
                   sum(cons(x, nil())) -> cons(x, nil()),
              sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
     POLY:
      Argument Filtering:
       pi(sum) = [], pi(cons) = [], pi(nil) = [], pi(app) = [], pi(plus) = [], pi(quot#) = 0, pi(quot) = [], pi(s) = [0], pi(0) = [], pi(minus) = 0
      Usable Rules:
       {}
      Interpretation:
       [s](x0) = x0 + 1
      Strict:
       {}
      Weak:
       {                   minus(x, 0()) -> x,
                   minus(minus(x, y), z) -> minus(x, plus(y, z)),
                       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))),
                            plus(0(), y) -> y,
                           plus(s(x), y) -> s(plus(x, y)),
                           app(l, nil()) -> l,
                           app(nil(), k) -> k,
                      app(cons(x, l), k) -> cons(x, app(l, k)),
        sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
                     sum(cons(x, nil())) -> cons(x, nil()),
                sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
      Qed
    SCC:
     Strict:
      {minus#(minus(x, y), z) -> minus#(x, plus(y, z)),
           minus#(s(x), s(y)) -> minus#(x, y)}
     Weak:
     {                   minus(x, 0()) -> x,
                 minus(minus(x, y), z) -> minus(x, plus(y, z)),
                     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))),
                          plus(0(), y) -> y,
                         plus(s(x), y) -> s(plus(x, y)),
                         app(l, nil()) -> l,
                         app(nil(), k) -> k,
                    app(cons(x, l), k) -> cons(x, app(l, k)),
      sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
                   sum(cons(x, nil())) -> cons(x, nil()),
              sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
     SPSC:
      Simple Projection:
       pi(minus#) = 0
      Strict:
       {minus#(s(x), s(y)) -> minus#(x, y)}
      EDG:
       {(minus#(s(x), s(y)) -> minus#(x, y), minus#(s(x), s(y)) -> minus#(x, y))}
       SCCS:
        Scc:
         {minus#(s(x), s(y)) -> minus#(x, y)}
        SCC:
         Strict:
          {minus#(s(x), s(y)) -> minus#(x, y)}
         Weak:
         {                   minus(x, 0()) -> x,
                     minus(minus(x, y), z) -> minus(x, plus(y, z)),
                         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))),
                              plus(0(), y) -> y,
                             plus(s(x), y) -> s(plus(x, y)),
                             app(l, nil()) -> l,
                             app(nil(), k) -> k,
                        app(cons(x, l), k) -> cons(x, app(l, k)),
          sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))),
                       sum(cons(x, nil())) -> cons(x, nil()),
                  sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))}
         SPSC:
          Simple Projection:
           pi(minus#) = 0
          Strict:
           {}
          Qed