Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/Ex4_7_56_Bor03_L)
The rewrite relation of the following TRS is considered.
after
(
s
(
N
),
cons
(
X
))
→
after
(
N
,
XS
)
(1)
from
(
X
)
→
cons
(
X
)
(2)
after
(
0
,
XS
)
→
XS
(3)
The evaluation strategy is outermost
Property / Task
Prove or disprove termination.
Answer / Result
No.
Proof (by AProVE @ termCOMP 2023)
1 Loop
The following loop proves nontermination.
t
0
=
after
(
s
(
N
),
cons
(
X
))
→
after
(
N
,
after
(
s
(
N
),
cons
(
X
)))
=
t
1
where t
1
= C[t
0
] and C =
after
(
N
,
☐
)