NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

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

t0 = c(f15)
ε c(b(f15))
ε c(a(b(f15)))
= t2

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

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

Tool configuration

csi