The rewrite relation of the following TRS is considered.
There are 140 ruless (increase limit for explicit display).
There are 219 ruless (increase limit for explicit display).
The dependency pairs are split into 23
components.
-
The
1st
component contains the
pair
mark#(U11(X1,X2,X3)) |
→ |
active#(U11(mark(X1),X2,X3)) |
(205) |
active#(U11(tt,V1,V2)) |
→ |
mark#(U12(isNatKind(V1),V1,V2)) |
(141) |
mark#(U11(X1,X2,X3)) |
→ |
mark#(X1) |
(207) |
mark#(U12(X1,X2,X3)) |
→ |
active#(U12(mark(X1),X2,X3)) |
(209) |
active#(U12(tt,V1,V2)) |
→ |
mark#(U13(isNatKind(V2),V1,V2)) |
(144) |
mark#(U12(X1,X2,X3)) |
→ |
mark#(X1) |
(211) |
mark#(isNatKind(X)) |
→ |
active#(isNatKind(X)) |
(212) |
active#(U13(tt,V1,V2)) |
→ |
mark#(U14(isNatKind(V2),V1,V2)) |
(147) |
mark#(U13(X1,X2,X3)) |
→ |
active#(U13(mark(X1),X2,X3)) |
(213) |
active#(U14(tt,V1,V2)) |
→ |
mark#(U15(isNat(V1),V2)) |
(150) |
mark#(U13(X1,X2,X3)) |
→ |
mark#(X1) |
(215) |
mark#(U14(X1,X2,X3)) |
→ |
active#(U14(mark(X1),X2,X3)) |
(216) |
active#(U15(tt,V2)) |
→ |
mark#(U16(isNat(V2))) |
(153) |
mark#(U14(X1,X2,X3)) |
→ |
mark#(X1) |
(218) |
mark#(U15(X1,X2)) |
→ |
active#(U15(mark(X1),X2)) |
(219) |
active#(U21(tt,V1)) |
→ |
mark#(U22(isNatKind(V1),V1)) |
(157) |
mark#(U15(X1,X2)) |
→ |
mark#(X1) |
(221) |
mark#(isNat(X)) |
→ |
active#(isNat(X)) |
(222) |
active#(U22(tt,V1)) |
→ |
mark#(U23(isNat(V1))) |
(160) |
mark#(U16(X)) |
→ |
active#(U16(mark(X))) |
(223) |
active#(U31(tt,V2)) |
→ |
mark#(U32(isNatKind(V2))) |
(164) |
mark#(U16(X)) |
→ |
mark#(X) |
(225) |
mark#(U21(X1,X2)) |
→ |
active#(U21(mark(X1),X2)) |
(226) |
active#(U51(tt,N)) |
→ |
mark#(U52(isNatKind(N),N)) |
(169) |
mark#(U21(X1,X2)) |
→ |
mark#(X1) |
(228) |
mark#(U22(X1,X2)) |
→ |
active#(U22(mark(X1),X2)) |
(229) |
active#(U52(tt,N)) |
→ |
mark#(N) |
(172) |
mark#(U22(X1,X2)) |
→ |
mark#(X1) |
(231) |
mark#(U23(X)) |
→ |
active#(U23(mark(X))) |
(232) |
active#(U61(tt,M,N)) |
→ |
mark#(U62(isNatKind(M),M,N)) |
(173) |
mark#(U23(X)) |
→ |
mark#(X) |
(234) |
mark#(U31(X1,X2)) |
→ |
active#(U31(mark(X1),X2)) |
(235) |
active#(U62(tt,M,N)) |
→ |
mark#(U63(isNat(N),M,N)) |
(176) |
mark#(U31(X1,X2)) |
→ |
mark#(X1) |
(237) |
mark#(U32(X)) |
→ |
active#(U32(mark(X))) |
(238) |
active#(U63(tt,M,N)) |
→ |
mark#(U64(isNatKind(N),M,N)) |
(179) |
mark#(U32(X)) |
→ |
mark#(X) |
(240) |
mark#(U41(X)) |
→ |
active#(U41(mark(X))) |
(241) |
active#(U64(tt,M,N)) |
→ |
mark#(s(plus(N,M))) |
(182) |
mark#(U41(X)) |
→ |
mark#(X) |
(243) |
mark#(U51(X1,X2)) |
→ |
active#(U51(mark(X1),X2)) |
(244) |
active#(isNat(plus(V1,V2))) |
→ |
mark#(U11(isNatKind(V1),V1,V2)) |
(186) |
mark#(U51(X1,X2)) |
→ |
mark#(X1) |
(246) |
mark#(U52(X1,X2)) |
→ |
active#(U52(mark(X1),X2)) |
(247) |
active#(isNat(s(V1))) |
→ |
mark#(U21(isNatKind(V1),V1)) |
(189) |
mark#(U52(X1,X2)) |
→ |
mark#(X1) |
(249) |
mark#(U61(X1,X2,X3)) |
→ |
active#(U61(mark(X1),X2,X3)) |
(250) |
active#(isNatKind(plus(V1,V2))) |
→ |
mark#(U31(isNatKind(V1),V2)) |
(193) |
mark#(U61(X1,X2,X3)) |
→ |
mark#(X1) |
(252) |
mark#(U62(X1,X2,X3)) |
→ |
active#(U62(mark(X1),X2,X3)) |
(253) |
active#(isNatKind(s(V1))) |
→ |
mark#(U41(isNatKind(V1))) |
(196) |
mark#(U62(X1,X2,X3)) |
→ |
mark#(X1) |
(255) |
mark#(U63(X1,X2,X3)) |
→ |
active#(U63(mark(X1),X2,X3)) |
(256) |
active#(plus(N,0)) |
→ |
mark#(U51(isNat(N),N)) |
(199) |
mark#(U63(X1,X2,X3)) |
→ |
mark#(X1) |
(258) |
mark#(U64(X1,X2,X3)) |
→ |
active#(U64(mark(X1),X2,X3)) |
(259) |
active#(plus(N,s(M))) |
→ |
mark#(U61(isNat(M),M,N)) |
(202) |
mark#(U64(X1,X2,X3)) |
→ |
mark#(X1) |
(261) |
mark#(s(X)) |
→ |
active#(s(mark(X))) |
(262) |
mark#(s(X)) |
→ |
mark#(X) |
(264) |
mark#(plus(X1,X2)) |
→ |
active#(plus(mark(X1),mark(X2))) |
(265) |
mark#(plus(X1,X2)) |
→ |
mark#(X1) |
(267) |
mark#(plus(X1,X2)) |
→ |
mark#(X2) |
(268) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + 2 · x1
|
[U11(x1, x2, x3)] |
= |
2 |
[U12(x1, x2, x3)] |
= |
2 |
[U13(x1, x2, x3)] |
= |
2 |
[U14(x1, x2, x3)] |
= |
2 |
[U15(x1, x2)] |
= |
2 |
[U16(x1)] |
= |
2 |
[U21(x1, x2)] |
= |
2 |
[U22(x1, x2)] |
= |
2 |
[U23(x1)] |
= |
0 |
[U31(x1, x2)] |
= |
2 |
[U32(x1)] |
= |
2 |
[U41(x1)] |
= |
2 |
[U51(x1, x2)] |
= |
2 |
[U52(x1, x2)] |
= |
2 |
[U61(x1, x2, x3)] |
= |
2 |
[U62(x1, x2, x3)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
2 |
[U64(x1, x2, x3)] |
= |
2 |
[plus(x1, x2)] |
= |
2 |
[s(x1)] |
= |
2 |
[mark(x1)] |
= |
2 |
[active(x1)] |
= |
-2 |
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
2 |
[isNat(x1)] |
= |
2 |
[0] |
= |
0 |
[mark#(x1)] |
= |
2 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U23(active(X)) |
→ |
U23(X) |
(94) |
U23(mark(X)) |
→ |
U23(X) |
(93) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U52(X1,mark(X2)) |
→ |
U52(X1,X2) |
(108) |
U52(mark(X1),X2) |
→ |
U52(X1,X2) |
(107) |
U52(active(X1),X2) |
→ |
U52(X1,X2) |
(109) |
U52(X1,active(X2)) |
→ |
U52(X1,X2) |
(110) |
U62(X1,mark(X2),X3) |
→ |
U62(X1,X2,X3) |
(118) |
U62(mark(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(117) |
U62(X1,X2,mark(X3)) |
→ |
U62(X1,X2,X3) |
(119) |
U62(active(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(120) |
U62(X1,active(X2),X3) |
→ |
U62(X1,X2,X3) |
(121) |
U62(X1,X2,active(X3)) |
→ |
U62(X1,X2,X3) |
(122) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U63(X1,mark(X2),X3) |
→ |
U63(X1,X2,X3) |
(124) |
U63(mark(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(123) |
U63(X1,X2,mark(X3)) |
→ |
U63(X1,X2,X3) |
(125) |
U63(active(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(126) |
U63(X1,active(X2),X3) |
→ |
U63(X1,X2,X3) |
(127) |
U63(X1,X2,active(X3)) |
→ |
U63(X1,X2,X3) |
(128) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
plus(X1,mark(X2)) |
→ |
plus(X1,X2) |
(138) |
plus(mark(X1),X2) |
→ |
plus(X1,X2) |
(137) |
plus(active(X1),X2) |
→ |
plus(X1,X2) |
(139) |
plus(X1,active(X2)) |
→ |
plus(X1,X2) |
(140) |
s(active(X)) |
→ |
s(X) |
(136) |
s(mark(X)) |
→ |
s(X) |
(135) |
U51(X1,mark(X2)) |
→ |
U51(X1,X2) |
(104) |
U51(mark(X1),X2) |
→ |
U51(X1,X2) |
(103) |
U51(active(X1),X2) |
→ |
U51(X1,X2) |
(105) |
U51(X1,active(X2)) |
→ |
U51(X1,X2) |
(106) |
U61(X1,mark(X2),X3) |
→ |
U61(X1,X2,X3) |
(112) |
U61(mark(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(111) |
U61(X1,X2,mark(X3)) |
→ |
U61(X1,X2,X3) |
(113) |
U61(active(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(114) |
U61(X1,active(X2),X3) |
→ |
U61(X1,X2,X3) |
(115) |
U61(X1,X2,active(X3)) |
→ |
U61(X1,X2,X3) |
(116) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(U23(X)) |
→ |
active#(U23(mark(X))) |
(232) |
could be deleted.
1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
x1 |
[U11(x1, x2, x3)] |
= |
2 |
[U12(x1, x2, x3)] |
= |
2 |
[U13(x1, x2, x3)] |
= |
2 |
[U14(x1, x2, x3)] |
= |
2 |
[U15(x1, x2)] |
= |
2 |
[U16(x1)] |
= |
2 |
[U21(x1, x2)] |
= |
2 |
[U22(x1, x2)] |
= |
2 |
[U31(x1, x2)] |
= |
2 |
[U32(x1)] |
= |
-2 |
[U41(x1)] |
= |
-2 |
[U51(x1, x2)] |
= |
2 |
[U52(x1, x2)] |
= |
2 |
[U61(x1, x2, x3)] |
= |
2 |
[U62(x1, x2, x3)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
2 |
[U64(x1, x2, x3)] |
= |
2 |
[plus(x1, x2)] |
= |
2 |
[s(x1)] |
= |
-2 |
[mark(x1)] |
= |
-2 |
[active(x1)] |
= |
0 |
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
2 |
[isNat(x1)] |
= |
2 |
[U23(x1)] |
= |
2 |
[0] |
= |
0 |
[mark#(x1)] |
= |
2 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U52(X1,mark(X2)) |
→ |
U52(X1,X2) |
(108) |
U52(mark(X1),X2) |
→ |
U52(X1,X2) |
(107) |
U52(active(X1),X2) |
→ |
U52(X1,X2) |
(109) |
U52(X1,active(X2)) |
→ |
U52(X1,X2) |
(110) |
U62(X1,mark(X2),X3) |
→ |
U62(X1,X2,X3) |
(118) |
U62(mark(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(117) |
U62(X1,X2,mark(X3)) |
→ |
U62(X1,X2,X3) |
(119) |
U62(active(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(120) |
U62(X1,active(X2),X3) |
→ |
U62(X1,X2,X3) |
(121) |
U62(X1,X2,active(X3)) |
→ |
U62(X1,X2,X3) |
(122) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U63(X1,mark(X2),X3) |
→ |
U63(X1,X2,X3) |
(124) |
U63(mark(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(123) |
U63(X1,X2,mark(X3)) |
→ |
U63(X1,X2,X3) |
(125) |
U63(active(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(126) |
U63(X1,active(X2),X3) |
→ |
U63(X1,X2,X3) |
(127) |
U63(X1,X2,active(X3)) |
→ |
U63(X1,X2,X3) |
(128) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
plus(X1,mark(X2)) |
→ |
plus(X1,X2) |
(138) |
plus(mark(X1),X2) |
→ |
plus(X1,X2) |
(137) |
plus(active(X1),X2) |
→ |
plus(X1,X2) |
(139) |
plus(X1,active(X2)) |
→ |
plus(X1,X2) |
(140) |
s(active(X)) |
→ |
s(X) |
(136) |
s(mark(X)) |
→ |
s(X) |
(135) |
U51(X1,mark(X2)) |
→ |
U51(X1,X2) |
(104) |
U51(mark(X1),X2) |
→ |
U51(X1,X2) |
(103) |
U51(active(X1),X2) |
→ |
U51(X1,X2) |
(105) |
U51(X1,active(X2)) |
→ |
U51(X1,X2) |
(106) |
U61(X1,mark(X2),X3) |
→ |
U61(X1,X2,X3) |
(112) |
U61(mark(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(111) |
U61(X1,X2,mark(X3)) |
→ |
U61(X1,X2,X3) |
(113) |
U61(active(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(114) |
U61(X1,active(X2),X3) |
→ |
U61(X1,X2,X3) |
(115) |
U61(X1,X2,active(X3)) |
→ |
U61(X1,X2,X3) |
(116) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(U32(X)) |
→ |
active#(U32(mark(X))) |
(238) |
mark#(U41(X)) |
→ |
active#(U41(mark(X))) |
(241) |
mark#(s(X)) |
→ |
active#(s(mark(X))) |
(262) |
could be deleted.
1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark#(x1)] |
= |
1 |
[U11(x1, x2, x3)] |
= |
1 |
[active#(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
0 |
[tt] |
= |
0 |
[U12(x1, x2, x3)] |
= |
1 |
[isNatKind(x1)] |
= |
1 |
[U13(x1, x2, x3)] |
= |
1 |
[U14(x1, x2, x3)] |
= |
1 |
[U15(x1, x2)] |
= |
1 |
[isNat(x1)] |
= |
1 |
[U16(x1)] |
= |
0 |
[U21(x1, x2)] |
= |
1 |
[U22(x1, x2)] |
= |
1 |
[U23(x1)] |
= |
0 |
[U31(x1, x2)] |
= |
1 |
[U32(x1)] |
= |
0 |
[U51(x1, x2)] |
= |
1 |
[U52(x1, x2)] |
= |
1 |
[U61(x1, x2, x3)] |
= |
1 |
[U62(x1, x2, x3)] |
= |
1 |
[U63(x1, x2, x3)] |
= |
1 |
[U64(x1, x2, x3)] |
= |
1 |
[s(x1)] |
= |
0 |
[plus(x1, x2)] |
= |
1 |
[U41(x1)] |
= |
0 |
[0] |
= |
0 |
[active(x1)] |
= |
0 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U52(X1,mark(X2)) |
→ |
U52(X1,X2) |
(108) |
U52(mark(X1),X2) |
→ |
U52(X1,X2) |
(107) |
U52(active(X1),X2) |
→ |
U52(X1,X2) |
(109) |
U52(X1,active(X2)) |
→ |
U52(X1,X2) |
(110) |
U62(X1,mark(X2),X3) |
→ |
U62(X1,X2,X3) |
(118) |
U62(mark(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(117) |
U62(X1,X2,mark(X3)) |
→ |
U62(X1,X2,X3) |
(119) |
U62(active(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(120) |
U62(X1,active(X2),X3) |
→ |
U62(X1,X2,X3) |
(121) |
U62(X1,X2,active(X3)) |
→ |
U62(X1,X2,X3) |
(122) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U63(X1,mark(X2),X3) |
→ |
U63(X1,X2,X3) |
(124) |
U63(mark(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(123) |
U63(X1,X2,mark(X3)) |
→ |
U63(X1,X2,X3) |
(125) |
U63(active(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(126) |
U63(X1,active(X2),X3) |
→ |
U63(X1,X2,X3) |
(127) |
U63(X1,X2,active(X3)) |
→ |
U63(X1,X2,X3) |
(128) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
plus(X1,mark(X2)) |
→ |
plus(X1,X2) |
(138) |
plus(mark(X1),X2) |
→ |
plus(X1,X2) |
(137) |
plus(active(X1),X2) |
→ |
plus(X1,X2) |
(139) |
plus(X1,active(X2)) |
→ |
plus(X1,X2) |
(140) |
U51(X1,mark(X2)) |
→ |
U51(X1,X2) |
(104) |
U51(mark(X1),X2) |
→ |
U51(X1,X2) |
(103) |
U51(active(X1),X2) |
→ |
U51(X1,X2) |
(105) |
U51(X1,active(X2)) |
→ |
U51(X1,X2) |
(106) |
U61(X1,mark(X2),X3) |
→ |
U61(X1,X2,X3) |
(112) |
U61(mark(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(111) |
U61(X1,X2,mark(X3)) |
→ |
U61(X1,X2,X3) |
(113) |
U61(active(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(114) |
U61(X1,active(X2),X3) |
→ |
U61(X1,X2,X3) |
(115) |
U61(X1,X2,active(X3)) |
→ |
U61(X1,X2,X3) |
(116) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(U16(X)) |
→ |
active#(U16(mark(X))) |
(223) |
could be deleted.
1.1.1.1.1.1 Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
[mark#(x1)] |
= |
1 · x1
|
[U11(x1, x2, x3)] |
= |
1 · x1
|
[active#(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[tt] |
= |
0 |
[U12(x1, x2, x3)] |
= |
1 · x1
|
[isNatKind(x1)] |
= |
0 |
[U13(x1, x2, x3)] |
= |
1 · x1
|
[U14(x1, x2, x3)] |
= |
1 · x1
|
[U15(x1, x2)] |
= |
1 · x1
|
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 · x1
|
[U21(x1, x2)] |
= |
1 · x1
|
[U22(x1, x2)] |
= |
1 · x1
|
[U23(x1)] |
= |
1 · x1
|
[U31(x1, x2)] |
= |
1 · x1
|
[U32(x1)] |
= |
1 · x1
|
[U51(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[U52(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[U61(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U62(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U63(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U64(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[s(x1)] |
= |
1 · x1
|
[plus(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[U41(x1)] |
= |
1 · x1
|
[0] |
= |
1 |
[active(x1)] |
= |
1 · x1
|
the
pair
active#(plus(N,0)) |
→ |
mark#(U51(isNat(N),N)) |
(199) |
could be deleted.
1.1.1.1.1.1.1 Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
[mark#(x1)] |
= |
1 · x1
|
[U11(x1, x2, x3)] |
= |
1 · x1
|
[active#(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[tt] |
= |
0 |
[U12(x1, x2, x3)] |
= |
1 · x1
|
[isNatKind(x1)] |
= |
0 |
[U13(x1, x2, x3)] |
= |
1 · x1
|
[U14(x1, x2, x3)] |
= |
1 · x1
|
[U15(x1, x2)] |
= |
1 · x1
|
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 · x1
|
[U21(x1, x2)] |
= |
1 · x1
|
[U22(x1, x2)] |
= |
1 · x1
|
[U23(x1)] |
= |
1 · x1
|
[U31(x1, x2)] |
= |
1 · x1
|
[U32(x1)] |
= |
1 · x1
|
[U51(x1, x2)] |
= |
1 + 1 · x1 + 1 · x2
|
[U52(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[U61(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U62(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U63(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U64(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[s(x1)] |
= |
1 · x1
|
[plus(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[U41(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[0] |
= |
1 |
the
pairs
active#(U51(tt,N)) |
→ |
mark#(U52(isNatKind(N),N)) |
(169) |
mark#(U51(X1,X2)) |
→ |
mark#(X1) |
(246) |
could be deleted.
1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark#(x1)] |
= |
1 |
[U11(x1, x2, x3)] |
= |
1 |
[active#(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
0 |
[tt] |
= |
0 |
[U12(x1, x2, x3)] |
= |
1 |
[isNatKind(x1)] |
= |
1 |
[U13(x1, x2, x3)] |
= |
1 |
[U14(x1, x2, x3)] |
= |
1 |
[U15(x1, x2)] |
= |
1 |
[isNat(x1)] |
= |
1 |
[U16(x1)] |
= |
0 |
[U21(x1, x2)] |
= |
1 |
[U22(x1, x2)] |
= |
1 |
[U23(x1)] |
= |
0 |
[U31(x1, x2)] |
= |
1 |
[U32(x1)] |
= |
0 |
[U52(x1, x2)] |
= |
1 |
[U61(x1, x2, x3)] |
= |
1 |
[U62(x1, x2, x3)] |
= |
1 |
[U63(x1, x2, x3)] |
= |
1 |
[U64(x1, x2, x3)] |
= |
1 |
[s(x1)] |
= |
0 |
[plus(x1, x2)] |
= |
1 |
[U41(x1)] |
= |
0 |
[U51(x1, x2)] |
= |
0 |
[active(x1)] |
= |
0 |
[0] |
= |
0 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U62(X1,mark(X2),X3) |
→ |
U62(X1,X2,X3) |
(118) |
U62(mark(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(117) |
U62(X1,X2,mark(X3)) |
→ |
U62(X1,X2,X3) |
(119) |
U62(active(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(120) |
U62(X1,active(X2),X3) |
→ |
U62(X1,X2,X3) |
(121) |
U62(X1,X2,active(X3)) |
→ |
U62(X1,X2,X3) |
(122) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U63(X1,mark(X2),X3) |
→ |
U63(X1,X2,X3) |
(124) |
U63(mark(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(123) |
U63(X1,X2,mark(X3)) |
→ |
U63(X1,X2,X3) |
(125) |
U63(active(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(126) |
U63(X1,active(X2),X3) |
→ |
U63(X1,X2,X3) |
(127) |
U63(X1,X2,active(X3)) |
→ |
U63(X1,X2,X3) |
(128) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
plus(X1,mark(X2)) |
→ |
plus(X1,X2) |
(138) |
plus(mark(X1),X2) |
→ |
plus(X1,X2) |
(137) |
plus(active(X1),X2) |
→ |
plus(X1,X2) |
(139) |
plus(X1,active(X2)) |
→ |
plus(X1,X2) |
(140) |
U51(X1,mark(X2)) |
→ |
U51(X1,X2) |
(104) |
U51(mark(X1),X2) |
→ |
U51(X1,X2) |
(103) |
U51(active(X1),X2) |
→ |
U51(X1,X2) |
(105) |
U51(X1,active(X2)) |
→ |
U51(X1,X2) |
(106) |
U52(X1,mark(X2)) |
→ |
U52(X1,X2) |
(108) |
U52(mark(X1),X2) |
→ |
U52(X1,X2) |
(107) |
U52(active(X1),X2) |
→ |
U52(X1,X2) |
(109) |
U52(X1,active(X2)) |
→ |
U52(X1,X2) |
(110) |
U61(X1,mark(X2),X3) |
→ |
U61(X1,X2,X3) |
(112) |
U61(mark(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(111) |
U61(X1,X2,mark(X3)) |
→ |
U61(X1,X2,X3) |
(113) |
U61(active(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(114) |
U61(X1,active(X2),X3) |
→ |
U61(X1,X2,X3) |
(115) |
U61(X1,X2,active(X3)) |
→ |
U61(X1,X2,X3) |
(116) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(U51(X1,X2)) |
→ |
active#(U51(mark(X1),X2)) |
(244) |
could be deleted.
1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
[mark#(x1)] |
= |
1 · x1
|
[U11(x1, x2, x3)] |
= |
1 · x1
|
[active#(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[tt] |
= |
0 |
[U12(x1, x2, x3)] |
= |
1 · x1
|
[isNatKind(x1)] |
= |
0 |
[U13(x1, x2, x3)] |
= |
1 · x1
|
[U14(x1, x2, x3)] |
= |
1 · x1
|
[U15(x1, x2)] |
= |
1 · x1
|
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 · x1
|
[U21(x1, x2)] |
= |
1 · x1
|
[U22(x1, x2)] |
= |
1 · x1
|
[U23(x1)] |
= |
1 · x1
|
[U31(x1, x2)] |
= |
1 · x1
|
[U32(x1)] |
= |
1 · x1
|
[U52(x1, x2)] |
= |
1 + 1 · x1 + 1 · x2
|
[U61(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U62(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U63(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U64(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[s(x1)] |
= |
1 · x1
|
[plus(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[U41(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U51(x1, x2)] |
= |
1 + 1 · x2
|
[0] |
= |
1 |
the
pairs
active#(U52(tt,N)) |
→ |
mark#(N) |
(172) |
mark#(U52(X1,X2)) |
→ |
mark#(X1) |
(249) |
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
[mark#(x1)] |
= |
1 |
[U11(x1, x2, x3)] |
= |
1 |
[active#(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
0 |
[tt] |
= |
0 |
[U12(x1, x2, x3)] |
= |
1 |
[isNatKind(x1)] |
= |
1 |
[U13(x1, x2, x3)] |
= |
1 |
[U14(x1, x2, x3)] |
= |
1 |
[U15(x1, x2)] |
= |
1 |
[isNat(x1)] |
= |
1 |
[U16(x1)] |
= |
0 |
[U21(x1, x2)] |
= |
1 |
[U22(x1, x2)] |
= |
1 |
[U23(x1)] |
= |
0 |
[U31(x1, x2)] |
= |
1 |
[U32(x1)] |
= |
0 |
[U61(x1, x2, x3)] |
= |
1 |
[U62(x1, x2, x3)] |
= |
1 |
[U63(x1, x2, x3)] |
= |
1 |
[U64(x1, x2, x3)] |
= |
1 |
[s(x1)] |
= |
0 |
[plus(x1, x2)] |
= |
1 |
[U41(x1)] |
= |
0 |
[U52(x1, x2)] |
= |
0 |
[active(x1)] |
= |
0 |
[U51(x1, x2)] |
= |
0 |
[0] |
= |
0 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U62(X1,mark(X2),X3) |
→ |
U62(X1,X2,X3) |
(118) |
U62(mark(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(117) |
U62(X1,X2,mark(X3)) |
→ |
U62(X1,X2,X3) |
(119) |
U62(active(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(120) |
U62(X1,active(X2),X3) |
→ |
U62(X1,X2,X3) |
(121) |
U62(X1,X2,active(X3)) |
→ |
U62(X1,X2,X3) |
(122) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U63(X1,mark(X2),X3) |
→ |
U63(X1,X2,X3) |
(124) |
U63(mark(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(123) |
U63(X1,X2,mark(X3)) |
→ |
U63(X1,X2,X3) |
(125) |
U63(active(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(126) |
U63(X1,active(X2),X3) |
→ |
U63(X1,X2,X3) |
(127) |
U63(X1,X2,active(X3)) |
→ |
U63(X1,X2,X3) |
(128) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
plus(X1,mark(X2)) |
→ |
plus(X1,X2) |
(138) |
plus(mark(X1),X2) |
→ |
plus(X1,X2) |
(137) |
plus(active(X1),X2) |
→ |
plus(X1,X2) |
(139) |
plus(X1,active(X2)) |
→ |
plus(X1,X2) |
(140) |
U52(X1,mark(X2)) |
→ |
U52(X1,X2) |
(108) |
U52(mark(X1),X2) |
→ |
U52(X1,X2) |
(107) |
U52(active(X1),X2) |
→ |
U52(X1,X2) |
(109) |
U52(X1,active(X2)) |
→ |
U52(X1,X2) |
(110) |
U61(X1,mark(X2),X3) |
→ |
U61(X1,X2,X3) |
(112) |
U61(mark(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(111) |
U61(X1,X2,mark(X3)) |
→ |
U61(X1,X2,X3) |
(113) |
U61(active(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(114) |
U61(X1,active(X2),X3) |
→ |
U61(X1,X2,X3) |
(115) |
U61(X1,X2,active(X3)) |
→ |
U61(X1,X2,X3) |
(116) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(U52(X1,X2)) |
→ |
active#(U52(mark(X1),X2)) |
(247) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
[mark#(x1)] |
= |
1 · x1
|
[U11(x1, x2, x3)] |
= |
1 · x1
|
[active#(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[tt] |
= |
1 |
[U12(x1, x2, x3)] |
= |
1 · x1
|
[isNatKind(x1)] |
= |
1 |
[U13(x1, x2, x3)] |
= |
1 · x1
|
[U14(x1, x2, x3)] |
= |
1 · x1
|
[U15(x1, x2)] |
= |
1 · x1
|
[isNat(x1)] |
= |
1 |
[U16(x1)] |
= |
1 · x1
|
[U21(x1, x2)] |
= |
1 · x1
|
[U22(x1, x2)] |
= |
1 · x1
|
[U23(x1)] |
= |
1 · x1
|
[U31(x1, x2)] |
= |
1 · x1
|
[U32(x1)] |
= |
1 · x1
|
[U61(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U62(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U63(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[U64(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[s(x1)] |
= |
1 + 1 · x1
|
[plus(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[U41(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U51(x1, x2)] |
= |
1 · x2
|
[U52(x1, x2)] |
= |
1 · x2
|
[0] |
= |
0 |
the
pair
mark#(s(X)) |
→ |
mark#(X) |
(264) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U12(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U13(x1, x2, x3)] |
= |
1 + x1
|
[U14(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U15(x1, x2)] |
= |
1 + 2 · x1
|
[U21(x1, x2)] |
= |
1 + x1
|
[U22(x1, x2)] |
= |
1 + x1
|
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[U61(x1, x2, x3)] |
= |
1 + x1
|
[U62(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U63(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U64(x1, x2, x3)] |
= |
1 + 2 · x1
|
[plus(x1, x2)] |
= |
2 + 2 · x1 + 2 · x2
|
[mark(x1)] |
= |
x1 |
[active(x1)] |
= |
2 + x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 + x1
|
[U23(x1)] |
= |
1 + 2 · x1
|
[U32(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
-2 + x1 + x2
|
[U52(x1, x2)] |
= |
2 + x2
|
[U41(x1)] |
= |
1 + 2 · x1
|
[s(x1)] |
= |
0 |
[0] |
= |
0 |
[mark#(x1)] |
= |
-1 + x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U23(active(X)) |
→ |
U23(X) |
(94) |
U23(mark(X)) |
→ |
U23(X) |
(93) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U62(X1,mark(X2),X3) |
→ |
U62(X1,X2,X3) |
(118) |
U62(mark(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(117) |
U62(X1,X2,mark(X3)) |
→ |
U62(X1,X2,X3) |
(119) |
U62(active(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(120) |
U62(X1,active(X2),X3) |
→ |
U62(X1,X2,X3) |
(121) |
U62(X1,X2,active(X3)) |
→ |
U62(X1,X2,X3) |
(122) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U63(X1,mark(X2),X3) |
→ |
U63(X1,X2,X3) |
(124) |
U63(mark(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(123) |
U63(X1,X2,mark(X3)) |
→ |
U63(X1,X2,X3) |
(125) |
U63(active(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(126) |
U63(X1,active(X2),X3) |
→ |
U63(X1,X2,X3) |
(127) |
U63(X1,X2,active(X3)) |
→ |
U63(X1,X2,X3) |
(128) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
s(active(X)) |
→ |
s(X) |
(136) |
s(mark(X)) |
→ |
s(X) |
(135) |
U61(X1,mark(X2),X3) |
→ |
U61(X1,X2,X3) |
(112) |
U61(mark(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(111) |
U61(X1,X2,mark(X3)) |
→ |
U61(X1,X2,X3) |
(113) |
U61(active(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(114) |
U61(X1,active(X2),X3) |
→ |
U61(X1,X2,X3) |
(115) |
U61(X1,X2,active(X3)) |
→ |
U61(X1,X2,X3) |
(116) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(plus(X1,X2)) |
→ |
active#(plus(mark(X1),mark(X2))) |
(265) |
mark#(plus(X1,X2)) |
→ |
mark#(X1) |
(267) |
mark#(plus(X1,X2)) |
→ |
mark#(X2) |
(268) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + x1
|
[U11(x1, x2, x3)] |
= |
2 |
[U12(x1, x2, x3)] |
= |
-2 |
[U13(x1, x2, x3)] |
= |
0 |
[U14(x1, x2, x3)] |
= |
2 |
[U15(x1, x2)] |
= |
2 |
[U21(x1, x2)] |
= |
2 |
[U22(x1, x2)] |
= |
2 |
[U31(x1, x2)] |
= |
2 |
[U61(x1, x2, x3)] |
= |
2 |
[U62(x1, x2, x3)] |
= |
-2 |
[U63(x1, x2, x3)] |
= |
2 |
[U64(x1, x2, x3)] |
= |
2 |
[mark(x1)] |
= |
2 |
[active(x1)] |
= |
-2 |
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
2 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
-2 + 2 · x1
|
[U23(x1)] |
= |
-2 + 2 · x1
|
[U32(x1)] |
= |
-2 |
[U51(x1, x2)] |
= |
2 |
[U52(x1, x2)] |
= |
-2 + x1
|
[U41(x1)] |
= |
2 + x1
|
[s(x1)] |
= |
2 + x1
|
[plus(x1, x2)] |
= |
1 + 2 · x2
|
[0] |
= |
0 |
[mark#(x1)] |
= |
-2 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U62(X1,mark(X2),X3) |
→ |
U62(X1,X2,X3) |
(118) |
U62(mark(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(117) |
U62(X1,X2,mark(X3)) |
→ |
U62(X1,X2,X3) |
(119) |
U62(active(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(120) |
U62(X1,active(X2),X3) |
→ |
U62(X1,X2,X3) |
(121) |
U62(X1,X2,active(X3)) |
→ |
U62(X1,X2,X3) |
(122) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U63(X1,mark(X2),X3) |
→ |
U63(X1,X2,X3) |
(124) |
U63(mark(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(123) |
U63(X1,X2,mark(X3)) |
→ |
U63(X1,X2,X3) |
(125) |
U63(active(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(126) |
U63(X1,active(X2),X3) |
→ |
U63(X1,X2,X3) |
(127) |
U63(X1,X2,active(X3)) |
→ |
U63(X1,X2,X3) |
(128) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
U61(X1,mark(X2),X3) |
→ |
U61(X1,X2,X3) |
(112) |
U61(mark(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(111) |
U61(X1,X2,mark(X3)) |
→ |
U61(X1,X2,X3) |
(113) |
U61(active(X1),X2,X3) |
→ |
U61(X1,X2,X3) |
(114) |
U61(X1,active(X2),X3) |
→ |
U61(X1,X2,X3) |
(115) |
U61(X1,X2,active(X3)) |
→ |
U61(X1,X2,X3) |
(116) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(plus(N,s(M))) |
→ |
mark#(U61(isNat(M),M,N)) |
(202) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
1 + x1
|
[U12(x1, x2, x3)] |
= |
1 + x1
|
[U13(x1, x2, x3)] |
= |
1 + x1
|
[U14(x1, x2, x3)] |
= |
1 + x1
|
[U15(x1, x2)] |
= |
1 + 2 · x1
|
[U21(x1, x2)] |
= |
1 + 2 · x1
|
[U22(x1, x2)] |
= |
1 + x1
|
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[U61(x1, x2, x3)] |
= |
2 + x1 + 2 · x2 + 2 · x3
|
[U62(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U63(x1, x2, x3)] |
= |
1 + x1
|
[U64(x1, x2, x3)] |
= |
1 + x1
|
[mark(x1)] |
= |
2 + x1
|
[active(x1)] |
= |
x1 |
[tt] |
= |
2 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 + 2 · x1
|
[U23(x1)] |
= |
1 + 2 · x1
|
[U32(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
-2 + x2
|
[U52(x1, x2)] |
= |
-2 + 2 · x2
|
[U41(x1)] |
= |
1 + 2 · x1
|
[s(x1)] |
= |
0 |
[plus(x1, x2)] |
= |
2 |
[0] |
= |
0 |
[mark#(x1)] |
= |
-1 + x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U23(active(X)) |
→ |
U23(X) |
(94) |
U23(mark(X)) |
→ |
U23(X) |
(93) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U62(X1,mark(X2),X3) |
→ |
U62(X1,X2,X3) |
(118) |
U62(mark(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(117) |
U62(X1,X2,mark(X3)) |
→ |
U62(X1,X2,X3) |
(119) |
U62(active(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(120) |
U62(X1,active(X2),X3) |
→ |
U62(X1,X2,X3) |
(121) |
U62(X1,X2,active(X3)) |
→ |
U62(X1,X2,X3) |
(122) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U63(X1,mark(X2),X3) |
→ |
U63(X1,X2,X3) |
(124) |
U63(mark(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(123) |
U63(X1,X2,mark(X3)) |
→ |
U63(X1,X2,X3) |
(125) |
U63(active(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(126) |
U63(X1,active(X2),X3) |
→ |
U63(X1,X2,X3) |
(127) |
U63(X1,X2,active(X3)) |
→ |
U63(X1,X2,X3) |
(128) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
s(active(X)) |
→ |
s(X) |
(136) |
s(mark(X)) |
→ |
s(X) |
(135) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(U61(X1,X2,X3)) |
→ |
active#(U61(mark(X1),X2,X3)) |
(250) |
mark#(U61(X1,X2,X3)) |
→ |
mark#(X1) |
(252) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + 2 · x1
|
[U11(x1, x2, x3)] |
= |
0 |
[U12(x1, x2, x3)] |
= |
-2 |
[U13(x1, x2, x3)] |
= |
-2 |
[U14(x1, x2, x3)] |
= |
-2 |
[U15(x1, x2)] |
= |
-2 |
[U21(x1, x2)] |
= |
-2 |
[U22(x1, x2)] |
= |
1 |
[U31(x1, x2)] |
= |
1 |
[U62(x1, x2, x3)] |
= |
-2 |
[U63(x1, x2, x3)] |
= |
-2 |
[U64(x1, x2, x3)] |
= |
-2 |
[mark(x1)] |
= |
2 |
[active(x1)] |
= |
2 + 2 · x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
1 |
[U16(x1)] |
= |
-2 + 2 · x1
|
[U23(x1)] |
= |
-2 |
[U32(x1)] |
= |
-2 + 2 · x1
|
[U51(x1, x2)] |
= |
1 |
[U52(x1, x2)] |
= |
-2 + 2 · x1
|
[U61(x1, x2, x3)] |
= |
2 + x1
|
[U41(x1)] |
= |
-2 + x1
|
[s(x1)] |
= |
1 + x1
|
[plus(x1, x2)] |
= |
-2 + 2 · x1 + x2
|
[0] |
= |
2 |
[mark#(x1)] |
= |
-2 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U62(X1,mark(X2),X3) |
→ |
U62(X1,X2,X3) |
(118) |
U62(mark(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(117) |
U62(X1,X2,mark(X3)) |
→ |
U62(X1,X2,X3) |
(119) |
U62(active(X1),X2,X3) |
→ |
U62(X1,X2,X3) |
(120) |
U62(X1,active(X2),X3) |
→ |
U62(X1,X2,X3) |
(121) |
U62(X1,X2,active(X3)) |
→ |
U62(X1,X2,X3) |
(122) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U63(X1,mark(X2),X3) |
→ |
U63(X1,X2,X3) |
(124) |
U63(mark(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(123) |
U63(X1,X2,mark(X3)) |
→ |
U63(X1,X2,X3) |
(125) |
U63(active(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(126) |
U63(X1,active(X2),X3) |
→ |
U63(X1,X2,X3) |
(127) |
U63(X1,X2,active(X3)) |
→ |
U63(X1,X2,X3) |
(128) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(U61(tt,M,N)) |
→ |
mark#(U62(isNatKind(M),M,N)) |
(173) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U12(x1, x2, x3)] |
= |
1 + x1
|
[U13(x1, x2, x3)] |
= |
1 + x1
|
[U14(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U15(x1, x2)] |
= |
1 + x1
|
[U21(x1, x2)] |
= |
1 + 2 · x1
|
[U22(x1, x2)] |
= |
1 + 2 · x1
|
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[U62(x1, x2, x3)] |
= |
2 + x1 + 2 · x2 + 2 · x3
|
[U63(x1, x2, x3)] |
= |
1 + x1
|
[U64(x1, x2, x3)] |
= |
1 + 2 · x1
|
[mark(x1)] |
= |
x1 |
[active(x1)] |
= |
2 + 2 · x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 + x1
|
[U23(x1)] |
= |
1 + 2 · x1
|
[U32(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
-2 + x1 + 2 · x2
|
[U52(x1, x2)] |
= |
-2 + x1 + x2
|
[U61(x1, x2, x3)] |
= |
2 + 2 · x1 + 2 · x3
|
[U41(x1)] |
= |
1 + x1
|
[s(x1)] |
= |
0 |
[plus(x1, x2)] |
= |
-2 + 2 · x1
|
[0] |
= |
0 |
[mark#(x1)] |
= |
-1 + x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U23(active(X)) |
→ |
U23(X) |
(94) |
U23(mark(X)) |
→ |
U23(X) |
(93) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U63(X1,mark(X2),X3) |
→ |
U63(X1,X2,X3) |
(124) |
U63(mark(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(123) |
U63(X1,X2,mark(X3)) |
→ |
U63(X1,X2,X3) |
(125) |
U63(active(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(126) |
U63(X1,active(X2),X3) |
→ |
U63(X1,X2,X3) |
(127) |
U63(X1,X2,active(X3)) |
→ |
U63(X1,X2,X3) |
(128) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
s(active(X)) |
→ |
s(X) |
(136) |
s(mark(X)) |
→ |
s(X) |
(135) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(U62(X1,X2,X3)) |
→ |
active#(U62(mark(X1),X2,X3)) |
(253) |
mark#(U62(X1,X2,X3)) |
→ |
mark#(X1) |
(255) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + x1
|
[U11(x1, x2, x3)] |
= |
2 |
[U12(x1, x2, x3)] |
= |
-2 |
[U13(x1, x2, x3)] |
= |
2 |
[U14(x1, x2, x3)] |
= |
2 |
[U15(x1, x2)] |
= |
2 |
[U21(x1, x2)] |
= |
0 |
[U22(x1, x2)] |
= |
-2 |
[U31(x1, x2)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
-2 |
[U64(x1, x2, x3)] |
= |
2 |
[mark(x1)] |
= |
2 |
[active(x1)] |
= |
2 |
[tt] |
= |
2 |
[isNatKind(x1)] |
= |
2 |
[isNat(x1)] |
= |
2 |
[U16(x1)] |
= |
x1 |
[U23(x1)] |
= |
-1 + x1
|
[U32(x1)] |
= |
2 |
[U51(x1, x2)] |
= |
2 + x1
|
[U52(x1, x2)] |
= |
-2 + 2 · x1
|
[U61(x1, x2, x3)] |
= |
-2 + 2 · x3
|
[U62(x1, x2, x3)] |
= |
-1 + 2 · x1
|
[U41(x1)] |
= |
0 |
[s(x1)] |
= |
-1 + x1
|
[plus(x1, x2)] |
= |
-1 + x1
|
[0] |
= |
0 |
[mark#(x1)] |
= |
-2 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U63(X1,mark(X2),X3) |
→ |
U63(X1,X2,X3) |
(124) |
U63(mark(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(123) |
U63(X1,X2,mark(X3)) |
→ |
U63(X1,X2,X3) |
(125) |
U63(active(X1),X2,X3) |
→ |
U63(X1,X2,X3) |
(126) |
U63(X1,active(X2),X3) |
→ |
U63(X1,X2,X3) |
(127) |
U63(X1,X2,active(X3)) |
→ |
U63(X1,X2,X3) |
(128) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(U62(tt,M,N)) |
→ |
mark#(U63(isNat(N),M,N)) |
(176) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U12(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U13(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U14(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U15(x1, x2)] |
= |
1 + 2 · x1
|
[U21(x1, x2)] |
= |
1 + 2 · x1
|
[U22(x1, x2)] |
= |
1 + 2 · x1
|
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[U63(x1, x2, x3)] |
= |
2 + 2 · x1 + x2 + x3
|
[U64(x1, x2, x3)] |
= |
1 + 2 · x1
|
[mark(x1)] |
= |
2 · x1
|
[active(x1)] |
= |
2 + 2 · x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 + 2 · x1
|
[U23(x1)] |
= |
1 + x1
|
[U32(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
-2 + 2 · x1 + x2
|
[U52(x1, x2)] |
= |
-2 + x1
|
[U61(x1, x2, x3)] |
= |
2 + 2 · x2
|
[U62(x1, x2, x3)] |
= |
1 |
[U41(x1)] |
= |
1 + x1
|
[s(x1)] |
= |
-2 |
[plus(x1, x2)] |
= |
2 + x1
|
[0] |
= |
0 |
[mark#(x1)] |
= |
-1 + x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U23(active(X)) |
→ |
U23(X) |
(94) |
U23(mark(X)) |
→ |
U23(X) |
(93) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
s(active(X)) |
→ |
s(X) |
(136) |
s(mark(X)) |
→ |
s(X) |
(135) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(U63(X1,X2,X3)) |
→ |
active#(U63(mark(X1),X2,X3)) |
(256) |
mark#(U63(X1,X2,X3)) |
→ |
mark#(X1) |
(258) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + x1
|
[U11(x1, x2, x3)] |
= |
-2 |
[U12(x1, x2, x3)] |
= |
2 |
[U13(x1, x2, x3)] |
= |
-2 |
[U14(x1, x2, x3)] |
= |
2 |
[U15(x1, x2)] |
= |
-2 |
[U21(x1, x2)] |
= |
2 |
[U22(x1, x2)] |
= |
2 |
[U31(x1, x2)] |
= |
2 |
[U64(x1, x2, x3)] |
= |
-2 |
[mark(x1)] |
= |
-2 |
[active(x1)] |
= |
2 |
[tt] |
= |
2 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
2 |
[U16(x1)] |
= |
-1 + x1
|
[U23(x1)] |
= |
-2 |
[U32(x1)] |
= |
-1 + x1
|
[U51(x1, x2)] |
= |
-2 + x1 + 2 · x2
|
[U52(x1, x2)] |
= |
-2 + 2 · x1
|
[U61(x1, x2, x3)] |
= |
-2 + 2 · x1
|
[U62(x1, x2, x3)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U41(x1)] |
= |
0 |
[s(x1)] |
= |
-1 + x1
|
[plus(x1, x2)] |
= |
-2 + 2 · x1 + 2 · x2
|
[0] |
= |
0 |
[mark#(x1)] |
= |
-2 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U64(X1,mark(X2),X3) |
→ |
U64(X1,X2,X3) |
(130) |
U64(mark(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(129) |
U64(X1,X2,mark(X3)) |
→ |
U64(X1,X2,X3) |
(131) |
U64(active(X1),X2,X3) |
→ |
U64(X1,X2,X3) |
(132) |
U64(X1,active(X2),X3) |
→ |
U64(X1,X2,X3) |
(133) |
U64(X1,X2,active(X3)) |
→ |
U64(X1,X2,X3) |
(134) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(U63(tt,M,N)) |
→ |
mark#(U64(isNatKind(N),M,N)) |
(179) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U12(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U13(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U14(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U15(x1, x2)] |
= |
1 + x1
|
[U21(x1, x2)] |
= |
1 + 2 · x1
|
[U22(x1, x2)] |
= |
1 + 2 · x1
|
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[U64(x1, x2, x3)] |
= |
2 + x1 + x2 + x3
|
[mark(x1)] |
= |
2 + 2 · x1
|
[active(x1)] |
= |
2 + x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 + x1
|
[U23(x1)] |
= |
1 + x1
|
[U32(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
-2 + 2 · x2
|
[U52(x1, x2)] |
= |
-2 |
[U61(x1, x2, x3)] |
= |
-2 + x2
|
[U62(x1, x2, x3)] |
= |
-2 + 2 · x3
|
[U63(x1, x2, x3)] |
= |
2 · x1 + x2 + x3
|
[U41(x1)] |
= |
1 + 2 · x1
|
[s(x1)] |
= |
-2 + 2 · x1
|
[plus(x1, x2)] |
= |
-2 |
[0] |
= |
0 |
[mark#(x1)] |
= |
-1 + x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U23(active(X)) |
→ |
U23(X) |
(94) |
U23(mark(X)) |
→ |
U23(X) |
(93) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
plus(X1,mark(X2)) |
→ |
plus(X1,X2) |
(138) |
plus(mark(X1),X2) |
→ |
plus(X1,X2) |
(137) |
plus(active(X1),X2) |
→ |
plus(X1,X2) |
(139) |
plus(X1,active(X2)) |
→ |
plus(X1,X2) |
(140) |
s(active(X)) |
→ |
s(X) |
(136) |
s(mark(X)) |
→ |
s(X) |
(135) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(U64(X1,X2,X3)) |
→ |
active#(U64(mark(X1),X2,X3)) |
(259) |
mark#(U64(X1,X2,X3)) |
→ |
mark#(X1) |
(261) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + 2 · x1
|
[U11(x1, x2, x3)] |
= |
-2 |
[U12(x1, x2, x3)] |
= |
0 |
[U13(x1, x2, x3)] |
= |
-2 |
[U14(x1, x2, x3)] |
= |
-2 |
[U15(x1, x2)] |
= |
-2 |
[U21(x1, x2)] |
= |
-2 |
[U22(x1, x2)] |
= |
1 |
[U31(x1, x2)] |
= |
-2 |
[mark(x1)] |
= |
-2 + x1
|
[active(x1)] |
= |
-2 + x1
|
[tt] |
= |
2 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
-2 + 2 · x1
|
[U23(x1)] |
= |
-2 + 2 · x1
|
[U32(x1)] |
= |
-2 + 2 · x1
|
[U51(x1, x2)] |
= |
x1 + x2
|
[U52(x1, x2)] |
= |
2 + x1
|
[U61(x1, x2, x3)] |
= |
-2 + x2 + 2 · x3
|
[U62(x1, x2, x3)] |
= |
-2 + x2 + x3
|
[U63(x1, x2, x3)] |
= |
2 + x1 + x2 + 2 · x3
|
[U64(x1, x2, x3)] |
= |
2 + 2 · x1
|
[U41(x1)] |
= |
-2 + x1
|
[s(x1)] |
= |
-2 + 2 · x1
|
[plus(x1, x2)] |
= |
2 |
[0] |
= |
0 |
[mark#(x1)] |
= |
-2 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U21(X1,mark(X2)) |
→ |
U21(X1,X2) |
(86) |
U21(mark(X1),X2) |
→ |
U21(X1,X2) |
(85) |
U21(active(X1),X2) |
→ |
U21(X1,X2) |
(87) |
U21(X1,active(X2)) |
→ |
U21(X1,X2) |
(88) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(U64(tt,M,N)) |
→ |
mark#(s(plus(N,M))) |
(182) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
x1 |
[U11(x1, x2, x3)] |
= |
2 · x1 + 2 · x2 + 2 · x3
|
[U12(x1, x2, x3)] |
= |
2 · x1 + 2 · x2 + 2 · x3
|
[U13(x1, x2, x3)] |
= |
2 · x1 + 2 · x2 + 2 · x3
|
[U14(x1, x2, x3)] |
= |
2 · x1 + 2 · x2 + 2 · x3
|
[U15(x1, x2)] |
= |
x1 + 2 · x2
|
[U21(x1, x2)] |
= |
2 · x1 + 2 · x2
|
[U22(x1, x2)] |
= |
x1 + 2 · x2
|
[U31(x1, x2)] |
= |
x1 |
[mark(x1)] |
= |
x1 |
[active(x1)] |
= |
x1 |
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
2 · x1
|
[U16(x1)] |
= |
x1 |
[U23(x1)] |
= |
x1 |
[U32(x1)] |
= |
x1 |
[U51(x1, x2)] |
= |
2 + 2 · x2
|
[U52(x1, x2)] |
= |
2 + 2 · x2
|
[U61(x1, x2, x3)] |
= |
2 + 2 · x2 + 2 · x3
|
[U62(x1, x2, x3)] |
= |
2 + x1 + 2 · x2 + 2 · x3
|
[U63(x1, x2, x3)] |
= |
2 + 2 · x2 + 2 · x3
|
[U64(x1, x2, x3)] |
= |
2 + 2 · x2 + 2 · x3
|
[U41(x1)] |
= |
2 · x1
|
[s(x1)] |
= |
1 + x1
|
[plus(x1, x2)] |
= |
2 · x1 + 2 · x2
|
[0] |
= |
2 |
[mark#(x1)] |
= |
x1 |
the
pair
active#(isNat(s(V1))) |
→ |
mark#(U21(isNatKind(V1),V1)) |
(189) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U12(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U13(x1, x2, x3)] |
= |
1 + x1
|
[U14(x1, x2, x3)] |
= |
1 + x1
|
[U15(x1, x2)] |
= |
1 + 2 · x1
|
[U21(x1, x2)] |
= |
2 + x1
|
[U22(x1, x2)] |
= |
1 + x1
|
[U31(x1, x2)] |
= |
1 + x1
|
[mark(x1)] |
= |
2 + 2 · x1
|
[active(x1)] |
= |
2 · x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 + x1
|
[U23(x1)] |
= |
1 + x1
|
[U32(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
-2 + 2 · x1 + 2 · x2
|
[U52(x1, x2)] |
= |
2 |
[U61(x1, x2, x3)] |
= |
-2 + 2 · x2
|
[U62(x1, x2, x3)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
x2 + x3
|
[U64(x1, x2, x3)] |
= |
2 + x1
|
[U41(x1)] |
= |
1 + 2 · x1
|
[s(x1)] |
= |
2 + x1
|
[plus(x1, x2)] |
= |
-2 |
[0] |
= |
0 |
[mark#(x1)] |
= |
-1 + x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U23(active(X)) |
→ |
U23(X) |
(94) |
U23(mark(X)) |
→ |
U23(X) |
(93) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(U21(X1,X2)) |
→ |
active#(U21(mark(X1),X2)) |
(226) |
mark#(U21(X1,X2)) |
→ |
mark#(X1) |
(228) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + 2 · x1
|
[U11(x1, x2, x3)] |
= |
-2 |
[U12(x1, x2, x3)] |
= |
-2 |
[U13(x1, x2, x3)] |
= |
1 |
[U14(x1, x2, x3)] |
= |
-2 |
[U15(x1, x2)] |
= |
-2 |
[U22(x1, x2)] |
= |
-2 |
[U31(x1, x2)] |
= |
-2 |
[mark(x1)] |
= |
-2 |
[active(x1)] |
= |
2 |
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
2 |
[U21(x1, x2)] |
= |
2 |
[U23(x1)] |
= |
-2 + 2 · x1
|
[U32(x1)] |
= |
-2 + 2 · x1
|
[U51(x1, x2)] |
= |
2 + x2
|
[U52(x1, x2)] |
= |
-2 + 2 · x1
|
[U61(x1, x2, x3)] |
= |
-2 + 2 · x1 + 2 · x2
|
[U62(x1, x2, x3)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
-2 + 2 · x2
|
[U64(x1, x2, x3)] |
= |
-2 + x2 + 2 · x3
|
[U41(x1)] |
= |
-2 + x1
|
[s(x1)] |
= |
-2 + x1
|
[plus(x1, x2)] |
= |
-2 + x2
|
[0] |
= |
2 |
[mark#(x1)] |
= |
-2 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U22(X1,mark(X2)) |
→ |
U22(X1,X2) |
(90) |
U22(mark(X1),X2) |
→ |
U22(X1,X2) |
(89) |
U22(active(X1),X2) |
→ |
U22(X1,X2) |
(91) |
U22(X1,active(X2)) |
→ |
U22(X1,X2) |
(92) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(U21(tt,V1)) |
→ |
mark#(U22(isNatKind(V1),V1)) |
(157) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U12(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U13(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U14(x1, x2, x3)] |
= |
1 + x1
|
[U15(x1, x2)] |
= |
1 + 2 · x1
|
[U22(x1, x2)] |
= |
2 + 2 · x1 + 2 · x2
|
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[mark(x1)] |
= |
2 · x1
|
[active(x1)] |
= |
2 + 2 · x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 + x1
|
[U21(x1, x2)] |
= |
2 |
[U23(x1)] |
= |
1 + x1
|
[U32(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
-2 + 2 · x1 + 2 · x2
|
[U52(x1, x2)] |
= |
-2 + 2 · x1
|
[U61(x1, x2, x3)] |
= |
2 + 2 · x2
|
[U62(x1, x2, x3)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
2 + 2 · x2
|
[U64(x1, x2, x3)] |
= |
-2 + 2 · x1 + 2 · x3
|
[U41(x1)] |
= |
1 + x1
|
[s(x1)] |
= |
-2 + x1
|
[plus(x1, x2)] |
= |
-2 + 2 · x1 + 2 · x2
|
[0] |
= |
1 |
[mark#(x1)] |
= |
-2 + 2 · x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U23(active(X)) |
→ |
U23(X) |
(94) |
U23(mark(X)) |
→ |
U23(X) |
(93) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(U22(X1,X2)) |
→ |
active#(U22(mark(X1),X2)) |
(229) |
mark#(U22(X1,X2)) |
→ |
mark#(X1) |
(231) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + 2 · x1
|
[U11(x1, x2, x3)] |
= |
1 |
[U12(x1, x2, x3)] |
= |
-2 |
[U13(x1, x2, x3)] |
= |
-2 |
[U14(x1, x2, x3)] |
= |
1 |
[U15(x1, x2)] |
= |
1 |
[U31(x1, x2)] |
= |
1 |
[mark(x1)] |
= |
2 |
[active(x1)] |
= |
-2 + 2 · x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
1 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
-2 |
[U21(x1, x2)] |
= |
-2 + 2 · x2
|
[U22(x1, x2)] |
= |
2 + x2
|
[U23(x1)] |
= |
-2 + 2 · x1
|
[U32(x1)] |
= |
-2 |
[U51(x1, x2)] |
= |
-2 + 2 · x2
|
[U52(x1, x2)] |
= |
-2 + 2 · x2
|
[U61(x1, x2, x3)] |
= |
2 |
[U62(x1, x2, x3)] |
= |
-2 + x1 + 2 · x2 + x3
|
[U63(x1, x2, x3)] |
= |
-2 + 2 · x1 + 2 · x3
|
[U64(x1, x2, x3)] |
= |
-2 + 2 · x2
|
[U41(x1)] |
= |
0 |
[s(x1)] |
= |
2 |
[plus(x1, x2)] |
= |
x2 |
[0] |
= |
0 |
[mark#(x1)] |
= |
-2 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(U22(tt,V1)) |
→ |
mark#(U23(isNat(V1))) |
(160) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U12(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U13(x1, x2, x3)] |
= |
1 + x1
|
[U14(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U15(x1, x2)] |
= |
1 + x1
|
[U31(x1, x2)] |
= |
1 + x1
|
[mark(x1)] |
= |
2 + x1
|
[active(x1)] |
= |
2 + 2 · x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 + x1
|
[U21(x1, x2)] |
= |
-2 + x1
|
[U22(x1, x2)] |
= |
-2 + x1
|
[U23(x1)] |
= |
2 + x1
|
[U32(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
2 |
[U52(x1, x2)] |
= |
2 |
[U61(x1, x2, x3)] |
= |
2 + x1
|
[U62(x1, x2, x3)] |
= |
-2 + 2 · x1 + 2 · x2 + 2 · x3
|
[U63(x1, x2, x3)] |
= |
x1 |
[U64(x1, x2, x3)] |
= |
x2 + x3
|
[U41(x1)] |
= |
1 + 2 · x1
|
[s(x1)] |
= |
2 + x1
|
[plus(x1, x2)] |
= |
-2 + 2 · x1
|
[0] |
= |
0 |
[mark#(x1)] |
= |
-1 + x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U14(X1,mark(X2),X3) |
→ |
U14(X1,X2,X3) |
(72) |
U14(mark(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(71) |
U14(X1,X2,mark(X3)) |
→ |
U14(X1,X2,X3) |
(73) |
U14(active(X1),X2,X3) |
→ |
U14(X1,X2,X3) |
(74) |
U14(X1,active(X2),X3) |
→ |
U14(X1,X2,X3) |
(75) |
U14(X1,X2,active(X3)) |
→ |
U14(X1,X2,X3) |
(76) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(U23(X)) |
→ |
mark#(X) |
(234) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
2 + x1
|
[U11(x1, x2, x3)] |
= |
2 + 2 · x1 + 2 · x2 + 2 · x3
|
[U12(x1, x2, x3)] |
= |
2 + 2 · x1 + 2 · x2 + 2 · x3
|
[U13(x1, x2, x3)] |
= |
2 + 2 · x1 + 2 · x2 + 2 · x3
|
[U14(x1, x2, x3)] |
= |
x1 + 2 · x2 + 2 · x3
|
[U15(x1, x2)] |
= |
x1 + 2 · x2
|
[U31(x1, x2)] |
= |
x1 |
[mark(x1)] |
= |
x1 |
[active(x1)] |
= |
x1 |
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
2 · x1
|
[U16(x1)] |
= |
x1 |
[U21(x1, x2)] |
= |
-2 |
[U22(x1, x2)] |
= |
-2 |
[U23(x1)] |
= |
-2 |
[U32(x1)] |
= |
x1 |
[U51(x1, x2)] |
= |
2 + x2
|
[U52(x1, x2)] |
= |
2 + 2 · x1 + x2
|
[U61(x1, x2, x3)] |
= |
2 + x3
|
[U62(x1, x2, x3)] |
= |
2 + x3
|
[U63(x1, x2, x3)] |
= |
2 + x3
|
[U64(x1, x2, x3)] |
= |
2 + x3
|
[U41(x1)] |
= |
2 · x1
|
[s(x1)] |
= |
1 |
[plus(x1, x2)] |
= |
1 + x1 + 2 · x2
|
[0] |
= |
1 |
[mark#(x1)] |
= |
2 + x1
|
the
pairs
mark#(U11(X1,X2,X3)) |
→ |
mark#(X1) |
(207) |
mark#(U12(X1,X2,X3)) |
→ |
mark#(X1) |
(211) |
active#(U13(tt,V1,V2)) |
→ |
mark#(U14(isNatKind(V2),V1,V2)) |
(147) |
mark#(U13(X1,X2,X3)) |
→ |
mark#(X1) |
(215) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
1 + x1
|
[U12(x1, x2, x3)] |
= |
-2 |
[U13(x1, x2, x3)] |
= |
-2 |
[U14(x1, x2, x3)] |
= |
2 + 2 · x1
|
[U15(x1, x2)] |
= |
1 + 2 · x1
|
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[mark(x1)] |
= |
2 · x1
|
[active(x1)] |
= |
2 + 2 · x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 + 2 · x1
|
[U21(x1, x2)] |
= |
2 + 2 · x1 + x2
|
[U22(x1, x2)] |
= |
-2 + x1 + x2
|
[U23(x1)] |
= |
2 |
[U32(x1)] |
= |
1 + 2 · x1
|
[U51(x1, x2)] |
= |
-2 + x2
|
[U52(x1, x2)] |
= |
-2 + 2 · x1
|
[U61(x1, x2, x3)] |
= |
-2 + x1
|
[U62(x1, x2, x3)] |
= |
x2 + x3
|
[U63(x1, x2, x3)] |
= |
2 + x1
|
[U64(x1, x2, x3)] |
= |
2 |
[U41(x1)] |
= |
1 + 2 · x1
|
[s(x1)] |
= |
0 |
[plus(x1, x2)] |
= |
x1 + x2
|
[0] |
= |
1 |
[mark#(x1)] |
= |
-2 + 2 · x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(U14(X1,X2,X3)) |
→ |
active#(U14(mark(X1),X2,X3)) |
(216) |
mark#(U14(X1,X2,X3)) |
→ |
mark#(X1) |
(218) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + 2 · x1
|
[U11(x1, x2, x3)] |
= |
1 |
[U12(x1, x2, x3)] |
= |
-2 |
[U13(x1, x2, x3)] |
= |
-2 |
[U15(x1, x2)] |
= |
-2 |
[U31(x1, x2)] |
= |
1 |
[mark(x1)] |
= |
-1 + 2 · x1
|
[active(x1)] |
= |
-2 + 2 · x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[U14(x1, x2, x3)] |
= |
2 + x3
|
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
2 |
[U21(x1, x2)] |
= |
-1 + x1 + x2
|
[U22(x1, x2)] |
= |
-2 + x1 + x2
|
[U23(x1)] |
= |
-1 + x1
|
[U32(x1)] |
= |
-2 |
[U51(x1, x2)] |
= |
-2 + 2 · x1 + x2
|
[U52(x1, x2)] |
= |
-2 + x1
|
[U61(x1, x2, x3)] |
= |
-1 + x2 + x3
|
[U62(x1, x2, x3)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
2 |
[U64(x1, x2, x3)] |
= |
-2 + 2 · x2
|
[U41(x1)] |
= |
-2 + x1
|
[s(x1)] |
= |
-2 + 2 · x1
|
[plus(x1, x2)] |
= |
-2 + x2
|
[0] |
= |
0 |
[mark#(x1)] |
= |
0 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(U14(tt,V1,V2)) |
→ |
mark#(U15(isNat(V1),V2)) |
(150) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-1 + 2 · x1
|
[U11(x1, x2, x3)] |
= |
1 |
[U12(x1, x2, x3)] |
= |
1 |
[U13(x1, x2, x3)] |
= |
-2 |
[U15(x1, x2)] |
= |
1 |
[U31(x1, x2)] |
= |
1 |
[mark(x1)] |
= |
-2 |
[active(x1)] |
= |
2 |
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
1 |
[U14(x1, x2, x3)] |
= |
-2 + x1 + 2 · x2
|
[isNat(x1)] |
= |
1 |
[U16(x1)] |
= |
0 |
[U21(x1, x2)] |
= |
-2 + x1
|
[U22(x1, x2)] |
= |
x1 |
[U23(x1)] |
= |
-2 |
[U32(x1)] |
= |
0 |
[U51(x1, x2)] |
= |
2 + 2 · x2
|
[U52(x1, x2)] |
= |
2 + 2 · x2
|
[U61(x1, x2, x3)] |
= |
-2 + 2 · x3
|
[U62(x1, x2, x3)] |
= |
-2 + x1 + x2
|
[U63(x1, x2, x3)] |
= |
-2 + x2 + x3
|
[U64(x1, x2, x3)] |
= |
-2 + 2 · x2
|
[U41(x1)] |
= |
-2 |
[s(x1)] |
= |
2 |
[plus(x1, x2)] |
= |
-2 + 2 · x1
|
[0] |
= |
0 |
[mark#(x1)] |
= |
1 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U15(X1,mark(X2)) |
→ |
U15(X1,X2) |
(78) |
U15(mark(X1),X2) |
→ |
U15(X1,X2) |
(77) |
U15(active(X1),X2) |
→ |
U15(X1,X2) |
(79) |
U15(X1,active(X2)) |
→ |
U15(X1,X2) |
(80) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(U13(X1,X2,X3)) |
→ |
active#(U13(mark(X1),X2,X3)) |
(213) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
1 |
[U12(x1, x2, x3)] |
= |
-2 |
[U15(x1, x2)] |
= |
2 + 2 · x1 + x2
|
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[mark(x1)] |
= |
2 · x1
|
[active(x1)] |
= |
x1 |
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[U13(x1, x2, x3)] |
= |
-2 |
[U14(x1, x2, x3)] |
= |
2 |
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
1 + x1
|
[U21(x1, x2)] |
= |
2 |
[U22(x1, x2)] |
= |
-2 + 2 · x2
|
[U23(x1)] |
= |
2 |
[U32(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
2 |
[U52(x1, x2)] |
= |
-2 + 2 · x1
|
[U61(x1, x2, x3)] |
= |
-2 + 2 · x2
|
[U62(x1, x2, x3)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
-2 + x1 + x2 + 2 · x3
|
[U64(x1, x2, x3)] |
= |
2 |
[U41(x1)] |
= |
1 + 2 · x1
|
[s(x1)] |
= |
-2 + x1
|
[plus(x1, x2)] |
= |
2 + 2 · x1
|
[0] |
= |
1 |
[mark#(x1)] |
= |
-1 + x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U16(active(X)) |
→ |
U16(X) |
(84) |
U16(mark(X)) |
→ |
U16(X) |
(83) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(U15(X1,X2)) |
→ |
active#(U15(mark(X1),X2)) |
(219) |
mark#(U15(X1,X2)) |
→ |
mark#(X1) |
(221) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
2 · x1
|
[U11(x1, x2, x3)] |
= |
0 |
[U12(x1, x2, x3)] |
= |
-2 |
[U31(x1, x2)] |
= |
0 |
[mark(x1)] |
= |
2 |
[active(x1)] |
= |
2 |
[tt] |
= |
2 |
[isNatKind(x1)] |
= |
0 |
[U13(x1, x2, x3)] |
= |
-2 + 2 · x1
|
[U14(x1, x2, x3)] |
= |
-1 + 2 · x1 + x2
|
[U15(x1, x2)] |
= |
1 + 2 · x1
|
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
-2 + x1
|
[U21(x1, x2)] |
= |
-2 + 2 · x1
|
[U22(x1, x2)] |
= |
-2 + x1
|
[U23(x1)] |
= |
2 |
[U32(x1)] |
= |
-2 + 2 · x1
|
[U51(x1, x2)] |
= |
x2 |
[U52(x1, x2)] |
= |
-2 + 2 · x1
|
[U61(x1, x2, x3)] |
= |
x3 |
[U62(x1, x2, x3)] |
= |
x1 |
[U63(x1, x2, x3)] |
= |
2 + 2 · x2
|
[U64(x1, x2, x3)] |
= |
-2 + 2 · x3
|
[U41(x1)] |
= |
-2 + x1
|
[s(x1)] |
= |
-2 + 2 · x1
|
[plus(x1, x2)] |
= |
-2 + 2 · x2
|
[0] |
= |
2 |
[mark#(x1)] |
= |
-2 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
isNat(active(X)) |
→ |
isNat(X) |
(82) |
isNat(mark(X)) |
→ |
isNat(X) |
(81) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(U15(tt,V2)) |
→ |
mark#(U16(isNat(V2))) |
(153) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
0 |
[U12(x1, x2, x3)] |
= |
-2 |
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[mark(x1)] |
= |
x1 |
[active(x1)] |
= |
x1 |
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[U13(x1, x2, x3)] |
= |
0 |
[U14(x1, x2, x3)] |
= |
-2 + x1
|
[U15(x1, x2)] |
= |
2 + 2 · x2
|
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
2 + x1
|
[U21(x1, x2)] |
= |
-2 + 2 · x1
|
[U22(x1, x2)] |
= |
2 |
[U23(x1)] |
= |
2 |
[U32(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
2 |
[U52(x1, x2)] |
= |
-2 + 2 · x2
|
[U61(x1, x2, x3)] |
= |
-2 + x3
|
[U62(x1, x2, x3)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
2 + 2 · x1
|
[U64(x1, x2, x3)] |
= |
-2 + 2 · x1 + x3
|
[U41(x1)] |
= |
1 + x1
|
[s(x1)] |
= |
2 |
[plus(x1, x2)] |
= |
2 |
[0] |
= |
0 |
[mark#(x1)] |
= |
-1 + x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(U16(X)) |
→ |
mark#(X) |
(225) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
1 |
[U12(x1, x2, x3)] |
= |
1 |
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[mark(x1)] |
= |
1 + 2 · x1
|
[active(x1)] |
= |
1 + x1
|
[tt] |
= |
2 |
[isNatKind(x1)] |
= |
0 |
[U13(x1, x2, x3)] |
= |
-2 |
[U14(x1, x2, x3)] |
= |
2 |
[U15(x1, x2)] |
= |
2 |
[isNat(x1)] |
= |
2 |
[U16(x1)] |
= |
2 |
[U21(x1, x2)] |
= |
2 |
[U22(x1, x2)] |
= |
-2 + 2 · x2
|
[U23(x1)] |
= |
x1 |
[U32(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
-2 + x2
|
[U52(x1, x2)] |
= |
2 |
[U61(x1, x2, x3)] |
= |
-2 + x2 + 2 · x3
|
[U62(x1, x2, x3)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
-2 + x2
|
[U64(x1, x2, x3)] |
= |
2 + 2 · x2
|
[U41(x1)] |
= |
1 + 2 · x1
|
[s(x1)] |
= |
2 |
[plus(x1, x2)] |
= |
-2 + x1
|
[0] |
= |
1 |
[mark#(x1)] |
= |
-2 + 2 · x1
|
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(isNat(X)) |
→ |
active#(isNat(X)) |
(222) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + 2 · x1
|
[U11(x1, x2, x3)] |
= |
1 |
[U12(x1, x2, x3)] |
= |
1 |
[U31(x1, x2)] |
= |
1 |
[mark(x1)] |
= |
2 · x1
|
[active(x1)] |
= |
-2 |
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
1 |
[U13(x1, x2, x3)] |
= |
-2 + x2
|
[U14(x1, x2, x3)] |
= |
-2 + x2
|
[U15(x1, x2)] |
= |
x2 |
[isNat(x1)] |
= |
2 · x1
|
[U16(x1)] |
= |
-2 + x1
|
[U21(x1, x2)] |
= |
2 |
[U22(x1, x2)] |
= |
2 + x1
|
[U23(x1)] |
= |
-2 + x1
|
[U32(x1)] |
= |
0 |
[U51(x1, x2)] |
= |
1 + x1
|
[U52(x1, x2)] |
= |
-2 + 2 · x2
|
[U61(x1, x2, x3)] |
= |
2 + 2 · x1 + x3
|
[U62(x1, x2, x3)] |
= |
x2 + x3
|
[U63(x1, x2, x3)] |
= |
2 |
[U64(x1, x2, x3)] |
= |
2 + x2
|
[U41(x1)] |
= |
2 |
[s(x1)] |
= |
-2 + 2 · x1
|
[plus(x1, x2)] |
= |
2 + 2 · x2
|
[0] |
= |
0 |
[mark#(x1)] |
= |
-2 |
together with the usable
rules
U11(X1,mark(X2),X3) |
→ |
U11(X1,X2,X3) |
(52) |
U11(mark(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(51) |
U11(X1,X2,mark(X3)) |
→ |
U11(X1,X2,X3) |
(53) |
U11(active(X1),X2,X3) |
→ |
U11(X1,X2,X3) |
(54) |
U11(X1,active(X2),X3) |
→ |
U11(X1,X2,X3) |
(55) |
U11(X1,X2,active(X3)) |
→ |
U11(X1,X2,X3) |
(56) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(isNat(plus(V1,V2))) |
→ |
mark#(U11(isNatKind(V1),V1,V2)) |
(186) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
0 |
[U11(x1, x2, x3)] |
= |
2 |
[U12(x1, x2, x3)] |
= |
1 + 2 · x1
|
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[mark(x1)] |
= |
2 · x1
|
[active(x1)] |
= |
2 + 2 · x1
|
[tt] |
= |
1 |
[isNatKind(x1)] |
= |
0 |
[U13(x1, x2, x3)] |
= |
-2 |
[U14(x1, x2, x3)] |
= |
-2 + 2 · x1 + x2
|
[U15(x1, x2)] |
= |
-2 + 2 · x1
|
[isNat(x1)] |
= |
x1 |
[U16(x1)] |
= |
-2 + x1
|
[U21(x1, x2)] |
= |
-2 + 2 · x2
|
[U22(x1, x2)] |
= |
2 + 2 · x2
|
[U23(x1)] |
= |
-2 + 2 · x1
|
[U32(x1)] |
= |
1 + 2 · x1
|
[U51(x1, x2)] |
= |
-2 + x2
|
[U52(x1, x2)] |
= |
2 + 2 · x2
|
[U61(x1, x2, x3)] |
= |
-2 + x2 + x3
|
[U62(x1, x2, x3)] |
= |
-2 + x1 + 2 · x2
|
[U63(x1, x2, x3)] |
= |
2 |
[U64(x1, x2, x3)] |
= |
-1 + x2
|
[U41(x1)] |
= |
1 + 2 · x1
|
[s(x1)] |
= |
2 |
[plus(x1, x2)] |
= |
2 + x1
|
[0] |
= |
1 |
[mark#(x1)] |
= |
-2 + 2 · x1
|
together with the usable
rules
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(U11(X1,X2,X3)) |
→ |
active#(U11(mark(X1),X2,X3)) |
(205) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + 2 · x1
|
[mark#(x1)] |
= |
-2 |
[U12(x1, x2, x3)] |
= |
1 |
[U13(x1, x2, x3)] |
= |
2 |
[U31(x1, x2)] |
= |
-2 |
[U32(x1)] |
= |
-2 + 2 · x1
|
[U41(x1)] |
= |
-2 + 2 · x1
|
[isNatKind(x1)] |
= |
0 |
[active(x1)] |
= |
-2 |
[mark(x1)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
2 + 2 · x1
|
[tt] |
= |
2 |
[U14(x1, x2, x3)] |
= |
-2 + x1 + 2 · x2
|
[U15(x1, x2)] |
= |
x1 + x2
|
[isNat(x1)] |
= |
2 |
[U16(x1)] |
= |
-2 |
[U21(x1, x2)] |
= |
-2 + x1
|
[U22(x1, x2)] |
= |
-2 + x1
|
[U23(x1)] |
= |
2 |
[U51(x1, x2)] |
= |
-2 + x2
|
[U52(x1, x2)] |
= |
x2 |
[U61(x1, x2, x3)] |
= |
x1 + x2 + x3
|
[U62(x1, x2, x3)] |
= |
-2 + x3
|
[U63(x1, x2, x3)] |
= |
2 |
[U64(x1, x2, x3)] |
= |
2 |
[s(x1)] |
= |
-2 + x1
|
[plus(x1, x2)] |
= |
-2 + 2 · x1
|
[0] |
= |
0 |
together with the usable
rules
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U12(X1,mark(X2),X3) |
→ |
U12(X1,X2,X3) |
(58) |
U12(mark(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(57) |
U12(X1,X2,mark(X3)) |
→ |
U12(X1,X2,X3) |
(59) |
U12(active(X1),X2,X3) |
→ |
U12(X1,X2,X3) |
(60) |
U12(X1,active(X2),X3) |
→ |
U12(X1,X2,X3) |
(61) |
U12(X1,X2,active(X3)) |
→ |
U12(X1,X2,X3) |
(62) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(U11(tt,V1,V2)) |
→ |
mark#(U12(isNatKind(V1),V1,V2)) |
(141) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 |
[U12(x1, x2, x3)] |
= |
2 + 2 · x2 + x3
|
[U31(x1, x2)] |
= |
1 + 2 · x1
|
[mark(x1)] |
= |
x1 |
[U11(x1, x2, x3)] |
= |
-2 + x2
|
[active(x1)] |
= |
2 + x1
|
[tt] |
= |
0 |
[isNatKind(x1)] |
= |
0 |
[U13(x1, x2, x3)] |
= |
-2 |
[U14(x1, x2, x3)] |
= |
-2 + 2 · x1
|
[U15(x1, x2)] |
= |
2 + x1 + x2
|
[isNat(x1)] |
= |
0 |
[U16(x1)] |
= |
-2 + x1
|
[U21(x1, x2)] |
= |
2 + x1
|
[U22(x1, x2)] |
= |
2 + 2 · x2
|
[U23(x1)] |
= |
-2 + 2 · x1
|
[U32(x1)] |
= |
1 + 2 · x1
|
[U51(x1, x2)] |
= |
-2 + 2 · x1
|
[U52(x1, x2)] |
= |
-2 + x1
|
[U61(x1, x2, x3)] |
= |
-2 + 2 · x3
|
[U62(x1, x2, x3)] |
= |
-2 + 2 · x1 + x3
|
[U63(x1, x2, x3)] |
= |
2 + 2 · x1 + x2 + 2 · x3
|
[U64(x1, x2, x3)] |
= |
2 |
[U41(x1)] |
= |
1 + x1
|
[s(x1)] |
= |
-2 + 2 · x1
|
[plus(x1, x2)] |
= |
2 + x1 + 2 · x2
|
[0] |
= |
0 |
[mark#(x1)] |
= |
-1 + x1
|
together with the usable
rules
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U13(X1,mark(X2),X3) |
→ |
U13(X1,X2,X3) |
(66) |
U13(mark(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(65) |
U13(X1,X2,mark(X3)) |
→ |
U13(X1,X2,X3) |
(67) |
U13(active(X1),X2,X3) |
→ |
U13(X1,X2,X3) |
(68) |
U13(X1,active(X2),X3) |
→ |
U13(X1,X2,X3) |
(69) |
U13(X1,X2,active(X3)) |
→ |
U13(X1,X2,X3) |
(70) |
U32(active(X)) |
→ |
U32(X) |
(100) |
U32(mark(X)) |
→ |
U32(X) |
(99) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(U12(X1,X2,X3)) |
→ |
active#(U12(mark(X1),X2,X3)) |
(209) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + 2 · x1
|
[mark#(x1)] |
= |
0 |
[U13(x1, x2, x3)] |
= |
-2 + 2 · x1 + 2 · x3
|
[U31(x1, x2)] |
= |
-2 |
[U32(x1)] |
= |
2 |
[U41(x1)] |
= |
-2 + 2 · x1
|
[isNatKind(x1)] |
= |
0 |
[active(x1)] |
= |
-2 + 2 · x1
|
[mark(x1)] |
= |
-2 + x1
|
[U11(x1, x2, x3)] |
= |
-2 + 2 · x1 + x2 + 2 · x3
|
[tt] |
= |
2 |
[U12(x1, x2, x3)] |
= |
2 + 2 · x1
|
[U14(x1, x2, x3)] |
= |
-2 + x1 + 2 · x3
|
[U15(x1, x2)] |
= |
-2 + 2 · x1 + 2 · x2
|
[isNat(x1)] |
= |
2 · x1
|
[U16(x1)] |
= |
-2 + 2 · x1
|
[U21(x1, x2)] |
= |
-2 + 2 · x2
|
[U22(x1, x2)] |
= |
-2 + x1 + 2 · x2
|
[U23(x1)] |
= |
1 + x1
|
[U51(x1, x2)] |
= |
-2 + 2 · x1
|
[U52(x1, x2)] |
= |
-2 + 2 · x1
|
[U61(x1, x2, x3)] |
= |
-2 + 2 · x2 + 2 · x3
|
[U62(x1, x2, x3)] |
= |
2 |
[U63(x1, x2, x3)] |
= |
-2 + 2 · x2 + 2 · x3
|
[U64(x1, x2, x3)] |
= |
2 |
[s(x1)] |
= |
-2 + x1
|
[plus(x1, x2)] |
= |
-2 + x1
|
[0] |
= |
0 |
together with the usable
rules
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(U12(tt,V1,V2)) |
→ |
mark#(U13(isNatKind(V2),V1,V2)) |
(144) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
2 + x1
|
[mark#(x1)] |
= |
2 + x1
|
[U31(x1, x2)] |
= |
2 + 2 · x1 + 2 · x2
|
[U32(x1)] |
= |
x1 |
[U41(x1)] |
= |
x1 |
[isNatKind(x1)] |
= |
1 + 2 · x1
|
[active(x1)] |
= |
x1 |
[mark(x1)] |
= |
x1 |
[U11(x1, x2, x3)] |
= |
2 |
[tt] |
= |
0 |
[U12(x1, x2, x3)] |
= |
2 |
[U13(x1, x2, x3)] |
= |
2 |
[U14(x1, x2, x3)] |
= |
2 |
[U15(x1, x2)] |
= |
-2 |
[isNat(x1)] |
= |
2 |
[U16(x1)] |
= |
-2 |
[U21(x1, x2)] |
= |
-2 |
[U22(x1, x2)] |
= |
-2 |
[U23(x1)] |
= |
-2 |
[U51(x1, x2)] |
= |
2 + 2 · x2
|
[U52(x1, x2)] |
= |
2 · x2
|
[U61(x1, x2, x3)] |
= |
2 + x2 + 2 · x3
|
[U62(x1, x2, x3)] |
= |
2 + x2 + 2 · x3
|
[U63(x1, x2, x3)] |
= |
2 + x2 + 2 · x3
|
[U64(x1, x2, x3)] |
= |
2 + x2 + 2 · x3
|
[s(x1)] |
= |
x1 |
[plus(x1, x2)] |
= |
2 + 2 · x1 + x2
|
[0] |
= |
0 |
the
pairs
active#(U31(tt,V2)) |
→ |
mark#(U32(isNatKind(V2))) |
(164) |
mark#(U31(X1,X2)) |
→ |
mark#(X1) |
(237) |
active#(isNatKind(plus(V1,V2))) |
→ |
mark#(U31(isNatKind(V1),V2)) |
(193) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the Knuth Bendix order with w0 = 1 and the following precedence and weight functions
prec(isNatKind) |
= |
0 |
|
weight(isNatKind) |
= |
1 |
|
|
|
prec(U31) |
= |
1 |
|
weight(U31) |
= |
2 |
|
|
|
prec(U32) |
= |
2 |
|
weight(U32) |
= |
1 |
|
|
|
in combination with the following argument filter
π(mark#) |
= |
1 |
π(isNatKind) |
= |
[] |
π(active#) |
= |
1 |
π(U31) |
= |
[] |
π(U32) |
= |
[1] |
π(U41) |
= |
1 |
π(active) |
= |
1 |
π(mark) |
= |
1 |
together with the usable
rules
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(U32(X)) |
→ |
mark#(X) |
(240) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
-2 + 2 · x1
|
[mark#(x1)] |
= |
2 |
[U41(x1)] |
= |
-2 |
[isNatKind(x1)] |
= |
2 |
[active(x1)] |
= |
-2 + x1
|
[mark(x1)] |
= |
1 |
[U31(x1, x2)] |
= |
-2 |
[U11(x1, x2, x3)] |
= |
-2 + 2 · x1 + x2 + x3
|
[tt] |
= |
0 |
[U12(x1, x2, x3)] |
= |
-2 + x2 + x3
|
[U13(x1, x2, x3)] |
= |
-2 + x3
|
[U14(x1, x2, x3)] |
= |
-2 + x2
|
[U15(x1, x2)] |
= |
2 |
[isNat(x1)] |
= |
2 |
[U16(x1)] |
= |
2 |
[U21(x1, x2)] |
= |
2 |
[U22(x1, x2)] |
= |
2 |
[U23(x1)] |
= |
1 + 2 · x1
|
[U32(x1)] |
= |
2 |
[U51(x1, x2)] |
= |
-2 + x2
|
[U52(x1, x2)] |
= |
2 |
[U61(x1, x2, x3)] |
= |
-2 + x2 + 2 · x3
|
[U62(x1, x2, x3)] |
= |
-2 + x3
|
[U63(x1, x2, x3)] |
= |
2 |
[U64(x1, x2, x3)] |
= |
-2 + 2 · x3
|
[s(x1)] |
= |
0 |
[plus(x1, x2)] |
= |
2 + x1
|
[0] |
= |
0 |
together with the usable
rules
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U31(X1,mark(X2)) |
→ |
U31(X1,X2) |
(96) |
U31(mark(X1),X2) |
→ |
U31(X1,X2) |
(95) |
U31(active(X1),X2) |
→ |
U31(X1,X2) |
(97) |
U31(X1,active(X2)) |
→ |
U31(X1,X2) |
(98) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
mark#(U31(X1,X2)) |
→ |
active#(U31(mark(X1),X2)) |
(235) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[isNatKind(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[U41(x1)] |
= |
1 · x1
|
[s(x1)] |
= |
1 · x1
|
[active#(x1)] |
= |
1 · x1
|
[mark#(x1)] |
= |
1 · x1
|
together with the usable
rules
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
U41(active(X)) |
→ |
U41(X) |
(102) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
(w.r.t. the implicit argument filter of the reduction pair),
the
rule
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[isNatKind(x1)] |
= |
2 · x1
|
[mark(x1)] |
= |
2 · x1
|
[active(x1)] |
= |
2 · x1
|
[U41(x1)] |
= |
1 · x1
|
[mark#(x1)] |
= |
1 · x1
|
[active#(x1)] |
= |
1 · x1
|
[s(x1)] |
= |
2 + 2 · x1
|
together with the usable
rules
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
U41(active(X)) |
→ |
U41(X) |
(102) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
active#(isNatKind(s(V1))) |
→ |
mark#(U41(isNatKind(V1))) |
(196) |
and
the
rules
isNatKind(mark(X)) |
→ |
isNatKind(X) |
(63) |
isNatKind(active(X)) |
→ |
isNatKind(X) |
(64) |
U41(mark(X)) |
→ |
U41(X) |
(101) |
U41(active(X)) |
→ |
U41(X) |
(102) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.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
1st
component contains the
pair
mark#(U41(X)) |
→ |
mark#(X) |
(243) |
1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
mark#(U41(X)) |
→ |
mark#(X) |
(243) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
2nd
component contains the
pair
U11#(X1,mark(X2),X3) |
→ |
U11#(X1,X2,X3) |
(271) |
U11#(mark(X1),X2,X3) |
→ |
U11#(X1,X2,X3) |
(270) |
U11#(X1,X2,mark(X3)) |
→ |
U11#(X1,X2,X3) |
(272) |
U11#(active(X1),X2,X3) |
→ |
U11#(X1,X2,X3) |
(273) |
U11#(X1,active(X2),X3) |
→ |
U11#(X1,X2,X3) |
(274) |
U11#(X1,X2,active(X3)) |
→ |
U11#(X1,X2,X3) |
(275) |
1.1.2 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U11#(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.2.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U11#(X1,mark(X2),X3) |
→ |
U11#(X1,X2,X3) |
(271) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U11#(mark(X1),X2,X3) |
→ |
U11#(X1,X2,X3) |
(270) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U11#(X1,X2,mark(X3)) |
→ |
U11#(X1,X2,X3) |
(272) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
U11#(active(X1),X2,X3) |
→ |
U11#(X1,X2,X3) |
(273) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U11#(X1,active(X2),X3) |
→ |
U11#(X1,X2,X3) |
(274) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U11#(X1,X2,active(X3)) |
→ |
U11#(X1,X2,X3) |
(275) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
3rd
component contains the
pair
U12#(X1,mark(X2),X3) |
→ |
U12#(X1,X2,X3) |
(277) |
U12#(mark(X1),X2,X3) |
→ |
U12#(X1,X2,X3) |
(276) |
U12#(X1,X2,mark(X3)) |
→ |
U12#(X1,X2,X3) |
(278) |
U12#(active(X1),X2,X3) |
→ |
U12#(X1,X2,X3) |
(279) |
U12#(X1,active(X2),X3) |
→ |
U12#(X1,X2,X3) |
(280) |
U12#(X1,X2,active(X3)) |
→ |
U12#(X1,X2,X3) |
(281) |
1.1.3 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U12#(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.3.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U12#(X1,mark(X2),X3) |
→ |
U12#(X1,X2,X3) |
(277) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U12#(mark(X1),X2,X3) |
→ |
U12#(X1,X2,X3) |
(276) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U12#(X1,X2,mark(X3)) |
→ |
U12#(X1,X2,X3) |
(278) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
U12#(active(X1),X2,X3) |
→ |
U12#(X1,X2,X3) |
(279) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U12#(X1,active(X2),X3) |
→ |
U12#(X1,X2,X3) |
(280) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U12#(X1,X2,active(X3)) |
→ |
U12#(X1,X2,X3) |
(281) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
4th
component contains the
pair
isNatKind#(active(X)) |
→ |
isNatKind#(X) |
(283) |
isNatKind#(mark(X)) |
→ |
isNatKind#(X) |
(282) |
1.1.4 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[isNatKind#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.4.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
isNatKind#(active(X)) |
→ |
isNatKind#(X) |
(283) |
|
1 |
> |
1 |
isNatKind#(mark(X)) |
→ |
isNatKind#(X) |
(282) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
5th
component contains the
pair
U13#(X1,mark(X2),X3) |
→ |
U13#(X1,X2,X3) |
(285) |
U13#(mark(X1),X2,X3) |
→ |
U13#(X1,X2,X3) |
(284) |
U13#(X1,X2,mark(X3)) |
→ |
U13#(X1,X2,X3) |
(286) |
U13#(active(X1),X2,X3) |
→ |
U13#(X1,X2,X3) |
(287) |
U13#(X1,active(X2),X3) |
→ |
U13#(X1,X2,X3) |
(288) |
U13#(X1,X2,active(X3)) |
→ |
U13#(X1,X2,X3) |
(289) |
1.1.5 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U13#(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.5.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U13#(X1,mark(X2),X3) |
→ |
U13#(X1,X2,X3) |
(285) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U13#(mark(X1),X2,X3) |
→ |
U13#(X1,X2,X3) |
(284) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U13#(X1,X2,mark(X3)) |
→ |
U13#(X1,X2,X3) |
(286) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
U13#(active(X1),X2,X3) |
→ |
U13#(X1,X2,X3) |
(287) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U13#(X1,active(X2),X3) |
→ |
U13#(X1,X2,X3) |
(288) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U13#(X1,X2,active(X3)) |
→ |
U13#(X1,X2,X3) |
(289) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
6th
component contains the
pair
U14#(X1,mark(X2),X3) |
→ |
U14#(X1,X2,X3) |
(291) |
U14#(mark(X1),X2,X3) |
→ |
U14#(X1,X2,X3) |
(290) |
U14#(X1,X2,mark(X3)) |
→ |
U14#(X1,X2,X3) |
(292) |
U14#(active(X1),X2,X3) |
→ |
U14#(X1,X2,X3) |
(293) |
U14#(X1,active(X2),X3) |
→ |
U14#(X1,X2,X3) |
(294) |
U14#(X1,X2,active(X3)) |
→ |
U14#(X1,X2,X3) |
(295) |
1.1.6 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U14#(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.6.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U14#(X1,mark(X2),X3) |
→ |
U14#(X1,X2,X3) |
(291) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U14#(mark(X1),X2,X3) |
→ |
U14#(X1,X2,X3) |
(290) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U14#(X1,X2,mark(X3)) |
→ |
U14#(X1,X2,X3) |
(292) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
U14#(active(X1),X2,X3) |
→ |
U14#(X1,X2,X3) |
(293) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U14#(X1,active(X2),X3) |
→ |
U14#(X1,X2,X3) |
(294) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U14#(X1,X2,active(X3)) |
→ |
U14#(X1,X2,X3) |
(295) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
7th
component contains the
pair
U15#(X1,mark(X2)) |
→ |
U15#(X1,X2) |
(297) |
U15#(mark(X1),X2) |
→ |
U15#(X1,X2) |
(296) |
U15#(active(X1),X2) |
→ |
U15#(X1,X2) |
(298) |
U15#(X1,active(X2)) |
→ |
U15#(X1,X2) |
(299) |
1.1.7 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U15#(x1, x2)] |
= |
1 · x1 + 1 · x2
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.7.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U15#(X1,mark(X2)) |
→ |
U15#(X1,X2) |
(297) |
|
1 |
≥ |
1 |
2 |
> |
2 |
U15#(mark(X1),X2) |
→ |
U15#(X1,X2) |
(296) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U15#(active(X1),X2) |
→ |
U15#(X1,X2) |
(298) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U15#(X1,active(X2)) |
→ |
U15#(X1,X2) |
(299) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
8th
component contains the
pair
isNat#(active(X)) |
→ |
isNat#(X) |
(301) |
isNat#(mark(X)) |
→ |
isNat#(X) |
(300) |
1.1.8 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[isNat#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.8.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
isNat#(active(X)) |
→ |
isNat#(X) |
(301) |
|
1 |
> |
1 |
isNat#(mark(X)) |
→ |
isNat#(X) |
(300) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
9th
component contains the
pair
U16#(active(X)) |
→ |
U16#(X) |
(303) |
U16#(mark(X)) |
→ |
U16#(X) |
(302) |
1.1.9 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[U16#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.9.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U16#(active(X)) |
→ |
U16#(X) |
(303) |
|
1 |
> |
1 |
U16#(mark(X)) |
→ |
U16#(X) |
(302) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
10th
component contains the
pair
U21#(X1,mark(X2)) |
→ |
U21#(X1,X2) |
(305) |
U21#(mark(X1),X2) |
→ |
U21#(X1,X2) |
(304) |
U21#(active(X1),X2) |
→ |
U21#(X1,X2) |
(306) |
U21#(X1,active(X2)) |
→ |
U21#(X1,X2) |
(307) |
1.1.10 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U21#(x1, x2)] |
= |
1 · x1 + 1 · x2
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.10.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U21#(X1,mark(X2)) |
→ |
U21#(X1,X2) |
(305) |
|
1 |
≥ |
1 |
2 |
> |
2 |
U21#(mark(X1),X2) |
→ |
U21#(X1,X2) |
(304) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U21#(active(X1),X2) |
→ |
U21#(X1,X2) |
(306) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U21#(X1,active(X2)) |
→ |
U21#(X1,X2) |
(307) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
11th
component contains the
pair
U22#(X1,mark(X2)) |
→ |
U22#(X1,X2) |
(309) |
U22#(mark(X1),X2) |
→ |
U22#(X1,X2) |
(308) |
U22#(active(X1),X2) |
→ |
U22#(X1,X2) |
(310) |
U22#(X1,active(X2)) |
→ |
U22#(X1,X2) |
(311) |
1.1.11 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U22#(x1, x2)] |
= |
1 · x1 + 1 · x2
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.11.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U22#(X1,mark(X2)) |
→ |
U22#(X1,X2) |
(309) |
|
1 |
≥ |
1 |
2 |
> |
2 |
U22#(mark(X1),X2) |
→ |
U22#(X1,X2) |
(308) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U22#(active(X1),X2) |
→ |
U22#(X1,X2) |
(310) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U22#(X1,active(X2)) |
→ |
U22#(X1,X2) |
(311) |
|
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
U23#(active(X)) |
→ |
U23#(X) |
(313) |
U23#(mark(X)) |
→ |
U23#(X) |
(312) |
1.1.12 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[U23#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.12.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U23#(active(X)) |
→ |
U23#(X) |
(313) |
|
1 |
> |
1 |
U23#(mark(X)) |
→ |
U23#(X) |
(312) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
13th
component contains the
pair
U31#(X1,mark(X2)) |
→ |
U31#(X1,X2) |
(315) |
U31#(mark(X1),X2) |
→ |
U31#(X1,X2) |
(314) |
U31#(active(X1),X2) |
→ |
U31#(X1,X2) |
(316) |
U31#(X1,active(X2)) |
→ |
U31#(X1,X2) |
(317) |
1.1.13 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U31#(x1, x2)] |
= |
1 · x1 + 1 · x2
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.13.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U31#(X1,mark(X2)) |
→ |
U31#(X1,X2) |
(315) |
|
1 |
≥ |
1 |
2 |
> |
2 |
U31#(mark(X1),X2) |
→ |
U31#(X1,X2) |
(314) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U31#(active(X1),X2) |
→ |
U31#(X1,X2) |
(316) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U31#(X1,active(X2)) |
→ |
U31#(X1,X2) |
(317) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
14th
component contains the
pair
U32#(active(X)) |
→ |
U32#(X) |
(319) |
U32#(mark(X)) |
→ |
U32#(X) |
(318) |
1.1.14 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[U32#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.14.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U32#(active(X)) |
→ |
U32#(X) |
(319) |
|
1 |
> |
1 |
U32#(mark(X)) |
→ |
U32#(X) |
(318) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
15th
component contains the
pair
U41#(active(X)) |
→ |
U41#(X) |
(321) |
U41#(mark(X)) |
→ |
U41#(X) |
(320) |
1.1.15 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[U41#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.15.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U41#(active(X)) |
→ |
U41#(X) |
(321) |
|
1 |
> |
1 |
U41#(mark(X)) |
→ |
U41#(X) |
(320) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
16th
component contains the
pair
U51#(X1,mark(X2)) |
→ |
U51#(X1,X2) |
(323) |
U51#(mark(X1),X2) |
→ |
U51#(X1,X2) |
(322) |
U51#(active(X1),X2) |
→ |
U51#(X1,X2) |
(324) |
U51#(X1,active(X2)) |
→ |
U51#(X1,X2) |
(325) |
1.1.16 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U51#(x1, x2)] |
= |
1 · x1 + 1 · x2
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.16.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U51#(X1,mark(X2)) |
→ |
U51#(X1,X2) |
(323) |
|
1 |
≥ |
1 |
2 |
> |
2 |
U51#(mark(X1),X2) |
→ |
U51#(X1,X2) |
(322) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U51#(active(X1),X2) |
→ |
U51#(X1,X2) |
(324) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U51#(X1,active(X2)) |
→ |
U51#(X1,X2) |
(325) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
17th
component contains the
pair
U52#(X1,mark(X2)) |
→ |
U52#(X1,X2) |
(327) |
U52#(mark(X1),X2) |
→ |
U52#(X1,X2) |
(326) |
U52#(active(X1),X2) |
→ |
U52#(X1,X2) |
(328) |
U52#(X1,active(X2)) |
→ |
U52#(X1,X2) |
(329) |
1.1.17 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U52#(x1, x2)] |
= |
1 · x1 + 1 · x2
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.17.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U52#(X1,mark(X2)) |
→ |
U52#(X1,X2) |
(327) |
|
1 |
≥ |
1 |
2 |
> |
2 |
U52#(mark(X1),X2) |
→ |
U52#(X1,X2) |
(326) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U52#(active(X1),X2) |
→ |
U52#(X1,X2) |
(328) |
|
1 |
> |
1 |
2 |
≥ |
2 |
U52#(X1,active(X2)) |
→ |
U52#(X1,X2) |
(329) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
18th
component contains the
pair
U61#(X1,mark(X2),X3) |
→ |
U61#(X1,X2,X3) |
(331) |
U61#(mark(X1),X2,X3) |
→ |
U61#(X1,X2,X3) |
(330) |
U61#(X1,X2,mark(X3)) |
→ |
U61#(X1,X2,X3) |
(332) |
U61#(active(X1),X2,X3) |
→ |
U61#(X1,X2,X3) |
(333) |
U61#(X1,active(X2),X3) |
→ |
U61#(X1,X2,X3) |
(334) |
U61#(X1,X2,active(X3)) |
→ |
U61#(X1,X2,X3) |
(335) |
1.1.18 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U61#(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.18.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U61#(X1,mark(X2),X3) |
→ |
U61#(X1,X2,X3) |
(331) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U61#(mark(X1),X2,X3) |
→ |
U61#(X1,X2,X3) |
(330) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U61#(X1,X2,mark(X3)) |
→ |
U61#(X1,X2,X3) |
(332) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
U61#(active(X1),X2,X3) |
→ |
U61#(X1,X2,X3) |
(333) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U61#(X1,active(X2),X3) |
→ |
U61#(X1,X2,X3) |
(334) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U61#(X1,X2,active(X3)) |
→ |
U61#(X1,X2,X3) |
(335) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
19th
component contains the
pair
U62#(X1,mark(X2),X3) |
→ |
U62#(X1,X2,X3) |
(337) |
U62#(mark(X1),X2,X3) |
→ |
U62#(X1,X2,X3) |
(336) |
U62#(X1,X2,mark(X3)) |
→ |
U62#(X1,X2,X3) |
(338) |
U62#(active(X1),X2,X3) |
→ |
U62#(X1,X2,X3) |
(339) |
U62#(X1,active(X2),X3) |
→ |
U62#(X1,X2,X3) |
(340) |
U62#(X1,X2,active(X3)) |
→ |
U62#(X1,X2,X3) |
(341) |
1.1.19 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U62#(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.19.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U62#(X1,mark(X2),X3) |
→ |
U62#(X1,X2,X3) |
(337) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U62#(mark(X1),X2,X3) |
→ |
U62#(X1,X2,X3) |
(336) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U62#(X1,X2,mark(X3)) |
→ |
U62#(X1,X2,X3) |
(338) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
U62#(active(X1),X2,X3) |
→ |
U62#(X1,X2,X3) |
(339) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U62#(X1,active(X2),X3) |
→ |
U62#(X1,X2,X3) |
(340) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U62#(X1,X2,active(X3)) |
→ |
U62#(X1,X2,X3) |
(341) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
20th
component contains the
pair
U63#(X1,mark(X2),X3) |
→ |
U63#(X1,X2,X3) |
(343) |
U63#(mark(X1),X2,X3) |
→ |
U63#(X1,X2,X3) |
(342) |
U63#(X1,X2,mark(X3)) |
→ |
U63#(X1,X2,X3) |
(344) |
U63#(active(X1),X2,X3) |
→ |
U63#(X1,X2,X3) |
(345) |
U63#(X1,active(X2),X3) |
→ |
U63#(X1,X2,X3) |
(346) |
U63#(X1,X2,active(X3)) |
→ |
U63#(X1,X2,X3) |
(347) |
1.1.20 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U63#(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.20.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U63#(X1,mark(X2),X3) |
→ |
U63#(X1,X2,X3) |
(343) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U63#(mark(X1),X2,X3) |
→ |
U63#(X1,X2,X3) |
(342) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U63#(X1,X2,mark(X3)) |
→ |
U63#(X1,X2,X3) |
(344) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
U63#(active(X1),X2,X3) |
→ |
U63#(X1,X2,X3) |
(345) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U63#(X1,active(X2),X3) |
→ |
U63#(X1,X2,X3) |
(346) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U63#(X1,X2,active(X3)) |
→ |
U63#(X1,X2,X3) |
(347) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
21th
component contains the
pair
U64#(X1,mark(X2),X3) |
→ |
U64#(X1,X2,X3) |
(349) |
U64#(mark(X1),X2,X3) |
→ |
U64#(X1,X2,X3) |
(348) |
U64#(X1,X2,mark(X3)) |
→ |
U64#(X1,X2,X3) |
(350) |
U64#(active(X1),X2,X3) |
→ |
U64#(X1,X2,X3) |
(351) |
U64#(X1,active(X2),X3) |
→ |
U64#(X1,X2,X3) |
(352) |
U64#(X1,X2,active(X3)) |
→ |
U64#(X1,X2,X3) |
(353) |
1.1.21 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[U64#(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.21.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U64#(X1,mark(X2),X3) |
→ |
U64#(X1,X2,X3) |
(349) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U64#(mark(X1),X2,X3) |
→ |
U64#(X1,X2,X3) |
(348) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U64#(X1,X2,mark(X3)) |
→ |
U64#(X1,X2,X3) |
(350) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
U64#(active(X1),X2,X3) |
→ |
U64#(X1,X2,X3) |
(351) |
|
1 |
> |
1 |
2 |
≥ |
2 |
3 |
≥ |
3 |
U64#(X1,active(X2),X3) |
→ |
U64#(X1,X2,X3) |
(352) |
|
1 |
≥ |
1 |
2 |
> |
2 |
3 |
≥ |
3 |
U64#(X1,X2,active(X3)) |
→ |
U64#(X1,X2,X3) |
(353) |
|
1 |
≥ |
1 |
2 |
≥ |
2 |
3 |
> |
3 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
22th
component contains the
pair
s#(active(X)) |
→ |
s#(X) |
(355) |
s#(mark(X)) |
→ |
s#(X) |
(354) |
1.1.22 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[s#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.22.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) |
(355) |
|
1 |
> |
1 |
s#(mark(X)) |
→ |
s#(X) |
(354) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
23th
component contains the
pair
plus#(X1,mark(X2)) |
→ |
plus#(X1,X2) |
(357) |
plus#(mark(X1),X2) |
→ |
plus#(X1,X2) |
(356) |
plus#(active(X1),X2) |
→ |
plus#(X1,X2) |
(358) |
plus#(X1,active(X2)) |
→ |
plus#(X1,X2) |
(359) |
1.1.23 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[plus#(x1, x2)] |
= |
1 · x1 + 1 · x2
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.23.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) |
(357) |
|
1 |
≥ |
1 |
2 |
> |
2 |
plus#(mark(X1),X2) |
→ |
plus#(X1,X2) |
(356) |
|
1 |
> |
1 |
2 |
≥ |
2 |
plus#(active(X1),X2) |
→ |
plus#(X1,X2) |
(358) |
|
1 |
> |
1 |
2 |
≥ |
2 |
plus#(X1,active(X2)) |
→ |
plus#(X1,X2) |
(359) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.