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

↳Forward Instantiation Transformation

→DP Problem 2

↳FwdInst

**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)))

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 3

↳Forward Instantiation Transformation

→DP Problem 2

↳FwdInst

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

sum(0) -> 0

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

sum1(0) -> 0

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

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 3

↳FwdInst

...

→DP Problem 4

↳Polynomial Ordering

→DP Problem 2

↳FwdInst

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

sum(0) -> 0

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

sum1(0) -> 0

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

innermost

The following dependency pair can be strictly oriented:

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

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

_{ }^{ }POL(SUM(x)_{1})= 1 + x _{1}_{ }^{ }_{ }^{ }POL(s(x)_{1})= 1 + x _{1}_{ }^{ }

resulting in one new DP problem.

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 3

↳FwdInst

...

→DP Problem 5

↳Dependency Graph

→DP Problem 2

↳FwdInst

sum(0) -> 0

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

sum1(0) -> 0

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

innermost

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 2

↳Forward Instantiation Transformation

**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)))

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 2

↳FwdInst

→DP Problem 6

↳Forward Instantiation Transformation

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

sum(0) -> 0

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

sum1(0) -> 0

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

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 2

↳FwdInst

→DP Problem 6

↳FwdInst

...

→DP Problem 7

↳Polynomial Ordering

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

sum(0) -> 0

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

sum1(0) -> 0

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

innermost

The following dependency pair can be strictly oriented:

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

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

_{ }^{ }POL(s(x)_{1})= 1 + x _{1}_{ }^{ }_{ }^{ }POL(SUM1(x)_{1})= 1 + x _{1}_{ }^{ }

resulting in one new DP problem.

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 2

↳FwdInst

→DP Problem 6

↳FwdInst

...

→DP Problem 8

↳Dependency Graph

sum(0) -> 0

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

sum1(0) -> 0

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

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes