NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a(x) → b(x)
a(x) → c(c(x))
b(x) → g(b(x))
c(x) → c(x)

Proof

1 Non-Joinable Fork

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

t0 = a(f4)
→ε b(f4)
= t1

t0 = a(f4)
→ε c(c(f4))
= t1

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

Tool configuration

csi