MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (12ms), SubtermCriterion (1ms), DependencyGraph (7ms), PolynomialLinearRange4iUR (359ms), DependencyGraph (4ms), PolynomialLinearRange8NegiUR (1002ms), DependencyGraph (3ms), ReductionPairSAT (945ms), DependencyGraph (3ms), SizeChangePrinciple (19ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

f(f(0, x), 1) → f(g(f(x, x)), x)f(g(x), y) → g(f(x, y))

Original Signature

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