Certification Problem
Input (TPDB SRS_Standard/Zantema_04/z087)
The rewrite relation of the following TRS is considered.
|
a(a(x1)) |
→ |
c(b(x1)) |
(1) |
|
b(b(x1)) |
→ |
a(c(x1)) |
(2) |
|
c(c(x1)) |
→ |
b(a(x1)) |
(3) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by matchbox @ termCOMP 2023)
1 Closure Under Flat Contexts
Using the flat contexts
{c(☐), b(☐), a(☐)}
We obtain the transformed TRS
|
c(a(a(x1))) |
→ |
c(c(b(x1))) |
(4) |
|
c(b(b(x1))) |
→ |
c(a(c(x1))) |
(5) |
|
c(c(c(x1))) |
→ |
c(b(a(x1))) |
(6) |
|
b(a(a(x1))) |
→ |
b(c(b(x1))) |
(7) |
|
b(b(b(x1))) |
→ |
b(a(c(x1))) |
(8) |
|
b(c(c(x1))) |
→ |
b(b(a(x1))) |
(9) |
|
a(a(a(x1))) |
→ |
a(c(b(x1))) |
(10) |
|
a(b(b(x1))) |
→ |
a(a(c(x1))) |
(11) |
|
a(c(c(x1))) |
→ |
a(b(a(x1))) |
(12) |
1.1 Semantic Labeling
The following interpretations form a
model
of the rules.
As carrier we take the set
{0,1,2}.
Symbols are labeled by the interpretation of their arguments using the interpretations
(modulo 3):
| [c(x1)] |
= |
3x1 + 0 |
| [b(x1)] |
= |
3x1 + 1 |
| [a(x1)] |
= |
3x1 + 2 |
We obtain the labeled TRS
|
a2(a2(a2(x1))) |
→ |
a0(c1(b2(x1))) |
(13) |
|
a2(a2(a0(x1))) |
→ |
a0(c1(b0(x1))) |
(14) |
|
a2(a2(a1(x1))) |
→ |
a0(c1(b1(x1))) |
(15) |
|
c2(a2(a2(x1))) |
→ |
c0(c1(b2(x1))) |
(16) |
|
c2(a2(a0(x1))) |
→ |
c0(c1(b0(x1))) |
(17) |
|
c2(a2(a1(x1))) |
→ |
c0(c1(b1(x1))) |
(18) |
|
b2(a2(a2(x1))) |
→ |
b0(c1(b2(x1))) |
(19) |
|
b2(a2(a0(x1))) |
→ |
b0(c1(b0(x1))) |
(20) |
|
b2(a2(a1(x1))) |
→ |
b0(c1(b1(x1))) |
(21) |
|
a1(b1(b2(x1))) |
→ |
a2(a0(c2(x1))) |
(22) |
|
a1(b1(b0(x1))) |
→ |
a2(a0(c0(x1))) |
(23) |
|
a1(b1(b1(x1))) |
→ |
a2(a0(c1(x1))) |
(24) |
|
c1(b1(b2(x1))) |
→ |
c2(a0(c2(x1))) |
(25) |
|
c1(b1(b0(x1))) |
→ |
c2(a0(c0(x1))) |
(26) |
|
c1(b1(b1(x1))) |
→ |
c2(a0(c1(x1))) |
(27) |
|
b1(b1(b2(x1))) |
→ |
b2(a0(c2(x1))) |
(28) |
|
b1(b1(b0(x1))) |
→ |
b2(a0(c0(x1))) |
(29) |
|
b1(b1(b1(x1))) |
→ |
b2(a0(c1(x1))) |
(30) |
|
a0(c0(c2(x1))) |
→ |
a1(b2(a2(x1))) |
(31) |
|
a0(c0(c0(x1))) |
→ |
a1(b2(a0(x1))) |
(32) |
|
a0(c0(c1(x1))) |
→ |
a1(b2(a1(x1))) |
(33) |
|
c0(c0(c2(x1))) |
→ |
c1(b2(a2(x1))) |
(34) |
|
c0(c0(c0(x1))) |
→ |
c1(b2(a0(x1))) |
(35) |
|
c0(c0(c1(x1))) |
→ |
c1(b2(a1(x1))) |
(36) |
|
b0(c0(c2(x1))) |
→ |
b1(b2(a2(x1))) |
(37) |
|
b0(c0(c0(x1))) |
→ |
b1(b2(a0(x1))) |
(38) |
|
b0(c0(c1(x1))) |
→ |
b1(b2(a1(x1))) |
(39) |
1.1.1 Rule Removal
Using the
matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1
| [c0(x1)] |
= |
x1 +
|
| [c1(x1)] |
= |
x1 +
|
| [c2(x1)] |
= |
x1 +
|
| [b0(x1)] |
= |
x1 +
|
| [b1(x1)] |
= |
x1 +
|
| [b2(x1)] |
= |
x1 +
|
| [a0(x1)] |
= |
x1 +
|
| [a1(x1)] |
= |
x1 +
|
| [a2(x1)] |
= |
x1 +
|
all of the following rules can be deleted.
|
a2(a2(a2(x1))) |
→ |
a0(c1(b2(x1))) |
(13) |
|
a2(a2(a0(x1))) |
→ |
a0(c1(b0(x1))) |
(14) |
|
a2(a2(a1(x1))) |
→ |
a0(c1(b1(x1))) |
(15) |
|
c2(a2(a2(x1))) |
→ |
c0(c1(b2(x1))) |
(16) |
|
b2(a2(a2(x1))) |
→ |
b0(c1(b2(x1))) |
(19) |
|
a1(b1(b1(x1))) |
→ |
a2(a0(c1(x1))) |
(24) |
|
c1(b1(b1(x1))) |
→ |
c2(a0(c1(x1))) |
(27) |
|
b1(b1(b2(x1))) |
→ |
b2(a0(c2(x1))) |
(28) |
|
b1(b1(b0(x1))) |
→ |
b2(a0(c0(x1))) |
(29) |
|
b1(b1(b1(x1))) |
→ |
b2(a0(c1(x1))) |
(30) |
|
a0(c0(c0(x1))) |
→ |
a1(b2(a0(x1))) |
(32) |
|
c0(c0(c2(x1))) |
→ |
c1(b2(a2(x1))) |
(34) |
|
c0(c0(c0(x1))) |
→ |
c1(b2(a0(x1))) |
(35) |
|
c0(c0(c1(x1))) |
→ |
c1(b2(a1(x1))) |
(36) |
|
b0(c0(c0(x1))) |
→ |
b1(b2(a0(x1))) |
(38) |
1.1.1.1 String Reversal
Since only unary symbols occur, one can reverse all terms and obtains the TRS
|
a0(a2(c2(x1))) |
→ |
b0(c1(c0(x1))) |
(40) |
|
a1(a2(c2(x1))) |
→ |
b1(c1(c0(x1))) |
(41) |
|
a0(a2(b2(x1))) |
→ |
b0(c1(b0(x1))) |
(42) |
|
a1(a2(b2(x1))) |
→ |
b1(c1(b0(x1))) |
(43) |
|
b2(b1(a1(x1))) |
→ |
c2(a0(a2(x1))) |
(44) |
|
b0(b1(a1(x1))) |
→ |
c0(a0(a2(x1))) |
(45) |
|
b2(b1(c1(x1))) |
→ |
c2(a0(c2(x1))) |
(46) |
|
b0(b1(c1(x1))) |
→ |
c0(a0(c2(x1))) |
(47) |
|
c2(c0(a0(x1))) |
→ |
a2(b2(a1(x1))) |
(48) |
|
c1(c0(a0(x1))) |
→ |
a1(b2(a1(x1))) |
(49) |
|
c2(c0(b0(x1))) |
→ |
a2(b2(b1(x1))) |
(50) |
|
c1(c0(b0(x1))) |
→ |
a1(b2(b1(x1))) |
(51) |
1.1.1.1.1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
c1#(c0(b0(x1))) |
→ |
b2#(b1(x1)) |
(52) |
|
c1#(c0(b0(x1))) |
→ |
a1#(b2(b1(x1))) |
(53) |
|
c1#(c0(a0(x1))) |
→ |
b2#(a1(x1)) |
(54) |
|
c1#(c0(a0(x1))) |
→ |
a1#(x1) |
(55) |
|
c1#(c0(a0(x1))) |
→ |
a1#(b2(a1(x1))) |
(56) |
|
c2#(c0(b0(x1))) |
→ |
b2#(b1(x1)) |
(57) |
|
c2#(c0(a0(x1))) |
→ |
b2#(a1(x1)) |
(58) |
|
c2#(c0(a0(x1))) |
→ |
a1#(x1) |
(59) |
|
b0#(b1(c1(x1))) |
→ |
c2#(x1) |
(60) |
|
b0#(b1(c1(x1))) |
→ |
a0#(c2(x1)) |
(61) |
|
b0#(b1(a1(x1))) |
→ |
a0#(a2(x1)) |
(62) |
|
b2#(b1(c1(x1))) |
→ |
c2#(x1) |
(63) |
|
b2#(b1(c1(x1))) |
→ |
c2#(a0(c2(x1))) |
(64) |
|
b2#(b1(c1(x1))) |
→ |
a0#(c2(x1)) |
(65) |
|
b2#(b1(a1(x1))) |
→ |
c2#(a0(a2(x1))) |
(66) |
|
b2#(b1(a1(x1))) |
→ |
a0#(a2(x1)) |
(67) |
|
a0#(a2(c2(x1))) |
→ |
c1#(c0(x1)) |
(68) |
|
a0#(a2(c2(x1))) |
→ |
b0#(c1(c0(x1))) |
(69) |
|
a0#(a2(b2(x1))) |
→ |
c1#(b0(x1)) |
(70) |
|
a0#(a2(b2(x1))) |
→ |
b0#(x1) |
(71) |
|
a0#(a2(b2(x1))) |
→ |
b0#(c1(b0(x1))) |
(72) |
|
a1#(a2(c2(x1))) |
→ |
c1#(c0(x1)) |
(73) |
|
a1#(a2(b2(x1))) |
→ |
c1#(b0(x1)) |
(74) |
|
a1#(a2(b2(x1))) |
→ |
b0#(x1) |
(75) |
1.1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules
Using the matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1
| [c0(x1)] |
= |
x1 +
|
| [c1(x1)] |
= |
x1 +
|
| [c2(x1)] |
= |
x1 +
|
| [b0(x1)] |
= |
x1 +
|
| [b1(x1)] |
= |
x1 +
|
| [b2(x1)] |
= |
x1 +
|
| [a0(x1)] |
= |
x1 +
|
| [a1(x1)] |
= |
x1 +
|
| [a2(x1)] |
= |
x1 +
|
| [c1#(x1)] |
= |
x1 +
|
| [c2#(x1)] |
= |
x1 +
|
| [b0#(x1)] |
= |
x1 +
|
| [b2#(x1)] |
= |
x1 +
|
| [a0#(x1)] |
= |
x1 +
|
| [a1#(x1)] |
= |
x1 +
|
together with the usable
rules
|
a0(a2(c2(x1))) |
→ |
b0(c1(c0(x1))) |
(40) |
|
a1(a2(c2(x1))) |
→ |
b1(c1(c0(x1))) |
(41) |
|
a0(a2(b2(x1))) |
→ |
b0(c1(b0(x1))) |
(42) |
|
a1(a2(b2(x1))) |
→ |
b1(c1(b0(x1))) |
(43) |
|
b2(b1(a1(x1))) |
→ |
c2(a0(a2(x1))) |
(44) |
|
b0(b1(a1(x1))) |
→ |
c0(a0(a2(x1))) |
(45) |
|
b2(b1(c1(x1))) |
→ |
c2(a0(c2(x1))) |
(46) |
|
b0(b1(c1(x1))) |
→ |
c0(a0(c2(x1))) |
(47) |
|
c2(c0(a0(x1))) |
→ |
a2(b2(a1(x1))) |
(48) |
|
c1(c0(a0(x1))) |
→ |
a1(b2(a1(x1))) |
(49) |
|
c2(c0(b0(x1))) |
→ |
a2(b2(b1(x1))) |
(50) |
|
c1(c0(b0(x1))) |
→ |
a1(b2(b1(x1))) |
(51) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
|
c1#(c0(b0(x1))) |
→ |
b2#(b1(x1)) |
(52) |
|
c1#(c0(b0(x1))) |
→ |
a1#(b2(b1(x1))) |
(53) |
|
c1#(c0(a0(x1))) |
→ |
b2#(a1(x1)) |
(54) |
|
c1#(c0(a0(x1))) |
→ |
a1#(x1) |
(55) |
|
c1#(c0(a0(x1))) |
→ |
a1#(b2(a1(x1))) |
(56) |
|
c2#(c0(b0(x1))) |
→ |
b2#(b1(x1)) |
(57) |
|
c2#(c0(a0(x1))) |
→ |
b2#(a1(x1)) |
(58) |
|
c2#(c0(a0(x1))) |
→ |
a1#(x1) |
(59) |
|
b0#(b1(c1(x1))) |
→ |
c2#(x1) |
(60) |
|
b0#(b1(c1(x1))) |
→ |
a0#(c2(x1)) |
(61) |
|
b0#(b1(a1(x1))) |
→ |
a0#(a2(x1)) |
(62) |
|
b2#(b1(c1(x1))) |
→ |
c2#(x1) |
(63) |
|
b2#(b1(c1(x1))) |
→ |
c2#(a0(c2(x1))) |
(64) |
|
b2#(b1(c1(x1))) |
→ |
a0#(c2(x1)) |
(65) |
|
b2#(b1(a1(x1))) |
→ |
c2#(a0(a2(x1))) |
(66) |
|
b2#(b1(a1(x1))) |
→ |
a0#(a2(x1)) |
(67) |
|
a0#(a2(c2(x1))) |
→ |
c1#(c0(x1)) |
(68) |
|
a0#(a2(c2(x1))) |
→ |
b0#(c1(c0(x1))) |
(69) |
|
a0#(a2(b2(x1))) |
→ |
c1#(b0(x1)) |
(70) |
|
a0#(a2(b2(x1))) |
→ |
b0#(x1) |
(71) |
|
a0#(a2(b2(x1))) |
→ |
b0#(c1(b0(x1))) |
(72) |
|
a1#(a2(c2(x1))) |
→ |
c1#(c0(x1)) |
(73) |
|
a1#(a2(b2(x1))) |
→ |
c1#(b0(x1)) |
(74) |
|
a1#(a2(b2(x1))) |
→ |
b0#(x1) |
(75) |
and
no rules
could be deleted.
1.1.1.1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.