MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (19ms), SubtermCriterion (2ms), DependencyGraph (8ms), PolynomialLinearRange4iUR (155ms), DependencyGraph (4ms), PolynomialLinearRange8NegiUR (702ms), DependencyGraph (5ms), ReductionPairSAT (589ms), DependencyGraph (2ms), SizeChangePrinciple (51ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(d(x), y) → f#(x, b(y))f#(x, a(b(y))) → f#(c(d(x)), y)
f#(c(x), y) → f#(x, a(y))

Rewrite Rules

f(x, a(b(y))) → f(c(d(x)), y)f(c(x), y) → f(x, a(y))
f(d(x), y) → f(x, b(y))

Original Signature

Termination of terms over the following signature is verified: f, d, b, c, a