MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (10ms), SubtermCriterion (1ms), DependencyGraph (9ms), PolynomialLinearRange4iUR (143ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (919ms), DependencyGraph (2ms), ReductionPairSAT (418ms), DependencyGraph (1ms), SizeChangePrinciple (18ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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