rev(a) -> a

rev(b) -> b

rev(++(

rev(++(

R

↳Dependency Pair Analysis

REV(++(x,y)) -> REV(y)

REV(++(x,y)) -> REV(x)

REV(++(x,x)) -> REV(x)

Furthermore,

R

↳DPs

→DP Problem 1

↳Polynomial Ordering

**REV(++( x, x)) -> REV(x)**

rev(a) -> a

rev(b) -> b

rev(++(x,y)) -> ++(rev(y), rev(x))

rev(++(x,x)) -> rev(x)

innermost

The following dependency pairs can be strictly oriented:

REV(++(x,x)) -> REV(x)

REV(++(x,y)) -> REV(x)

REV(++(x,y)) -> REV(y)

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(REV(x)_{1})= 1 + x _{1}_{ }^{ }_{ }^{ }POL(++(x)_{1}, x_{2})= 1 + x _{1}+ x_{2}_{ }^{ }

resulting in one new DP problem.

R

↳DPs

→DP Problem 1

↳Polo

→DP Problem 2

↳Dependency Graph

rev(a) -> a

rev(b) -> b

rev(++(x,y)) -> ++(rev(y), rev(x))

rev(++(x,x)) -> rev(x)

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes