Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/Ex23_Luc06_L)
The rewrite relation of the following TRS is considered.
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by ttt2 @ termCOMP 2023)
1 Rule Removal
Using the
Weighted Path Order with the following precedence and status
| prec(c) |
= |
0 |
|
status(c) |
= |
[] |
|
list-extension(c) |
= |
Lex |
| prec(f) |
= |
0 |
|
status(f) |
= |
[1] |
|
list-extension(f) |
= |
Lex |
| prec(a) |
= |
0 |
|
status(a) |
= |
[] |
|
list-extension(a) |
= |
Lex |
and the following
Max-polynomial interpretation
| [c] |
=
|
max(0) |
| [f(x1)] |
=
|
max(3, 5 + 1 · x1) |
| [a] |
=
|
max(5) |
all of the following rules can be deleted.
1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.