YES

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

The following DP Processors were used


Problem 1 was processed with processor BackwardsNarrowing (0ms).

Problem 1: BackwardsNarrowing

Dependency Pair Problem

Dependency Pairs

f#(0, 1, x) → f#(x, x, x)

Rewrite Rules

f(0, 1, x) → f(x, x, x)

Original Signature

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

Strategy

The left-hand side of the rule f#(0, 1, x) → f#(x, x, x) is backward narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
Relevant TermsIrrelevant Terms
Thus, the rule f#(0, 1, x) → f#(x, x, x) is deleted.