rev(a) -> a

rev(b) -> b

rev(++(

rev(++(

R

↳Removing Redundant Rules

Removing the following rules from

rev(a) -> a

where the Polynomial interpretation:

was used.

_{ }^{ }POL(rev(x)_{1})= 2·x _{1}_{ }^{ }_{ }^{ }POL(b)= 0 _{ }^{ }_{ }^{ }POL(++(x)_{1}, x_{2})= x _{1}+ x_{2}_{ }^{ }_{ }^{ }POL(a)= 1 _{ }^{ }

Not all Rules of

R

↳RRRPolo

→TRS2

↳Removing Redundant Rules

Removing the following rules from

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

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

where the Polynomial interpretation:

was used.

_{ }^{ }POL(rev(x)_{1})= 2·x _{1}_{ }^{ }_{ }^{ }POL(b)= 0 _{ }^{ }_{ }^{ }POL(++(x)_{1}, x_{2})= 1 + x _{1}+ x_{2}_{ }^{ }

Not all Rules of

R

↳RRRPolo

→TRS2

↳RRRPolo

→TRS3

↳Removing Redundant Rules

Removing the following rules from

rev(b) -> b

where the Polynomial interpretation:

was used.

_{ }^{ }POL(rev(x)_{1})= 1 + x _{1}_{ }^{ }_{ }^{ }POL(b)= 0 _{ }^{ }

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