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