Termination proof
1: switching to dependency pairs
The following set of initial dependency pairs has been identified.
|
f#(
a
,
empty
)
|
→ |
g#(
a
,
empty
)
|
|
f#(
a
,
cons(
x
,
k
)
)
|
→ |
f#(
cons(
x
,
a
)
,
k
)
|
|
g#(
cons(
x
,
k
)
,
d
)
|
→ |
g#(
k
,
cons(
x
,
d
)
)
|
1.1: dependency graph processor
The dependency pairs are split into 2 component(s).
-
The
1st
component contains the
pair(s)
|
f#(
a
,
cons(
x
,
k
)
)
|
→ |
f#(
cons(
x
,
a
)
,
k
)
|
1.1.1: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[g
(x1, x2)
]
|
= |
x1 + x2
|
|
[f
(x1, x2)
]
|
= |
x1 + x2
|
|
[f#
(x1, x2)
]
|
= |
2
x1
|
|
[empty]
|
= |
0
|
|
[cons
(x1, x2)
]
|
= |
x1
+
1
|
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
1.1.1.1: P is empty
All dependency pairs have been removed.
-
The
2nd
component contains the
pair(s)
|
g#(
cons(
x
,
k
)
,
d
)
|
→ |
g#(
k
,
cons(
x
,
d
)
)
|
1.1.2: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[g#
(x1, x2)
]
|
= |
2
x1
|
|
[g
(x1, x2)
]
|
= |
x1 + x2
|
|
[f
(x1, x2)
]
|
= |
x1 + x2
|
|
[empty]
|
= |
0
|
|
[cons
(x1, x2)
]
|
= |
x1
+
2
|
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
1.1.2.1: P is empty
All dependency pairs have been removed.