MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (8ms), SubtermCriterion (1ms), DependencyGraph (10ms), PolynomialLinearRange4iUR (149ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (725ms), DependencyGraph (1ms), ReductionPairSAT (280ms), DependencyGraph (1ms), SizeChangePrinciple (11ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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