YES
Confluence Proof
Confluence Proof
by csi
Input
The rewrite relation of the following TRS is considered.
|
a(x) |
→ |
b(x) |
|
a(b(x)) |
→ |
b(a(c(a(x)))) |
|
b(x) |
→ |
c(x) |
|
c(c(x)) |
→ |
x |
Proof
1 Decreasing Diagrams
1.1 Relative Termination Proof
The duplicating rules (R) terminate relative to the other rules (S).
1.1.1 R is empty
There are no rules in the TRS R. Hence, R/S is relative terminating.
1.2 Rule Labeling
Confluence is proven, because all critical peaks can be joined decreasingly
using the following rule labeling function (rules that are not shown have label 0).
-
a(x)→b(x) ↦ 0
-
a(b(x))→b(a(c(a(x)))) ↦ 1
-
b(x)→c(x) ↦ 0
-
c(c(x))→x ↦ 0
All critical pairs are joinable:
-
b(b(x))←b(b(c(c(x))))←b(b(c(b(x))))←b(a(c(b(x))))←b(a(c(a(x))))
-
b(b(x))←b(b(c(c(x))))←b(b(c(b(x))))←b(b(c(a(x))))←b(a(c(a(x))))
-
b(b(x))←b(b(c(c(x))))←b(a(c(c(x))))←b(a(c(b(x))))←b(a(c(a(x))))
-
b(b(x))←b(c(c(b(x))))←b(b(c(b(x))))←b(a(c(b(x))))←b(a(c(a(x))))
-
b(b(x))←b(c(c(b(x))))←b(b(c(b(x))))←b(b(c(a(x))))←b(a(c(a(x))))
-
b(b(x))←b(c(c(b(x))))←b(c(c(a(x))))←b(b(c(a(x))))←b(a(c(a(x))))
-
b(b(x))←b(a(x))←b(a(c(c(x))))←b(a(c(b(x))))←b(a(c(a(x))))
-
b(b(x))←b(a(x))←b(c(c(a(x))))←b(b(c(a(x))))←b(a(c(a(x))))
-
b(a(c(a(x26))))→b(a(c(b(x26))))→b(b(c(b(x26))))→b(b(c(c(x26))))→b(b(x26))
-
b(a(c(a(x26))))→b(b(c(a(x26))))→b(b(c(b(x26))))→b(b(c(c(x26))))→b(b(x26))
-
b(a(c(a(x26))))→b(a(c(b(x26))))→b(a(c(c(x26))))→b(b(c(c(x26))))→b(b(x26))
-
b(a(c(a(x26))))→b(a(c(b(x26))))→b(b(c(b(x26))))→b(c(c(b(x26))))→b(b(x26))
-
b(a(c(a(x26))))→b(b(c(a(x26))))→b(b(c(b(x26))))→b(c(c(b(x26))))→b(b(x26))
-
b(a(c(a(x26))))→b(b(c(a(x26))))→b(c(c(a(x26))))→b(c(c(b(x26))))→b(b(x26))
-
b(a(c(a(x26))))→b(a(c(b(x26))))→b(a(c(c(x26))))→b(a(x26))→b(b(x26))
-
b(a(c(a(x26))))→b(b(c(a(x26))))→b(c(c(a(x26))))→b(a(x26))→b(b(x26))
-
a(c(x))→b(c(x))←b(c(c(c(x))))←b(b(c(c(x))))←b(b(c(b(x))))←b(a(c(b(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(c(c(c(x))))←b(b(c(c(x))))←b(b(c(b(x))))←b(b(c(a(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(c(c(c(x))))←b(b(c(c(x))))←b(a(c(c(x))))←b(a(c(b(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(c(c(c(x))))←b(c(c(b(x))))←b(b(c(b(x))))←b(a(c(b(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(c(c(c(x))))←b(c(c(b(x))))←b(b(c(b(x))))←b(b(c(a(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(c(c(c(x))))←b(c(c(b(x))))←b(c(c(a(x))))←b(b(c(a(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(b(x))←b(b(c(c(x))))←b(b(c(b(x))))←b(a(c(b(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(b(x))←b(b(c(c(x))))←b(b(c(b(x))))←b(b(c(a(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(b(x))←b(b(c(c(x))))←b(a(c(c(x))))←b(a(c(b(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(b(x))←b(c(c(b(x))))←b(b(c(b(x))))←b(a(c(b(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(b(x))←b(c(c(b(x))))←b(b(c(b(x))))←b(b(c(a(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(b(x))←b(c(c(b(x))))←b(c(c(a(x))))←b(b(c(a(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(b(x))←b(a(x))←b(a(c(c(x))))←b(a(c(b(x))))←b(a(c(a(x))))
-
a(c(x))→b(c(x))←b(b(x))←b(a(x))←b(c(c(a(x))))←b(b(c(a(x))))←b(a(c(a(x))))
-
c(x28)
Tool configuration
csi
- version: csi 1.2.5 [hg: unknown]
- strategy:
(if left-linear then (cr -dup;(( lpo -quasi || (matrix -dim 1 -ib 3 -ob 4 | matrix -dim 2 -ib 2 -ob 2 | matrix -dim 3 -ib 1 -ob 2 | arctic -dim 2 -ib 2 -ob 2) || (if duplicating then fail else (bounds -rt || bounds -rt -qc))[1] || poly -ib 2 -ob 4 -nl2 -heuristic 1 || fail )[5]*);shift -lstar);(rule_labeling | rule_labeling -left)?;decreasing else fail)!