MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (4ms), SubtermCriterion (1ms), DependencyGraph (1ms), PolynomialLinearRange4iUR (76ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (31ms), DependencyGraph (1ms), ReductionPairSAT (16ms), DependencyGraph (1ms), SizeChangePrinciple (5ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(x) → f#(g(x))

Rewrite Rules

f(x) → f(g(x))

Original Signature

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