YES

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

The following DP Processors were used


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

Problem 1: DependencyGraph

Dependency Pair Problem

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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

Strategy

There are no SCCs!