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