YES
Confluence Proof
Confluence Proof
by ACP
Input
The rewrite relation of the following TRS is considered.
|
F(G(x,A,B)) |
→ |
x |
|
G(F(H(C,D)),x,y) |
→ |
H(K1(x),K2(y)) |
|
K1(A) |
→ |
C |
|
K2(B) |
→ |
D |
Proof
1 Development Closed
Confluence is proven since the TRS is development closed.
Tool configuration
ACP