NO Non-Confluence Proof

Non-Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

c a
b f(h(a,a))
f(a) b
h(a,b) a

Proof

1 Non-Joinable Fork

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

t0 = h(c,b)
1 h(a,b)
2 h(a,f(h(a,a)))
= t2

t0 = h(c,b)
1 h(a,b)
ε a
= t2

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

Tool configuration

ACP