YES
Confluence Proof
Confluence Proof
by ACP
Input
The rewrite relation of the following TRS is considered.
|
F(H(x),y) |
→ |
F(H(x),I(I(y))) |
|
F(x,G(y)) |
→ |
F(I(x),G(y)) |
|
I(x) |
→ |
x |
Proof
1 Strongly closed
Confluence is proven since the TRS is strongly closed.
The joins can be performed within 5 step(s).
Tool configuration
ACP