The rewrite relation of the following TRS is considered.
active(from(X)) |
→ |
mark(cons(X,from(s(X)))) |
(1) |
active(2ndspos(0,Z)) |
→ |
mark(rnil) |
(2) |
active(2ndspos(s(N),cons(X,cons(Y,Z)))) |
→ |
mark(rcons(posrecip(Y),2ndsneg(N,Z))) |
(3) |
active(2ndsneg(0,Z)) |
→ |
mark(rnil) |
(4) |
active(2ndsneg(s(N),cons(X,cons(Y,Z)))) |
→ |
mark(rcons(negrecip(Y),2ndspos(N,Z))) |
(5) |
active(pi(X)) |
→ |
mark(2ndspos(X,from(0))) |
(6) |
active(plus(0,Y)) |
→ |
mark(Y) |
(7) |
active(plus(s(X),Y)) |
→ |
mark(s(plus(X,Y))) |
(8) |
active(times(0,Y)) |
→ |
mark(0) |
(9) |
active(times(s(X),Y)) |
→ |
mark(plus(Y,times(X,Y))) |
(10) |
active(square(X)) |
→ |
mark(times(X,X)) |
(11) |
mark(from(X)) |
→ |
active(from(mark(X))) |
(12) |
mark(cons(X1,X2)) |
→ |
active(cons(mark(X1),X2)) |
(13) |
mark(s(X)) |
→ |
active(s(mark(X))) |
(14) |
mark(2ndspos(X1,X2)) |
→ |
active(2ndspos(mark(X1),mark(X2))) |
(15) |
mark(0) |
→ |
active(0) |
(16) |
mark(rnil) |
→ |
active(rnil) |
(17) |
mark(rcons(X1,X2)) |
→ |
active(rcons(mark(X1),mark(X2))) |
(18) |
mark(posrecip(X)) |
→ |
active(posrecip(mark(X))) |
(19) |
mark(2ndsneg(X1,X2)) |
→ |
active(2ndsneg(mark(X1),mark(X2))) |
(20) |
mark(negrecip(X)) |
→ |
active(negrecip(mark(X))) |
(21) |
mark(pi(X)) |
→ |
active(pi(mark(X))) |
(22) |
mark(plus(X1,X2)) |
→ |
active(plus(mark(X1),mark(X2))) |
(23) |
mark(times(X1,X2)) |
→ |
active(times(mark(X1),mark(X2))) |
(24) |
mark(square(X)) |
→ |
active(square(mark(X))) |
(25) |
from(mark(X)) |
→ |
from(X) |
(26) |
from(active(X)) |
→ |
from(X) |
(27) |
cons(mark(X1),X2) |
→ |
cons(X1,X2) |
(28) |
cons(X1,mark(X2)) |
→ |
cons(X1,X2) |
(29) |
cons(active(X1),X2) |
→ |
cons(X1,X2) |
(30) |
cons(X1,active(X2)) |
→ |
cons(X1,X2) |
(31) |
s(mark(X)) |
→ |
s(X) |
(32) |
s(active(X)) |
→ |
s(X) |
(33) |
2ndspos(mark(X1),X2) |
→ |
2ndspos(X1,X2) |
(34) |
2ndspos(X1,mark(X2)) |
→ |
2ndspos(X1,X2) |
(35) |
2ndspos(active(X1),X2) |
→ |
2ndspos(X1,X2) |
(36) |
2ndspos(X1,active(X2)) |
→ |
2ndspos(X1,X2) |
(37) |
rcons(mark(X1),X2) |
→ |
rcons(X1,X2) |
(38) |
rcons(X1,mark(X2)) |
→ |
rcons(X1,X2) |
(39) |
rcons(active(X1),X2) |
→ |
rcons(X1,X2) |
(40) |
rcons(X1,active(X2)) |
→ |
rcons(X1,X2) |
(41) |
posrecip(mark(X)) |
→ |
posrecip(X) |
(42) |
posrecip(active(X)) |
→ |
posrecip(X) |
(43) |
2ndsneg(mark(X1),X2) |
→ |
2ndsneg(X1,X2) |
(44) |
2ndsneg(X1,mark(X2)) |
→ |
2ndsneg(X1,X2) |
(45) |
2ndsneg(active(X1),X2) |
→ |
2ndsneg(X1,X2) |
(46) |
2ndsneg(X1,active(X2)) |
→ |
2ndsneg(X1,X2) |
(47) |
negrecip(mark(X)) |
→ |
negrecip(X) |
(48) |
negrecip(active(X)) |
→ |
negrecip(X) |
(49) |
pi(mark(X)) |
→ |
pi(X) |
(50) |
pi(active(X)) |
→ |
pi(X) |
(51) |
plus(mark(X1),X2) |
→ |
plus(X1,X2) |
(52) |
plus(X1,mark(X2)) |
→ |
plus(X1,X2) |
(53) |
plus(active(X1),X2) |
→ |
plus(X1,X2) |
(54) |
plus(X1,active(X2)) |
→ |
plus(X1,X2) |
(55) |
times(mark(X1),X2) |
→ |
times(X1,X2) |
(56) |
times(X1,mark(X2)) |
→ |
times(X1,X2) |
(57) |
times(active(X1),X2) |
→ |
times(X1,X2) |
(58) |
times(X1,active(X2)) |
→ |
times(X1,X2) |
(59) |
square(mark(X)) |
→ |
square(X) |
(60) |
square(active(X)) |
→ |
square(X) |
(61) |
The evaluation strategy is innermost.There are 106 ruless (increase limit for explicit display).
The dependency pairs are split into 13
components.
-
The
1st
component contains the
pair
mark#(cons(X1,X2)) |
→ |
active#(cons(mark(X1),X2)) |
(92) |
active#(from(X)) |
→ |
mark#(cons(X,from(s(X)))) |
(62) |
mark#(cons(X1,X2)) |
→ |
mark#(X1) |
(94) |
mark#(from(X)) |
→ |
active#(from(mark(X))) |
(89) |
active#(2ndspos(s(N),cons(X,cons(Y,Z)))) |
→ |
mark#(rcons(posrecip(Y),2ndsneg(N,Z))) |
(67) |
mark#(rcons(X1,X2)) |
→ |
active#(rcons(mark(X1),mark(X2))) |
(104) |
active#(2ndsneg(s(N),cons(X,cons(Y,Z)))) |
→ |
mark#(rcons(negrecip(Y),2ndspos(N,Z))) |
(72) |
mark#(rcons(X1,X2)) |
→ |
mark#(X1) |
(106) |
mark#(from(X)) |
→ |
mark#(X) |
(91) |
mark#(s(X)) |
→ |
active#(s(mark(X))) |
(95) |
active#(pi(X)) |
→ |
mark#(2ndspos(X,from(0))) |
(76) |
mark#(2ndspos(X1,X2)) |
→ |
active#(2ndspos(mark(X1),mark(X2))) |
(98) |
active#(plus(0,Y)) |
→ |
mark#(Y) |
(79) |
mark#(s(X)) |
→ |
mark#(X) |
(97) |
mark#(2ndspos(X1,X2)) |
→ |
mark#(X1) |
(100) |
mark#(2ndspos(X1,X2)) |
→ |
mark#(X2) |
(101) |
mark#(rcons(X1,X2)) |
→ |
mark#(X2) |
(107) |
mark#(posrecip(X)) |
→ |
active#(posrecip(mark(X))) |
(108) |
active#(plus(s(X),Y)) |
→ |
mark#(s(plus(X,Y))) |
(80) |
active#(times(s(X),Y)) |
→ |
mark#(plus(Y,times(X,Y))) |
(84) |
mark#(plus(X1,X2)) |
→ |
active#(plus(mark(X1),mark(X2))) |
(121) |
active#(square(X)) |
→ |
mark#(times(X,X)) |
(87) |
mark#(times(X1,X2)) |
→ |
active#(times(mark(X1),mark(X2))) |
(125) |
mark#(times(X1,X2)) |
→ |
mark#(X1) |
(127) |
mark#(posrecip(X)) |
→ |
mark#(X) |
(110) |
mark#(2ndsneg(X1,X2)) |
→ |
active#(2ndsneg(mark(X1),mark(X2))) |
(111) |
mark#(2ndsneg(X1,X2)) |
→ |
mark#(X1) |
(113) |
mark#(2ndsneg(X1,X2)) |
→ |
mark#(X2) |
(114) |
mark#(negrecip(X)) |
→ |
active#(negrecip(mark(X))) |
(115) |
mark#(negrecip(X)) |
→ |
mark#(X) |
(117) |
mark#(pi(X)) |
→ |
active#(pi(mark(X))) |
(118) |
mark#(pi(X)) |
→ |
mark#(X) |
(120) |
mark#(plus(X1,X2)) |
→ |
mark#(X1) |
(123) |
mark#(plus(X1,X2)) |
→ |
mark#(X2) |
(124) |
mark#(times(X1,X2)) |
→ |
mark#(X2) |
(128) |
mark#(square(X)) |
→ |
active#(square(mark(X))) |
(129) |
mark#(square(X)) |
→ |
mark#(X) |
(131) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[2ndsneg(x1, x2)] |
= |
2 |
[active#(x1)] |
= |
-1 + x1
|
[2ndspos(x1, x2)] |
= |
2 |
[cons(x1, x2)] |
= |
0 |
[from(x1)] |
= |
2 |
[negrecip(x1)] |
= |
2 |
[pi(x1)] |
= |
2 |
[plus(x1, x2)] |
= |
2 |
[posrecip(x1)] |
= |
-2 |
[rcons(x1, x2)] |
= |
2 |
[s(x1)] |
= |
-2 |
[square(x1)] |
= |
2 |
[times(x1, x2)] |
= |
2 |
[mark(x1)] |
= |
1 |
[active(x1)] |
= |
2 |
[0] |
= |
0 |
[rnil] |
= |
0 |
[mark#(x1)] |
= |
1 |
together with the usable
rules
cons(X1,mark(X2)) |
→ |
cons(X1,X2) |
(29) |
cons(mark(X1),X2) |
→ |
cons(X1,X2) |
(28) |
cons(active(X1),X2) |
→ |
cons(X1,X2) |
(30) |
cons(X1,active(X2)) |
→ |
cons(X1,X2) |
(31) |
from(active(X)) |
→ |
from(X) |
(27) |
from(mark(X)) |
→ |
from(X) |
(26) |
rcons(X1,mark(X2)) |
→ |
rcons(X1,X2) |
(39) |
rcons(mark(X1),X2) |
→ |
rcons(X1,X2) |
(38) |
rcons(active(X1),X2) |
→ |
rcons(X1,X2) |
(40) |
rcons(X1,active(X2)) |
→ |
rcons(X1,X2) |
(41) |
s(active(X)) |
→ |
s(X) |
(33) |
s(mark(X)) |
→ |
s(X) |
(32) |
2ndspos(X1,mark(X2)) |
→ |
2ndspos(X1,X2) |
(35) |
2ndspos(mark(X1),X2) |
→ |
2ndspos(X1,X2) |
(34) |
2ndspos(active(X1),X2) |
→ |
2ndspos(X1,X2) |
(36) |
2ndspos(X1,active(X2)) |
→ |
2ndspos(X1,X2) |
(37) |
posrecip(active(X)) |
→ |
posrecip(X) |
(43) |
posrecip(mark(X)) |
→ |
posrecip(X) |
(42) |
plus(X1,mark(X2)) |
→ |
plus(X1,X2) |
(53) |
plus(mark(X1),X2) |
→ |
plus(X1,X2) |
(52) |
plus(active(X1),X2) |
→ |
plus(X1,X2) |
(54) |
plus(X1,active(X2)) |
→ |
plus(X1,X2) |
(55) |
times(X1,mark(X2)) |
→ |
times(X1,X2) |
(57) |
times(mark(X1),X2) |
→ |
times(X1,X2) |
(56) |
times(active(X1),X2) |
→ |
times(X1,X2) |
(58) |
times(X1,active(X2)) |
→ |
times(X1,X2) |
(59) |
2ndsneg(X1,mark(X2)) |
→ |
2ndsneg(X1,X2) |
(45) |
2ndsneg(mark(X1),X2) |
→ |
2ndsneg(X1,X2) |
(44) |
2ndsneg(active(X1),X2) |
→ |
2ndsneg(X1,X2) |
(46) |
2ndsneg(X1,active(X2)) |
→ |
2ndsneg(X1,X2) |
(47) |
negrecip(active(X)) |
→ |
negrecip(X) |
(49) |
negrecip(mark(X)) |
→ |
negrecip(X) |
(48) |
pi(active(X)) |
→ |
pi(X) |
(51) |
pi(mark(X)) |
→ |
pi(X) |
(50) |
square(active(X)) |
→ |
square(X) |
(61) |
square(mark(X)) |
→ |
square(X) |
(60) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(cons(X1,X2)) |
→ |
active#(cons(mark(X1),X2)) |
(92) |
mark#(s(X)) |
→ |
active#(s(mark(X))) |
(95) |
mark#(posrecip(X)) |
→ |
active#(posrecip(mark(X))) |
(108) |
could be deleted.
1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[2ndsneg(x1, x2)] |
= |
2 |
[active#(x1)] |
= |
x1 |
[2ndspos(x1, x2)] |
= |
2 |
[from(x1)] |
= |
2 |
[negrecip(x1)] |
= |
-2 |
[pi(x1)] |
= |
2 |
[plus(x1, x2)] |
= |
2 |
[rcons(x1, x2)] |
= |
2 |
[square(x1)] |
= |
2 |
[times(x1, x2)] |
= |
2 |
[mark(x1)] |
= |
0 |
[cons(x1, x2)] |
= |
2 |
[active(x1)] |
= |
2 + x1
|
[s(x1)] |
= |
-2 |
[posrecip(x1)] |
= |
2 |
[0] |
= |
0 |
[rnil] |
= |
0 |
[mark#(x1)] |
= |
2 |
together with the usable
rules
from(active(X)) |
→ |
from(X) |
(27) |
from(mark(X)) |
→ |
from(X) |
(26) |
rcons(X1,mark(X2)) |
→ |
rcons(X1,X2) |
(39) |
rcons(mark(X1),X2) |
→ |
rcons(X1,X2) |
(38) |
rcons(active(X1),X2) |
→ |
rcons(X1,X2) |
(40) |
rcons(X1,active(X2)) |
→ |
rcons(X1,X2) |
(41) |
2ndspos(X1,mark(X2)) |
→ |
2ndspos(X1,X2) |
(35) |
2ndspos(mark(X1),X2) |
→ |
2ndspos(X1,X2) |
(34) |
2ndspos(active(X1),X2) |
→ |
2ndspos(X1,X2) |
(36) |
2ndspos(X1,active(X2)) |
→ |
2ndspos(X1,X2) |
(37) |
plus(X1,mark(X2)) |
→ |
plus(X1,X2) |
(53) |
plus(mark(X1),X2) |
→ |
plus(X1,X2) |
(52) |
plus(active(X1),X2) |
→ |
plus(X1,X2) |
(54) |
plus(X1,active(X2)) |
→ |
plus(X1,X2) |
(55) |
times(X1,mark(X2)) |
→ |
times(X1,X2) |
(57) |
times(mark(X1),X2) |
→ |
times(X1,X2) |
(56) |
times(active(X1),X2) |
→ |
times(X1,X2) |
(58) |
times(X1,active(X2)) |
→ |
times(X1,X2) |
(59) |
2ndsneg(X1,mark(X2)) |
→ |
2ndsneg(X1,X2) |
(45) |
2ndsneg(mark(X1),X2) |
→ |
2ndsneg(X1,X2) |
(44) |
2ndsneg(active(X1),X2) |
→ |
2ndsneg(X1,X2) |
(46) |
2ndsneg(X1,active(X2)) |
→ |
2ndsneg(X1,X2) |
(47) |
negrecip(active(X)) |
→ |
negrecip(X) |
(49) |
negrecip(mark(X)) |
→ |
negrecip(X) |
(48) |
pi(active(X)) |
→ |
pi(X) |
(51) |
pi(mark(X)) |
→ |
pi(X) |
(50) |
square(active(X)) |
→ |
square(X) |
(61) |
square(mark(X)) |
→ |
square(X) |
(60) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(negrecip(X)) |
→ |
active#(negrecip(mark(X))) |
(115) |
could be deleted.
1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[2ndsneg(x1, x2)] |
= |
2 |
[active#(x1)] |
= |
-2 + 2 · x1
|
[2ndspos(x1, x2)] |
= |
2 |
[from(x1)] |
= |
2 |
[pi(x1)] |
= |
2 |
[plus(x1, x2)] |
= |
2 |
[rcons(x1, x2)] |
= |
-2 |
[square(x1)] |
= |
2 |
[times(x1, x2)] |
= |
2 |
[mark(x1)] |
= |
-2 |
[cons(x1, x2)] |
= |
-2 + x2
|
[active(x1)] |
= |
0 |
[s(x1)] |
= |
-2 + x1
|
[posrecip(x1)] |
= |
2 |
[negrecip(x1)] |
= |
-2 |
[0] |
= |
0 |
[rnil] |
= |
0 |
[mark#(x1)] |
= |
2 |
together with the usable
rules
from(active(X)) |
→ |
from(X) |
(27) |
from(mark(X)) |
→ |
from(X) |
(26) |
rcons(X1,mark(X2)) |
→ |
rcons(X1,X2) |
(39) |
rcons(mark(X1),X2) |
→ |
rcons(X1,X2) |
(38) |
rcons(active(X1),X2) |
→ |
rcons(X1,X2) |
(40) |
rcons(X1,active(X2)) |
→ |
rcons(X1,X2) |
(41) |
2ndspos(X1,mark(X2)) |
→ |
2ndspos(X1,X2) |
(35) |
2ndspos(mark(X1),X2) |
→ |
2ndspos(X1,X2) |
(34) |
2ndspos(active(X1),X2) |
→ |
2ndspos(X1,X2) |
(36) |
2ndspos(X1,active(X2)) |
→ |
2ndspos(X1,X2) |
(37) |
plus(X1,mark(X2)) |
→ |
plus(X1,X2) |
(53) |
plus(mark(X1),X2) |
→ |
plus(X1,X2) |
(52) |
plus(active(X1),X2) |
→ |
plus(X1,X2) |
(54) |
plus(X1,active(X2)) |
→ |
plus(X1,X2) |
(55) |
times(X1,mark(X2)) |
→ |
times(X1,X2) |
(57) |
times(mark(X1),X2) |
→ |
times(X1,X2) |
(56) |
times(active(X1),X2) |
→ |
times(X1,X2) |
(58) |
times(X1,active(X2)) |
→ |
times(X1,X2) |
(59) |
2ndsneg(X1,mark(X2)) |
→ |
2ndsneg(X1,X2) |
(45) |
2ndsneg(mark(X1),X2) |
→ |
2ndsneg(X1,X2) |
(44) |
2ndsneg(active(X1),X2) |
→ |
2ndsneg(X1,X2) |
(46) |
2ndsneg(X1,active(X2)) |
→ |
2ndsneg(X1,X2) |
(47) |
pi(active(X)) |
→ |
pi(X) |
(51) |
pi(mark(X)) |
→ |
pi(X) |
(50) |
square(active(X)) |
→ |
square(X) |
(61) |
square(mark(X)) |
→ |
square(X) |
(60) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(rcons(X1,X2)) |
→ |
active#(rcons(mark(X1),mark(X2))) |
(104) |
could be deleted.
1.1.1.1.1.1 Reduction Pair Processor
Using the matrix interpretations of dimension 1 with strict dimension 1 over the arctic semiring over the naturals
[active#(x1)] |
= |
+ · x1
|
[from(x1)] |
= |
+ · x1
|
[mark#(x1)] |
= |
+ · x1
|
[cons(x1, x2)] |
= |
+ · x1 + · x2
|
[s(x1)] |
= |
+ · x1
|
[mark(x1)] |
= |
+ · x1
|
[2ndspos(x1, x2)] |
= |
+ · x1 + · x2
|
[rcons(x1, x2)] |
= |
+ · x1 + · x2
|
[posrecip(x1)] |
= |
+ · x1
|
[2ndsneg(x1, x2)] |
= |
+ · x1 + · x2
|
[negrecip(x1)] |
= |
+ · x1
|
[pi(x1)] |
= |
+ · x1
|
[0] |
= |
|
[plus(x1, x2)] |
= |
+ · x1 + · x2
|
[times(x1, x2)] |
= |
+ · x1 + · x2
|
[square(x1)] |
= |
+ · x1
|
[active(x1)] |
= |
+ · x1
|
[rnil] |
= |
|
the
pair
mark#(square(X)) |
→ |
mark#(X) |
(131) |
could be deleted.
1.1.1.1.1.1.1 Reduction Pair Processor
Using the matrix interpretations of dimension 1 with strict dimension 1 over the arctic semiring over the naturals
[active#(x1)] |
= |
+ · x1
|
[from(x1)] |
= |
+ · x1
|
[mark#(x1)] |
= |
+ · x1
|
[cons(x1, x2)] |
= |
+ · x1 + · x2
|
[s(x1)] |
= |
+ · x1
|
[mark(x1)] |
= |
+ · x1
|
[2ndspos(x1, x2)] |
= |
+ · x1 + · x2
|
[rcons(x1, x2)] |
= |
+ · x1 + · x2
|
[posrecip(x1)] |
= |
+ · x1
|
[2ndsneg(x1, x2)] |
= |
+ · x1 + · x2
|
[negrecip(x1)] |
= |
+ · x1
|
[pi(x1)] |
= |
+ · x1
|
[0] |
= |
|
[plus(x1, x2)] |
= |
+ · x1 + · x2
|
[times(x1, x2)] |
= |
+ · x1 + · x2
|
[square(x1)] |
= |
+ · x1
|
[active(x1)] |
= |
+ · x1
|
[rnil] |
= |
|
the
pair
mark#(2ndsneg(X1,X2)) |
→ |
mark#(X1) |
(113) |
could be deleted.
1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the matrix interpretations of dimension 1 with strict dimension 1 over the arctic semiring over the naturals
[active#(x1)] |
= |
+ · x1
|
[from(x1)] |
= |
+ · x1
|
[mark#(x1)] |
= |
+ · x1
|
[cons(x1, x2)] |
= |
+ · x1 + · x2
|
[s(x1)] |
= |
+ · x1
|
[mark(x1)] |
= |
+ · x1
|
[2ndspos(x1, x2)] |
= |
+ · x1 + · x2
|
[rcons(x1, x2)] |
= |
+ · x1 + · x2
|
[posrecip(x1)] |
= |
+ · x1
|
[2ndsneg(x1, x2)] |
= |
+ · x1 + · x2
|
[negrecip(x1)] |
= |
+ · x1
|
[pi(x1)] |
= |
+ · x1
|
[0] |
= |
|
[plus(x1, x2)] |
= |
+ · x1 + · x2
|
[times(x1, x2)] |
= |
+ · x1 + · x2
|
[square(x1)] |
= |
+ · x1
|
[active(x1)] |
= |
+ · x1
|
[rnil] |
= |
|
the
pair
mark#(from(X)) |
→ |
mark#(X) |
(91) |
could be deleted.
1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the matrix interpretations of dimension 1 with strict dimension 1 over the arctic semiring over the naturals
[active#(x1)] |
= |
+ · x1
|
[from(x1)] |
= |
+ · x1
|
[mark#(x1)] |
= |
+ · x1
|
[cons(x1, x2)] |
= |
+ · x1 + · x2
|
[s(x1)] |
= |
+ · x1
|
[mark(x1)] |
= |
+ · x1
|
[2ndspos(x1, x2)] |
= |
+ · x1 + · x2
|
[rcons(x1, x2)] |
= |
+ · x1 + · x2
|
[posrecip(x1)] |
= |
+ · x1
|
[2ndsneg(x1, x2)] |
= |
+ · x1 + · x2
|
[negrecip(x1)] |
= |
+ · x1
|
[pi(x1)] |
= |
+ · x1
|
[0] |
= |
|
[plus(x1, x2)] |
= |
+ · x1 + · x2
|
[times(x1, x2)] |
= |
+ · x1 + · x2
|
[square(x1)] |
= |
+ · x1
|
[active(x1)] |
= |
+ · x1
|
[rnil] |
= |
|
the
pair
active#(square(X)) |
→ |
mark#(times(X,X)) |
(87) |
could be deleted.
1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[2ndsneg(x1, x2)] |
= |
2 |
[active#(x1)] |
= |
-2 + 2 · x1
|
[2ndspos(x1, x2)] |
= |
2 |
[from(x1)] |
= |
2 |
[pi(x1)] |
= |
2 |
[plus(x1, x2)] |
= |
2 |
[square(x1)] |
= |
-2 |
[times(x1, x2)] |
= |
2 |
[mark(x1)] |
= |
-2 + 2 · x1
|
[cons(x1, x2)] |
= |
-2 + x1 + x2
|
[active(x1)] |
= |
0 |
[s(x1)] |
= |
0 |
[rcons(x1, x2)] |
= |
-2 + x2
|
[posrecip(x1)] |
= |
-2 + x1
|
[negrecip(x1)] |
= |
-2 + x1
|
[0] |
= |
2 |
[rnil] |
= |
0 |
[mark#(x1)] |
= |
2 |
together with the usable
rules
from(active(X)) |
→ |
from(X) |
(27) |
from(mark(X)) |
→ |
from(X) |
(26) |
2ndspos(X1,mark(X2)) |
→ |
2ndspos(X1,X2) |
(35) |
2ndspos(mark(X1),X2) |
→ |
2ndspos(X1,X2) |
(34) |
2ndspos(active(X1),X2) |
→ |
2ndspos(X1,X2) |
(36) |
2ndspos(X1,active(X2)) |
→ |
2ndspos(X1,X2) |
(37) |
plus(X1,mark(X2)) |
→ |
plus(X1,X2) |
(53) |
plus(mark(X1),X2) |
→ |
plus(X1,X2) |
(52) |
plus(active(X1),X2) |
→ |
plus(X1,X2) |
(54) |
plus(X1,active(X2)) |
→ |
plus(X1,X2) |
(55) |
times(X1,mark(X2)) |
→ |
times(X1,X2) |
(57) |
times(mark(X1),X2) |
→ |
times(X1,X2) |
(56) |
times(active(X1),X2) |
→ |
times(X1,X2) |
(58) |
times(X1,active(X2)) |
→ |
times(X1,X2) |
(59) |
2ndsneg(X1,mark(X2)) |
→ |
2ndsneg(X1,X2) |
(45) |
2ndsneg(mark(X1),X2) |
→ |
2ndsneg(X1,X2) |
(44) |
2ndsneg(active(X1),X2) |
→ |
2ndsneg(X1,X2) |
(46) |
2ndsneg(X1,active(X2)) |
→ |
2ndsneg(X1,X2) |
(47) |
pi(active(X)) |
→ |
pi(X) |
(51) |
pi(mark(X)) |
→ |
pi(X) |
(50) |
square(active(X)) |
→ |
square(X) |
(61) |
square(mark(X)) |
→ |
square(X) |
(60) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(square(X)) |
→ |
active#(square(mark(X))) |
(129) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the matrix interpretations of dimension 1 with strict dimension 1 over the arctic semiring over the naturals
[active#(x1)] |
= |
+ · x1
|
[from(x1)] |
= |
+ · x1
|
[mark#(x1)] |
= |
+ · x1
|
[cons(x1, x2)] |
= |
+ · x1 + · x2
|
[s(x1)] |
= |
+ · x1
|
[mark(x1)] |
= |
+ · x1
|
[2ndspos(x1, x2)] |
= |
+ · x1 + · x2
|
[rcons(x1, x2)] |
= |
+ · x1 + · x2
|
[posrecip(x1)] |
= |
+ · x1
|
[2ndsneg(x1, x2)] |
= |
+ · x1 + · x2
|
[negrecip(x1)] |
= |
+ · x1
|
[pi(x1)] |
= |
+ · x1
|
[0] |
= |
|
[plus(x1, x2)] |
= |
+ · x1 + · x2
|
[times(x1, x2)] |
= |
+ · x1 + · x2
|
[active(x1)] |
= |
+ · x1
|
[square(x1)] |
= |
+ · x1
|
[rnil] |
= |
|
the
pair
mark#(times(X1,X2)) |
→ |
mark#(X1) |
(127) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the matrix interpretations of dimension 1 with strict dimension 1 over the arctic semiring over the naturals
[active#(x1)] |
= |
+ · x1
|
[from(x1)] |
= |
+ · x1
|
[mark#(x1)] |
= |
+ · x1
|
[cons(x1, x2)] |
= |
+ · x1 + · x2
|
[s(x1)] |
= |
+ · x1
|
[mark(x1)] |
= |
+ · x1
|
[2ndspos(x1, x2)] |
= |
+ · x1 + · x2
|
[rcons(x1, x2)] |
= |
+ · x1 + · x2
|
[posrecip(x1)] |
= |
+ · x1
|
[2ndsneg(x1, x2)] |
= |
+ · x1 + · x2
|
[negrecip(x1)] |
= |
+ · x1
|
[pi(x1)] |
= |
+ · x1
|
[0] |
= |
|
[plus(x1, x2)] |
= |
+ · x1 + · x2
|
[times(x1, x2)] |
= |
+ · x1 + · x2
|
[active(x1)] |
= |
+ · x1
|
[square(x1)] |
= |
+ · x1
|
[rnil] |
= |
|
the
pairs
mark#(2ndspos(X1,X2)) |
→ |
mark#(X2) |
(101) |
mark#(2ndsneg(X1,X2)) |
→ |
mark#(X2) |
(114) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the matrix interpretations of dimension 1 with strict dimension 1 over the arctic semiring over the naturals
[active#(x1)] |
= |
+ · x1
|
[from(x1)] |
= |
+ · x1
|
[mark#(x1)] |
= |
+ · x1
|
[cons(x1, x2)] |
= |
+ · x1 + · x2
|
[s(x1)] |
= |
+ · x1
|
[mark(x1)] |
= |
+ · x1
|
[2ndspos(x1, x2)] |
= |
+ · x1 + · x2
|
[rcons(x1, x2)] |
= |
+ · x1 + · x2
|
[posrecip(x1)] |
= |
+ · x1
|
[2ndsneg(x1, x2)] |
= |
+ · x1 + · x2
|
[negrecip(x1)] |
= |
+ · x1
|
[pi(x1)] |
= |
+ · x1
|
[0] |
= |
|
[plus(x1, x2)] |
= |
+ · x1 + · x2
|
[times(x1, x2)] |
= |
+ · x1 + · x2
|
[active(x1)] |
= |
+ · x1
|
[square(x1)] |
= |
+ · x1
|
[rnil] |
= |
|
the
pair
mark#(plus(X1,X2)) |
→ |
mark#(X1) |
(123) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the matrix interpretations of dimension 1 with strict dimension 1 over the arctic semiring over the naturals
[active#(x1)] |
= |
+ · x1
|
[from(x1)] |
= |
+ · x1
|
[mark#(x1)] |
= |
+ · x1
|
[cons(x1, x2)] |
= |
+ · x1 + · x2
|
[s(x1)] |
= |
+ · x1
|
[mark(x1)] |
= |
+ · x1
|
[2ndspos(x1, x2)] |
= |
+ · x1 + · x2
|
[rcons(x1, x2)] |
= |
+ · x1 + · x2
|
[posrecip(x1)] |
= |
+ · x1
|
[2ndsneg(x1, x2)] |
= |
+ · x1 + · x2
|
[negrecip(x1)] |
= |
+ · x1
|
[pi(x1)] |
= |
+ · x1
|
[0] |
= |
|
[plus(x1, x2)] |
= |
+ · x1 + · x2
|
[times(x1, x2)] |
= |
+ · x1 + · x2
|
[active(x1)] |
= |
+ · x1
|
[square(x1)] |
= |
+ · x1
|
[rnil] |
= |
|
the
pair
mark#(times(X1,X2)) |
→ |
mark#(X2) |
(128) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the matrix interpretations of dimension 1 with strict dimension 1 over the arctic semiring over the naturals
[active#(x1)] |
= |
+ · x1
|
[from(x1)] |
= |
+ · x1
|
[mark#(x1)] |
= |
+ · x1
|
[cons(x1, x2)] |
= |
+ · x1 + · x2
|
[s(x1)] |
= |
+ · x1
|
[mark(x1)] |
= |
+ · x1
|
[2ndspos(x1, x2)] |
= |
+ · x1 + · x2
|
[rcons(x1, x2)] |
= |
+ · x1 + · x2
|
[posrecip(x1)] |
= |
+ · x1
|
[2ndsneg(x1, x2)] |
= |
+ · x1 + · x2
|
[negrecip(x1)] |
= |
+ · x1
|
[pi(x1)] |
= |
+ · x1
|
[0] |
= |
|
[plus(x1, x2)] |
= |
+ · x1 + · x2
|
[times(x1, x2)] |
= |
+ · x1 + · x2
|
[active(x1)] |
= |
+ · x1
|
[square(x1)] |
= |
+ · x1
|
[rnil] |
= |
|
the
pair
mark#(cons(X1,X2)) |
→ |
mark#(X1) |
(94) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.
-
The
2nd
component contains the
pair
from#(active(X)) |
→ |
from#(X) |
(133) |
from#(mark(X)) |
→ |
from#(X) |
(132) |
1.1.2 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.2.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.2.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
from#(active(X)) |
→ |
from#(X) |
(133) |
|
1 |
> |
1 |
from#(mark(X)) |
→ |
from#(X) |
(132) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
3rd
component contains the
pair
cons#(X1,mark(X2)) |
→ |
cons#(X1,X2) |
(135) |
cons#(mark(X1),X2) |
→ |
cons#(X1,X2) |
(134) |
cons#(active(X1),X2) |
→ |
cons#(X1,X2) |
(136) |
cons#(X1,active(X2)) |
→ |
cons#(X1,X2) |
(137) |
1.1.3 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.3.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.3.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
cons#(X1,mark(X2)) |
→ |
cons#(X1,X2) |
(135) |
|
1 |
≥ |
1 |
2 |
> |
2 |
cons#(mark(X1),X2) |
→ |
cons#(X1,X2) |
(134) |
|
1 |
> |
1 |
2 |
≥ |
2 |
cons#(active(X1),X2) |
→ |
cons#(X1,X2) |
(136) |
|
1 |
> |
1 |
2 |
≥ |
2 |
cons#(X1,active(X2)) |
→ |
cons#(X1,X2) |
(137) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
4th
component contains the
pair
s#(active(X)) |
→ |
s#(X) |
(139) |
s#(mark(X)) |
→ |
s#(X) |
(138) |
1.1.4 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.4.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.4.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
s#(active(X)) |
→ |
s#(X) |
(139) |
|
1 |
> |
1 |
s#(mark(X)) |
→ |
s#(X) |
(138) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
5th
component contains the
pair
2ndspos#(X1,mark(X2)) |
→ |
2ndspos#(X1,X2) |
(141) |
2ndspos#(mark(X1),X2) |
→ |
2ndspos#(X1,X2) |
(140) |
2ndspos#(active(X1),X2) |
→ |
2ndspos#(X1,X2) |
(142) |
2ndspos#(X1,active(X2)) |
→ |
2ndspos#(X1,X2) |
(143) |
1.1.5 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.5.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.5.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
2ndspos#(X1,mark(X2)) |
→ |
2ndspos#(X1,X2) |
(141) |
|
1 |
≥ |
1 |
2 |
> |
2 |
2ndspos#(mark(X1),X2) |
→ |
2ndspos#(X1,X2) |
(140) |
|
1 |
> |
1 |
2 |
≥ |
2 |
2ndspos#(active(X1),X2) |
→ |
2ndspos#(X1,X2) |
(142) |
|
1 |
> |
1 |
2 |
≥ |
2 |
2ndspos#(X1,active(X2)) |
→ |
2ndspos#(X1,X2) |
(143) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
6th
component contains the
pair
rcons#(X1,mark(X2)) |
→ |
rcons#(X1,X2) |
(145) |
rcons#(mark(X1),X2) |
→ |
rcons#(X1,X2) |
(144) |
rcons#(active(X1),X2) |
→ |
rcons#(X1,X2) |
(146) |
rcons#(X1,active(X2)) |
→ |
rcons#(X1,X2) |
(147) |
1.1.6 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.6.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.6.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
rcons#(X1,mark(X2)) |
→ |
rcons#(X1,X2) |
(145) |
|
1 |
≥ |
1 |
2 |
> |
2 |
rcons#(mark(X1),X2) |
→ |
rcons#(X1,X2) |
(144) |
|
1 |
> |
1 |
2 |
≥ |
2 |
rcons#(active(X1),X2) |
→ |
rcons#(X1,X2) |
(146) |
|
1 |
> |
1 |
2 |
≥ |
2 |
rcons#(X1,active(X2)) |
→ |
rcons#(X1,X2) |
(147) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
7th
component contains the
pair
posrecip#(active(X)) |
→ |
posrecip#(X) |
(149) |
posrecip#(mark(X)) |
→ |
posrecip#(X) |
(148) |
1.1.7 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.7.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.7.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
posrecip#(active(X)) |
→ |
posrecip#(X) |
(149) |
|
1 |
> |
1 |
posrecip#(mark(X)) |
→ |
posrecip#(X) |
(148) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
8th
component contains the
pair
2ndsneg#(X1,mark(X2)) |
→ |
2ndsneg#(X1,X2) |
(151) |
2ndsneg#(mark(X1),X2) |
→ |
2ndsneg#(X1,X2) |
(150) |
2ndsneg#(active(X1),X2) |
→ |
2ndsneg#(X1,X2) |
(152) |
2ndsneg#(X1,active(X2)) |
→ |
2ndsneg#(X1,X2) |
(153) |
1.1.8 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.8.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.8.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
2ndsneg#(X1,mark(X2)) |
→ |
2ndsneg#(X1,X2) |
(151) |
|
1 |
≥ |
1 |
2 |
> |
2 |
2ndsneg#(mark(X1),X2) |
→ |
2ndsneg#(X1,X2) |
(150) |
|
1 |
> |
1 |
2 |
≥ |
2 |
2ndsneg#(active(X1),X2) |
→ |
2ndsneg#(X1,X2) |
(152) |
|
1 |
> |
1 |
2 |
≥ |
2 |
2ndsneg#(X1,active(X2)) |
→ |
2ndsneg#(X1,X2) |
(153) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
9th
component contains the
pair
negrecip#(active(X)) |
→ |
negrecip#(X) |
(155) |
negrecip#(mark(X)) |
→ |
negrecip#(X) |
(154) |
1.1.9 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.9.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.9.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
negrecip#(active(X)) |
→ |
negrecip#(X) |
(155) |
|
1 |
> |
1 |
negrecip#(mark(X)) |
→ |
negrecip#(X) |
(154) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
10th
component contains the
pair
pi#(active(X)) |
→ |
pi#(X) |
(157) |
pi#(mark(X)) |
→ |
pi#(X) |
(156) |
1.1.10 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.10.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.10.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
pi#(active(X)) |
→ |
pi#(X) |
(157) |
|
1 |
> |
1 |
pi#(mark(X)) |
→ |
pi#(X) |
(156) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
11th
component contains the
pair
plus#(X1,mark(X2)) |
→ |
plus#(X1,X2) |
(159) |
plus#(mark(X1),X2) |
→ |
plus#(X1,X2) |
(158) |
plus#(active(X1),X2) |
→ |
plus#(X1,X2) |
(160) |
plus#(X1,active(X2)) |
→ |
plus#(X1,X2) |
(161) |
1.1.11 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.11.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.11.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
plus#(X1,mark(X2)) |
→ |
plus#(X1,X2) |
(159) |
|
1 |
≥ |
1 |
2 |
> |
2 |
plus#(mark(X1),X2) |
→ |
plus#(X1,X2) |
(158) |
|
1 |
> |
1 |
2 |
≥ |
2 |
plus#(active(X1),X2) |
→ |
plus#(X1,X2) |
(160) |
|
1 |
> |
1 |
2 |
≥ |
2 |
plus#(X1,active(X2)) |
→ |
plus#(X1,X2) |
(161) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
12th
component contains the
pair
times#(X1,mark(X2)) |
→ |
times#(X1,X2) |
(163) |
times#(mark(X1),X2) |
→ |
times#(X1,X2) |
(162) |
times#(active(X1),X2) |
→ |
times#(X1,X2) |
(164) |
times#(X1,active(X2)) |
→ |
times#(X1,X2) |
(165) |
1.1.12 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.12.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.12.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
times#(X1,mark(X2)) |
→ |
times#(X1,X2) |
(163) |
|
1 |
≥ |
1 |
2 |
> |
2 |
times#(mark(X1),X2) |
→ |
times#(X1,X2) |
(162) |
|
1 |
> |
1 |
2 |
≥ |
2 |
times#(active(X1),X2) |
→ |
times#(X1,X2) |
(164) |
|
1 |
> |
1 |
2 |
≥ |
2 |
times#(X1,active(X2)) |
→ |
times#(X1,X2) |
(165) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
13th
component contains the
pair
square#(active(X)) |
→ |
square#(X) |
(167) |
square#(mark(X)) |
→ |
square#(X) |
(166) |
1.1.13 Usable Rules Processor
We restrict the rewrite rules to the following usable rules of the DP problem.
There are no rules.
1.1.13.1 Innermost Lhss Removal Processor
We restrict the innermost strategy to the following left hand sides.
active(from(x0)) |
active(2ndspos(0,x0)) |
active(2ndspos(s(x0),cons(x1,cons(x2,x3)))) |
active(2ndsneg(0,x0)) |
active(2ndsneg(s(x0),cons(x1,cons(x2,x3)))) |
active(pi(x0)) |
active(plus(0,x0)) |
active(plus(s(x0),x1)) |
active(times(0,x0)) |
active(times(s(x0),x1)) |
active(square(x0)) |
mark(from(x0)) |
mark(cons(x0,x1)) |
mark(s(x0)) |
mark(2ndspos(x0,x1)) |
mark(0) |
mark(rnil) |
mark(rcons(x0,x1)) |
mark(posrecip(x0)) |
mark(2ndsneg(x0,x1)) |
mark(negrecip(x0)) |
mark(pi(x0)) |
mark(plus(x0,x1)) |
mark(times(x0,x1)) |
mark(square(x0)) |
1.1.13.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
square#(active(X)) |
→ |
square#(X) |
(167) |
|
1 |
> |
1 |
square#(mark(X)) |
→ |
square#(X) |
(166) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.