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)

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`
`         ↳Polynomial Ordering`

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)

The following dependency pair can be strictly oriented:

AVERAGE(x, s(s(s(y)))) -> AVERAGE(s(x), y)

There are no usable rules using the Ce-refinement that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(AVERAGE(x1, x2)) =  1 + x1 + x2 POL(s(x1)) =  1 + x1

resulting in one new DP problem.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`           →DP Problem 2`
`             ↳Polynomial Ordering`

Dependency Pair:

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)

The following dependency pair can be strictly oriented:

AVERAGE(s(x), y) -> AVERAGE(x, s(y))

There are no usable rules using the Ce-refinement that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(AVERAGE(x1, x2)) =  x1 POL(s(x1)) =  1 + x1

resulting in one new DP problem.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`           →DP Problem 2`
`             ↳Polo`
`             ...`
`               →DP Problem 3`
`                 ↳Dependency Graph`

Dependency Pair:

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)

Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:00 minutes