The rewrite relation of the following TRS is considered.
The dependency pairs are split into 5
components.
-
The
1st
component contains the
pair
|
gcd#(s(x),s(y)) |
→ |
gcd#(minus(max(x,y),min(x,y)),s(min(x,y))) |
(19) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the arctic semiring over the integers
| [minus(x1, x2)] |
= |
0 · x1 +
-∞ · x2 +
-∞ |
| [min(x1, x2)] |
= |
0 · x1 +
-∞ · x2 + 0 |
| [max(x1, x2)] |
= |
0 · x1 + 0 · x2 +
-∞ |
| [any(x1)] |
= |
0 · x1 + 0 |
| [0] |
= |
0 |
| [gcd#(x1, x2)] |
= |
1 · x1 + 0 · x2 + 0 |
| [s(x1)] |
= |
2 · x1 + 2 |
together with the usable
rules
|
min(x,0) |
→ |
0 |
(1) |
|
min(0,y) |
→ |
0 |
(2) |
|
min(s(x),s(y)) |
→ |
s(min(x,y)) |
(3) |
|
max(x,0) |
→ |
x |
(4) |
|
max(0,y) |
→ |
y |
(5) |
|
max(s(x),s(y)) |
→ |
s(max(x,y)) |
(6) |
|
minus(x,0) |
→ |
x |
(7) |
|
minus(s(x),s(y)) |
→ |
s(minus(x,any(y))) |
(8) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
|
gcd#(s(x),s(y)) |
→ |
gcd#(minus(max(x,y),min(x,y)),s(min(x,y))) |
(19) |
could be deleted.
1.1.1.1 P is empty
There are no pairs anymore.
-
The
2nd
component contains the
pair
|
minus#(s(x),s(y)) |
→ |
minus#(x,any(y)) |
(15) |
1.1.2 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
|
minus#(s(x),s(y)) |
→ |
minus#(x,any(y)) |
(15) |
|
| 1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
3rd
component contains the
pair
|
any#(s(x)) |
→ |
any#(x) |
(20) |
1.1.3 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
|
any#(s(x)) |
→ |
any#(x) |
(20) |
|
| 1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
4th
component contains the
pair
|
max#(s(x),s(y)) |
→ |
max#(x,y) |
(13) |
1.1.4 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
|
max#(s(x),s(y)) |
→ |
max#(x,y) |
(13) |
|
|
| 2 |
> |
2 |
| 1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
5th
component contains the
pair
|
min#(s(x),s(y)) |
→ |
min#(x,y) |
(12) |
1.1.5 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
|
min#(s(x),s(y)) |
→ |
min#(x,y) |
(12) |
|
|
| 2 |
> |
2 |
| 1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.