MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (10ms), SubtermCriterion (3ms), DependencyGraph (3ms), PolynomialLinearRange4iUR (75ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (112ms), DependencyGraph (3ms), ReductionPairSAT (63ms), DependencyGraph (2ms), SizeChangePrinciple (7ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(0, 1, X) → h#(X, X)h#(0, X) → f#(0, X, X)

Rewrite Rules

f(0, 1, X) → h(X, X)h(0, X) → f(0, X, X)
g(X, Y) → Xg(X, Y) → Y

Original Signature

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