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