NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

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

t0 = a(f3)
ε c(f3)
= t1

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

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

Tool configuration

csi