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