a(b(

R

↳Dependency Pair Analysis

A(b(x)) -> A(x)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

**A(b( x)) -> A(x)**

a(b(x)) -> b(b(a(x)))

innermost

The following dependency pair can be strictly oriented:

A(b(x)) -> A(x)

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

resulting in one new DP problem.

Used Argument Filtering System:

A(x) -> A(_{1}x)_{1}

b(x) -> b(_{1}x)_{1}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

a(b(x)) -> b(b(a(x)))

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes