f(a, f(a,

R

↳Dependency Pair Analysis

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Semantic Labelling

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

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

Using Semantic Labelling, the DP problem could be transformed. The following model was found:

F(x_{0}, x_{1})= 1 a= 1 f(x_{0}, x_{1})= 0

From the dependency graph we obtain 0 (labeled) SCCs which each result in correspondingDP problem.

Duration:

0:00 minutes