Term Rewriting System R:
[y, x, z]
or(true, y) -> true
or(x, true) -> true
or(false, false) -> false
mem(x, nil) -> false
mem(x, set(y)) -> =(x, y)
mem(x, union(y, z)) -> or(mem(x, y), mem(x, z))
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
MEM(x, union(y, z)) -> OR(mem(x, y), mem(x, z))
MEM(x, union(y, z)) -> MEM(x, y)
MEM(x, union(y, z)) -> MEM(x, z)
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pairs:
MEM(x, union(y, z)) -> MEM(x, z)
MEM(x, union(y, z)) -> MEM(x, y)
Rules:
or(true, y) -> true
or(x, true) -> true
or(false, false) -> false
mem(x, nil) -> false
mem(x, set(y)) -> =(x, y)
mem(x, union(y, z)) -> or(mem(x, y), mem(x, z))
Termination of R could not be shown.
Duration:
0:00 minutes