YES
Confluence Proof
Confluence Proof
by ACP
Input
The rewrite relation of the following TRS is considered.
|
f(x) |
→ |
g(k(x)) |
|
f(x) |
→ |
a |
|
g(x) |
→ |
a |
|
k(a) |
→ |
k(k(a)) |
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