NO Non-Confluence Proof

Non-Confluence Proof

by Hakusan

Input

The rewrite relation of the following TRS is considered.

f(f(x)) g(x)

Proof

1 Non-Joinable Fork

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

t0 = f(f(f(x1)))
1 f(g(x1))
= t1

t0 = f(f(f(x1)))
ε g(f(x1))
= t1

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

Tool configuration

Hakusan