TIMEOUT

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (30ms), SubtermCriterion (1ms), DependencyGraph (12ms), PolynomialLinearRange4iUR (832ms), DependencyGraph (15ms), PolynomialLinearRange8NegiUR (2325ms), DependencyGraph (8ms), ReductionPairSAT (timeout)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

app#(app(fmap, app(app(fcons, f), t)), x) → app#(f, x)app#(app(fmap, app(app(fcons, f), t)), x) → app#(app(fmap, t), x)
app#(app(fmap, app(app(fcons, f), t)), x) → app#(cons, app(f, x))app#(app(fmap, app(app(fcons, f), t)), x) → app#(fmap, t)
app#(app(fmap, app(app(fcons, f), t)), x) → app#(app(cons, app(f, x)), app(app(fmap, t), x))

Rewrite Rules

app(app(fmap, fnil), x) → nilapp(app(fmap, app(app(fcons, f), t)), x) → app(app(cons, app(f, x)), app(app(fmap, t), x))

Original Signature

Termination of terms over the following signature is verified: app, fmap, fcons, cons, fnil, nil