NO Non-Confluence Proof

Non-Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

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

t0 = a(c_1)
ε g(g(b(c_1)))
= t1

t0 = a(c_1)
ε g(c(c_1))
= t1

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

Tool configuration

ACP