YES
We show the termination of the TRS R:

  le(|0|(),y) -> true()
  le(s(x),|0|()) -> false()
  le(s(x),s(y)) -> le(x,y)
  minus(x,|0|()) -> x
  minus(s(x),s(y)) -> minus(x,y)
  mod(|0|(),y) -> |0|()
  mod(s(x),|0|()) -> |0|()
  mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y))
  if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y))
  if_mod(false(),s(x),s(y)) -> s(x)


-- SCC decomposition.

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

p1: le#(s(x),s(y)) -> le#(x,y)
p2: minus#(s(x),s(y)) -> minus#(x,y)
p3: mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y))
p4: mod#(s(x),s(y)) -> le#(y,x)
p5: if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y))
p6: if_mod#(true(),s(x),s(y)) -> minus#(x,y)

and R consists of:

r1: le(|0|(),y) -> true()
r2: le(s(x),|0|()) -> false()
r3: le(s(x),s(y)) -> le(x,y)
r4: minus(x,|0|()) -> x
r5: minus(s(x),s(y)) -> minus(x,y)
r6: mod(|0|(),y) -> |0|()
r7: mod(s(x),|0|()) -> |0|()
r8: mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y))
r9: if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y))
r10: if_mod(false(),s(x),s(y)) -> s(x)

The estimated dependency graph contains the following SCCs:

  {p3, p5}
  {p1}
  {p2}


-- Reduction pair.

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

p1: if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y))
p2: mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y))

and R consists of:

r1: le(|0|(),y) -> true()
r2: le(s(x),|0|()) -> false()
r3: le(s(x),s(y)) -> le(x,y)
r4: minus(x,|0|()) -> x
r5: minus(s(x),s(y)) -> minus(x,y)
r6: mod(|0|(),y) -> |0|()
r7: mod(s(x),|0|()) -> |0|()
r8: mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y))
r9: if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y))
r10: if_mod(false(),s(x),s(y)) -> s(x)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r7

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        if_mod#_A(x1,x2,x3) = max{5, x2, x3 - 1}
        true_A = 4
        s_A(x1) = x1
        mod#_A(x1,x2) = max{5, x1, x2 - 1}
        minus_A(x1,x2) = x1
        le_A(x1,x2) = max{3, x1 + 1, x2 + 1}
        |0|_A = 5
        false_A = 0
        mod_A(x1,x2) = max{x1 - 6, x2}
  
    base order 2:
  
      precedence:
      
        if_mod# = mod# > s = mod > minus = le = |0| > true = false
      
  
    partial status:
  
      pi(if_mod#) = [2]
      pi(true) = []
      pi(s) = [1]
      pi(mod#) = [1]
      pi(minus) = [1]
      pi(le) = [1, 2]
      pi(|0|) = []
      pi(false) = []
      pi(mod) = [2]

The following rules are removed:

  p1



-- SCC decomposition.

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

p1: mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y))

and R consists of:

r1: le(|0|(),y) -> true()
r2: le(s(x),|0|()) -> false()
r3: le(s(x),s(y)) -> le(x,y)
r4: minus(x,|0|()) -> x
r5: minus(s(x),s(y)) -> minus(x,y)
r6: mod(|0|(),y) -> |0|()
r7: mod(s(x),|0|()) -> |0|()
r8: mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y))
r9: if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y))
r10: if_mod(false(),s(x),s(y)) -> s(x)

The estimated dependency graph contains the following SCCs:

  (no SCCs)

-- Reduction pair.

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

p1: le#(s(x),s(y)) -> le#(x,y)

and R consists of:

r1: le(|0|(),y) -> true()
r2: le(s(x),|0|()) -> false()
r3: le(s(x),s(y)) -> le(x,y)
r4: minus(x,|0|()) -> x
r5: minus(s(x),s(y)) -> minus(x,y)
r6: mod(|0|(),y) -> |0|()
r7: mod(s(x),|0|()) -> |0|()
r8: mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y))
r9: if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y))
r10: if_mod(false(),s(x),s(y)) -> s(x)

The set of usable rules consists of

  r1, r2, r6, r7

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        le#_A(x1,x2) = max{10, x2}
        s_A(x1) = x1 + 10
        le_A(x1,x2) = max{5, x1 - 16, x2 - 18}
        |0|_A = 5
        true_A = 1
        false_A = 4
        mod_A(x1,x2) = max{6, x1 - 27, x2 - 25}
  
    base order 2:
  
      precedence:
      
        mod > le > s > le# = |0| > true = false
      
  
    partial status:
  
      pi(le#) = [2]
      pi(s) = [1]
      pi(le) = []
      pi(|0|) = []
      pi(true) = []
      pi(false) = []
      pi(mod) = []

The following rules are removed:

  p1

Then no dependency pair remains.

-- Reduction pair.

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

p1: minus#(s(x),s(y)) -> minus#(x,y)

and R consists of:

r1: le(|0|(),y) -> true()
r2: le(s(x),|0|()) -> false()
r3: le(s(x),s(y)) -> le(x,y)
r4: minus(x,|0|()) -> x
r5: minus(s(x),s(y)) -> minus(x,y)
r6: mod(|0|(),y) -> |0|()
r7: mod(s(x),|0|()) -> |0|()
r8: mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y))
r9: if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y))
r10: if_mod(false(),s(x),s(y)) -> s(x)

The set of usable rules consists of

  r1, r2, r6, r7

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        minus#_A(x1,x2) = max{5, x2}
        s_A(x1) = x1 + 5
        le_A(x1,x2) = max{24, x1 - 19, x2 - 6}
        |0|_A = 4
        true_A = 3
        false_A = 3
        mod_A(x1,x2) = max{25, x1 - 7, x2 - 23}
  
    base order 2:
  
      precedence:
      
        mod > le > s > minus# = |0| > true = false
      
  
    partial status:
  
      pi(minus#) = [2]
      pi(s) = [1]
      pi(le) = []
      pi(|0|) = []
      pi(true) = []
      pi(false) = []
      pi(mod) = []

The following rules are removed:

  p1

Then no dependency pair remains.