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