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