MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (6ms), SubtermCriterion (1ms), DependencyGraph (7ms), PolynomialLinearRange4iUR (63ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (53ms), DependencyGraph (2ms), ReductionPairSAT (175ms), DependencyGraph (1ms), SizeChangePrinciple (2ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(0, 1, x) → f#(x, x, x)

Rewrite Rules

f(0, 1, x) → f(x, x, x)f(x, y, z) → 2
0 → 21 → 2
g(x, x, y) → yg(x, y, y) → x

Original Signature

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