Term Rewriting System R:
[x]
app(f, app(s, x)) -> app(f, app(app(g, x), x))
app(app(g, 0), 1) -> app(s, 0)
0 -> 1
Innermost Termination of R to be shown.
R
↳Removing Redundant Rules for Innermost Termination
Removing the following rules from R which left hand sides contain non normal subterms
app(app(g, 0), 1) -> app(s, 0)
R
↳RRRI
→TRS2
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
APP(f, app(s, x)) -> APP(f, app(app(g, x), x))
APP(f, app(s, x)) -> APP(app(g, x), x)
APP(f, app(s, x)) -> APP(g, x)
R contains no SCCs.
Innermost Termination of R successfully shown.
Duration:
0:00 minutes