Certification Problem
Input (TPDB SRS_Relative/Zantema_06_relative/rel04)
The relative rewrite relation R/S is considered where R is the following TRS
|
b(c(a(x1))) |
→ |
d(d(x1)) |
(1) |
|
b(x1) |
→ |
c(c(x1)) |
(2) |
|
a(a(x1)) |
→ |
a(c(b(a(x1)))) |
(3) |
and S is the following TRS.
|
a(b(x1)) |
→ |
d(x1) |
(4) |
|
d(x1) |
→ |
a(b(x1)) |
(5) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by matchbox @ termCOMP 2023)
1 Closure Under Flat Contexts
Using the flat contexts
{d(☐), c(☐), b(☐), a(☐)}
We obtain the transformed TRS
|
d(b(c(a(x1)))) |
→ |
d(d(d(x1))) |
(6) |
|
d(b(x1)) |
→ |
d(c(c(x1))) |
(7) |
|
d(a(a(x1))) |
→ |
d(a(c(b(a(x1))))) |
(8) |
|
c(b(c(a(x1)))) |
→ |
c(d(d(x1))) |
(9) |
|
c(b(x1)) |
→ |
c(c(c(x1))) |
(10) |
|
c(a(a(x1))) |
→ |
c(a(c(b(a(x1))))) |
(11) |
|
b(b(c(a(x1)))) |
→ |
b(d(d(x1))) |
(12) |
|
b(b(x1)) |
→ |
b(c(c(x1))) |
(13) |
|
b(a(a(x1))) |
→ |
b(a(c(b(a(x1))))) |
(14) |
|
a(b(c(a(x1)))) |
→ |
a(d(d(x1))) |
(15) |
|
a(b(x1)) |
→ |
a(c(c(x1))) |
(16) |
|
a(a(a(x1))) |
→ |
a(a(c(b(a(x1))))) |
(17) |
|
d(a(b(x1))) |
→ |
d(d(x1)) |
(18) |
|
d(d(x1)) |
→ |
d(a(b(x1))) |
(19) |
|
c(a(b(x1))) |
→ |
c(d(x1)) |
(20) |
|
c(d(x1)) |
→ |
c(a(b(x1))) |
(21) |
|
b(a(b(x1))) |
→ |
b(d(x1)) |
(22) |
|
b(d(x1)) |
→ |
b(a(b(x1))) |
(23) |
|
a(a(b(x1))) |
→ |
a(d(x1)) |
(24) |
|
a(d(x1)) |
→ |
a(a(b(x1))) |
(25) |
1.1 Closure Under Flat Contexts
Using the flat contexts
{d(☐), c(☐), b(☐), a(☐)}
We obtain the transformed TRS
|
d(d(b(c(a(x1))))) |
→ |
d(d(d(d(x1)))) |
(26) |
|
d(d(b(x1))) |
→ |
d(d(c(c(x1)))) |
(27) |
|
d(d(a(a(x1)))) |
→ |
d(d(a(c(b(a(x1)))))) |
(28) |
|
d(c(b(c(a(x1))))) |
→ |
d(c(d(d(x1)))) |
(29) |
|
d(c(b(x1))) |
→ |
d(c(c(c(x1)))) |
(30) |
|
d(c(a(a(x1)))) |
→ |
d(c(a(c(b(a(x1)))))) |
(31) |
|
d(b(b(c(a(x1))))) |
→ |
d(b(d(d(x1)))) |
(32) |
|
d(b(b(x1))) |
→ |
d(b(c(c(x1)))) |
(33) |
|
d(b(a(a(x1)))) |
→ |
d(b(a(c(b(a(x1)))))) |
(34) |
|
d(a(b(c(a(x1))))) |
→ |
d(a(d(d(x1)))) |
(35) |
|
d(a(b(x1))) |
→ |
d(a(c(c(x1)))) |
(36) |
|
d(a(a(a(x1)))) |
→ |
d(a(a(c(b(a(x1)))))) |
(37) |
|
c(d(b(c(a(x1))))) |
→ |
c(d(d(d(x1)))) |
(38) |
|
c(d(b(x1))) |
→ |
c(d(c(c(x1)))) |
(39) |
|
c(d(a(a(x1)))) |
→ |
c(d(a(c(b(a(x1)))))) |
(40) |
|
c(c(b(c(a(x1))))) |
→ |
c(c(d(d(x1)))) |
(41) |
|
c(c(b(x1))) |
→ |
c(c(c(c(x1)))) |
(42) |
|
c(c(a(a(x1)))) |
→ |
c(c(a(c(b(a(x1)))))) |
(43) |
|
c(b(b(c(a(x1))))) |
→ |
c(b(d(d(x1)))) |
(44) |
|
c(b(b(x1))) |
→ |
c(b(c(c(x1)))) |
(45) |
|
c(b(a(a(x1)))) |
→ |
c(b(a(c(b(a(x1)))))) |
(46) |
|
c(a(b(c(a(x1))))) |
→ |
c(a(d(d(x1)))) |
(47) |
|
c(a(b(x1))) |
→ |
c(a(c(c(x1)))) |
(48) |
|
c(a(a(a(x1)))) |
→ |
c(a(a(c(b(a(x1)))))) |
(49) |
|
b(d(b(c(a(x1))))) |
→ |
b(d(d(d(x1)))) |
(50) |
|
b(d(b(x1))) |
→ |
b(d(c(c(x1)))) |
(51) |
|
b(d(a(a(x1)))) |
→ |
b(d(a(c(b(a(x1)))))) |
(52) |
|
b(c(b(c(a(x1))))) |
→ |
b(c(d(d(x1)))) |
(53) |
|
b(c(b(x1))) |
→ |
b(c(c(c(x1)))) |
(54) |
|
b(c(a(a(x1)))) |
→ |
b(c(a(c(b(a(x1)))))) |
(55) |
|
b(b(b(c(a(x1))))) |
→ |
b(b(d(d(x1)))) |
(56) |
|
b(b(b(x1))) |
→ |
b(b(c(c(x1)))) |
(57) |
|
b(b(a(a(x1)))) |
→ |
b(b(a(c(b(a(x1)))))) |
(58) |
|
b(a(b(c(a(x1))))) |
→ |
b(a(d(d(x1)))) |
(59) |
|
b(a(b(x1))) |
→ |
b(a(c(c(x1)))) |
(60) |
|
b(a(a(a(x1)))) |
→ |
b(a(a(c(b(a(x1)))))) |
(61) |
|
a(d(b(c(a(x1))))) |
→ |
a(d(d(d(x1)))) |
(62) |
|
a(d(b(x1))) |
→ |
a(d(c(c(x1)))) |
(63) |
|
a(d(a(a(x1)))) |
→ |
a(d(a(c(b(a(x1)))))) |
(64) |
|
a(c(b(c(a(x1))))) |
→ |
a(c(d(d(x1)))) |
(65) |
|
a(c(b(x1))) |
→ |
a(c(c(c(x1)))) |
(66) |
|
a(c(a(a(x1)))) |
→ |
a(c(a(c(b(a(x1)))))) |
(67) |
|
a(b(b(c(a(x1))))) |
→ |
a(b(d(d(x1)))) |
(68) |
|
a(b(b(x1))) |
→ |
a(b(c(c(x1)))) |
(69) |
|
a(b(a(a(x1)))) |
→ |
a(b(a(c(b(a(x1)))))) |
(70) |
|
a(a(b(c(a(x1))))) |
→ |
a(a(d(d(x1)))) |
(71) |
|
a(a(b(x1))) |
→ |
a(a(c(c(x1)))) |
(72) |
|
a(a(a(a(x1)))) |
→ |
a(a(a(c(b(a(x1)))))) |
(73) |
|
d(d(a(b(x1)))) |
→ |
d(d(d(x1))) |
(74) |
|
d(d(d(x1))) |
→ |
d(d(a(b(x1)))) |
(75) |
|
d(c(a(b(x1)))) |
→ |
d(c(d(x1))) |
(76) |
|
d(c(d(x1))) |
→ |
d(c(a(b(x1)))) |
(77) |
|
d(b(a(b(x1)))) |
→ |
d(b(d(x1))) |
(78) |
|
d(b(d(x1))) |
→ |
d(b(a(b(x1)))) |
(79) |
|
d(a(a(b(x1)))) |
→ |
d(a(d(x1))) |
(80) |
|
d(a(d(x1))) |
→ |
d(a(a(b(x1)))) |
(81) |
|
c(d(a(b(x1)))) |
→ |
c(d(d(x1))) |
(82) |
|
c(d(d(x1))) |
→ |
c(d(a(b(x1)))) |
(83) |
|
c(c(a(b(x1)))) |
→ |
c(c(d(x1))) |
(84) |
|
c(c(d(x1))) |
→ |
c(c(a(b(x1)))) |
(85) |
|
c(b(a(b(x1)))) |
→ |
c(b(d(x1))) |
(86) |
|
c(b(d(x1))) |
→ |
c(b(a(b(x1)))) |
(87) |
|
c(a(a(b(x1)))) |
→ |
c(a(d(x1))) |
(88) |
|
c(a(d(x1))) |
→ |
c(a(a(b(x1)))) |
(89) |
|
b(d(a(b(x1)))) |
→ |
b(d(d(x1))) |
(90) |
|
b(d(d(x1))) |
→ |
b(d(a(b(x1)))) |
(91) |
|
b(c(a(b(x1)))) |
→ |
b(c(d(x1))) |
(92) |
|
b(c(d(x1))) |
→ |
b(c(a(b(x1)))) |
(93) |
|
b(b(a(b(x1)))) |
→ |
b(b(d(x1))) |
(94) |
|
b(b(d(x1))) |
→ |
b(b(a(b(x1)))) |
(95) |
|
b(a(a(b(x1)))) |
→ |
b(a(d(x1))) |
(96) |
|
b(a(d(x1))) |
→ |
b(a(a(b(x1)))) |
(97) |
|
a(d(a(b(x1)))) |
→ |
a(d(d(x1))) |
(98) |
|
a(d(d(x1))) |
→ |
a(d(a(b(x1)))) |
(99) |
|
a(c(a(b(x1)))) |
→ |
a(c(d(x1))) |
(100) |
|
a(c(d(x1))) |
→ |
a(c(a(b(x1)))) |
(101) |
|
a(b(a(b(x1)))) |
→ |
a(b(d(x1))) |
(102) |
|
a(b(d(x1))) |
→ |
a(b(a(b(x1)))) |
(103) |
|
a(a(a(b(x1)))) |
→ |
a(a(d(x1))) |
(104) |
|
a(a(d(x1))) |
→ |
a(a(a(b(x1)))) |
(105) |
1.1.1 Semantic Labeling
The following interpretations form a
model
of the rules.
As carrier we take the set
{0,...,15}.
Symbols are labeled by the interpretation of their arguments using the interpretations
(modulo 16):
| [d(x1)] |
= |
4x1 + 0 |
| [c(x1)] |
= |
4x1 + 1 |
| [b(x1)] |
= |
4x1 + 2 |
| [a(x1)] |
= |
4x1 + 3 |
We obtain the labeled TRS
There are 1280 ruless (increase limit for explicit display).
1.1.1.1 Rule Removal
Using the
matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1
| [d0(x1)] |
= |
x1 +
|
| [d4(x1)] |
= |
x1 +
|
| [d8(x1)] |
= |
x1 +
|
| [d12(x1)] |
= |
x1 +
|
| [d1(x1)] |
= |
x1 +
|
| [d5(x1)] |
= |
x1 +
|
| [d9(x1)] |
= |
x1 +
|
| [d13(x1)] |
= |
x1 +
|
| [d2(x1)] |
= |
x1 +
|
| [d6(x1)] |
= |
x1 +
|
| [d10(x1)] |
= |
x1 +
|
| [d14(x1)] |
= |
x1 +
|
| [d3(x1)] |
= |
x1 +
|
| [d7(x1)] |
= |
x1 +
|
| [d11(x1)] |
= |
x1 +
|
| [d15(x1)] |
= |
x1 +
|
| [c0(x1)] |
= |
x1 +
|
| [c4(x1)] |
= |
x1 +
|
| [c8(x1)] |
= |
x1 +
|
| [c12(x1)] |
= |
x1 +
|
| [c1(x1)] |
= |
x1 +
|
| [c5(x1)] |
= |
x1 +
|
| [c9(x1)] |
= |
x1 +
|
| [c13(x1)] |
= |
x1 +
|
| [c2(x1)] |
= |
x1 +
|
| [c6(x1)] |
= |
x1 +
|
| [c10(x1)] |
= |
x1 +
|
| [c14(x1)] |
= |
x1 +
|
| [c3(x1)] |
= |
x1 +
|
| [c7(x1)] |
= |
x1 +
|
| [c11(x1)] |
= |
x1 +
|
| [c15(x1)] |
= |
x1 +
|
| [b0(x1)] |
= |
x1 +
|
| [b4(x1)] |
= |
x1 +
|
| [b8(x1)] |
= |
x1 +
|
| [b12(x1)] |
= |
x1 +
|
| [b1(x1)] |
= |
x1 +
|
| [b5(x1)] |
= |
x1 +
|
| [b9(x1)] |
= |
x1 +
|
| [b13(x1)] |
= |
x1 +
|
| [b2(x1)] |
= |
x1 +
|
| [b6(x1)] |
= |
x1 +
|
| [b10(x1)] |
= |
x1 +
|
| [b14(x1)] |
= |
x1 +
|
| [b3(x1)] |
= |
x1 +
|
| [b7(x1)] |
= |
x1 +
|
| [b11(x1)] |
= |
x1 +
|
| [b15(x1)] |
= |
x1 +
|
| [a0(x1)] |
= |
x1 +
|
| [a4(x1)] |
= |
x1 +
|
| [a8(x1)] |
= |
x1 +
|
| [a12(x1)] |
= |
x1 +
|
| [a1(x1)] |
= |
x1 +
|
| [a5(x1)] |
= |
x1 +
|
| [a9(x1)] |
= |
x1 +
|
| [a13(x1)] |
= |
x1 +
|
| [a2(x1)] |
= |
x1 +
|
| [a6(x1)] |
= |
x1 +
|
| [a10(x1)] |
= |
x1 +
|
| [a14(x1)] |
= |
x1 +
|
| [a3(x1)] |
= |
x1 +
|
| [a7(x1)] |
= |
x1 +
|
| [a11(x1)] |
= |
x1 +
|
| [a15(x1)] |
= |
x1 +
|
all of the following rules can be deleted.
There are 768 ruless (increase limit for explicit display).
1.1.1.1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.