f(

f(

R

↳Dependency Pair Analysis

F(x, g(y)) -> F(g(x),y)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

**F( x, g(y)) -> F(g(x), y)**

f(x, a) ->x

f(x, g(y)) -> f(g(x),y)

The following dependency pair can be strictly oriented:

F(x, g(y)) -> F(g(x),y)

There are no usable rules using the Ce-refinement that need to be oriented.

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

trivial

resulting in one new DP problem.

Used Argument Filtering System:

F(x,_{1}x) ->_{2}x_{2}

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

f(x, a) ->x

f(x, g(y)) -> f(g(x),y)

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes