Certification Problem
Input (TPDB TRS_Standard/CiME_04/list-sum-prod)
The rewrite relation of the following TRS is considered.
|
+(x,0) |
→ |
x |
(1) |
|
+(0,x) |
→ |
x |
(2) |
|
+(s(x),s(y)) |
→ |
s(s(+(x,y))) |
(3) |
|
*(x,0) |
→ |
0 |
(4) |
|
*(0,x) |
→ |
0 |
(5) |
|
*(s(x),s(y)) |
→ |
s(+(*(x,y),+(x,y))) |
(6) |
|
sum(nil) |
→ |
0 |
(7) |
|
sum(cons(x,l)) |
→ |
+(x,sum(l)) |
(8) |
|
prod(nil) |
→ |
s(0) |
(9) |
|
prod(cons(x,l)) |
→ |
*(x,prod(l)) |
(10) |
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.
|
*#(s(x),s(y)) |
→ |
*#(x,y) |
(11) |
|
+#(s(x),s(y)) |
→ |
+#(x,y) |
(12) |
|
sum#(cons(x,l)) |
→ |
+#(x,sum(l)) |
(13) |
|
prod#(cons(x,l)) |
→ |
prod#(l) |
(14) |
|
*#(s(x),s(y)) |
→ |
+#(x,y) |
(15) |
|
*#(s(x),s(y)) |
→ |
+#(*(x,y),+(x,y)) |
(16) |
|
sum#(cons(x,l)) |
→ |
sum#(l) |
(17) |
|
prod#(cons(x,l)) |
→ |
*#(x,prod(l)) |
(18) |
1.1 Dependency Graph Processor
The dependency pairs are split into 4
components.
-
The
1st
component contains the
pair
|
sum#(cons(x,l)) |
→ |
sum#(l) |
(17) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
| [prod(x1)] |
=
|
0 |
| [s(x1)] |
=
|
0 |
| [prod#(x1)] |
=
|
0 |
| [*#(x1, x2)] |
=
|
0 |
| [sum(x1)] |
=
|
0 |
| [0] |
=
|
0 |
| [nil] |
=
|
0 |
| [cons(x1, x2)] |
=
|
x2 + 1 |
| [+(x1, x2)] |
=
|
0 |
| [sum#(x1)] |
=
|
x1 + 0 |
| [+#(x1, x2)] |
=
|
0 |
| [*(x1, x2)] |
=
|
0 |
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
pair
|
sum#(cons(x,l)) |
→ |
sum#(l) |
(17) |
could be deleted.
1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
2nd
component contains the
pair
|
prod#(cons(x,l)) |
→ |
prod#(l) |
(14) |
1.1.2 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
| [prod(x1)] |
=
|
0 |
| [s(x1)] |
=
|
0 |
| [prod#(x1)] |
=
|
x1 + 0 |
| [*#(x1, x2)] |
=
|
0 |
| [sum(x1)] |
=
|
0 |
| [0] |
=
|
0 |
| [nil] |
=
|
0 |
| [cons(x1, x2)] |
=
|
x2 + 1 |
| [+(x1, x2)] |
=
|
0 |
| [sum#(x1)] |
=
|
0 |
| [+#(x1, x2)] |
=
|
0 |
| [*(x1, x2)] |
=
|
0 |
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
pair
|
prod#(cons(x,l)) |
→ |
prod#(l) |
(14) |
could be deleted.
1.1.2.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
3rd
component contains the
pair
|
*#(s(x),s(y)) |
→ |
*#(x,y) |
(11) |
1.1.3 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
| [prod(x1)] |
=
|
0 |
| [s(x1)] |
=
|
x1 + 1 |
| [prod#(x1)] |
=
|
0 |
| [*#(x1, x2)] |
=
|
x2 + 0 |
| [sum(x1)] |
=
|
0 |
| [0] |
=
|
0 |
| [nil] |
=
|
0 |
| [cons(x1, x2)] |
=
|
1 |
| [+(x1, x2)] |
=
|
0 |
| [sum#(x1)] |
=
|
0 |
| [+#(x1, x2)] |
=
|
0 |
| [*(x1, x2)] |
=
|
0 |
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
pair
|
*#(s(x),s(y)) |
→ |
*#(x,y) |
(11) |
could be deleted.
1.1.3.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
4th
component contains the
pair
|
+#(s(x),s(y)) |
→ |
+#(x,y) |
(12) |
1.1.4 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
| [prod(x1)] |
=
|
0 |
| [s(x1)] |
=
|
x1 + 1 |
| [prod#(x1)] |
=
|
0 |
| [*#(x1, x2)] |
=
|
0 |
| [sum(x1)] |
=
|
0 |
| [0] |
=
|
0 |
| [nil] |
=
|
0 |
| [cons(x1, x2)] |
=
|
1 |
| [+(x1, x2)] |
=
|
0 |
| [sum#(x1)] |
=
|
0 |
| [+#(x1, x2)] |
=
|
x2 + 0 |
| [*(x1, x2)] |
=
|
0 |
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
pair
|
+#(s(x),s(y)) |
→ |
+#(x,y) |
(12) |
could be deleted.
1.1.4.1 Dependency Graph Processor
The dependency pairs are split into 0
components.