cons(

inf(

R

↳Dependency Pair Analysis

INF(x) -> CONS(x, inf(s(x)))

INF(x) -> INF(s(x))

Furthermore,

R

↳DPs

→DP Problem 1

↳Instantiation Transformation

**INF( x) -> INF(s(x))**

cons(x, cons(y,z)) -> big

inf(x) -> cons(x, inf(s(x)))

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

As a result of transforming the rule

one new Dependency Pair is created:

INF(x) -> INF(s(x))

INF(s(x'')) -> INF(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:

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

cons(x, cons(y,z)) -> big

inf(x) -> cons(x, inf(s(x)))

Duration:

0:00 minutes