f(g(

R

↳Dependency Pair Analysis

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

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

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

The following dependency pair can be strictly oriented:

F(g(x,y), f(y,y)) -> F(g(y,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:

{F, f}

resulting in one new DP problem.

Used Argument Filtering System:

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

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

f(x,_{1}x) -> f(_{2}x,_{1}x)_{2}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

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

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes