f(f(a, a),

R

↳Overlay and local confluence Check

The TRS is overlay and locally confluent (all critical pairs are trivially joinable).Hence, we can switch to innermost.

R

↳OC

→TRS2

↳Dependency Pair Analysis

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

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

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

Furthermore,

R

↳OC

→TRS2

↳DPs

→DP Problem 1

↳Semantic Labelling

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

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

innermost

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

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

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

R

↳OC

→TRS2

↳DPs

→DP Problem 1

↳SemLab

...

→DP Problem 2

↳Modular Removal of Rules

**F _{01}(f_{11}(a, a), x) -> F_{00}(f_{11}(x, a), f_{10}(a, f_{11}(a, a)))**

f_{00}(f_{11}(a, a),x) -> f_{00}(f_{01}(x, a), f_{10}(a, f_{11}(a, a)))

f_{01}(f_{11}(a, a),x) -> f_{00}(f_{11}(x, a), f_{10}(a, f_{11}(a, a)))

innermost

We have the following set of usable rules: none

To remove rules and DPs from this DP problem we used the following monotonic and C

Polynomial interpretation:

_{ }^{ }POL(f_11(x)_{1}, x_{2})= x _{1}+ x_{2}_{ }^{ }_{ }^{ }POL(F_00(x)_{1}, x_{2})= x _{1}+ x_{2}_{ }^{ }_{ }^{ }POL(f_10(x)_{1}, x_{2})= x _{1}+ x_{2}_{ }^{ }_{ }^{ }POL(F_01(x)_{1}, x_{2})= x _{1}+ x_{2}_{ }^{ }_{ }^{ }POL(a)= 0 _{ }^{ }

We have the following set D of usable symbols: {f

No Dependency Pairs can be deleted.

2 non usable rules have been deleted.

The result of this processor delivers one new DP problem.

R

↳OC

→TRS2

↳DPs

→DP Problem 1

↳SemLab

...

→DP Problem 3

↳Unlabel

**F _{00}(f_{11}(a, a), x) -> F_{01}(x, a)**

none

innermost

Removed all semantic labels.

R

↳OC

→TRS2

↳DPs

→DP Problem 1

↳SemLab

...

→DP Problem 4

↳Semantic Labelling

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

none

innermost

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

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

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

R

↳OC

→TRS2

↳DPs

→DP Problem 1

↳SemLab

...

→DP Problem 5

↳Unlabel

**F _{10}(f_{00}(a, a), x) -> F_{10}(f_{00}(x, a), f_{01}(a, f_{00}(a, a)))**

none

innermost

Removed all semantic labels.

R

↳OC

→TRS2

↳DPs

→DP Problem 1

↳SemLab

...

→DP Problem 6

↳Instantiation Transformation

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

none

innermost

On this DP problem, an Instantiation SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in no new DP problems.

Duration:

0:00 minutes