Certification Problem
Input (COPS 35)
We consider the TRS containing the following rules:
|
f(a,a) |
→ |
g(f(a,a)) |
(1) |
| a |
→ |
b |
(2) |
|
f(b,x) |
→ |
g(f(x,x)) |
(3) |
|
f(x,b) |
→ |
g(f(x,x)) |
(4) |
The underlying signature is as follows:
{f/2, a/0, g/1, b/0}Property / Task
Prove or disprove confluence.Answer / Result
Yes.Proof (by ACP @ CoCo 2023)
1 Development Closed
Confluence is proven since the TRS is development closed.
The joins can be performed using
1 development
step(s).