Term Rewriting System R:
[]
app(f, a) -> app(f, b)
app(g, b) -> app(g, a)
Termination of R to be shown.
R
↳Overlay and local confluence Check
The TRS is overlay and locally confluent (all critical pairs are trivially joinable).Hence, we can switch to innermost.
R
↳OC
→TRS2
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
APP(f, a) -> APP(f, b)
APP(g, b) -> APP(g, a)
R contains no SCCs.
Termination of R successfully shown.
Duration:
0:00 minutes