YES

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

The following DP Processors were used


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

Problem 1: DependencyGraph

Dependency Pair Problem

Dependency Pairs

f#(g(h(x, y)), f(a, a)) → f#(y, a)f#(g(h(x, y)), f(a, a)) → f#(h(x, x), g(f(y, a)))

Rewrite Rules

f(g(h(x, y)), f(a, a)) → f(h(x, x), g(f(y, a)))

Original Signature

Termination of terms over the following signature is verified: f, g, a, h

Strategy

There are no SCCs!