MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (19ms), SubtermCriterion (1ms), DependencyGraph (6ms), PolynomialLinearRange4iUR (359ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (1285ms), DependencyGraph (3ms), ReductionPairSAT (376ms), DependencyGraph (3ms), SizeChangePrinciple (133ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(g(X), Y) → f#(X, n__f(g(X), activate(Y)))activate#(n__f(X1, X2)) → f#(X1, X2)
f#(g(X), Y) → activate#(Y)

Rewrite Rules

f(g(X), Y) → f(X, n__f(g(X), activate(Y)))f(X1, X2) → n__f(X1, X2)
activate(n__f(X1, X2)) → f(X1, X2)activate(X) → X

Original Signature

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