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