MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (26ms), SubtermCriterion (0ms), DependencyGraph (7ms), PolynomialLinearRange4iUR (149ms), DependencyGraph (3ms), PolynomialLinearRange8NegiUR (663ms), DependencyGraph (2ms), ReductionPairSAT (1026ms), DependencyGraph (3ms), SizeChangePrinciple (14ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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