YES Confluence Proof

Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

0(1(2(3(4(x))))) → 0(2(1(3(4(x)))))
0(5(1(2(4(3(x)))))) → 0(5(2(1(4(3(x))))))
0(5(2(4(1(3(x)))))) → 0(1(5(2(4(3(x))))))
0(5(3(1(2(4(x)))))) → 0(1(5(3(2(4(x))))))
0(5(4(1(3(2(x)))))) → 0(5(4(3(1(2(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