Termination proof
1: switching to dependency pairs
The following set of initial dependency pairs has been identified.
2nd#
(
cons
(
X
,
X1
) )
→
2nd#
(
cons1
(
X
,
activate
(
X1
) ) )
2nd#
(
cons
(
X
,
X1
) )
→
activate#
(
X1
)
activate#
(
n__from
(
X
) )
→
from#
(
X
)
1.1: dependency graph processor
The dependency pairs are split into 0 component(s).