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