YES Confluence Proof

Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

b(a(b(b(x)))) b(b(b(a(b(x)))))
b(a(a(b(b(x))))) b(a(b(b(a(a(b(x)))))))
b(a(a(a(b(b(x)))))) b(a(a(b(b(a(a(a(b(x)))))))))

Proof

1 Strongly closed

Confluence is proven since the TRS is strongly closed. The joins can be performed within 4 step(s).

Tool configuration

ACP