Term Rewriting System R:
app(f, app(f, x)) -> app(g, app(f, x))
app(g, app(g, x)) -> app(f, x)

Innermost Termination of R to be shown.

Dependency Pair Analysis

R contains the following Dependency Pairs:

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

R contains no SCCs.

Innermost Termination of R successfully shown.
0:00 minutes