NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a(b(x)) c(d(x))
d(d(x)) b(e(x))
b(x) d(c(x))
d(x) x
e(c(x)) d(a(x))
a(x) e(d(x))

Proof

1 Non-Joinable Fork

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

t0 = d(d(x140))
ε b(e(x140))
ε d(c(e(x140)))
ε c(e(x140))
= t3

t0 = d(d(x140))
ε d(x140)
ε x140
= t2

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

Tool configuration

csi