NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

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

t0 = b(b(b(a(b(a(x114))))))
1.1.1 b(b(b(b(b(b(a(x114)))))))
1.1.1 b(b(b(a(a(a(b(x114)))))))
ε a(a(a(b(a(a(b(x114)))))))
1.1 a(a(b(b(b(a(a(b(x114))))))))
1.1 a(a(a(a(a(b(a(b(x114))))))))
1.1.1.1 a(a(a(a(b(b(b(a(b(x114)))))))))
1.1.1.1 a(a(a(a(a(a(a(b(b(x114)))))))))
= t7

t0 = b(b(b(a(b(a(x114))))))
ε a(a(a(b(b(a(x114))))))
= t1

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

Tool configuration

csi