YES

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

The following DP Processors were used


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

Problem 1: DependencyGraph

Dependency Pair Problem

Dependency Pairs

f#(s(X), Y) → f#(h(Y), X)

Rewrite Rules

f(s(X), Y) → h(s(f(h(Y), X)))

Original Signature

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

Strategy

There are no SCCs!