MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (5ms), SubtermCriterion (1ms), DependencyGraph (4ms), PolynomialLinearRange4iUR (85ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (52ms), DependencyGraph (3ms), ReductionPairSAT (222ms), DependencyGraph (1ms), SizeChangePrinciple (2ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(X, g(X), Y) → f#(Y, Y, Y)

Rewrite Rules

f(X, g(X), Y) → f(Y, Y, Y)g(b) → c
b → c

Original Signature

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