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