Term Rewriting System R:
[y, x, f]
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))

Innermost Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

APP(app(mult, app(s, x)), y) -> APP(app(add, app(app(mult, x), y)), y)
APP(app(mult, app(s, x)), y) -> APP(add, app(app(mult, x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(mult, app(s, x)), y) -> APP(mult, x)
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
FACT -> APP(app(rec, mult), app(s, 0))
FACT -> APP(rec, mult)
FACT -> APP(s, 0)

Furthermore, R contains one SCC.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Remaining Obligation(s)`

The following remains to be proven:
Dependency Pairs:

APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(mult, app(s, x)), y) -> APP(app(add, app(app(mult, x), y)), y)

Rules:

app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))

Strategy:

innermost

Innermost Termination of R could not be shown.
Duration:
0:01 minutes