YES

We show the termination of the TRS R:

  +(|0|(),y) -> y
  +(s(x),y) -> s(+(x,y))
  +(s(x),y) -> +(x,s(y))

-- SCC decomposition.

Consider the dependency pair problem (P, R), where P consists of

p1: +#(s(x),y) -> +#(x,y)
p2: +#(s(x),y) -> +#(x,s(y))

and R consists of:

r1: +(|0|(),y) -> y
r2: +(s(x),y) -> s(+(x,y))
r3: +(s(x),y) -> +(x,s(y))

The estimated dependency graph contains the following SCCs:

  {p1, p2}


-- Reduction pair.

Consider the dependency pair problem (P, R), where P consists of

p1: +#(s(x),y) -> +#(x,y)
p2: +#(s(x),y) -> +#(x,s(y))

and R consists of:

r1: +(|0|(),y) -> y
r2: +(s(x),y) -> s(+(x,y))
r3: +(s(x),y) -> +(x,s(y))

The set of usable rules consists of

  (no rules)

Take the monotone reduction pair:

  matrix interpretations:
  
    carrier: N^4
    order: lexicographic order
    interpretations:
      +#_A(x1,x2) = ((1,0,0,0),(1,1,0,0),(1,1,1,0),(0,1,0,1)) x1 + ((1,0,0,0),(0,1,0,0),(0,0,1,0),(1,1,1,1)) x2
      s_A(x1) = ((1,0,0,0),(0,1,0,0),(1,1,1,0),(1,1,1,1)) x1 + (1,1,1,1)

The next rules are strictly ordered:

  p1, p2
  r1, r2, r3

We remove them from the problem.  Then no dependency pair remains.