TIMEOUT

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (6ms), SubtermCriterion (0ms), DependencyGraph (1ms), PolynomialLinearRange4iUR (63ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (48ms), DependencyGraph (1ms), ReductionPairSAT (176ms), DependencyGraph (0ms), SizeChangePrinciple (4ms), ForwardNarrowing (1ms), BackwardInstantiation (1ms), ForwardInstantiation (2ms), Propagation (0ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(0, 1, X) → f#(X, X, X)

Rewrite Rules

f(0, 1, X) → f(X, X, X)g(X, Y) → X
g(X, Y) → Y

Original Signature

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