Termination proof
1: switching to dependency pairs
The following set of initial dependency pairs has been identified.
f#
(
n__f
(
n__a
) )
→
f#
(
n__g
(
f
(
n__a
) ) )
f#
(
n__f
(
n__a
) )
→
f#
(
n__a
)
activate#
(
n__f
(
X
) )
→
f#
(
X
)
activate#
(
n__a
)
→
a#
activate#
(
n__g
(
X
) )
→
g#
(
X
)
1.1: dependency graph processor
The dependency pairs are split into 0 component(s).