sum(0) -> 0

sum(s(

sum(s(

sqr(

R

↳Dependency Pair Analysis

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

**SUM(s( x)) -> SUM(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)

The following dependency pair can be strictly oriented:

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

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

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

trivial

resulting in one new DP problem.

Used Argument Filtering System:

SUM(x) -> SUM(_{1}x)_{1}

s(x) -> s(_{1}x)_{1}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

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.

Duration:

0:00 minutes