Term Rewriting System R:
[x]
f(a, h(x)) -> f(g(x), h(x))
h(g(x)) -> h(a)
h(h(x)) -> x
g(h(x)) -> g(x)
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(a, h(x)) -> F(g(x), h(x))
F(a, h(x)) -> G(x)
H(g(x)) -> H(a)
G(h(x)) -> G(x)
Furthermore, R contains two SCCs.
R
↳DPs
→DP Problem 1
↳Polynomial Ordering
→DP Problem 2
↳Remaining
Dependency Pair:
G(h(x)) -> G(x)
Rules:
f(a, h(x)) -> f(g(x), h(x))
h(g(x)) -> h(a)
h(h(x)) -> x
g(h(x)) -> g(x)
The following dependency pair can be strictly oriented:
G(h(x)) -> G(x)
There are no usable rules using the Ce-refinement that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:
| POL(G(x1)) | = x1 |
| POL(h(x1)) | = 1 + x1 |
resulting in one new DP problem.
R
↳DPs
→DP Problem 1
↳Polo
→DP Problem 3
↳Dependency Graph
→DP Problem 2
↳Remaining
Dependency Pair:
Rules:
f(a, h(x)) -> f(g(x), h(x))
h(g(x)) -> h(a)
h(h(x)) -> x
g(h(x)) -> g(x)
Using the Dependency Graph resulted in no new DP problems.
R
↳DPs
→DP Problem 1
↳Polo
→DP Problem 2
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pair:
F(a, h(x)) -> F(g(x), h(x))
Rules:
f(a, h(x)) -> f(g(x), h(x))
h(g(x)) -> h(a)
h(h(x)) -> x
g(h(x)) -> g(x)
Termination of R could not be shown.
Duration:
0:00 minutes