YES

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

The following DP Processors were used


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

Problem 1: DependencyGraph

Dependency Pair Problem

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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

Strategy

There are no SCCs!