Certification Problem
Input (TPDB TRS_Standard/AProVE_04/fac)
The rewrite relation of the following TRS is considered.
|
plus(x,0) |
→ |
x |
(1) |
|
plus(x,s(y)) |
→ |
s(plus(x,y)) |
(2) |
|
times(0,y) |
→ |
0 |
(3) |
|
times(x,0) |
→ |
0 |
(4) |
|
times(s(x),y) |
→ |
plus(times(x,y),y) |
(5) |
|
p(s(s(x))) |
→ |
s(p(s(x))) |
(6) |
|
p(s(0)) |
→ |
0 |
(7) |
|
fac(s(x)) |
→ |
times(fac(p(s(x))),s(x)) |
(8) |
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.
|
p#(s(s(x))) |
→ |
p#(s(x)) |
(9) |
|
fac#(s(x)) |
→ |
fac#(p(s(x))) |
(10) |
|
fac#(s(x)) |
→ |
p#(s(x)) |
(11) |
|
fac#(s(x)) |
→ |
times#(fac(p(s(x))),s(x)) |
(12) |
|
times#(s(x),y) |
→ |
plus#(times(x,y),y) |
(13) |
|
plus#(x,s(y)) |
→ |
plus#(x,y) |
(14) |
|
times#(s(x),y) |
→ |
times#(x,y) |
(15) |
1.1 Dependency Graph Processor
The dependency pairs are split into 4
components.
-
The
1st
component contains the
pair
|
fac#(s(x)) |
→ |
fac#(p(s(x))) |
(10) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the matrix interpretations of dimension 2 with strict dimension 1 over the naturals
| [s(x1)] |
= |
· x1 +
|
| [fac#(x1)] |
= |
· x1 +
|
| [plus#(x1, x2)] |
= |
|
| [p#(x1)] |
= |
|
| [p(x1)] |
= |
· x1 +
|
| [times#(x1, x2)] |
= |
|
| [0] |
= |
|
| [times(x1, x2)] |
= |
|
| [fac(x1)] |
= |
|
| [plus(x1, x2)] |
= |
|
together with the usable
rules
|
p(s(0)) |
→ |
0 |
(7) |
|
p(s(s(x))) |
→ |
s(p(s(x))) |
(6) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
|
fac#(s(x)) |
→ |
fac#(p(s(x))) |
(10) |
could be deleted.
1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
2nd
component contains the
pair
|
times#(s(x),y) |
→ |
times#(x,y) |
(15) |
1.1.2 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
| [s(x1)] |
=
|
x1 + 2 |
| [fac#(x1)] |
=
|
0 |
| [plus#(x1, x2)] |
=
|
0 |
| [p#(x1)] |
=
|
0 |
| [p(x1)] |
=
|
1 |
| [times#(x1, x2)] |
=
|
x1 + 0 |
| [0] |
=
|
11799 |
| [times(x1, x2)] |
=
|
0 |
| [fac(x1)] |
=
|
0 |
| [plus(x1, x2)] |
=
|
0 |
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
pair
|
times#(s(x),y) |
→ |
times#(x,y) |
(15) |
could be deleted.
1.1.2.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
3rd
component contains the
pair
|
plus#(x,s(y)) |
→ |
plus#(x,y) |
(14) |
1.1.3 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
| [s(x1)] |
=
|
x1 + 1 |
| [fac#(x1)] |
=
|
0 |
| [plus#(x1, x2)] |
=
|
x2 + 0 |
| [p#(x1)] |
=
|
0 |
| [p(x1)] |
=
|
40651 |
| [times#(x1, x2)] |
=
|
0 |
| [0] |
=
|
52449 |
| [times(x1, x2)] |
=
|
0 |
| [fac(x1)] |
=
|
0 |
| [plus(x1, x2)] |
=
|
0 |
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
pair
|
plus#(x,s(y)) |
→ |
plus#(x,y) |
(14) |
could be deleted.
1.1.3.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
4th
component contains the
pair
|
p#(s(s(x))) |
→ |
p#(s(x)) |
(9) |
1.1.4 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
| [s(x1)] |
=
|
x1 + 28101 |
| [fac#(x1)] |
=
|
0 |
| [plus#(x1, x2)] |
=
|
0 |
| [p#(x1)] |
=
|
x1 + 0 |
| [p(x1)] |
=
|
36466 |
| [times#(x1, x2)] |
=
|
0 |
| [0] |
=
|
36467 |
| [times(x1, x2)] |
=
|
0 |
| [fac(x1)] |
=
|
0 |
| [plus(x1, x2)] |
=
|
0 |
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
pair
|
p#(s(s(x))) |
→ |
p#(s(x)) |
(9) |
could be deleted.
1.1.4.1 Dependency Graph Processor
The dependency pairs are split into 0
components.