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