The
1st
component contains the
pair(s)
mark#(
from(
X
)
)
|
→ |
a__from#(
mark(
X
)
)
|
a__from#(
X
)
|
→ |
mark#(
X
)
|
mark#(
from(
X
)
)
|
→ |
mark#(
X
)
|
mark#(
cons(
X1
,
X2
)
)
|
→ |
mark#(
X1
)
|
mark#(
s(
X
)
)
|
→ |
mark#(
X
)
|
1.1.1: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
[from
(x1)
]
|
= |
x1
+
3
|
[mark
(x1)
]
|
= |
x1
|
[length
(x1)
]
|
= |
1
|
[a__length
(x1)
]
|
= |
1
|
[mark#
(x1)
]
|
= |
3
x1
|
[0]
|
= |
0
|
[nil]
|
= |
0
|
[cons
(x1, x2)
]
|
= |
x1
|
[a__length1
(x1)
]
|
= |
1
|
[a__from
(x1)
]
|
= |
x1
+
3
|
[a__from#
(x1)
]
|
= |
3
x1
+
3
|
[s
(x1)
]
|
= |
x1
|
[length1
(x1)
]
|
= |
1
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
mark#(
cons(
X1
,
X2
)
)
|
→ |
mark#(
X1
)
|
mark#(
s(
X
)
)
|
→ |
mark#(
X
)
|
1.1.1.1: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
[from
(x1)
]
|
= |
2
x1
+
2
|
[mark
(x1)
]
|
= |
x1
|
[length
(x1)
]
|
= |
0
|
[a__length
(x1)
]
|
= |
0
|
[a__length1
(x1)
]
|
= |
0
|
[mark#
(x1)
]
|
= |
2
x1
|
[a__from
(x1)
]
|
= |
2
x1
+
2
|
[s
(x1)
]
|
= |
2
x1
|
[0]
|
= |
0
|
[nil]
|
= |
0
|
[cons
(x1, x2)
]
|
= |
2
x1
+
1
|
[length1
(x1)
]
|
= |
0
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
mark#(
s(
X
)
)
|
→ |
mark#(
X
)
|
1.1.1.1.1: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
[from
(x1)
]
|
= |
0
|
[mark
(x1)
]
|
= |
2
x1
+
2
|
[length
(x1)
]
|
= |
x1
|
[a__length
(x1)
]
|
= |
x1
|
[a__length1
(x1)
]
|
= |
x1
|
[mark#
(x1)
]
|
= |
2
x1
|
[a__from
(x1)
]
|
= |
2
|
[s
(x1)
]
|
= |
x1
+
1
|
[0]
|
= |
0
|
[nil]
|
= |
0
|
[cons
(x1, x2)
]
|
= |
x1
+
1
|
[length1
(x1)
]
|
= |
x1
|
[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.1.1: P is empty
All dependency pairs have been removed.