NO
Non-Confluence Proof
Non-Confluence Proof
by Hakusan
Input
The rewrite relation of the following TRS is considered.
| c |
→ |
a |
| b |
→ |
f(h(a,a)) |
|
f(a) |
→ |
b |
|
h(a,b) |
→ |
a |
Proof
1 Non-Joinable Fork
The system is not confluent due to the following forking derivations.
| t0
|
= |
h(a,b) |
|
→2
|
h(a,f(h(a,a))) |
|
= |
t1
|
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