NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a → f(a,b)
f(a,b) → f(b,a)

Proof

1 Non-Joinable Fork

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

t0 = f(a,b)
→1 f(f(a,b),b)
→1 f(f(b,a),b)
→1.2 f(f(b,f(a,b)),b)
= t3

t0 = f(a,b)
→ε f(b,a)
→2 f(b,f(a,b))
→2 f(b,f(b,a))
= t3

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

Tool configuration

csi