MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (7ms), SubtermCriterion (1ms), DependencyGraph (7ms), PolynomialLinearRange4iUR (99ms), DependencyGraph (3ms), PolynomialLinearRange8NegiUR (86ms), DependencyGraph (1ms), ReductionPairSAT (19417ms), DependencyGraph (1ms), SizeChangePrinciple (2ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

f(g(x), h(x), y, x) → f(y, y, y, x)f(x, y, z, 0) → 2
g(0) → 2h(0) → 2

Original Signature

Termination of terms over the following signature is verified: f, 2, g, 0, h