Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/Ex6_GM04_L)
The rewrite relation of the following TRS is considered.
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 Bounds
The given TRS is
match-(raise)-bounded by 2.
This is shown by the following automaton.
-
final states:
{0, 1, 2}
-
transitions:
|
c0
|
→ |
0 |
|
f0
|
→ |
1 |
|
g0
|
→ |
2 |
|
f1
|
→ |
0 |
|
g1
|
→ |
1 |
|
g2
|
→ |
0 |