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