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`
`         ↳Polynomial Ordering`

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

The following dependency pairs can be strictly oriented:

APP(app(app(compose, f), g), x) -> APP(g, x)
APP(app(app(compose, f), g), x) -> APP(f, app(g, x))

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(compose) =  1 POL(app(x1, x2)) =  x1 + x2 POL(APP(x1, x2)) =  x1

resulting in one new DP problem.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`           →DP Problem 2`
`             ↳Dependency Graph`

Dependency Pair:

Rule:

app(app(app(compose, f), g), x) -> app(f, app(g, x))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

Innermost Termination of R successfully shown.
Duration:
0:00 minutes