Certification Problem
Input (COPS 84)
We consider the TRS containing the following rules:
| a |
→ |
b |
(1) |
|
f(a) |
→ |
g(a) |
(2) |
|
f(b) |
→ |
g(b) |
(3) |
The underlying signature is as follows:
{a/0, b/0, f/1, g/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
2
step(s).