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