f(

f(g(

R

↳Dependency Pair Analysis

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

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

f(x,x) -> a

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

innermost

The following dependency pair can be strictly oriented:

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

There are no usable rules for innermost w.r.t. to the AFS 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) -> F(_{2}x,_{1}x)_{2}

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

f(x,x) -> a

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

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes