Term Rewriting System R:
[]
f(a) -> f(a)
Innermost Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(a) -> F(a)
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pair:
F(a) -> F(a)
Rule:
f(a) -> f(a)
Strategy:
innermost
Innermost Termination of R could not be shown.
Duration:
0:00 minutes