We consider the TRS containing the following rules:
| g(f(a)) | → | f(g(f(a))) | (1) |
| g(f(a)) | → | f(f(a)) | (2) |
| f(f(a)) | → | f(a) | (3) |
The underlying signature is as follows:
{g/1, f/1, a/0}To prove that the TRS is (non-)confluent, we show (non-)confluence of the following modified system:
| g(f(a)) | → | f(f(a)) | (2) |
| f(f(a)) | → | f(a) | (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.