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