MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (37ms), SubtermCriterion (1ms), DependencyGraph (15ms), PolynomialLinearRange4iUR (399ms), DependencyGraph (5ms), PolynomialLinearRange8NegiUR (920ms), DependencyGraph (8ms), ReductionPairSAT (2520ms), DependencyGraph (4ms), SizeChangePrinciple (14ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

app#(app(iterate, f), x) → app#(iterate, f)app#(app(iterate, f), x) → app#(app(cons, x), app(app(iterate, f), app(f, x)))
app#(app(iterate, f), x) → app#(cons, x)app#(app(iterate, f), x) → app#(app(iterate, f), app(f, x))
app#(app(iterate, f), x) → app#(f, x)

Rewrite Rules

app(app(iterate, f), x) → app(app(cons, x), app(app(iterate, f), app(f, x)))

Original Signature

Termination of terms over the following signature is verified: app, iterate, cons