f(g(

R

↳Dependency Pair Analysis

F(g(X),Y) -> F(X, f(g(X),Y))

F(g(X),Y) -> F(g(X),Y)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

**F(g( X), Y) -> F(g(X), Y)**

f(g(X),Y) -> f(X, f(g(X),Y))

The following dependency pair can be strictly oriented:

F(g(X),Y) -> F(X, f(g(X),Y))

The following usable rule w.r.t. to the AFS can be oriented:

f(g(X),Y) -> f(X, f(g(X),Y))

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}

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Remaining Obligation(s)

The following remains to be proven:

**F(g( X), Y) -> F(g(X), Y)**

f(g(X),Y) -> f(X, f(g(X),Y))

Duration:

0:00 minutes