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