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