YES
We show the termination of the TRS R:

  empty(nil()) -> true()
  empty(cons(x,y)) -> false()
  tail(nil()) -> nil()
  tail(cons(x,y)) -> y
  head(cons(x,y)) -> x
  zero(|0|()) -> true()
  zero(s(x)) -> false()
  p(|0|()) -> |0|()
  p(s(|0|())) -> |0|()
  p(s(s(x))) -> s(p(s(x)))
  intlist(x) -> if_intlist(empty(x),x)
  if_intlist(true(),x) -> nil()
  if_intlist(false(),x) -> cons(s(head(x)),intlist(tail(x)))
  int(x,y) -> if_int(zero(x),zero(y),x,y)
  if_int(true(),b,x,y) -> if1(b,x,y)
  if_int(false(),b,x,y) -> if2(b,x,y)
  if1(true(),x,y) -> cons(|0|(),nil())
  if1(false(),x,y) -> cons(|0|(),int(s(|0|()),y))
  if2(true(),x,y) -> nil()
  if2(false(),x,y) -> intlist(int(p(x),p(y)))


-- SCC decomposition.

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

p1: p#(s(s(x))) -> p#(s(x))
p2: intlist#(x) -> if_intlist#(empty(x),x)
p3: intlist#(x) -> empty#(x)
p4: if_intlist#(false(),x) -> head#(x)
p5: if_intlist#(false(),x) -> intlist#(tail(x))
p6: if_intlist#(false(),x) -> tail#(x)
p7: int#(x,y) -> if_int#(zero(x),zero(y),x,y)
p8: int#(x,y) -> zero#(x)
p9: int#(x,y) -> zero#(y)
p10: if_int#(true(),b,x,y) -> if1#(b,x,y)
p11: if_int#(false(),b,x,y) -> if2#(b,x,y)
p12: if1#(false(),x,y) -> int#(s(|0|()),y)
p13: if2#(false(),x,y) -> intlist#(int(p(x),p(y)))
p14: if2#(false(),x,y) -> int#(p(x),p(y))
p15: if2#(false(),x,y) -> p#(x)
p16: if2#(false(),x,y) -> p#(y)

and R consists of:

r1: empty(nil()) -> true()
r2: empty(cons(x,y)) -> false()
r3: tail(nil()) -> nil()
r4: tail(cons(x,y)) -> y
r5: head(cons(x,y)) -> x
r6: zero(|0|()) -> true()
r7: zero(s(x)) -> false()
r8: p(|0|()) -> |0|()
r9: p(s(|0|())) -> |0|()
r10: p(s(s(x))) -> s(p(s(x)))
r11: intlist(x) -> if_intlist(empty(x),x)
r12: if_intlist(true(),x) -> nil()
r13: if_intlist(false(),x) -> cons(s(head(x)),intlist(tail(x)))
r14: int(x,y) -> if_int(zero(x),zero(y),x,y)
r15: if_int(true(),b,x,y) -> if1(b,x,y)
r16: if_int(false(),b,x,y) -> if2(b,x,y)
r17: if1(true(),x,y) -> cons(|0|(),nil())
r18: if1(false(),x,y) -> cons(|0|(),int(s(|0|()),y))
r19: if2(true(),x,y) -> nil()
r20: if2(false(),x,y) -> intlist(int(p(x),p(y)))

The estimated dependency graph contains the following SCCs:

  {p7, p10, p11, p12, p14}
  {p1}
  {p2, p5}


-- Reduction pair.

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

p1: if_int#(false(),b,x,y) -> if2#(b,x,y)
p2: if2#(false(),x,y) -> int#(p(x),p(y))
p3: int#(x,y) -> if_int#(zero(x),zero(y),x,y)
p4: if_int#(true(),b,x,y) -> if1#(b,x,y)
p5: if1#(false(),x,y) -> int#(s(|0|()),y)

and R consists of:

r1: empty(nil()) -> true()
r2: empty(cons(x,y)) -> false()
r3: tail(nil()) -> nil()
r4: tail(cons(x,y)) -> y
r5: head(cons(x,y)) -> x
r6: zero(|0|()) -> true()
r7: zero(s(x)) -> false()
r8: p(|0|()) -> |0|()
r9: p(s(|0|())) -> |0|()
r10: p(s(s(x))) -> s(p(s(x)))
r11: intlist(x) -> if_intlist(empty(x),x)
r12: if_intlist(true(),x) -> nil()
r13: if_intlist(false(),x) -> cons(s(head(x)),intlist(tail(x)))
r14: int(x,y) -> if_int(zero(x),zero(y),x,y)
r15: if_int(true(),b,x,y) -> if1(b,x,y)
r16: if_int(false(),b,x,y) -> if2(b,x,y)
r17: if1(true(),x,y) -> cons(|0|(),nil())
r18: if1(false(),x,y) -> cons(|0|(),int(s(|0|()),y))
r19: if2(true(),x,y) -> nil()
r20: if2(false(),x,y) -> intlist(int(p(x),p(y)))

The set of usable rules consists of

  r6, r7, r8, r9, r10

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!):
        
          max/plus interpretation on natural numbers:
          
            if_int#_A(x1,x2,x3,x4) = max{0, x1 - 68, x2 - 35, x3 - 311, x4 - 35}
            false_A = 45
            if2#_A(x1,x2,x3) = max{0, x1 - 353, x2 - 311, x3 - 308}
            int#_A(x1,x2) = max{0, x1 - 311, x2 - 35}
            p_A(x1) = max{4, x1 - 302}
            zero_A(x1) = max{34, x1 - 243}
            true_A = 34
            if1#_A(x1,x2,x3) = max{0, x1 - 70, x2 - 311, x3 - 35}
            s_A(x1) = x1 + 306
            |0|_A = 4
            if_int#!_A(x1,x2,x3,x4) = max{x2 + 4, x4 + 39}
            false!_A = 14
            if2#!_A(x1,x2,x3) = max{3, x1 - 1, x3 - 4}
            int#!_A(x1,x2) = x2 + 39
            p!_A(x1) = max{283, x1 - 3}
            zero!_A(x1) = 39
            true!_A = 39
            if1#!_A(x1,x2,x3) = max{x1 - 46, x3 + 39}
            s!_A(x1) = x1 + 34
            |0|!_A = 283
        
        2. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          matrix interpretation with standard point-wise order:
          
            carrier: N^1
            order: standard order
            interpretations:
              if_int#_A(x1,x2,x3,x4) = 0
              false_A() = 6
              if2#_A(x1,x2,x3) = 0
              int#_A(x1,x2) = 0
              p_A(x1) = 8
              zero_A(x1) = x1 + 1
              true_A() = 9
              if1#_A(x1,x2,x3) = 0
              s_A(x1) = 5
              |0|_A() = 8
              if_int#!_A(x1,x2,x3,x4) = x1 + 3
              false!_A() = 4
              if2#!_A(x1,x2,x3) = 7
              int#!_A(x1,x2) = x1 + 5
              p!_A(x1) = 6
              zero!_A(x1) = 5
              true!_A() = 1
              if1#!_A(x1,x2,x3) = 11
              s!_A(x1) = x1 + 2
              |0|!_A() = 5
        
  
    partial status:
  
      pi(if_int#) = []
      pi(false) = []
      pi(if2#) = []
      pi(int#) = []
      pi(p) = []
      pi(zero) = []
      pi(true) = []
      pi(if1#) = []
      pi(s) = []
      pi(|0|) = []

The following rules are removed:

  p1, p2, p3, p4, p5

Then no dependency pair remains.

-- Reduction pair.

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

p1: p#(s(s(x))) -> p#(s(x))

and R consists of:

r1: empty(nil()) -> true()
r2: empty(cons(x,y)) -> false()
r3: tail(nil()) -> nil()
r4: tail(cons(x,y)) -> y
r5: head(cons(x,y)) -> x
r6: zero(|0|()) -> true()
r7: zero(s(x)) -> false()
r8: p(|0|()) -> |0|()
r9: p(s(|0|())) -> |0|()
r10: p(s(s(x))) -> s(p(s(x)))
r11: intlist(x) -> if_intlist(empty(x),x)
r12: if_intlist(true(),x) -> nil()
r13: if_intlist(false(),x) -> cons(s(head(x)),intlist(tail(x)))
r14: int(x,y) -> if_int(zero(x),zero(y),x,y)
r15: if_int(true(),b,x,y) -> if1(b,x,y)
r16: if_int(false(),b,x,y) -> if2(b,x,y)
r17: if1(true(),x,y) -> cons(|0|(),nil())
r18: if1(false(),x,y) -> cons(|0|(),int(s(|0|()),y))
r19: if2(true(),x,y) -> nil()
r20: if2(false(),x,y) -> intlist(int(p(x),p(y)))

The set of usable rules consists of

  r8

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!):
        
          max/plus interpretation on natural numbers:
          
            p#_A(x1) = x1
            s_A(x1) = x1 + 6
            p_A(x1) = 22
            |0|_A = 13
            p#!_A(x1) = x1 + 24
            s!_A(x1) = x1 + 36
            p!_A(x1) = 36
            |0|!_A = 8
        
        2. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          matrix interpretation with standard point-wise order:
          
            carrier: N^1
            order: standard order
            interpretations:
              p#_A(x1) = x1
              s_A(x1) = 5
              p_A(x1) = x1 + 1
              |0|_A() = 7
              p#!_A(x1) = 0
              s!_A(x1) = x1 + 2
              p!_A(x1) = 2
              |0|!_A() = 1
        
  
    partial status:
  
      pi(p#) = []
      pi(s) = []
      pi(p) = []
      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: intlist#(x) -> if_intlist#(empty(x),x)
p2: if_intlist#(false(),x) -> intlist#(tail(x))

and R consists of:

r1: empty(nil()) -> true()
r2: empty(cons(x,y)) -> false()
r3: tail(nil()) -> nil()
r4: tail(cons(x,y)) -> y
r5: head(cons(x,y)) -> x
r6: zero(|0|()) -> true()
r7: zero(s(x)) -> false()
r8: p(|0|()) -> |0|()
r9: p(s(|0|())) -> |0|()
r10: p(s(s(x))) -> s(p(s(x)))
r11: intlist(x) -> if_intlist(empty(x),x)
r12: if_intlist(true(),x) -> nil()
r13: if_intlist(false(),x) -> cons(s(head(x)),intlist(tail(x)))
r14: int(x,y) -> if_int(zero(x),zero(y),x,y)
r15: if_int(true(),b,x,y) -> if1(b,x,y)
r16: if_int(false(),b,x,y) -> if2(b,x,y)
r17: if1(true(),x,y) -> cons(|0|(),nil())
r18: if1(false(),x,y) -> cons(|0|(),int(s(|0|()),y))
r19: if2(true(),x,y) -> nil()
r20: if2(false(),x,y) -> intlist(int(p(x),p(y)))

The set of usable rules consists of

  r1, r2, r3, r4, r12

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!):
        
          max/plus interpretation on natural numbers:
          
            intlist#_A(x1) = max{9, x1 + 1}
            if_intlist#_A(x1,x2) = max{9, x1 - 16, x2 - 1}
            empty_A(x1) = max{1, x1 - 67}
            false_A = 15
            tail_A(x1) = max{8, x1 - 40}
            nil_A = 8
            true_A = 1
            cons_A(x1,x2) = max{171, x1 + 68, x2 + 66}
            if_intlist_A(x1,x2) = max{115, x1 - 39, x2 - 24}
            intlist#!_A(x1) = max{3, x1 - 9}
            if_intlist#!_A(x1,x2) = max{1, x1 - 11, x2 - 10}
            empty!_A(x1) = max{2, x1 - 10}
            false!_A = 92
            tail!_A(x1) = max{235, x1 - 11}
            nil!_A = 236
            true!_A = 1
            cons!_A(x1,x2) = x1 + 92
            if_intlist!_A(x1,x2) = x1 + 236
        
        2. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          matrix interpretation with standard point-wise order:
          
            carrier: N^1
            order: standard order
            interpretations:
              intlist#_A(x1) = 0
              if_intlist#_A(x1,x2) = 0
              empty_A(x1) = x1 + 1
              false_A() = 2
              tail_A(x1) = x1 + 1
              nil_A() = 4
              true_A() = 2
              cons_A(x1,x2) = x2 + 3
              if_intlist_A(x1,x2) = 5
              intlist#!_A(x1) = x1 + 8
              if_intlist#!_A(x1,x2) = 0
              empty!_A(x1) = 7
              false!_A() = 2
              tail!_A(x1) = 3
              nil!_A() = 4
              true!_A() = 8
              cons!_A(x1,x2) = 1
              if_intlist!_A(x1,x2) = 5
        
  
    partial status:
  
      pi(intlist#) = []
      pi(if_intlist#) = []
      pi(empty) = []
      pi(false) = []
      pi(tail) = [1]
      pi(nil) = []
      pi(true) = []
      pi(cons) = [1, 2]
      pi(if_intlist) = []

The following rules are removed:

  p1, p2

Then no dependency pair remains.