YES
Confluence Proof
Confluence Proof
by ACP
Input
The rewrite relation of the following TRS is considered.
|
W(B(x)) |
→ |
W(x) |
|
B(I(x)) |
→ |
J(x) |
|
W(I(x)) |
→ |
W(J(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