Term Rewriting System R:
[x, y]
gcd(x, 0) -> x
gcd(0, y) -> y
gcd(s(x), s(y)) -> if(< (x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y)))
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:
GCD(s(x), s(y)) -> GCD(s(x), -(y, x))
GCD(s(x), s(y)) -> GCD(-(x, y), s(y))
R contains no SCCs.
Termination of R successfully shown.
Duration:
0:00 minutes