f(h(

g(i(

h(a) -> b

i(a) -> b

R

↳Dependency Pair Analysis

F(h(x)) -> F(i(x))

F(h(x)) -> I(x)

G(i(x)) -> G(h(x))

G(i(x)) -> H(x)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳AFS

**F(h( x)) -> F(i(x))**

f(h(x)) -> f(i(x))

g(i(x)) -> g(h(x))

h(a) -> b

i(a) -> b

The following dependency pair can be strictly oriented:

F(h(x)) -> F(i(x))

The following usable rule using the Ce-refinement can be oriented:

i(a) -> b

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

h > {i, b}

resulting in one new DP problem.

Used Argument Filtering System:

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

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 3

↳Dependency Graph

→DP Problem 2

↳AFS

f(h(x)) -> f(i(x))

g(i(x)) -> g(h(x))

h(a) -> b

i(a) -> b

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Argument Filtering and Ordering

**G(i( x)) -> G(h(x))**

f(h(x)) -> f(i(x))

g(i(x)) -> g(h(x))

h(a) -> b

i(a) -> b

The following dependency pair can be strictly oriented:

G(i(x)) -> G(h(x))

The following usable rule using the Ce-refinement can be oriented:

h(a) -> b

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

i > h

{a, b}

resulting in one new DP problem.

Used Argument Filtering System:

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

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 4

↳Dependency Graph

f(h(x)) -> f(i(x))

g(i(x)) -> g(h(x))

h(a) -> b

i(a) -> b

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes