YES
We show the termination of the TRS R:

  .(|1|(),x) -> x
  .(x,|1|()) -> x
  .(i(x),x) -> |1|()
  .(x,i(x)) -> |1|()
  i(|1|()) -> |1|()
  i(i(x)) -> x
  .(i(y),.(y,z)) -> z
  .(y,.(i(y),z)) -> z
  .(.(x,y),z) -> .(x,.(y,z))
  i(.(x,y)) -> .(i(y),i(x))


-- SCC decomposition.

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

p1: .#(.(x,y),z) -> .#(x,.(y,z))
p2: .#(.(x,y),z) -> .#(y,z)
p3: i#(.(x,y)) -> .#(i(y),i(x))
p4: i#(.(x,y)) -> i#(y)
p5: i#(.(x,y)) -> i#(x)

and R consists of:

r1: .(|1|(),x) -> x
r2: .(x,|1|()) -> x
r3: .(i(x),x) -> |1|()
r4: .(x,i(x)) -> |1|()
r5: i(|1|()) -> |1|()
r6: i(i(x)) -> x
r7: .(i(y),.(y,z)) -> z
r8: .(y,.(i(y),z)) -> z
r9: .(.(x,y),z) -> .(x,.(y,z))
r10: i(.(x,y)) -> .(i(y),i(x))

The estimated dependency graph contains the following SCCs:

  {p4, p5}
  {p1, p2}


-- Reduction pair.

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

p1: i#(.(x,y)) -> i#(x)
p2: i#(.(x,y)) -> i#(y)

and R consists of:

r1: .(|1|(),x) -> x
r2: .(x,|1|()) -> x
r3: .(i(x),x) -> |1|()
r4: .(x,i(x)) -> |1|()
r5: i(|1|()) -> |1|()
r6: i(i(x)) -> x
r7: .(i(y),.(y,z)) -> z
r8: .(y,.(i(y),z)) -> z
r9: .(.(x,y),z) -> .(x,.(y,z))
r10: i(.(x,y)) -> .(i(y),i(x))

The set of usable rules consists of

  r1, r2, r3, r4, r5, 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:
  
      model-based reduction triple (=A, >=A!, >A!):
      
        finite algebra:
        
          carrier: {0,1}
          interpretations:
            i#_A(0) = 0
            i#_A(1) = 0
            ._A(0,0) = 1
            ._A(0,1) = 0
            ._A(1,0) = 0
            ._A(1,1) = 1
            |1|_A = 1
            i_A(0) = 0
            i_A(1) = 1
            i#!_A(0) = 0
            i#!_A(1) = 0
            .!_A(0,0) = 0
            .!_A(0,1) = 0
            .!_A(1,0) = 0
            .!_A(1,1) = 0
            |1|!_A = 0
            i!_A(0) = 1
            i!_A(1) = 1
  
    partial status:
  
      pi(i#) = [1]
      pi(.) = [1, 2]
      pi(|1|) = []
      pi(i) = [1]

The following rules are removed:

  p1



-- SCC decomposition.

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

p1: i#(.(x,y)) -> i#(y)

and R consists of:

r1: .(|1|(),x) -> x
r2: .(x,|1|()) -> x
r3: .(i(x),x) -> |1|()
r4: .(x,i(x)) -> |1|()
r5: i(|1|()) -> |1|()
r6: i(i(x)) -> x
r7: .(i(y),.(y,z)) -> z
r8: .(y,.(i(y),z)) -> z
r9: .(.(x,y),z) -> .(x,.(y,z))
r10: i(.(x,y)) -> .(i(y),i(x))

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: i#(.(x,y)) -> i#(y)

and R consists of:

r1: .(|1|(),x) -> x
r2: .(x,|1|()) -> x
r3: .(i(x),x) -> |1|()
r4: .(x,i(x)) -> |1|()
r5: i(|1|()) -> |1|()
r6: i(i(x)) -> x
r7: .(i(y),.(y,z)) -> z
r8: .(y,.(i(y),z)) -> z
r9: .(.(x,y),z) -> .(x,.(y,z))
r10: i(.(x,y)) -> .(i(y),i(x))

The set of usable rules consists of

  r1, r2, r3, r4, r5, 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:
  
      model-based reduction triple (=A, >=A!, >A!):
      
        finite algebra:
        
          carrier: {0,1}
          interpretations:
            i#_A(0) = 0
            i#_A(1) = 0
            ._A(0,0) = 1
            ._A(0,1) = 0
            ._A(1,0) = 0
            ._A(1,1) = 1
            |1|_A = 1
            i_A(0) = 0
            i_A(1) = 1
            i#!_A(0) = 0
            i#!_A(1) = 0
            .!_A(0,0) = 0
            .!_A(0,1) = 0
            .!_A(1,0) = 0
            .!_A(1,1) = 0
            |1|!_A = 0
            i!_A(0) = 1
            i!_A(1) = 1
  
    partial status:
  
      pi(i#) = [1]
      pi(.) = [1, 2]
      pi(|1|) = []
      pi(i) = [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: .#(.(x,y),z) -> .#(x,.(y,z))
p2: .#(.(x,y),z) -> .#(y,z)

and R consists of:

r1: .(|1|(),x) -> x
r2: .(x,|1|()) -> x
r3: .(i(x),x) -> |1|()
r4: .(x,i(x)) -> |1|()
r5: i(|1|()) -> |1|()
r6: i(i(x)) -> x
r7: .(i(y),.(y,z)) -> z
r8: .(y,.(i(y),z)) -> z
r9: .(.(x,y),z) -> .(x,.(y,z))
r10: i(.(x,y)) -> .(i(y),i(x))

The set of usable rules consists of

  r1, r2, r3, r4, r5, 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:
  
      model-based reduction triple (=A, >=A!, >A!):
      
        finite algebra:
        
          carrier: {0,1}
          interpretations:
            .#_A(0,0) = 0
            .#_A(0,1) = 0
            .#_A(1,0) = 0
            .#_A(1,1) = 0
            ._A(0,0) = 0
            ._A(0,1) = 1
            ._A(1,0) = 1
            ._A(1,1) = 0
            |1|_A = 0
            i_A(0) = 0
            i_A(1) = 1
            .#!_A(0,0) = 0
            .#!_A(0,1) = 0
            .#!_A(1,0) = 0
            .#!_A(1,1) = 0
            .!_A(0,0) = 0
            .!_A(0,1) = 0
            .!_A(1,0) = 0
            .!_A(1,1) = 0
            |1|!_A = 1
            i!_A(0) = 1
            i!_A(1) = 1
  
    partial status:
  
      pi(.#) = [1]
      pi(.) = [1, 2]
      pi(|1|) = []
      pi(i) = [1]

The following rules are removed:

  p2



-- SCC decomposition.

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

p1: .#(.(x,y),z) -> .#(x,.(y,z))

and R consists of:

r1: .(|1|(),x) -> x
r2: .(x,|1|()) -> x
r3: .(i(x),x) -> |1|()
r4: .(x,i(x)) -> |1|()
r5: i(|1|()) -> |1|()
r6: i(i(x)) -> x
r7: .(i(y),.(y,z)) -> z
r8: .(y,.(i(y),z)) -> z
r9: .(.(x,y),z) -> .(x,.(y,z))
r10: i(.(x,y)) -> .(i(y),i(x))

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: .#(.(x,y),z) -> .#(x,.(y,z))

and R consists of:

r1: .(|1|(),x) -> x
r2: .(x,|1|()) -> x
r3: .(i(x),x) -> |1|()
r4: .(x,i(x)) -> |1|()
r5: i(|1|()) -> |1|()
r6: i(i(x)) -> x
r7: .(i(y),.(y,z)) -> z
r8: .(y,.(i(y),z)) -> z
r9: .(.(x,y),z) -> .(x,.(y,z))
r10: i(.(x,y)) -> .(i(y),i(x))

The set of usable rules consists of

  r1, r2, r3, r4, r5, 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:
  
      model-based reduction triple (=A, >=A!, >A!):
      
        finite algebra:
        
          carrier: {0,1}
          interpretations:
            .#_A(0,0) = 0
            .#_A(0,1) = 0
            .#_A(1,0) = 0
            .#_A(1,1) = 0
            ._A(0,0) = 0
            ._A(0,1) = 1
            ._A(1,0) = 1
            ._A(1,1) = 0
            |1|_A = 0
            i_A(0) = 0
            i_A(1) = 1
            .#!_A(0,0) = 0
            .#!_A(0,1) = 0
            .#!_A(1,0) = 0
            .#!_A(1,1) = 0
            .!_A(0,0) = 0
            .!_A(0,1) = 0
            .!_A(1,0) = 0
            .!_A(1,1) = 0
            |1|!_A = 1
            i!_A(0) = 1
            i!_A(1) = 1
  
    partial status:
  
      pi(.#) = [1]
      pi(.) = [1, 2]
      pi(|1|) = []
      pi(i) = [1]

The following rules are removed:

  p1

Then no dependency pair remains.