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