Certification Problem
Input (COPS 1041)
We consider two TRSs R and S where R contains the rules
|
h(a,b) |
→ |
a |
(1) |
|
f(c) |
→ |
f(c) |
(2) |
| c |
→ |
h(a,h(b,b)) |
(3) |
and S contains the following rules:
|
f(g(f(x))) |
→ |
x |
(4) |
|
f(g(x)) |
→ |
g(f(x)) |
(5) |
The underlying signature is as follows:
{a/0, b/0, c/0, f/1, g/1, h/2}Property / Task
Prove or disprove commutation.Answer / Result
Yes.Proof (by ACP @ CoCo 2023)
1 Development Closed
Commutation is proven since the TRSs are development closed.
The joins can be performed using
5
step(s).