a(a(f(

f(a(

f(b(

R

↳Dependency Pair Analysis

A(a(f(x,y))) -> F(a(b(a(b(a(x))))), a(b(a(b(a(y))))))

A(a(f(x,y))) -> A(b(a(b(a(x)))))

A(a(f(x,y))) -> A(b(a(x)))

A(a(f(x,y))) -> A(x)

A(a(f(x,y))) -> A(b(a(b(a(y)))))

A(a(f(x,y))) -> A(b(a(y)))

A(a(f(x,y))) -> A(y)

F(a(x), a(y)) -> A(f(x,y))

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

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

a(a(f(x,y))) -> f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))

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

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

innermost

The following dependency pairs can be strictly oriented:

A(a(f(x,y))) -> A(y)

A(a(f(x,y))) -> A(x)

The following usable rules for innermost can be oriented:

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

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

a(a(f(x,y))) -> f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))

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}

A(x) ->_{1}x_{1}

a(x) ->_{1}x_{1}

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

b(x) ->_{1}x_{1}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Remaining Obligation(s)

The following remains to be proven:

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

a(a(f(x,y))) -> f(a(b(a(b(a(x))))), a(b(a(b(a(y))))))

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

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

innermost

Duration:

0:02 minutes