NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

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

t0 = a
→ε b
= t1

t0 = a
→ε f(a)
→1 f(b)
= t2

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

Tool configuration

csi