YES
We show the termination of the TRS R:

  not(true()) -> false()
  not(false()) -> true()
  evenodd(x,|0|()) -> not(evenodd(x,s(|0|())))
  evenodd(|0|(),s(|0|())) -> false()
  evenodd(s(x),s(|0|())) -> evenodd(x,|0|())


-- SCC decomposition.

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

p1: evenodd#(x,|0|()) -> not#(evenodd(x,s(|0|())))
p2: evenodd#(x,|0|()) -> evenodd#(x,s(|0|()))
p3: evenodd#(s(x),s(|0|())) -> evenodd#(x,|0|())

and R consists of:

r1: not(true()) -> false()
r2: not(false()) -> true()
r3: evenodd(x,|0|()) -> not(evenodd(x,s(|0|())))
r4: evenodd(|0|(),s(|0|())) -> false()
r5: evenodd(s(x),s(|0|())) -> evenodd(x,|0|())

The estimated dependency graph contains the following SCCs:

  {p2, p3}


-- Reduction pair.

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

p1: evenodd#(x,|0|()) -> evenodd#(x,s(|0|()))
p2: evenodd#(s(x),s(|0|())) -> evenodd#(x,|0|())

and R consists of:

r1: not(true()) -> false()
r2: not(false()) -> true()
r3: evenodd(x,|0|()) -> not(evenodd(x,s(|0|())))
r4: evenodd(|0|(),s(|0|())) -> false()
r5: evenodd(s(x),s(|0|())) -> evenodd(x,|0|())

The set of usable rules consists of

  r1, r2, r4

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      matrix interpretation with standard point-wise order:
      
        carrier: N^1
        order: standard order
        interpretations:
          evenodd#_A(x1,x2) = x1 + 4
          |0|_A() = 3
          s_A(x1) = x1 + 5
          not_A(x1) = x1 + 2
          true_A() = 1
          false_A() = 2
          evenodd_A(x1,x2) = x1 + 4
  
    base order 2:
  
      precedence:
      
        evenodd# = not > s = evenodd > |0| > false > true
      
  
    partial status:
  
      pi(evenodd#) = [1]
      pi(|0|) = []
      pi(s) = [1]
      pi(not) = [1]
      pi(true) = []
      pi(false) = []
      pi(evenodd) = [1]

The following rules are removed:

  p2



-- SCC decomposition.

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

p1: evenodd#(x,|0|()) -> evenodd#(x,s(|0|()))

and R consists of:

r1: not(true()) -> false()
r2: not(false()) -> true()
r3: evenodd(x,|0|()) -> not(evenodd(x,s(|0|())))
r4: evenodd(|0|(),s(|0|())) -> false()
r5: evenodd(s(x),s(|0|())) -> evenodd(x,|0|())

The estimated dependency graph contains the following SCCs:

  (no SCCs)