Certification Problem
Input (TPDB TRS_Standard/Der95/03)
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 1.
This is shown by the following automaton.
-
final states:
{0, 1}
-
transitions:
|
f0(0) |
→ |
0 |
|
f0(1) |
→ |
0 |
|
g0(0) |
→ |
1 |
|
g0(1) |
→ |
1 |
|
f1(0) |
→ |
2 |
|
g1(2) |
→ |
0 |
|
f1(1) |
→ |
2 |
| 0 |
→ |
2 |