**Term Rewriting System** *R*:

**[***x*]

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

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

R

↳**Dependency Pair Analysis**

*R* contains the following *Dependency Pairs:
*

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

Furthermore, *R* contains one SCC.

R

↳DPs

→DP Problem 1

↳**Remaining Obligation(s)**

The following remains to be proven:

**Dependency Pair:**

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

**Rule:**

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

**Strategy:**

innermost

**Innermost Termination** of *R* could not be shown.

Duration:

0:00 minutes