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