MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (25ms), SubtermCriterion (1ms), DependencyGraph (4ms), PolynomialLinearRange4iUR (175ms), DependencyGraph (5ms), PolynomialLinearRange8NegiUR (537ms), DependencyGraph (3ms), ReductionPairSAT (531ms), DependencyGraph (3ms), SizeChangePrinciple (13ms)].

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(b(x)), y)
f#(a(x), y) → f#(x, a(y))

Rewrite Rules

f(x, a(b(y))) → a(f(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