YES

The TRS could be proven terminating. The proof took 15 ms.

The following DP Processors were used


Problem 1 was processed with processor DependencyGraph (1ms).

Problem 1: DependencyGraph

Dependency Pair Problem

Dependency Pairs

h#(X) → c#f#(f(X)) → c#

Rewrite Rules

f(f(X)) → cc → d
h(X) → c

Original Signature

Termination of terms over the following signature is verified: f, d, c, h

Strategy

There are no SCCs!