The dependency pairs are split into 6 component(s).
-
The
1st
component contains the
pair(s)
|
top#(
mark(
x
)
)
|
→ |
top#(
check(
x
)
)
|
|
top#(
active(
c
)
)
|
→ |
top#(
mark(
c
)
)
|
|
top#(
found(
x
)
)
|
→ |
top#(
active(
x
)
)
|
1.1.1: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
0
|
|
[active
(x1)
]
|
= |
2
x1
|
|
[f
(x1)
]
|
= |
0
|
|
[found
(x1)
]
|
= |
2
x1
|
|
[X]
|
= |
2
|
|
[c]
|
= |
2
|
|
[start
(x1)
]
|
= |
2
x1
|
|
[match
(x1, x2)
]
|
= |
2
x1
|
|
[top#
(x1)
]
|
= |
x1
|
|
[ok
(x1)
]
|
= |
x1
|
|
[check
(x1)
]
|
= |
0
|
|
[top
(x1)
]
|
= |
0
|
|
[proper
(x1)
]
|
= |
2
|
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
|
top#(
mark(
x
)
)
|
→ |
top#(
check(
x
)
)
|
|
top#(
found(
x
)
)
|
→ |
top#(
active(
x
)
)
|
1.1.1.1: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
2
x1
+
1
|
|
[active
(x1)
]
|
= |
2
x1
|
|
[f
(x1)
]
|
= |
3
x1
+
2
|
|
[found
(x1)
]
|
= |
2
x1
+
1
|
|
[X]
|
= |
0
|
|
[c]
|
= |
0
|
|
[start
(x1)
]
|
= |
2
x1
+
1
|
|
[match
(x1, x2)
]
|
= |
x1
|
|
[top#
(x1)
]
|
= |
x1
|
|
[ok
(x1)
]
|
= |
x1
|
|
[check
(x1)
]
|
= |
2
x1
+
1
|
|
[top
(x1)
]
|
= |
0
|
|
[proper
(x1)
]
|
= |
x1
|
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
|
top#(
mark(
x
)
)
|
→ |
top#(
check(
x
)
)
|
1.1.1.1.1: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
2
x1
+
2
|
|
[active
(x1)
]
|
= |
x1
|
|
[f
(x1)
]
|
= |
2
x1
+
2
|
|
[found
(x1)
]
|
= |
0
|
|
[X]
|
= |
3
|
|
[c]
|
= |
0
|
|
[start
(x1)
]
|
= |
0
|
|
[match
(x1, x2)
]
|
= |
3
x1 +
3
x2
+
3
|
|
[top#
(x1)
]
|
= |
3
x1
|
|
[ok
(x1)
]
|
= |
1
|
|
[check
(x1)
]
|
= |
x1
|
|
[top
(x1)
]
|
= |
0
|
|
[proper
(x1)
]
|
= |
2
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.1.1: P is empty
All dependency pairs have been removed.
-
The
2nd
component contains the
pair(s)
|
check#(
f(
x
)
)
|
→ |
check#(
x
)
|
1.1.2: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
x1
|
|
[active
(x1)
]
|
= |
x1
|
|
[f
(x1)
]
|
= |
2
x1
+
1
|
|
[found
(x1)
]
|
= |
0
|
|
[X]
|
= |
0
|
|
[check#
(x1)
]
|
= |
x1
|
|
[c]
|
= |
1
|
|
[start
(x1)
]
|
= |
x1
+
1
|
|
[match
(x1, x2)
]
|
= |
3
x1
|
|
[ok
(x1)
]
|
= |
1
|
|
[check
(x1)
]
|
= |
3
x1
+
1
|
|
[top
(x1)
]
|
= |
0
|
|
[proper
(x1)
]
|
= |
2
x1
|
|
[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.
-
The
3rd
component contains the
pair(s)
|
match#(
f(
x
)
,
f(
y
)
)
|
→ |
match#(
x
,
y
)
|
1.1.3: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
0
|
|
[match#
(x1, x2)
]
|
= |
x1
|
|
[active
(x1)
]
|
= |
x1
|
|
[f
(x1)
]
|
= |
2
x1
+
1
|
|
[found
(x1)
]
|
= |
0
|
|
[X]
|
= |
0
|
|
[c]
|
= |
1
|
|
[start
(x1)
]
|
= |
0
|
|
[match
(x1, x2)
]
|
= |
2
x1
|
|
[ok
(x1)
]
|
= |
0
|
|
[check
(x1)
]
|
= |
2
x1
|
|
[top
(x1)
]
|
= |
0
|
|
[proper
(x1)
]
|
= |
2
x1
|
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
1.1.3.1: P is empty
All dependency pairs have been removed.
-
The
4th
component contains the
pair(s)
|
proper#(
f(
x
)
)
|
→ |
proper#(
x
)
|
1.1.4: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
x1
|
|
[active
(x1)
]
|
= |
x1
|
|
[f
(x1)
]
|
= |
2
x1
+
1
|
|
[found
(x1)
]
|
= |
0
|
|
[proper#
(x1)
]
|
= |
x1
|
|
[X]
|
= |
0
|
|
[c]
|
= |
1
|
|
[start
(x1)
]
|
= |
x1
+
1
|
|
[match
(x1, x2)
]
|
= |
3
x1
|
|
[ok
(x1)
]
|
= |
1
|
|
[check
(x1)
]
|
= |
3
x1
+
1
|
|
[top
(x1)
]
|
= |
0
|
|
[proper
(x1)
]
|
= |
2
x1
|
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
1.1.4.1: P is empty
All dependency pairs have been removed.
-
The
5th
component contains the
pair(s)
|
active#(
f(
x
)
)
|
→ |
active#(
x
)
|
1.1.5: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
x1
|
|
[active#
(x1)
]
|
= |
x1
|
|
[active
(x1)
]
|
= |
x1
|
|
[f
(x1)
]
|
= |
2
x1
+
1
|
|
[found
(x1)
]
|
= |
0
|
|
[X]
|
= |
0
|
|
[c]
|
= |
1
|
|
[start
(x1)
]
|
= |
x1
+
1
|
|
[match
(x1, x2)
]
|
= |
3
x1
|
|
[ok
(x1)
]
|
= |
1
|
|
[check
(x1)
]
|
= |
3
x1
+
1
|
|
[top
(x1)
]
|
= |
0
|
|
[proper
(x1)
]
|
= |
2
x1
|
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
1.1.5.1: P is empty
All dependency pairs have been removed.
-
The
6th
component contains the
pair(s)
|
f#(
found(
x
)
)
|
→ |
f#(
x
)
|
|
f#(
ok(
x
)
)
|
→ |
f#(
x
)
|
|
f#(
mark(
x
)
)
|
→ |
f#(
x
)
|
1.1.6: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
x1
+
1
|
|
[active
(x1)
]
|
= |
2
x1
|
|
[f
(x1)
]
|
= |
x1
+
1
|
|
[found
(x1)
]
|
= |
x1
|
|
[X]
|
= |
0
|
|
[c]
|
= |
3
|
|
[start
(x1)
]
|
= |
x1
|
|
[match
(x1, x2)
]
|
= |
3
x1
+
1
|
|
[ok
(x1)
]
|
= |
x1
+
3
|
|
[f#
(x1)
]
|
= |
2
x1
|
|
[check
(x1)
]
|
= |
3
x1
+
1
|
|
[top
(x1)
]
|
= |
0
|
|
[proper
(x1)
]
|
= |
3
x1
|
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
|
f#(
found(
x
)
)
|
→ |
f#(
x
)
|
1.1.6.1: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
x1
|
|
[active
(x1)
]
|
= |
x1
|
|
[f
(x1)
]
|
= |
x1
|
|
[found
(x1)
]
|
= |
x1
+
1
|
|
[X]
|
= |
0
|
|
[c]
|
= |
0
|
|
[start
(x1)
]
|
= |
x1
+
1
|
|
[match
(x1, x2)
]
|
= |
0
|
|
[ok
(x1)
]
|
= |
2
x1
|
|
[f#
(x1)
]
|
= |
x1
|
|
[check
(x1)
]
|
= |
x1
+
2
|
|
[top
(x1)
]
|
= |
0
|
|
[proper
(x1)
]
|
= |
0
|
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
1.1.6.1.1: P is empty
All dependency pairs have been removed.