MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (5ms), SubtermCriterion (1ms), DependencyGraph (2ms), PolynomialLinearRange4iUR (71ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (63ms), DependencyGraph (1ms), ReductionPairSAT (225ms), DependencyGraph (1ms), SizeChangePrinciple (1ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(g(x, y), x, z) → f#(z, z, z)

Rewrite Rules

f(g(x, y), x, z) → f(z, z, z)g(x, y) → x
g(x, y) → y

Original Signature

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