Term Rewriting System R:
[x, y]
bin(x, 0) -> s(0)
bin(0, s(y)) -> 0
bin(s(x), s(y)) -> +(bin(x, s(y)), bin(x, y))
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
BIN(s(x), s(y)) -> BIN(x, s(y))
BIN(s(x), s(y)) -> BIN(x, y)
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pairs:
BIN(s(x), s(y)) -> BIN(x, y)
BIN(s(x), s(y)) -> BIN(x, s(y))
Rules:
bin(x, 0) -> s(0)
bin(0, s(y)) -> 0
bin(s(x), s(y)) -> +(bin(x, s(y)), bin(x, y))
Termination of R could not be shown.
Duration:
0:00 minutes