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