MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (9ms), SubtermCriterion (0ms), DependencyGraph (9ms), PolynomialLinearRange4iUR (144ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (803ms), DependencyGraph (2ms), ReductionPairSAT (479ms), DependencyGraph (1ms), SizeChangePrinciple (15ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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