The rewrite relation of the following TRS is considered.
There are 142 ruless (increase limit for explicit display).
There are 203 ruless (increase limit for explicit display).
The dependency pairs are split into 28
components.
-
The
1st
component contains the
pair
top#(ok(X)) |
→ |
top#(active(X)) |
(345) |
top#(mark(X)) |
→ |
top#(proper(X)) |
(343) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the
prec(top#) |
= |
0 |
|
stat(top#) |
= |
lex
|
prec(ok) |
= |
0 |
|
stat(ok) |
= |
lex
|
prec(proper) |
= |
0 |
|
stat(proper) |
= |
lex
|
prec(u) |
= |
5 |
|
stat(u) |
= |
lex
|
prec(o) |
= |
1 |
|
stat(o) |
= |
lex
|
prec(i) |
= |
1 |
|
stat(i) |
= |
lex
|
prec(e) |
= |
1 |
|
stat(e) |
= |
lex
|
prec(a) |
= |
1 |
|
stat(a) |
= |
lex
|
prec(isPal) |
= |
16 |
|
stat(isPal) |
= |
lex
|
prec(isPalListKind) |
= |
0 |
|
stat(isPalListKind) |
= |
lex
|
prec(and) |
= |
1 |
|
stat(and) |
= |
lex
|
prec(U72) |
= |
2 |
|
stat(U72) |
= |
lex
|
prec(isNePal) |
= |
8 |
|
stat(isNePal) |
= |
lex
|
prec(U71) |
= |
10 |
|
stat(U71) |
= |
lex
|
prec(U62) |
= |
1 |
|
stat(U62) |
= |
lex
|
prec(U61) |
= |
4 |
|
stat(U61) |
= |
lex
|
prec(U53) |
= |
1 |
|
stat(U53) |
= |
lex
|
prec(U52) |
= |
6 |
|
stat(U52) |
= |
lex
|
prec(U51) |
= |
8 |
|
stat(U51) |
= |
lex
|
prec(U43) |
= |
8 |
|
stat(U43) |
= |
lex
|
prec(U42) |
= |
9 |
|
stat(U42) |
= |
lex
|
prec(U41) |
= |
16 |
|
stat(U41) |
= |
lex
|
prec(U32) |
= |
1 |
|
stat(U32) |
= |
lex
|
prec(isQid) |
= |
0 |
|
stat(isQid) |
= |
lex
|
prec(U31) |
= |
2 |
|
stat(U31) |
= |
lex
|
prec(U23) |
= |
1 |
|
stat(U23) |
= |
lex
|
prec(U22) |
= |
8 |
|
stat(U22) |
= |
lex
|
prec(isList) |
= |
5 |
|
stat(isList) |
= |
lex
|
prec(U21) |
= |
9 |
|
stat(U21) |
= |
lex
|
prec(U12) |
= |
1 |
|
stat(U12) |
= |
lex
|
prec(isNeList) |
= |
3 |
|
stat(isNeList) |
= |
lex
|
prec(U11) |
= |
4 |
|
stat(U11) |
= |
lex
|
prec(tt) |
= |
0 |
|
stat(tt) |
= |
lex
|
prec(nil) |
= |
32 |
|
stat(nil) |
= |
lex
|
prec(mark) |
= |
0 |
|
stat(mark) |
= |
lex
|
prec(active) |
= |
0 |
|
stat(active) |
= |
lex
|
prec(__) |
= |
27 |
|
stat(__) |
= |
lex
|
π(top#) |
= |
1 |
π(ok) |
= |
1 |
π(proper) |
= |
1 |
π(u) |
= |
[] |
π(o) |
= |
[] |
π(i) |
= |
[] |
π(e) |
= |
[] |
π(a) |
= |
[] |
π(isPal) |
= |
[1] |
π(isPalListKind) |
= |
1 |
π(and) |
= |
[1,2] |
π(U72) |
= |
[1] |
π(isNePal) |
= |
[1] |
π(U71) |
= |
[1,2] |
π(U62) |
= |
[1] |
π(U61) |
= |
[1,2] |
π(U53) |
= |
[1] |
π(U52) |
= |
[1,2] |
π(U51) |
= |
[1,2,3] |
π(U43) |
= |
[1] |
π(U42) |
= |
[1,2] |
π(U41) |
= |
[1,2,3] |
π(U32) |
= |
[1] |
π(isQid) |
= |
1 |
π(U31) |
= |
[1,2] |
π(U23) |
= |
[1] |
π(U22) |
= |
[1,2] |
π(isList) |
= |
[1] |
π(U21) |
= |
[1,2,3] |
π(U12) |
= |
[1] |
π(isNeList) |
= |
[1] |
π(U11) |
= |
[1,2] |
π(tt) |
= |
[] |
π(nil) |
= |
[] |
π(mark) |
= |
[1] |
π(active) |
= |
1 |
π(__) |
= |
[1,2] |
together with the usable
rulesThere are 140 ruless (increase limit for explicit display).
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
top#(mark(X)) |
→ |
top#(proper(X)) |
(343) |
could be deleted.
1.1.1.1 Reduction Pair Processor with Usable Rules
Using the
prec(top#) |
= |
0 |
|
stat(top#) |
= |
lex
|
prec(ok) |
= |
0 |
|
stat(ok) |
= |
lex
|
prec(u) |
= |
0 |
|
stat(u) |
= |
lex
|
prec(o) |
= |
0 |
|
stat(o) |
= |
lex
|
prec(i) |
= |
0 |
|
stat(i) |
= |
lex
|
prec(e) |
= |
0 |
|
stat(e) |
= |
lex
|
prec(a) |
= |
1 |
|
stat(a) |
= |
lex
|
prec(isPal) |
= |
32 |
|
stat(isPal) |
= |
lex
|
prec(isPalListKind) |
= |
1 |
|
stat(isPalListKind) |
= |
lex
|
prec(and) |
= |
0 |
|
stat(and) |
= |
lex
|
prec(U72) |
= |
34 |
|
stat(U72) |
= |
lex
|
prec(isNePal) |
= |
1 |
|
stat(isNePal) |
= |
lex
|
prec(U71) |
= |
1 |
|
stat(U71) |
= |
lex
|
prec(U62) |
= |
0 |
|
stat(U62) |
= |
lex
|
prec(U61) |
= |
0 |
|
stat(U61) |
= |
lex
|
prec(U53) |
= |
5 |
|
stat(U53) |
= |
lex
|
prec(U52) |
= |
0 |
|
stat(U52) |
= |
lex
|
prec(U51) |
= |
1 |
|
stat(U51) |
= |
lex
|
prec(U43) |
= |
0 |
|
stat(U43) |
= |
lex
|
prec(U42) |
= |
1 |
|
stat(U42) |
= |
lex
|
prec(U41) |
= |
1 |
|
stat(U41) |
= |
lex
|
prec(U32) |
= |
1 |
|
stat(U32) |
= |
lex
|
prec(isQid) |
= |
1 |
|
stat(isQid) |
= |
lex
|
prec(U31) |
= |
0 |
|
stat(U31) |
= |
lex
|
prec(U23) |
= |
1 |
|
stat(U23) |
= |
lex
|
prec(U22) |
= |
1 |
|
stat(U22) |
= |
lex
|
prec(isList) |
= |
1 |
|
stat(isList) |
= |
lex
|
prec(U21) |
= |
33 |
|
stat(U21) |
= |
lex
|
prec(U12) |
= |
1 |
|
stat(U12) |
= |
lex
|
prec(isNeList) |
= |
1 |
|
stat(isNeList) |
= |
lex
|
prec(U11) |
= |
1 |
|
stat(U11) |
= |
lex
|
prec(tt) |
= |
2 |
|
stat(tt) |
= |
lex
|
prec(nil) |
= |
0 |
|
stat(nil) |
= |
lex
|
prec(mark) |
= |
0 |
|
stat(mark) |
= |
lex
|
prec(active) |
= |
0 |
|
stat(active) |
= |
lex
|
prec(__) |
= |
1 |
|
stat(__) |
= |
lex
|
π(top#) |
= |
1 |
π(ok) |
= |
[1] |
π(u) |
= |
[] |
π(o) |
= |
[] |
π(i) |
= |
[] |
π(e) |
= |
[] |
π(a) |
= |
[] |
π(isPal) |
= |
[] |
π(isPalListKind) |
= |
[1] |
π(and) |
= |
1 |
π(U72) |
= |
[1] |
π(isNePal) |
= |
[] |
π(U71) |
= |
[2] |
π(U62) |
= |
1 |
π(U61) |
= |
1 |
π(U53) |
= |
[1] |
π(U52) |
= |
1 |
π(U51) |
= |
[1] |
π(U43) |
= |
1 |
π(U42) |
= |
[1] |
π(U41) |
= |
[1] |
π(U32) |
= |
[1] |
π(isQid) |
= |
[1] |
π(U31) |
= |
1 |
π(U23) |
= |
[1] |
π(U22) |
= |
[1] |
π(isList) |
= |
[] |
π(U21) |
= |
[3] |
π(U12) |
= |
[1] |
π(isNeList) |
= |
[1] |
π(U11) |
= |
[1] |
π(tt) |
= |
[] |
π(nil) |
= |
[] |
π(mark) |
= |
[] |
π(active) |
= |
1 |
π(__) |
= |
[1] |
together with the usable
rulesThere are 102 ruless (increase limit for explicit display).
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
top#(ok(X)) |
→ |
top#(active(X)) |
(345) |
could be deleted.
1.1.1.1.1 P is empty
There are no pairs anymore.
-
The
2nd
component contains the
pair
active#(__(X1,X2)) |
→ |
active#(X1) |
(192) |
active#(__(X1,X2)) |
→ |
active#(X2) |
(194) |
active#(U11(X1,X2)) |
→ |
active#(X1) |
(196) |
active#(U12(X)) |
→ |
active#(X) |
(198) |
active#(U21(X1,X2,X3)) |
→ |
active#(X1) |
(200) |
active#(U22(X1,X2)) |
→ |
active#(X1) |
(202) |
active#(U23(X)) |
→ |
active#(X) |
(204) |
active#(U31(X1,X2)) |
→ |
active#(X1) |
(206) |
active#(U32(X)) |
→ |
active#(X) |
(208) |
active#(U41(X1,X2,X3)) |
→ |
active#(X1) |
(210) |
active#(U42(X1,X2)) |
→ |
active#(X1) |
(212) |
active#(U43(X)) |
→ |
active#(X) |
(214) |
active#(U51(X1,X2,X3)) |
→ |
active#(X1) |
(216) |
active#(U52(X1,X2)) |
→ |
active#(X1) |
(218) |
active#(U53(X)) |
→ |
active#(X) |
(220) |
active#(U61(X1,X2)) |
→ |
active#(X1) |
(222) |
active#(U62(X)) |
→ |
active#(X) |
(224) |
active#(U71(X1,X2)) |
→ |
active#(X1) |
(226) |
active#(U72(X)) |
→ |
active#(X) |
(228) |
active#(and(X1,X2)) |
→ |
active#(X1) |
(230) |
1.1.2 Subterm Criterion Processor
We use the projection
and remove the pairs:
active#(__(X1,X2)) |
→ |
active#(X1) |
(192) |
active#(__(X1,X2)) |
→ |
active#(X2) |
(194) |
active#(U11(X1,X2)) |
→ |
active#(X1) |
(196) |
active#(U12(X)) |
→ |
active#(X) |
(198) |
active#(U21(X1,X2,X3)) |
→ |
active#(X1) |
(200) |
active#(U22(X1,X2)) |
→ |
active#(X1) |
(202) |
active#(U23(X)) |
→ |
active#(X) |
(204) |
active#(U31(X1,X2)) |
→ |
active#(X1) |
(206) |
active#(U32(X)) |
→ |
active#(X) |
(208) |
active#(U41(X1,X2,X3)) |
→ |
active#(X1) |
(210) |
active#(U42(X1,X2)) |
→ |
active#(X1) |
(212) |
active#(U43(X)) |
→ |
active#(X) |
(214) |
active#(U51(X1,X2,X3)) |
→ |
active#(X1) |
(216) |
active#(U52(X1,X2)) |
→ |
active#(X1) |
(218) |
active#(U53(X)) |
→ |
active#(X) |
(220) |
active#(U61(X1,X2)) |
→ |
active#(X1) |
(222) |
active#(U62(X)) |
→ |
active#(X) |
(224) |
active#(U71(X1,X2)) |
→ |
active#(X1) |
(226) |
active#(U72(X)) |
→ |
active#(X) |
(228) |
active#(and(X1,X2)) |
→ |
active#(X1) |
(230) |
1.1.2.1 P is empty
There are no pairs anymore.
-
The
3rd
component contains the
pair
proper#(__(X1,X2)) |
→ |
proper#(X2) |
(252) |
proper#(__(X1,X2)) |
→ |
proper#(X1) |
(253) |
proper#(U11(X1,X2)) |
→ |
proper#(X2) |
(255) |
proper#(U11(X1,X2)) |
→ |
proper#(X1) |
(256) |
proper#(U12(X)) |
→ |
proper#(X) |
(258) |
proper#(isNeList(X)) |
→ |
proper#(X) |
(260) |
proper#(U21(X1,X2,X3)) |
→ |
proper#(X3) |
(262) |
proper#(U21(X1,X2,X3)) |
→ |
proper#(X2) |
(263) |
proper#(U21(X1,X2,X3)) |
→ |
proper#(X1) |
(264) |
proper#(U22(X1,X2)) |
→ |
proper#(X2) |
(266) |
proper#(U22(X1,X2)) |
→ |
proper#(X1) |
(267) |
proper#(isList(X)) |
→ |
proper#(X) |
(269) |
proper#(U23(X)) |
→ |
proper#(X) |
(271) |
proper#(U31(X1,X2)) |
→ |
proper#(X2) |
(273) |
proper#(U31(X1,X2)) |
→ |
proper#(X1) |
(274) |
proper#(U32(X)) |
→ |
proper#(X) |
(276) |
proper#(isQid(X)) |
→ |
proper#(X) |
(278) |
proper#(U41(X1,X2,X3)) |
→ |
proper#(X3) |
(280) |
proper#(U41(X1,X2,X3)) |
→ |
proper#(X2) |
(281) |
proper#(U41(X1,X2,X3)) |
→ |
proper#(X1) |
(282) |
proper#(U42(X1,X2)) |
→ |
proper#(X2) |
(284) |
proper#(U42(X1,X2)) |
→ |
proper#(X1) |
(285) |
proper#(U43(X)) |
→ |
proper#(X) |
(287) |
proper#(U51(X1,X2,X3)) |
→ |
proper#(X3) |
(289) |
proper#(U51(X1,X2,X3)) |
→ |
proper#(X2) |
(290) |
proper#(U51(X1,X2,X3)) |
→ |
proper#(X1) |
(291) |
proper#(U52(X1,X2)) |
→ |
proper#(X2) |
(293) |
proper#(U52(X1,X2)) |
→ |
proper#(X1) |
(294) |
proper#(U53(X)) |
→ |
proper#(X) |
(296) |
proper#(U61(X1,X2)) |
→ |
proper#(X2) |
(298) |
proper#(U61(X1,X2)) |
→ |
proper#(X1) |
(299) |
proper#(U62(X)) |
→ |
proper#(X) |
(301) |
proper#(U71(X1,X2)) |
→ |
proper#(X2) |
(303) |
proper#(U71(X1,X2)) |
→ |
proper#(X1) |
(304) |
proper#(U72(X)) |
→ |
proper#(X) |
(306) |
proper#(isNePal(X)) |
→ |
proper#(X) |
(308) |
proper#(and(X1,X2)) |
→ |
proper#(X2) |
(310) |
proper#(and(X1,X2)) |
→ |
proper#(X1) |
(311) |
proper#(isPalListKind(X)) |
→ |
proper#(X) |
(313) |
proper#(isPal(X)) |
→ |
proper#(X) |
(315) |
1.1.3 Subterm Criterion Processor
We use the projection
and remove the pairs:
proper#(__(X1,X2)) |
→ |
proper#(X2) |
(252) |
proper#(__(X1,X2)) |
→ |
proper#(X1) |
(253) |
proper#(U11(X1,X2)) |
→ |
proper#(X2) |
(255) |
proper#(U11(X1,X2)) |
→ |
proper#(X1) |
(256) |
proper#(U12(X)) |
→ |
proper#(X) |
(258) |
proper#(isNeList(X)) |
→ |
proper#(X) |
(260) |
proper#(U21(X1,X2,X3)) |
→ |
proper#(X3) |
(262) |
proper#(U21(X1,X2,X3)) |
→ |
proper#(X2) |
(263) |
proper#(U21(X1,X2,X3)) |
→ |
proper#(X1) |
(264) |
proper#(U22(X1,X2)) |
→ |
proper#(X2) |
(266) |
proper#(U22(X1,X2)) |
→ |
proper#(X1) |
(267) |
proper#(isList(X)) |
→ |
proper#(X) |
(269) |
proper#(U23(X)) |
→ |
proper#(X) |
(271) |
proper#(U31(X1,X2)) |
→ |
proper#(X2) |
(273) |
proper#(U31(X1,X2)) |
→ |
proper#(X1) |
(274) |
proper#(U32(X)) |
→ |
proper#(X) |
(276) |
proper#(isQid(X)) |
→ |
proper#(X) |
(278) |
proper#(U41(X1,X2,X3)) |
→ |
proper#(X3) |
(280) |
proper#(U41(X1,X2,X3)) |
→ |
proper#(X2) |
(281) |
proper#(U41(X1,X2,X3)) |
→ |
proper#(X1) |
(282) |
proper#(U42(X1,X2)) |
→ |
proper#(X2) |
(284) |
proper#(U42(X1,X2)) |
→ |
proper#(X1) |
(285) |
proper#(U43(X)) |
→ |
proper#(X) |
(287) |
proper#(U51(X1,X2,X3)) |
→ |
proper#(X3) |
(289) |
proper#(U51(X1,X2,X3)) |
→ |
proper#(X2) |
(290) |
proper#(U51(X1,X2,X3)) |
→ |
proper#(X1) |
(291) |
proper#(U52(X1,X2)) |
→ |
proper#(X2) |
(293) |
proper#(U52(X1,X2)) |
→ |
proper#(X1) |
(294) |
proper#(U53(X)) |
→ |
proper#(X) |
(296) |
proper#(U61(X1,X2)) |
→ |
proper#(X2) |
(298) |
proper#(U61(X1,X2)) |
→ |
proper#(X1) |
(299) |
proper#(U62(X)) |
→ |
proper#(X) |
(301) |
proper#(U71(X1,X2)) |
→ |
proper#(X2) |
(303) |
proper#(U71(X1,X2)) |
→ |
proper#(X1) |
(304) |
proper#(U72(X)) |
→ |
proper#(X) |
(306) |
proper#(isNePal(X)) |
→ |
proper#(X) |
(308) |
proper#(and(X1,X2)) |
→ |
proper#(X2) |
(310) |
proper#(and(X1,X2)) |
→ |
proper#(X1) |
(311) |
proper#(isPalListKind(X)) |
→ |
proper#(X) |
(313) |
proper#(isPal(X)) |
→ |
proper#(X) |
(315) |
1.1.3.1 P is empty
There are no pairs anymore.
-
The
4th
component contains the
pair
isPal#(ok(X)) |
→ |
isPal#(X) |
(341) |
1.1.4 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
isPal#(ok(X)) |
→ |
isPal#(X) |
(341) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
5th
component contains the
pair
isPalListKind#(ok(X)) |
→ |
isPalListKind#(X) |
(340) |
1.1.5 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
isPalListKind#(ok(X)) |
→ |
isPalListKind#(X) |
(340) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
6th
component contains the
pair
and#(mark(X1),X2) |
→ |
and#(X1,X2) |
(251) |
and#(ok(X1),ok(X2)) |
→ |
and#(X1,X2) |
(339) |
1.1.6 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
and#(mark(X1),X2) |
→ |
and#(X1,X2) |
(251) |
|
2 |
≥ |
2 |
1 |
> |
1 |
and#(ok(X1),ok(X2)) |
→ |
and#(X1,X2) |
(339) |
|
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
7th
component contains the
pair
isNePal#(ok(X)) |
→ |
isNePal#(X) |
(338) |
1.1.7 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
isNePal#(ok(X)) |
→ |
isNePal#(X) |
(338) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
8th
component contains the
pair
U72#(mark(X)) |
→ |
U72#(X) |
(250) |
U72#(ok(X)) |
→ |
U72#(X) |
(337) |
1.1.8 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U72#(mark(X)) |
→ |
U72#(X) |
(250) |
|
1 |
> |
1 |
U72#(ok(X)) |
→ |
U72#(X) |
(337) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
9th
component contains the
pair
U71#(mark(X1),X2) |
→ |
U71#(X1,X2) |
(249) |
U71#(ok(X1),ok(X2)) |
→ |
U71#(X1,X2) |
(336) |
1.1.9 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U71#(mark(X1),X2) |
→ |
U71#(X1,X2) |
(249) |
|
2 |
≥ |
2 |
1 |
> |
1 |
U71#(ok(X1),ok(X2)) |
→ |
U71#(X1,X2) |
(336) |
|
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
10th
component contains the
pair
U62#(mark(X)) |
→ |
U62#(X) |
(248) |
U62#(ok(X)) |
→ |
U62#(X) |
(335) |
1.1.10 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U62#(mark(X)) |
→ |
U62#(X) |
(248) |
|
1 |
> |
1 |
U62#(ok(X)) |
→ |
U62#(X) |
(335) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
11th
component contains the
pair
U61#(mark(X1),X2) |
→ |
U61#(X1,X2) |
(247) |
U61#(ok(X1),ok(X2)) |
→ |
U61#(X1,X2) |
(334) |
1.1.11 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U61#(mark(X1),X2) |
→ |
U61#(X1,X2) |
(247) |
|
2 |
≥ |
2 |
1 |
> |
1 |
U61#(ok(X1),ok(X2)) |
→ |
U61#(X1,X2) |
(334) |
|
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
12th
component contains the
pair
U53#(mark(X)) |
→ |
U53#(X) |
(246) |
U53#(ok(X)) |
→ |
U53#(X) |
(333) |
1.1.12 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U53#(mark(X)) |
→ |
U53#(X) |
(246) |
|
1 |
> |
1 |
U53#(ok(X)) |
→ |
U53#(X) |
(333) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
13th
component contains the
pair
U52#(mark(X1),X2) |
→ |
U52#(X1,X2) |
(245) |
U52#(ok(X1),ok(X2)) |
→ |
U52#(X1,X2) |
(332) |
1.1.13 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U52#(mark(X1),X2) |
→ |
U52#(X1,X2) |
(245) |
|
2 |
≥ |
2 |
1 |
> |
1 |
U52#(ok(X1),ok(X2)) |
→ |
U52#(X1,X2) |
(332) |
|
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
14th
component contains the
pair
U51#(mark(X1),X2,X3) |
→ |
U51#(X1,X2,X3) |
(244) |
U51#(ok(X1),ok(X2),ok(X3)) |
→ |
U51#(X1,X2,X3) |
(331) |
1.1.14 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U51#(mark(X1),X2,X3) |
→ |
U51#(X1,X2,X3) |
(244) |
|
3 |
≥ |
3 |
2 |
≥ |
2 |
1 |
> |
1 |
U51#(ok(X1),ok(X2),ok(X3)) |
→ |
U51#(X1,X2,X3) |
(331) |
|
3 |
> |
3 |
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
15th
component contains the
pair
U43#(mark(X)) |
→ |
U43#(X) |
(243) |
U43#(ok(X)) |
→ |
U43#(X) |
(330) |
1.1.15 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U43#(mark(X)) |
→ |
U43#(X) |
(243) |
|
1 |
> |
1 |
U43#(ok(X)) |
→ |
U43#(X) |
(330) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
16th
component contains the
pair
U42#(mark(X1),X2) |
→ |
U42#(X1,X2) |
(242) |
U42#(ok(X1),ok(X2)) |
→ |
U42#(X1,X2) |
(329) |
1.1.16 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U42#(mark(X1),X2) |
→ |
U42#(X1,X2) |
(242) |
|
2 |
≥ |
2 |
1 |
> |
1 |
U42#(ok(X1),ok(X2)) |
→ |
U42#(X1,X2) |
(329) |
|
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
17th
component contains the
pair
U41#(mark(X1),X2,X3) |
→ |
U41#(X1,X2,X3) |
(241) |
U41#(ok(X1),ok(X2),ok(X3)) |
→ |
U41#(X1,X2,X3) |
(328) |
1.1.17 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U41#(mark(X1),X2,X3) |
→ |
U41#(X1,X2,X3) |
(241) |
|
3 |
≥ |
3 |
2 |
≥ |
2 |
1 |
> |
1 |
U41#(ok(X1),ok(X2),ok(X3)) |
→ |
U41#(X1,X2,X3) |
(328) |
|
3 |
> |
3 |
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
18th
component contains the
pair
isQid#(ok(X)) |
→ |
isQid#(X) |
(327) |
1.1.18 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
isQid#(ok(X)) |
→ |
isQid#(X) |
(327) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
19th
component contains the
pair
U32#(mark(X)) |
→ |
U32#(X) |
(240) |
U32#(ok(X)) |
→ |
U32#(X) |
(326) |
1.1.19 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U32#(mark(X)) |
→ |
U32#(X) |
(240) |
|
1 |
> |
1 |
U32#(ok(X)) |
→ |
U32#(X) |
(326) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
20th
component contains the
pair
U31#(mark(X1),X2) |
→ |
U31#(X1,X2) |
(239) |
U31#(ok(X1),ok(X2)) |
→ |
U31#(X1,X2) |
(325) |
1.1.20 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U31#(mark(X1),X2) |
→ |
U31#(X1,X2) |
(239) |
|
2 |
≥ |
2 |
1 |
> |
1 |
U31#(ok(X1),ok(X2)) |
→ |
U31#(X1,X2) |
(325) |
|
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
21th
component contains the
pair
U23#(mark(X)) |
→ |
U23#(X) |
(238) |
U23#(ok(X)) |
→ |
U23#(X) |
(324) |
1.1.21 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U23#(mark(X)) |
→ |
U23#(X) |
(238) |
|
1 |
> |
1 |
U23#(ok(X)) |
→ |
U23#(X) |
(324) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
22th
component contains the
pair
isList#(ok(X)) |
→ |
isList#(X) |
(323) |
1.1.22 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
isList#(ok(X)) |
→ |
isList#(X) |
(323) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
23th
component contains the
pair
U22#(mark(X1),X2) |
→ |
U22#(X1,X2) |
(237) |
U22#(ok(X1),ok(X2)) |
→ |
U22#(X1,X2) |
(322) |
1.1.23 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U22#(mark(X1),X2) |
→ |
U22#(X1,X2) |
(237) |
|
2 |
≥ |
2 |
1 |
> |
1 |
U22#(ok(X1),ok(X2)) |
→ |
U22#(X1,X2) |
(322) |
|
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
24th
component contains the
pair
U21#(mark(X1),X2,X3) |
→ |
U21#(X1,X2,X3) |
(236) |
U21#(ok(X1),ok(X2),ok(X3)) |
→ |
U21#(X1,X2,X3) |
(321) |
1.1.24 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U21#(mark(X1),X2,X3) |
→ |
U21#(X1,X2,X3) |
(236) |
|
3 |
≥ |
3 |
2 |
≥ |
2 |
1 |
> |
1 |
U21#(ok(X1),ok(X2),ok(X3)) |
→ |
U21#(X1,X2,X3) |
(321) |
|
3 |
> |
3 |
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
25th
component contains the
pair
isNeList#(ok(X)) |
→ |
isNeList#(X) |
(320) |
1.1.25 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
isNeList#(ok(X)) |
→ |
isNeList#(X) |
(320) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
26th
component contains the
pair
U12#(mark(X)) |
→ |
U12#(X) |
(235) |
U12#(ok(X)) |
→ |
U12#(X) |
(319) |
1.1.26 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U12#(mark(X)) |
→ |
U12#(X) |
(235) |
|
1 |
> |
1 |
U12#(ok(X)) |
→ |
U12#(X) |
(319) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
27th
component contains the
pair
U11#(mark(X1),X2) |
→ |
U11#(X1,X2) |
(234) |
U11#(ok(X1),ok(X2)) |
→ |
U11#(X1,X2) |
(318) |
1.1.27 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
U11#(mark(X1),X2) |
→ |
U11#(X1,X2) |
(234) |
|
2 |
≥ |
2 |
1 |
> |
1 |
U11#(ok(X1),ok(X2)) |
→ |
U11#(X1,X2) |
(318) |
|
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
28th
component contains the
pair
__#(mark(X1),X2) |
→ |
__#(X1,X2) |
(232) |
__#(X1,mark(X2)) |
→ |
__#(X1,X2) |
(233) |
__#(ok(X1),ok(X2)) |
→ |
__#(X1,X2) |
(317) |
1.1.28 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
__#(mark(X1),X2) |
→ |
__#(X1,X2) |
(232) |
|
2 |
≥ |
2 |
1 |
> |
1 |
__#(X1,mark(X2)) |
→ |
__#(X1,X2) |
(233) |
|
2 |
> |
2 |
1 |
≥ |
1 |
__#(ok(X1),ok(X2)) |
→ |
__#(X1,X2) |
(317) |
|
2 |
> |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.