YES
We show the termination of the TRS R:

  g(A()) -> A()
  g(B()) -> A()
  g(B()) -> B()
  g(C()) -> A()
  g(C()) -> B()
  g(C()) -> C()
  foldB(t,|0|()) -> t
  foldB(t,s(n)) -> f(foldB(t,n),B())
  foldC(t,|0|()) -> t
  foldC(t,s(n)) -> f(foldC(t,n),C())
  f(t,x) -> |f'|(t,g(x))
  |f'|(triple(a,b,c),C()) -> triple(a,b,s(c))
  |f'|(triple(a,b,c),B()) -> f(triple(a,b,c),A())
  |f'|(triple(a,b,c),A()) -> |f''|(foldB(triple(s(a),|0|(),c),b))
  |f''|(triple(a,b,c)) -> foldC(triple(a,b,|0|()),c)


-- SCC decomposition.

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

p1: foldB#(t,s(n)) -> f#(foldB(t,n),B())
p2: foldB#(t,s(n)) -> foldB#(t,n)
p3: foldC#(t,s(n)) -> f#(foldC(t,n),C())
p4: foldC#(t,s(n)) -> foldC#(t,n)
p5: f#(t,x) -> |f'|#(t,g(x))
p6: f#(t,x) -> g#(x)
p7: |f'|#(triple(a,b,c),B()) -> f#(triple(a,b,c),A())
p8: |f'|#(triple(a,b,c),A()) -> |f''|#(foldB(triple(s(a),|0|(),c),b))
p9: |f'|#(triple(a,b,c),A()) -> foldB#(triple(s(a),|0|(),c),b)
p10: |f''|#(triple(a,b,c)) -> foldC#(triple(a,b,|0|()),c)

and R consists of:

r1: g(A()) -> A()
r2: g(B()) -> A()
r3: g(B()) -> B()
r4: g(C()) -> A()
r5: g(C()) -> B()
r6: g(C()) -> C()
r7: foldB(t,|0|()) -> t
r8: foldB(t,s(n)) -> f(foldB(t,n),B())
r9: foldC(t,|0|()) -> t
r10: foldC(t,s(n)) -> f(foldC(t,n),C())
r11: f(t,x) -> |f'|(t,g(x))
r12: |f'|(triple(a,b,c),C()) -> triple(a,b,s(c))
r13: |f'|(triple(a,b,c),B()) -> f(triple(a,b,c),A())
r14: |f'|(triple(a,b,c),A()) -> |f''|(foldB(triple(s(a),|0|(),c),b))
r15: |f''|(triple(a,b,c)) -> foldC(triple(a,b,|0|()),c)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p7, p8, p9, p10}


-- Reduction pair.

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

p1: foldB#(t,s(n)) -> f#(foldB(t,n),B())
p2: f#(t,x) -> |f'|#(t,g(x))
p3: |f'|#(triple(a,b,c),A()) -> foldB#(triple(s(a),|0|(),c),b)
p4: foldB#(t,s(n)) -> foldB#(t,n)
p5: |f'|#(triple(a,b,c),A()) -> |f''|#(foldB(triple(s(a),|0|(),c),b))
p6: |f''|#(triple(a,b,c)) -> foldC#(triple(a,b,|0|()),c)
p7: foldC#(t,s(n)) -> foldC#(t,n)
p8: foldC#(t,s(n)) -> f#(foldC(t,n),C())
p9: |f'|#(triple(a,b,c),B()) -> f#(triple(a,b,c),A())

and R consists of:

r1: g(A()) -> A()
r2: g(B()) -> A()
r3: g(B()) -> B()
r4: g(C()) -> A()
r5: g(C()) -> B()
r6: g(C()) -> C()
r7: foldB(t,|0|()) -> t
r8: foldB(t,s(n)) -> f(foldB(t,n),B())
r9: foldC(t,|0|()) -> t
r10: foldC(t,s(n)) -> f(foldC(t,n),C())
r11: f(t,x) -> |f'|(t,g(x))
r12: |f'|(triple(a,b,c),C()) -> triple(a,b,s(c))
r13: |f'|(triple(a,b,c),B()) -> f(triple(a,b,c),A())
r14: |f'|(triple(a,b,c),A()) -> |f''|(foldB(triple(s(a),|0|(),c),b))
r15: |f''|(triple(a,b,c)) -> foldC(triple(a,b,|0|()),c)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        foldB#_A(x1,x2) = max{33, x1 + 11}
        s_A(x1) = max{13, x1}
        f#_A(x1,x2) = max{23, x1 + 11, x2 - 11}
        foldB_A(x1,x2) = max{15, x1}
        B_A = 34
        |f'|#_A(x1,x2) = max{16, x1 + 11, x2 - 15}
        g_A(x1) = max{10, x1}
        triple_A(x1,x2,x3) = max{x2 + 7, x3 + 22}
        A_A = 34
        |0|_A = 0
        |f''|#_A(x1) = max{20, x1 + 11}
        foldC#_A(x1,x2) = max{x1 + 11, x2 + 33}
        foldC_A(x1,x2) = max{x1, x2 + 22}
        C_A = 57
        f_A(x1,x2) = max{15, x1, x2 - 22}
        |f'|_A(x1,x2) = max{12, x1, x2 - 22}
        |f''|_A(x1) = max{13, x1}
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            foldB#_A(x1,x2) = 0
            s_A(x1) = x1 + 16
            f#_A(x1,x2) = 0
            foldB_A(x1,x2) = x1 + x2 + 1
            B_A() = 13
            |f'|#_A(x1,x2) = 0
            g_A(x1) = x1 + 1
            triple_A(x1,x2,x3) = x2 + x3 + 15
            A_A() = 10
            |0|_A() = 1
            |f''|#_A(x1) = 0
            foldC#_A(x1,x2) = 0
            foldC_A(x1,x2) = x1 + x2 + 1
            C_A() = 17
            f_A(x1,x2) = x1 + 16
            |f'|_A(x1,x2) = x1 + 16
            |f''|_A(x1) = x1 + 2
            foldB#!_A(x1,x2) = x1 + x2 + 4
            s!_A(x1) = 22
            f#!_A(x1,x2) = x1 + 5
            foldB!_A(x1,x2) = x1 + x2 + 3
            B!_A() = 21
            |f'|#!_A(x1,x2) = x1 + 5
            g!_A(x1) = x1 + 4
            triple!_A(x1,x2,x3) = 23
            A!_A() = 21
            |0|!_A() = 22
            |f''|#!_A(x1) = x1 + 2
            foldC#!_A(x1,x2) = x1 + x2
            foldC!_A(x1,x2) = x1 + x2 + 7
            C!_A() = 20
            f!_A(x1,x2) = x1 + x2 + 4
            |f'|!_A(x1,x2) = x1 + x2 + 2
            |f''|!_A(x1) = x1 + 9
  
    partial status:
  
      pi(foldB#) = []
      pi(s) = [1]
      pi(f#) = []
      pi(foldB) = [1]
      pi(B) = []
      pi(|f'|#) = []
      pi(g) = [1]
      pi(triple) = []
      pi(A) = []
      pi(|0|) = []
      pi(|f''|#) = [1]
      pi(foldC#) = []
      pi(foldC) = [1, 2]
      pi(C) = []
      pi(f) = []
      pi(|f'|) = []
      pi(|f''|) = [1]

The following rules are removed:

  p1, p4, p5, p6, p7, p8



-- SCC decomposition.

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

p1: f#(t,x) -> |f'|#(t,g(x))
p2: |f'|#(triple(a,b,c),A()) -> foldB#(triple(s(a),|0|(),c),b)
p3: |f'|#(triple(a,b,c),B()) -> f#(triple(a,b,c),A())

and R consists of:

r1: g(A()) -> A()
r2: g(B()) -> A()
r3: g(B()) -> B()
r4: g(C()) -> A()
r5: g(C()) -> B()
r6: g(C()) -> C()
r7: foldB(t,|0|()) -> t
r8: foldB(t,s(n)) -> f(foldB(t,n),B())
r9: foldC(t,|0|()) -> t
r10: foldC(t,s(n)) -> f(foldC(t,n),C())
r11: f(t,x) -> |f'|(t,g(x))
r12: |f'|(triple(a,b,c),C()) -> triple(a,b,s(c))
r13: |f'|(triple(a,b,c),B()) -> f(triple(a,b,c),A())
r14: |f'|(triple(a,b,c),A()) -> |f''|(foldB(triple(s(a),|0|(),c),b))
r15: |f''|(triple(a,b,c)) -> foldC(triple(a,b,|0|()),c)

The estimated dependency graph contains the following SCCs:

  {p1, p3}


-- Reduction pair.

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

p1: f#(t,x) -> |f'|#(t,g(x))
p2: |f'|#(triple(a,b,c),B()) -> f#(triple(a,b,c),A())

and R consists of:

r1: g(A()) -> A()
r2: g(B()) -> A()
r3: g(B()) -> B()
r4: g(C()) -> A()
r5: g(C()) -> B()
r6: g(C()) -> C()
r7: foldB(t,|0|()) -> t
r8: foldB(t,s(n)) -> f(foldB(t,n),B())
r9: foldC(t,|0|()) -> t
r10: foldC(t,s(n)) -> f(foldC(t,n),C())
r11: f(t,x) -> |f'|(t,g(x))
r12: |f'|(triple(a,b,c),C()) -> triple(a,b,s(c))
r13: |f'|(triple(a,b,c),B()) -> f(triple(a,b,c),A())
r14: |f'|(triple(a,b,c),A()) -> |f''|(foldB(triple(s(a),|0|(),c),b))
r15: |f''|(triple(a,b,c)) -> foldC(triple(a,b,|0|()),c)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        f#_A(x1,x2) = x2
        |f'|#_A(x1,x2) = x2
        g_A(x1) = x1
        triple_A(x1,x2,x3) = max{x1 + 1, x2 + 24, x3 + 30}
        B_A = 58
        A_A = 27
        C_A = 82
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            f#_A(x1,x2) = x1
            |f'|#_A(x1,x2) = x1
            g_A(x1) = x1 + 1
            triple_A(x1,x2,x3) = x3 + 1
            B_A() = 1
            A_A() = 1
            C_A() = 1
            f#!_A(x1,x2) = x1 + 3
            |f'|#!_A(x1,x2) = x1 + 2
            g!_A(x1) = 2
            triple!_A(x1,x2,x3) = x1 + x2 + x3 + 5
            B!_A() = 2
            A!_A() = 1
            C!_A() = 0
  
    partial status:
  
      pi(f#) = []
      pi(|f'|#) = [2]
      pi(g) = []
      pi(triple) = [2]
      pi(B) = []
      pi(A) = []
      pi(C) = []

The following rules are removed:

  p1, p2

Then no dependency pair remains.