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