MAYBE

The TRS could not be proven terminating. The proof attempt took 8693 ms.

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (27ms), SubtermCriterion (0ms), DependencyGraph (12ms), PolynomialLinearRange4iUR (377ms), DependencyGraph (6ms), PolynomialLinearRange8NegiUR (3045ms), DependencyGraph (5ms), ReductionPairSAT (5044ms), DependencyGraph (6ms), SizeChangePrinciple (66ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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