YES
We show the termination of the TRS R:

  minus(x,|0|()) -> x
  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(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
  plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
  plus(zero(),y) -> y
  plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
  id(x) -> x
  if(true(),x,y) -> x
  if(false(),x,y) -> y
  not(x) -> if(x,false(),true())
  gt(s(x),zero()) -> true()
  gt(zero(),y) -> false()
  gt(s(x),s(y)) -> gt(x,y)


-- SCC decomposition.

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

p1: minus#(s(x),s(y)) -> minus#(x,y)
p2: quot#(s(x),s(y)) -> quot#(minus(x,y),s(y))
p3: quot#(s(x),s(y)) -> minus#(x,y)
p4: plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
p5: plus#(s(x),s(y)) -> if#(gt(x,y),x,y)
p6: plus#(s(x),s(y)) -> gt#(x,y)
p7: plus#(s(x),s(y)) -> if#(not(gt(x,y)),id(x),id(y))
p8: plus#(s(x),s(y)) -> not#(gt(x,y))
p9: plus#(s(x),s(y)) -> id#(x)
p10: plus#(s(x),s(y)) -> id#(y)
p11: plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))
p12: plus#(s(x),x) -> if#(gt(x,x),id(x),id(x))
p13: plus#(s(x),x) -> gt#(x,x)
p14: plus#(s(x),x) -> id#(x)
p15: plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
p16: plus#(id(x),s(y)) -> if#(gt(s(y),y),y,s(y))
p17: plus#(id(x),s(y)) -> gt#(s(y),y)
p18: not#(x) -> if#(x,false(),true())
p19: gt#(s(x),s(y)) -> gt#(x,y)

and R consists of:

r1: minus(x,|0|()) -> x
r2: minus(s(x),s(y)) -> minus(x,y)
r3: quot(|0|(),s(y)) -> |0|()
r4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
r5: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
r6: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
r7: plus(zero(),y) -> y
r8: plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
r9: id(x) -> x
r10: if(true(),x,y) -> x
r11: if(false(),x,y) -> y
r12: not(x) -> if(x,false(),true())
r13: gt(s(x),zero()) -> true()
r14: gt(zero(),y) -> false()
r15: gt(s(x),s(y)) -> gt(x,y)

The estimated dependency graph contains the following SCCs:

  {p2}
  {p1}
  {p4, p11, p15}
  {p19}


-- Reduction pair.

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

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

and R consists of:

r1: minus(x,|0|()) -> x
r2: minus(s(x),s(y)) -> minus(x,y)
r3: quot(|0|(),s(y)) -> |0|()
r4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
r5: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
r6: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
r7: plus(zero(),y) -> y
r8: plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
r9: id(x) -> x
r10: if(true(),x,y) -> x
r11: if(false(),x,y) -> y
r12: not(x) -> if(x,false(),true())
r13: gt(s(x),zero()) -> true()
r14: gt(zero(),y) -> false()
r15: gt(s(x),s(y)) -> gt(x,y)

The set of usable rules consists of

  r1, r2

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      trivial reduction triple (T x T, T x T, Φ)
  
    base order 2:
  
      lexicographic combination of reduction triples:
      
        1. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          matrix interpretation with standard point-wise order:
          
            carrier: N^1
            order: standard order
            interpretations:
              quot#_A(x1,x2) = x1
              s_A(x1) = x1 + 2
              minus_A(x1,x2) = x1 + 1
              |0|_A() = 2
              quot#!_A(x1,x2) = 1
              s!_A(x1) = 4
              minus!_A(x1,x2) = x1 + x2
              |0|!_A() = 1
        
        2. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          max/plus interpretation on natural numbers:
          
            quot#_A(x1,x2) = max{0, x2 - 45}
            s_A(x1) = x1 + 44
            minus_A(x1,x2) = x1 + 1
            |0|_A = 49
            quot#!_A(x1,x2) = max{1, x1 - 42}
            s!_A(x1) = x1 + 42
            minus!_A(x1,x2) = max{3, x1 - 1, x2 - 45}
            |0|!_A = 6
        
  
    partial status:
  
      pi(quot#) = []
      pi(s) = [1]
      pi(minus) = [1, 2]
      pi(|0|) = []

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: minus(x,|0|()) -> x
r2: minus(s(x),s(y)) -> minus(x,y)
r3: quot(|0|(),s(y)) -> |0|()
r4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
r5: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
r6: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
r7: plus(zero(),y) -> y
r8: plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
r9: id(x) -> x
r10: if(true(),x,y) -> x
r11: if(false(),x,y) -> y
r12: not(x) -> if(x,false(),true())
r13: gt(s(x),zero()) -> true()
r14: gt(zero(),y) -> false()
r15: gt(s(x),s(y)) -> gt(x,y)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      trivial reduction triple (T x T, T x T, Φ)
  
    base order 2:
  
      lexicographic combination of reduction triples:
      
        1. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          matrix interpretation with standard point-wise order:
          
            carrier: N^1
            order: standard order
            interpretations:
              minus#_A(x1,x2) = x1 + x2
              s_A(x1) = x1 + 1
              minus#!_A(x1,x2) = x1 + x2 + 5
              s!_A(x1) = x1 + 4
        
        2. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          max/plus interpretation on natural numbers:
          
            minus#_A(x1,x2) = 0
            s_A(x1) = max{7, x1 - 11}
            minus#!_A(x1,x2) = max{3, x1 - 8, x2 - 8}
            s!_A(x1) = 2
        
  
    partial status:
  
      pi(minus#) = []
      pi(s) = [1]

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: plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
p2: plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))
p3: plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x))

and R consists of:

r1: minus(x,|0|()) -> x
r2: minus(s(x),s(y)) -> minus(x,y)
r3: quot(|0|(),s(y)) -> |0|()
r4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
r5: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
r6: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
r7: plus(zero(),y) -> y
r8: plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
r9: id(x) -> x
r10: if(true(),x,y) -> x
r11: if(false(),x,y) -> y
r12: not(x) -> if(x,false(),true())
r13: gt(s(x),zero()) -> true()
r14: gt(zero(),y) -> false()
r15: gt(s(x),s(y)) -> gt(x,y)

The set of usable rules consists of

  r9, r10, r11, r12, r13, r14, r15

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      trivial reduction triple (T x T, T x T, Φ)
  
    base order 2:
  
      lexicographic combination of reduction triples:
      
        1. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          matrix interpretation with standard point-wise order:
          
            carrier: N^1
            order: standard order
            interpretations:
              plus#_A(x1,x2) = 0
              s_A(x1) = x1 + 2
              if_A(x1,x2,x3) = x2 + x3 + 1
              gt_A(x1,x2) = x2 + 1
              not_A(x1) = 3
              id_A(x1) = x1 + 1
              true_A() = 1
              false_A() = 1
              zero_A() = 1
              plus#!_A(x1,x2) = 1
              s!_A(x1) = 2
              if!_A(x1,x2,x3) = 4
              gt!_A(x1,x2) = x2 + 4
              not!_A(x1) = 5
              id!_A(x1) = 2
              true!_A() = 0
              false!_A() = 0
              zero!_A() = 1
        
        2. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          max/plus interpretation on natural numbers:
          
            plus#_A(x1,x2) = 0
            s_A(x1) = x1 + 224
            if_A(x1,x2,x3) = max{223, x1 - 461, x2 + 93, x3}
            gt_A(x1,x2) = max{1, x1 - 226, x2 - 226}
            not_A(x1) = x1 + 453
            id_A(x1) = max{75, x1 + 67}
            true_A = 1
            false_A = 1
            zero_A = 225
            plus#!_A(x1,x2) = max{x1 + 163, x2 + 6}
            s!_A(x1) = max{504, x1 + 502}
            if!_A(x1,x2,x3) = max{2, x1 - 223, x2 - 71, x3 - 68}
            gt!_A(x1,x2) = 505
            not!_A(x1) = max{505, x1 + 3}
            id!_A(x1) = max{1, x1 - 689}
            true!_A = 503
            false!_A = 4
            zero!_A = 504
        
  
    partial status:
  
      pi(plus#) = []
      pi(s) = [1]
      pi(if) = [2, 3]
      pi(gt) = [1]
      pi(not) = [1]
      pi(id) = [1]
      pi(true) = []
      pi(false) = []
      pi(zero) = []

The following rules are removed:

  p1, p3



-- SCC decomposition.

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

p1: plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))

and R consists of:

r1: minus(x,|0|()) -> x
r2: minus(s(x),s(y)) -> minus(x,y)
r3: quot(|0|(),s(y)) -> |0|()
r4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
r5: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
r6: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
r7: plus(zero(),y) -> y
r8: plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
r9: id(x) -> x
r10: if(true(),x,y) -> x
r11: if(false(),x,y) -> y
r12: not(x) -> if(x,false(),true())
r13: gt(s(x),zero()) -> true()
r14: gt(zero(),y) -> false()
r15: gt(s(x),s(y)) -> gt(x,y)

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y)))

and R consists of:

r1: minus(x,|0|()) -> x
r2: minus(s(x),s(y)) -> minus(x,y)
r3: quot(|0|(),s(y)) -> |0|()
r4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
r5: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
r6: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
r7: plus(zero(),y) -> y
r8: plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
r9: id(x) -> x
r10: if(true(),x,y) -> x
r11: if(false(),x,y) -> y
r12: not(x) -> if(x,false(),true())
r13: gt(s(x),zero()) -> true()
r14: gt(zero(),y) -> false()
r15: gt(s(x),s(y)) -> gt(x,y)

The set of usable rules consists of

  r13, r14, r15

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      trivial reduction triple (T x T, T x T, Φ)
  
    base order 2:
  
      lexicographic combination of reduction triples:
      
        1. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          matrix interpretation with standard point-wise order:
          
            carrier: N^1
            order: standard order
            interpretations:
              plus#_A(x1,x2) = x1
              id_A(x1) = x1 + 1
              s_A(x1) = 3
              if_A(x1,x2,x3) = x2 + x3 + 1
              gt_A(x1,x2) = 1
              zero_A() = 1
              true_A() = 1
              false_A() = 1
              plus#!_A(x1,x2) = x1
              id!_A(x1) = 4
              s!_A(x1) = x1 + 3
              if!_A(x1,x2,x3) = 2
              gt!_A(x1,x2) = 5
              zero!_A() = 1
              true!_A() = 0
              false!_A() = 0
        
        2. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          max/plus interpretation on natural numbers:
          
            plus#_A(x1,x2) = max{0, x1 - 378}
            id_A(x1) = max{377, x1}
            s_A(x1) = x1 + 66
            if_A(x1,x2,x3) = max{x1 + 10, x3 + 375}
            gt_A(x1,x2) = max{x1 - 13, x2 + 250}
            zero_A = 12
            true_A = 54
            false_A = 250
            plus#!_A(x1,x2) = x1 + 10
            id!_A(x1) = max{13, x1 + 10}
            s!_A(x1) = x1 + 213
            if!_A(x1,x2,x3) = max{388, x1 - 1, x2 - 432, x3 - 55}
            gt!_A(x1,x2) = max{388, x1 - 429}
            zero!_A = 18
            true!_A = 17
            false!_A = 1
        
  
    partial status:
  
      pi(plus#) = []
      pi(id) = []
      pi(s) = [1]
      pi(if) = []
      pi(gt) = [2]
      pi(zero) = []
      pi(true) = []
      pi(false) = []

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: gt#(s(x),s(y)) -> gt#(x,y)

and R consists of:

r1: minus(x,|0|()) -> x
r2: minus(s(x),s(y)) -> minus(x,y)
r3: quot(|0|(),s(y)) -> |0|()
r4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
r5: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
r6: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
r7: plus(zero(),y) -> y
r8: plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
r9: id(x) -> x
r10: if(true(),x,y) -> x
r11: if(false(),x,y) -> y
r12: not(x) -> if(x,false(),true())
r13: gt(s(x),zero()) -> true()
r14: gt(zero(),y) -> false()
r15: gt(s(x),s(y)) -> gt(x,y)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      trivial reduction triple (T x T, T x T, Φ)
  
    base order 2:
  
      lexicographic combination of reduction triples:
      
        1. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          matrix interpretation with standard point-wise order:
          
            carrier: N^1
            order: standard order
            interpretations:
              gt#_A(x1,x2) = x1 + x2
              s_A(x1) = x1 + 1
              gt#!_A(x1,x2) = x1 + x2
              s!_A(x1) = x1 + 4
        
        2. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          max/plus interpretation on natural numbers:
          
            gt#_A(x1,x2) = 0
            s_A(x1) = max{23, x1 - 62}
            gt#!_A(x1,x2) = max{1, x1 - 24, x2 - 24}
            s!_A(x1) = 0
        
  
    partial status:
  
      pi(gt#) = [1]
      pi(s) = [1]

The following rules are removed:

  p1

Then no dependency pair remains.