MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (5ms), SubtermCriterion (1ms), DependencyGraph (2ms), PolynomialLinearRange4iUR (74ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (71ms), DependencyGraph (1ms), ReductionPairSAT (64ms), DependencyGraph (1ms), SizeChangePrinciple (8ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

ap#(f, x) → ap#(f, app(g, x))

Rewrite Rules

ap(ap(g, x), y) → yap(f, x) → ap(f, app(g, x))

Original Signature

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