The dependency pairs are split into 4 component(s).
-
The
1st
component contains the
pair(s)
|
mark#(
f(
X
)
)
|
→ |
active#(
f(
mark(
X
)
)
)
|
|
active#(
f(
f(
a
)
)
)
|
→ |
mark#(
c(
f(
g(
f(
a
)
)
)
)
)
|
|
mark#(
f(
X
)
)
|
→ |
mark#(
X
)
|
|
mark#(
c(
X
)
)
|
→ |
active#(
c(
X
)
)
|
|
mark#(
g(
X
)
)
|
→ |
active#(
g(
mark(
X
)
)
)
|
|
mark#(
g(
X
)
)
|
→ |
mark#(
X
)
|
1.1.1: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
0
|
|
[a]
|
= |
0
|
|
[active#
(x1)
]
|
= |
x1
|
|
[active
(x1)
]
|
= |
0
|
|
[f
(x1)
]
|
= |
1
|
|
[mark#
(x1)
]
|
= |
1
|
|
[c
(x1)
]
|
= |
0
|
|
[g
(x1)
]
|
= |
0
|
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
|
mark#(
f(
X
)
)
|
→ |
active#(
f(
mark(
X
)
)
)
|
|
active#(
f(
f(
a
)
)
)
|
→ |
mark#(
c(
f(
g(
f(
a
)
)
)
)
)
|
|
mark#(
f(
X
)
)
|
→ |
mark#(
X
)
|
|
mark#(
g(
X
)
)
|
→ |
mark#(
X
)
|
1.1.1.1: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
x1
|
|
[a]
|
= |
3
|
|
[active#
(x1)
]
|
= |
3
x1
+
1
|
|
[active
(x1)
]
|
= |
x1
|
|
[f
(x1)
]
|
= |
2
x1
+
3
|
|
[mark#
(x1)
]
|
= |
3
x1
+
1
|
|
[c
(x1)
]
|
= |
0
|
|
[g
(x1)
]
|
= |
2
x1
+
3
|
|
[f(x1, ..., xn)]
|
= |
x1 + ... + xn + 1
|
for all other symbols f of arity n
|
one remains with the following pair(s).
|
mark#(
f(
X
)
)
|
→ |
active#(
f(
mark(
X
)
)
)
|
1.1.1.1.1: dependency graph processor
The dependency pairs are split into 0 component(s).
-
The
2nd
component contains the
pair(s)
|
f#(
active(
X
)
)
|
→ |
f#(
X
)
|
|
f#(
mark(
X
)
)
|
→ |
f#(
X
)
|
1.1.2: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[mark
(x1)
]
|
= |
x1
+
3
|
|
[a]
|
= |
0
|
|
[active
(x1)
]
|
= |
x1
+
2
|
|
[f
(x1)
]
|
= |
3
|
|
[c
(x1)
]
|
= |
2
|
|
[f#
(x1)
]
|
= |
x1
|
|
[g
(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.2.1: P is empty
All dependency pairs have been removed.
-
The
3rd
component contains the
pair(s)
|
c#(
active(
X
)
)
|
→ |
c#(
X
)
|
|
c#(
mark(
X
)
)
|
→ |
c#(
X
)
|
1.1.3: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[c#
(x1)
]
|
= |
x1
|
|
[mark
(x1)
]
|
= |
x1
+
3
|
|
[a]
|
= |
0
|
|
[active
(x1)
]
|
= |
x1
+
2
|
|
[f
(x1)
]
|
= |
3
|
|
[c
(x1)
]
|
= |
2
|
|
[g
(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.3.1: P is empty
All dependency pairs have been removed.
-
The
4th
component contains the
pair(s)
|
g#(
active(
X
)
)
|
→ |
g#(
X
)
|
|
g#(
mark(
X
)
)
|
→ |
g#(
X
)
|
1.1.4: reduction pair processor
Using the following reduction pair
Linear polynomial
interpretation over
the naturals
|
[g#
(x1)
]
|
= |
x1
|
|
[mark
(x1)
]
|
= |
x1
+
3
|
|
[a]
|
= |
0
|
|
[active
(x1)
]
|
= |
x1
+
2
|
|
[f
(x1)
]
|
= |
3
|
|
[c
(x1)
]
|
= |
2
|
|
[g
(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.4.1: P is empty
All dependency pairs have been removed.