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