rev(

r1(empty,

r1(cons(

R

↳Removing Redundant Rules

Removing the following rules from

rev(ls) -> r1(ls, empty)

where the Polynomial interpretation:

was used.

_{ }^{ }POL(rev(x)_{1})= 1 + x _{1}_{ }^{ }_{ }^{ }POL(cons(x)_{1}, x_{2})= x _{1}+ x_{2}_{ }^{ }_{ }^{ }POL(r1(x)_{1}, x_{2})= x _{1}+ x_{2}_{ }^{ }_{ }^{ }POL(empty)= 0 _{ }^{ }

Not all Rules of

R

↳RRRPolo

→TRS2

↳Removing Redundant Rules

Removing the following rules from

r1(empty,a) ->a

where the Polynomial interpretation:

was used.

_{ }^{ }POL(cons(x)_{1}, x_{2})= x _{1}+ x_{2}_{ }^{ }_{ }^{ }POL(r1(x)_{1}, x_{2})= 1 + x _{1}+ x_{2}_{ }^{ }_{ }^{ }POL(empty)= 0 _{ }^{ }

Not all Rules of

R

↳RRRPolo

→TRS2

↳RRRPolo

→TRS3

↳Removing Redundant Rules

Removing the following rules from

r1(cons(x,k),a) -> r1(k, cons(x,a))

where the Polynomial interpretation:

was used.

_{ }^{ }POL(cons(x)_{1}, x_{2})= 1 + x _{1}+ x_{2}_{ }^{ }_{ }^{ }POL(r1(x)_{1}, x_{2})= 2·x _{1}+ x_{2}_{ }^{ }

All Rules of

R

↳RRRPolo

→TRS2

↳RRRPolo

→TRS3

↳RRRPolo

...

→TRS4

↳Overlay and local confluence Check

The TRS is overlay and locally confluent (all critical pairs are trivially joinable).Hence, we can switch to innermost.

R

↳RRRPolo

→TRS2

↳RRRPolo

→TRS3

↳RRRPolo

...

→TRS5

↳Dependency Pair Analysis

Duration:

0:00 minutes