YES

Problem 1: 

(VAR v_NonEmpty:S x:S y:S)
(RULES
D(*(x:S,y:S)) -> +(*(y:S,D(x:S)),*(x:S,D(y:S)))
D(+(x:S,y:S)) -> +(D(x:S),D(y:S))
D(-(x:S,y:S)) -> -(D(x:S),D(y:S))
D(constant) -> 0
D(t) -> 1
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 D(*(x:S,y:S)) -> +(*(y:S,D(x:S)),*(x:S,D(y:S)))
 D(+(x:S,y:S)) -> +(D(x:S),D(y:S))
 D(-(x:S,y:S)) -> -(D(x:S),D(y:S))
 D(constant) -> 0
 D(t) -> 1
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 D#(*(x:S,y:S)) -> D#(x:S)
 D#(*(x:S,y:S)) -> D#(y:S)
 D#(+(x:S,y:S)) -> D#(x:S)
 D#(+(x:S,y:S)) -> D#(y:S)
 D#(-(x:S,y:S)) -> D#(x:S)
 D#(-(x:S,y:S)) -> D#(y:S)
-> Rules:
 D(*(x:S,y:S)) -> +(*(y:S,D(x:S)),*(x:S,D(y:S)))
 D(+(x:S,y:S)) -> +(D(x:S),D(y:S))
 D(-(x:S,y:S)) -> -(D(x:S),D(y:S))
 D(constant) -> 0
 D(t) -> 1

Problem 1: 

SCC Processor:
-> Pairs:
 D#(*(x:S,y:S)) -> D#(x:S)
 D#(*(x:S,y:S)) -> D#(y:S)
 D#(+(x:S,y:S)) -> D#(x:S)
 D#(+(x:S,y:S)) -> D#(y:S)
 D#(-(x:S,y:S)) -> D#(x:S)
 D#(-(x:S,y:S)) -> D#(y:S)
-> Rules:
 D(*(x:S,y:S)) -> +(*(y:S,D(x:S)),*(x:S,D(y:S)))
 D(+(x:S,y:S)) -> +(D(x:S),D(y:S))
 D(-(x:S,y:S)) -> -(D(x:S),D(y:S))
 D(constant) -> 0
 D(t) -> 1
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 D#(*(x:S,y:S)) -> D#(x:S)
 D#(*(x:S,y:S)) -> D#(y:S)
 D#(+(x:S,y:S)) -> D#(x:S)
 D#(+(x:S,y:S)) -> D#(y:S)
 D#(-(x:S,y:S)) -> D#(x:S)
 D#(-(x:S,y:S)) -> D#(y:S)
->->-> Rules:
 D(*(x:S,y:S)) -> +(*(y:S,D(x:S)),*(x:S,D(y:S)))
 D(+(x:S,y:S)) -> +(D(x:S),D(y:S))
 D(-(x:S,y:S)) -> -(D(x:S),D(y:S))
 D(constant) -> 0
 D(t) -> 1

Problem 1: 

Subterm Processor:
-> Pairs:
 D#(*(x:S,y:S)) -> D#(x:S)
 D#(*(x:S,y:S)) -> D#(y:S)
 D#(+(x:S,y:S)) -> D#(x:S)
 D#(+(x:S,y:S)) -> D#(y:S)
 D#(-(x:S,y:S)) -> D#(x:S)
 D#(-(x:S,y:S)) -> D#(y:S)
-> Rules:
 D(*(x:S,y:S)) -> +(*(y:S,D(x:S)),*(x:S,D(y:S)))
 D(+(x:S,y:S)) -> +(D(x:S),D(y:S))
 D(-(x:S,y:S)) -> -(D(x:S),D(y:S))
 D(constant) -> 0
 D(t) -> 1
->Projection:
 pi(D#) = 1

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 D(*(x:S,y:S)) -> +(*(y:S,D(x:S)),*(x:S,D(y:S)))
 D(+(x:S,y:S)) -> +(D(x:S),D(y:S))
 D(-(x:S,y:S)) -> -(D(x:S),D(y:S))
 D(constant) -> 0
 D(t) -> 1
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.