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