Term Rewriting System R:
[x, y]
ap(ap(g, x), y) -> y
ap(f, x) -> ap(f, app(g, x))
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
AP(f, x) -> AP(f, app(g, x))
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pair:
AP(f, x) -> AP(f, app(g, x))
Rules:
ap(ap(g, x), y) -> y
ap(f, x) -> ap(f, app(g, x))
Termination of R could not be shown.
Duration:
0:00 minutes