Certification Problem

Input (COPS 958)

We consider the TRS containing the following rules:

b(b(b(x))) a(a(a(x))) (1)
a(a(a(x))) b(a(b(x))) (2)

The underlying signature is as follows:

{b/1, a/1}

Property / Task

Prove or disprove confluence.

Answer / Result

No.

Proof (by csi @ CoCo 2022)

1 Non-Joinable Fork

The system is not confluent due to the following forking derivations.

t0 = b(b(b(b(b(b(x5))))))
b(b(b(a(a(a(x5))))))
a(a(a(a(a(a(x5))))))
a(b(a(b(a(a(x5))))))
= t3

t0 = b(b(b(b(b(b(x5))))))
a(a(a(b(b(b(x5))))))
a(a(a(a(a(a(x5))))))
a(a(b(a(b(a(x5))))))
= t3

The two resulting terms cannot be joined for the following reason: