YES

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

The following DP Processors were used


Problem 1 was processed with processor PolynomialLinearRange4iUR (118ms).

Problem 1: PolynomialLinearRange4iUR

Dependency Pair Problem

Dependency Pairs

a#(b(a(x))) → a#(b(x))

Rewrite Rules

a(b(a(x))) → b(a(b(x)))

Original Signature

Termination of terms over the following signature is verified: b, a

Strategy

Polynomial Interpretation

There are no usable rules

The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:

a#(b(a(x))) → a#(b(x))