NO
Non-Confluence Proof
Non-Confluence Proof
by Hakusan
Input
The rewrite relation of the following TRS is considered.
| c |
→ |
a |
|
f(f(c)) |
→ |
c |
|
f(c) |
→ |
a |
Proof
1 Non-Joinable Fork
The system is not confluent due to the following forking derivations.
The two resulting terms cannot be joined for the following reason:
- When applying the cap-function on both terms (where variables may be treated like constants)
then the resulting terms do not unify.
Tool configuration
Hakusan