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