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