**Term Rewriting System** *R*:

**[***x*, *y*, *z*]

f(0, 1, *x*) -> f(*x*, *x*, *x*)

f(*x*, *y*, *z*) -> 2

0 -> 2

1 -> 2

g(*x*, *x*, *y*) -> *y*

g(*x*, *y*, *y*) -> *x*

**Innermost Termination** of *R* to be shown.

R

↳**Dependency Pair Analysis**

*R* contains the following *Dependency Pairs:
*

F(0, 1, *x*) -> F(*x*, *x*, *x*)

*R* contains **no** SCCs.

**Innermost Termination** of *R* successfully shown.

Duration:

0:00 minutes