MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (20ms), SubtermCriterion (0ms), DependencyGraph (11ms), PolynomialLinearRange4iUR (374ms), DependencyGraph (3ms), PolynomialLinearRange8NegiUR (1731ms), DependencyGraph (7ms), ReductionPairSAT (865ms), DependencyGraph (2ms), SizeChangePrinciple (19ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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