Certification Problem
Input (COPS 86)
We consider the TRS containing the following rules:
|
f(x) |
→ |
g(x) |
(1) |
|
f(x) |
→ |
h(f(x)) |
(2) |
|
h(f(x)) |
→ |
h(g(x)) |
(3) |
|
g(x) |
→ |
h(g(x)) |
(4) |
The underlying signature is as follows:
{f/1, g/1, h/1}Property / Task
Prove or disprove confluence.Answer / Result
Yes.Proof (by ACP @ CoCo 2020)
1 Strongly closed
Confluence is proven since the TRS is strongly closed.
The joins can be performed using
3
step(s).