f(g(

R

↳Dependency Pair Analysis

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

F(g(x)) -> F(x)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

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

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

The following dependency pair can be strictly oriented:

F(g(x)) -> F(x)

There are no usable rules 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) -> F(_{1}x)_{1}

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

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

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes