We consider the TRS containing the following rules:
| a | → | b | (1) |
| f(a) | → | g(a) | (2) |
| f(b) | → | g(b) | (3) |
The underlying signature is as follows:
{a/0, b/0, f/1, g/1}To prove that the TRS is (non-)confluent, we show (non-)confluence of the following modified system:
| a | → | b | (1) |
| f(b) | → | g(b) | (3) |
All redundant rules that were added or removed can be simulated in 4 steps .
Confluence is proven using the following terminating critical-pair-closing-system R:
There are no rules.
There are no rules in the TRS. Hence, it is terminating.