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