Term Rewriting System R:
[x]
sum(0) -> 0
sum(s(x)) -> +(sqr(s(x)), sum(x))
sum(s(x)) -> +(*(s(x), s(x)), sum(x))
sqr(x) -> *(x, x)

Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

SUM(s(x)) -> SQR(s(x))
SUM(s(x)) -> SUM(x)

Furthermore, R contains one SCC.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Argument Filtering and Ordering`

Dependency Pair:

SUM(s(x)) -> SUM(x)

Rules:

sum(0) -> 0
sum(s(x)) -> +(sqr(s(x)), sum(x))
sum(s(x)) -> +(*(s(x), s(x)), sum(x))
sqr(x) -> *(x, x)

The following dependency pair can be strictly oriented:

SUM(s(x)) -> SUM(x)

The following rules can be oriented:

sum(0) -> 0
sum(s(x)) -> +(sqr(s(x)), sum(x))
sum(s(x)) -> +(*(s(x), s(x)), sum(x))
sqr(x) -> *(x, x)

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(SUM(x1)) =  x1 POL(0) =  0 POL(sqr) =  0 POL(*) =  0 POL(s(x1)) =  1 + x1 POL(sum(x1)) =  x1 POL(+(x1, x2)) =  x1 + x2

resulting in one new DP problem.
Used Argument Filtering System:
SUM(x1) -> SUM(x1)
s(x1) -> s(x1)
sum(x1) -> sum(x1)
+(x1, x2) -> +(x1, x2)
sqr(x1) -> sqr
*(x1, x2) -> *

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳AFS`
`           →DP Problem 2`
`             ↳Dependency Graph`

Dependency Pair:

Rules:

sum(0) -> 0
sum(s(x)) -> +(sqr(s(x)), sum(x))
sum(s(x)) -> +(*(s(x), s(x)), sum(x))
sqr(x) -> *(x, x)

Using the Dependency Graph resulted in no new DP problems.

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