YES
We show the termination of the TRS R:

  D(t()) -> |1|()
  D(constant()) -> |0|()
  D(+(x,y)) -> +(D(x),D(y))
  D(*(x,y)) -> +(*(y,D(x)),*(x,D(y)))
  D(-(x,y)) -> -(D(x),D(y))


-- SCC decomposition.

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

p1: D#(+(x,y)) -> D#(x)
p2: D#(+(x,y)) -> D#(y)
p3: D#(*(x,y)) -> D#(x)
p4: D#(*(x,y)) -> D#(y)
p5: D#(-(x,y)) -> D#(x)
p6: D#(-(x,y)) -> D#(y)

and R consists of:

r1: D(t()) -> |1|()
r2: D(constant()) -> |0|()
r3: D(+(x,y)) -> +(D(x),D(y))
r4: D(*(x,y)) -> +(*(y,D(x)),*(x,D(y)))
r5: D(-(x,y)) -> -(D(x),D(y))

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p6}


-- Reduction pair.

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

p1: D#(+(x,y)) -> D#(x)
p2: D#(-(x,y)) -> D#(y)
p3: D#(-(x,y)) -> D#(x)
p4: D#(*(x,y)) -> D#(y)
p5: D#(*(x,y)) -> D#(x)
p6: D#(+(x,y)) -> D#(y)

and R consists of:

r1: D(t()) -> |1|()
r2: D(constant()) -> |0|()
r3: D(+(x,y)) -> +(D(x),D(y))
r4: D(*(x,y)) -> +(*(y,D(x)),*(x,D(y)))
r5: D(-(x,y)) -> -(D(x),D(y))

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        D#_A(x1) = max{11, x1 - 20}
        +_A(x1,x2) = max{32, x1 + 7, x2 + 16}
        -_A(x1,x2) = max{19, x1 + 10, x2 + 1}
        *_A(x1,x2) = max{x1 + 13, x2 + 7}
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            D#_A(x1) = x1
            +_A(x1,x2) = x1 + x2 + 1
            -_A(x1,x2) = x1 + x2 + 4
            *_A(x1,x2) = x1 + x2 + 1
            D#!_A(x1) = x1
            +!_A(x1,x2) = x1 + x2 + 1
            -!_A(x1,x2) = x1 + x2 + 1
            *!_A(x1,x2) = x2 + 6
  
    partial status:
  
      pi(D#) = []
      pi(+) = []
      pi(-) = [2]
      pi(*) = [2]

The following rules are removed:

  p1, p2, p3, p4, p5, p6

Then no dependency pair remains.