sum(0) -> 0

sum(s(

sum1(0) -> 0

sum1(s(

R

↳Dependency Pair Analysis

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

SUM1(s(x)) -> SUM1(x)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳AFS

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

sum(0) -> 0

sum(s(x)) -> +(sum(x), s(x))

sum1(0) -> 0

sum1(s(x)) -> s(+(sum1(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)) -> +(sum(x), s(x))

sum1(0) -> 0

sum1(s(x)) -> s(+(sum1(x), +(x,x)))

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

sum > +

sum1 > +

sum1 > s

resulting in one new DP problem.

Used Argument Filtering System:

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

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

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

+(x,_{1}x) -> +(_{2}x,_{1}x)_{2}

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 3

↳Dependency Graph

→DP Problem 2

↳AFS

sum(0) -> 0

sum(s(x)) -> +(sum(x), s(x))

sum1(0) -> 0

sum1(s(x)) -> s(+(sum1(x), +(x,x)))

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Argument Filtering and Ordering

**SUM1(s( x)) -> SUM1(x)**

sum(0) -> 0

sum(s(x)) -> +(sum(x), s(x))

sum1(0) -> 0

sum1(s(x)) -> s(+(sum1(x), +(x,x)))

The following dependency pair can be strictly oriented:

SUM1(s(x)) -> SUM1(x)

The following rules can be oriented:

sum(0) -> 0

sum(s(x)) -> +(sum(x), s(x))

sum1(0) -> 0

sum1(s(x)) -> s(+(sum1(x), +(x,x)))

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

sum > +

sum1 > +

sum1 > s

resulting in one new DP problem.

Used Argument Filtering System:

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

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

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

+(x,_{1}x) -> +(_{2}x,_{1}x)_{2}

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 4

↳Dependency Graph

sum(0) -> 0

sum(s(x)) -> +(sum(x), s(x))

sum1(0) -> 0

sum1(s(x)) -> s(+(sum1(x), +(x,x)))

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes