MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (20ms), SubtermCriterion (2ms), DependencyGraph (5ms), PolynomialLinearRange4iUR (259ms), DependencyGraph (3ms), PolynomialLinearRange8NegiUR (747ms), DependencyGraph (3ms), ReductionPairSAT (43979ms), DependencyGraph (45ms), SizeChangePrinciple (13ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(x, y, f(z, u, v)) → f#(x, y, v)f#(x, y, f(z, u, v)) → f#(x, y, z)
f#(x, y, f(z, u, v)) → f#(f(x, y, z), u, f(x, y, v))

Rewrite Rules

f(x, y, f(z, u, v)) → f(f(x, y, z), u, f(x, y, v))

Original Signature

Termination of terms over the following signature is verified: f