Term Rewriting System R:
[f, x, y]
app(app(app(uncurry, f), x), y) -> app(app(f, x), y)

Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

APP(app(app(uncurry, f), x), y) -> APP(app(f, x), y)
APP(app(app(uncurry, f), x), y) -> APP(f, x)

Furthermore, R contains one SCC.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Argument Filtering and Ordering`

Dependency Pairs:

APP(app(app(uncurry, f), x), y) -> APP(f, x)
APP(app(app(uncurry, f), x), y) -> APP(app(f, x), y)

Rule:

app(app(app(uncurry, f), x), y) -> app(app(f, x), y)

The following dependency pairs can be strictly oriented:

APP(app(app(uncurry, f), x), y) -> APP(f, x)
APP(app(app(uncurry, f), x), y) -> APP(app(f, x), y)

The following rule can be oriented:

app(app(app(uncurry, f), x), y) -> app(app(f, x), y)

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
APP(x1, x2) -> APP(x1, x2)
app(x1, x2) -> app(x1, x2)

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

Dependency Pair:

Rule:

app(app(app(uncurry, f), x), y) -> app(app(f, x), y)

Using the Dependency Graph resulted in no new DP problems.

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