f(a, f(

R

↳Dependency Pair Analysis

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

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Polynomial Ordering

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

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

The following dependency pair can be strictly oriented:

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

Additionally, the following usable rule w.r.t. to the implicit AFS can be oriented:

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

Used ordering: Polynomial ordering with Polynomial interpretation:

_{ }^{ }POL(a)= 1 _{ }^{ }_{ }^{ }POL(f(x)_{1}, x_{2})= 0 _{ }^{ }_{ }^{ }POL(F(x)_{1}, x_{2})= x _{1}_{ }^{ }

resulting in one new DP problem.

R

↳DPs

→DP Problem 1

↳Polo

→DP Problem 2

↳Remaining Obligation(s)

The following remains to be proven:

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

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

Duration:

0:00 minutes