Certification Problem
Input (TPDB TRS_Standard/HirokawaMiddeldorp_04/t005)
The rewrite relation of the following TRS is considered.
There are 206 ruless (increase limit for explicit display).
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by NaTT @ termCOMP 2023)
1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
There are 115 ruless (increase limit for explicit display).
1.1 Dependency Graph Processor
The dependency pairs are split into 2
components.
-
The
1st
component contains the
pair
|
*#(c(x,y),z) |
→ |
*#(y,z) |
(265) |
|
*#(x,c(y,z)) |
→ |
*#(x,z) |
(261) |
|
*#(x,c(y,z)) |
→ |
*#(x,y) |
(303) |
|
*#(c(x,y),z) |
→ |
*#(x,z) |
(239) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
| [7] |
=
|
0 |
| [1] |
=
|
0 |
| [4] |
=
|
0 |
| [5] |
=
|
0 |
| [3] |
=
|
0 |
| [*#(x1, x2)] |
=
|
x1 + 0 |
| [c(x1, x2)] |
=
|
x1 + x2 + 1 |
| [9] |
=
|
0 |
| [8] |
=
|
0 |
| [0] |
=
|
0 |
| [c#(x1, x2)] |
=
|
0 |
| [2] |
=
|
0 |
| [6] |
=
|
0 |
| [+(x1, x2)] |
=
|
0 |
| [+#(x1, x2)] |
=
|
0 |
| [*(x1, x2)] |
=
|
0 |
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
pairs
|
*#(c(x,y),z) |
→ |
*#(y,z) |
(265) |
|
*#(c(x,y),z) |
→ |
*#(x,z) |
(239) |
could be deleted.
1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.
-
The
2nd
component contains the
pair
|
+#(x,c(y,z)) |
→ |
c#(y,+(x,z)) |
(276) |
|
+#(c(x,y),z) |
→ |
c#(x,+(y,z)) |
(268) |
|
c#(x,c(y,z)) |
→ |
c#(+(x,y),z) |
(311) |
|
+#(x,c(y,z)) |
→ |
+#(x,z) |
(251) |
|
+#(c(x,y),z) |
→ |
+#(y,z) |
(230) |
|
c#(x,c(y,z)) |
→ |
+#(x,y) |
(207) |
1.1.2 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
| [7] |
=
|
43149 |
| [1] |
=
|
1 |
| [4] |
=
|
21575 |
| [5] |
=
|
33542 |
| [3] |
=
|
23934 |
| [*#(x1, x2)] |
=
|
0 |
| [c(x1, x2)] |
=
|
x1 + x2 + 62361 |
| [9] |
=
|
52756 |
| [8] |
=
|
40789 |
| [0] |
=
|
2361 |
| [c#(x1, x2)] |
=
|
x1 + x2 + 50394 |
| [2] |
=
|
11968 |
| [6] |
=
|
31182 |
| [+(x1, x2)] |
=
|
x1 + x2 + 11966 |
| [+#(x1, x2)] |
=
|
x1 + x2 + 0 |
| [*(x1, x2)] |
=
|
0 |
together with the usable
rulesThere are 104 ruless (increase limit for explicit display).
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
|
+#(x,c(y,z)) |
→ |
c#(y,+(x,z)) |
(276) |
|
+#(c(x,y),z) |
→ |
c#(x,+(y,z)) |
(268) |
|
c#(x,c(y,z)) |
→ |
c#(+(x,y),z) |
(311) |
|
+#(x,c(y,z)) |
→ |
+#(x,z) |
(251) |
|
+#(c(x,y),z) |
→ |
+#(y,z) |
(230) |
|
c#(x,c(y,z)) |
→ |
+#(x,y) |
(207) |
could be deleted.
1.1.2.1 Dependency Graph Processor
The dependency pairs are split into 0
components.