2nd(cons1(

2nd(cons(

from(

R

↳Dependency Pair Analysis

2ND(cons(X,X1)) -> 2ND(cons1(X,X1))

FROM(X) -> FROM(s(X))

Furthermore,

R

↳DPs

→DP Problem 1

↳Instantiation Transformation

**FROM( X) -> FROM(s(X))**

2nd(cons1(X, cons(Y,Z))) ->Y

2nd(cons(X,X1)) -> 2nd(cons1(X,X1))

from(X) -> cons(X, from(s(X)))

innermost

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

As a result of transforming the rule

one new Dependency Pair is created:

FROM(X) -> FROM(s(X))

FROM(s(X'')) -> FROM(s(s(X'')))

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳Inst

→DP Problem 2

↳Remaining Obligation(s)

The following remains to be proven:

**FROM(s( X'')) -> FROM(s(s(X'')))**

2nd(cons1(X, cons(Y,Z))) ->Y

2nd(cons(X,X1)) -> 2nd(cons1(X,X1))

from(X) -> cons(X, from(s(X)))

innermost

Duration:

0:00 minutes