**Term Rewriting System** *R*:

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

f(*x*, *y*) -> h(*x*, *y*)

f(*x*, *y*) -> h(*y*, *x*)

h(*x*, *x*) -> *x*

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

R

↳**Dependency Pair Analysis**

*R* contains the following *Dependency Pairs:
*

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

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

*R* contains **no** SCCs.

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

Duration:

0:00 minutes