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