NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

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

t0 = h(f(a),a)
→1.1 h(f(h(h(h(f(a),b),h(c,c)),f(b))),a)
= t1

t0 = h(f(a),a)
→ε h(c,a)
= t1

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

Tool configuration

csi