NO Non-Confluence Proof

Non-Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

a b
a f(a)
b f(f(b))

Proof

1 Non-Joinable Fork

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

t0 = a
ε f(a)
1 f(b)
= t2

t0 = a
ε b
= t1

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

Tool configuration

ACP