MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (17ms), SubtermCriterion (0ms), DependencyGraph (5ms), PolynomialLinearRange4iUR (293ms), DependencyGraph (5ms), PolynomialLinearRange8NegiUR (1188ms), DependencyGraph (2ms), ReductionPairSAT (1685ms), DependencyGraph (2ms), SizeChangePrinciple (12ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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