The rewrite relation of the following TRS is considered.
active(and(true,X)) |
→ |
mark(X) |
(1) |
active(and(false,Y)) |
→ |
mark(false) |
(2) |
active(if(true,X,Y)) |
→ |
mark(X) |
(3) |
active(if(false,X,Y)) |
→ |
mark(Y) |
(4) |
active(add(0,X)) |
→ |
mark(X) |
(5) |
active(add(s(X),Y)) |
→ |
mark(s(add(X,Y))) |
(6) |
active(first(0,X)) |
→ |
mark(nil) |
(7) |
active(first(s(X),cons(Y,Z))) |
→ |
mark(cons(Y,first(X,Z))) |
(8) |
active(from(X)) |
→ |
mark(cons(X,from(s(X)))) |
(9) |
active(and(X1,X2)) |
→ |
and(active(X1),X2) |
(10) |
active(if(X1,X2,X3)) |
→ |
if(active(X1),X2,X3) |
(11) |
active(add(X1,X2)) |
→ |
add(active(X1),X2) |
(12) |
active(first(X1,X2)) |
→ |
first(active(X1),X2) |
(13) |
active(first(X1,X2)) |
→ |
first(X1,active(X2)) |
(14) |
and(mark(X1),X2) |
→ |
mark(and(X1,X2)) |
(15) |
if(mark(X1),X2,X3) |
→ |
mark(if(X1,X2,X3)) |
(16) |
add(mark(X1),X2) |
→ |
mark(add(X1,X2)) |
(17) |
first(mark(X1),X2) |
→ |
mark(first(X1,X2)) |
(18) |
first(X1,mark(X2)) |
→ |
mark(first(X1,X2)) |
(19) |
proper(and(X1,X2)) |
→ |
and(proper(X1),proper(X2)) |
(20) |
proper(true) |
→ |
ok(true) |
(21) |
proper(false) |
→ |
ok(false) |
(22) |
proper(if(X1,X2,X3)) |
→ |
if(proper(X1),proper(X2),proper(X3)) |
(23) |
proper(add(X1,X2)) |
→ |
add(proper(X1),proper(X2)) |
(24) |
proper(0) |
→ |
ok(0) |
(25) |
proper(s(X)) |
→ |
s(proper(X)) |
(26) |
proper(first(X1,X2)) |
→ |
first(proper(X1),proper(X2)) |
(27) |
proper(nil) |
→ |
ok(nil) |
(28) |
proper(cons(X1,X2)) |
→ |
cons(proper(X1),proper(X2)) |
(29) |
proper(from(X)) |
→ |
from(proper(X)) |
(30) |
and(ok(X1),ok(X2)) |
→ |
ok(and(X1,X2)) |
(31) |
if(ok(X1),ok(X2),ok(X3)) |
→ |
ok(if(X1,X2,X3)) |
(32) |
add(ok(X1),ok(X2)) |
→ |
ok(add(X1,X2)) |
(33) |
s(ok(X)) |
→ |
ok(s(X)) |
(34) |
first(ok(X1),ok(X2)) |
→ |
ok(first(X1,X2)) |
(35) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(36) |
from(ok(X)) |
→ |
ok(from(X)) |
(37) |
top(mark(X)) |
→ |
top(proper(X)) |
(38) |
top(ok(X)) |
→ |
top(active(X)) |
(39) |
active#(add(s(X),Y)) |
→ |
s#(add(X,Y)) |
(40) |
active#(add(s(X),Y)) |
→ |
add#(X,Y) |
(41) |
active#(first(s(X),cons(Y,Z))) |
→ |
cons#(Y,first(X,Z)) |
(42) |
active#(first(s(X),cons(Y,Z))) |
→ |
first#(X,Z) |
(43) |
active#(from(X)) |
→ |
cons#(X,from(s(X))) |
(44) |
active#(from(X)) |
→ |
from#(s(X)) |
(45) |
active#(from(X)) |
→ |
s#(X) |
(46) |
active#(and(X1,X2)) |
→ |
and#(active(X1),X2) |
(47) |
active#(and(X1,X2)) |
→ |
active#(X1) |
(48) |
active#(if(X1,X2,X3)) |
→ |
if#(active(X1),X2,X3) |
(49) |
active#(if(X1,X2,X3)) |
→ |
active#(X1) |
(50) |
active#(add(X1,X2)) |
→ |
add#(active(X1),X2) |
(51) |
active#(add(X1,X2)) |
→ |
active#(X1) |
(52) |
active#(first(X1,X2)) |
→ |
first#(active(X1),X2) |
(53) |
active#(first(X1,X2)) |
→ |
active#(X1) |
(54) |
active#(first(X1,X2)) |
→ |
first#(X1,active(X2)) |
(55) |
active#(first(X1,X2)) |
→ |
active#(X2) |
(56) |
and#(mark(X1),X2) |
→ |
and#(X1,X2) |
(57) |
if#(mark(X1),X2,X3) |
→ |
if#(X1,X2,X3) |
(58) |
add#(mark(X1),X2) |
→ |
add#(X1,X2) |
(59) |
first#(mark(X1),X2) |
→ |
first#(X1,X2) |
(60) |
first#(X1,mark(X2)) |
→ |
first#(X1,X2) |
(61) |
proper#(and(X1,X2)) |
→ |
and#(proper(X1),proper(X2)) |
(62) |
proper#(and(X1,X2)) |
→ |
proper#(X1) |
(63) |
proper#(and(X1,X2)) |
→ |
proper#(X2) |
(64) |
proper#(if(X1,X2,X3)) |
→ |
if#(proper(X1),proper(X2),proper(X3)) |
(65) |
proper#(if(X1,X2,X3)) |
→ |
proper#(X1) |
(66) |
proper#(if(X1,X2,X3)) |
→ |
proper#(X2) |
(67) |
proper#(if(X1,X2,X3)) |
→ |
proper#(X3) |
(68) |
proper#(add(X1,X2)) |
→ |
add#(proper(X1),proper(X2)) |
(69) |
proper#(add(X1,X2)) |
→ |
proper#(X1) |
(70) |
proper#(add(X1,X2)) |
→ |
proper#(X2) |
(71) |
proper#(s(X)) |
→ |
s#(proper(X)) |
(72) |
proper#(s(X)) |
→ |
proper#(X) |
(73) |
proper#(first(X1,X2)) |
→ |
first#(proper(X1),proper(X2)) |
(74) |
proper#(first(X1,X2)) |
→ |
proper#(X1) |
(75) |
proper#(first(X1,X2)) |
→ |
proper#(X2) |
(76) |
proper#(cons(X1,X2)) |
→ |
cons#(proper(X1),proper(X2)) |
(77) |
proper#(cons(X1,X2)) |
→ |
proper#(X1) |
(78) |
proper#(cons(X1,X2)) |
→ |
proper#(X2) |
(79) |
proper#(from(X)) |
→ |
from#(proper(X)) |
(80) |
proper#(from(X)) |
→ |
proper#(X) |
(81) |
and#(ok(X1),ok(X2)) |
→ |
and#(X1,X2) |
(82) |
if#(ok(X1),ok(X2),ok(X3)) |
→ |
if#(X1,X2,X3) |
(83) |
add#(ok(X1),ok(X2)) |
→ |
add#(X1,X2) |
(84) |
s#(ok(X)) |
→ |
s#(X) |
(85) |
first#(ok(X1),ok(X2)) |
→ |
first#(X1,X2) |
(86) |
cons#(ok(X1),ok(X2)) |
→ |
cons#(X1,X2) |
(87) |
from#(ok(X)) |
→ |
from#(X) |
(88) |
top#(mark(X)) |
→ |
top#(proper(X)) |
(89) |
top#(mark(X)) |
→ |
proper#(X) |
(90) |
top#(ok(X)) |
→ |
top#(active(X)) |
(91) |
top#(ok(X)) |
→ |
active#(X) |
(92) |
The dependency pairs are split into 10
components.
-
The
1st
component contains the
pair
top#(ok(X)) |
→ |
top#(active(X)) |
(91) |
top#(mark(X)) |
→ |
top#(proper(X)) |
(89) |
1.1.1 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[proper(x1)] |
= |
1 · x1
|
[and(x1, x2)] |
= |
2 · x1 + 1 · x2
|
[true] |
= |
0 |
[ok(x1)] |
= |
2 · x1
|
[false] |
= |
0 |
[if(x1, x2, x3)] |
= |
2 · x1 + 2 · x2 + 1 · x3
|
[add(x1, x2)] |
= |
2 · x1 + 2 · x2
|
[0] |
= |
0 |
[s(x1)] |
= |
1 · x1
|
[first(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[nil] |
= |
0 |
[cons(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[from(x1)] |
= |
2 · x1
|
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
2 · x1
|
[top#(x1)] |
= |
1 · x1
|
together with the usable
rules
proper(and(X1,X2)) |
→ |
and(proper(X1),proper(X2)) |
(20) |
proper(true) |
→ |
ok(true) |
(21) |
proper(false) |
→ |
ok(false) |
(22) |
proper(if(X1,X2,X3)) |
→ |
if(proper(X1),proper(X2),proper(X3)) |
(23) |
proper(add(X1,X2)) |
→ |
add(proper(X1),proper(X2)) |
(24) |
proper(0) |
→ |
ok(0) |
(25) |
proper(s(X)) |
→ |
s(proper(X)) |
(26) |
proper(first(X1,X2)) |
→ |
first(proper(X1),proper(X2)) |
(27) |
proper(nil) |
→ |
ok(nil) |
(28) |
proper(cons(X1,X2)) |
→ |
cons(proper(X1),proper(X2)) |
(29) |
proper(from(X)) |
→ |
from(proper(X)) |
(30) |
from(ok(X)) |
→ |
ok(from(X)) |
(37) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(36) |
first(mark(X1),X2) |
→ |
mark(first(X1,X2)) |
(18) |
first(X1,mark(X2)) |
→ |
mark(first(X1,X2)) |
(19) |
first(ok(X1),ok(X2)) |
→ |
ok(first(X1,X2)) |
(35) |
s(ok(X)) |
→ |
ok(s(X)) |
(34) |
add(mark(X1),X2) |
→ |
mark(add(X1,X2)) |
(17) |
add(ok(X1),ok(X2)) |
→ |
ok(add(X1,X2)) |
(33) |
if(mark(X1),X2,X3) |
→ |
mark(if(X1,X2,X3)) |
(16) |
if(ok(X1),ok(X2),ok(X3)) |
→ |
ok(if(X1,X2,X3)) |
(32) |
and(mark(X1),X2) |
→ |
mark(and(X1,X2)) |
(15) |
and(ok(X1),ok(X2)) |
→ |
ok(and(X1,X2)) |
(31) |
active(and(true,X)) |
→ |
mark(X) |
(1) |
active(and(false,Y)) |
→ |
mark(false) |
(2) |
active(if(true,X,Y)) |
→ |
mark(X) |
(3) |
active(if(false,X,Y)) |
→ |
mark(Y) |
(4) |
active(add(0,X)) |
→ |
mark(X) |
(5) |
active(add(s(X),Y)) |
→ |
mark(s(add(X,Y))) |
(6) |
active(first(0,X)) |
→ |
mark(nil) |
(7) |
active(first(s(X),cons(Y,Z))) |
→ |
mark(cons(Y,first(X,Z))) |
(8) |
active(from(X)) |
→ |
mark(cons(X,from(s(X)))) |
(9) |
active(and(X1,X2)) |
→ |
and(active(X1),X2) |
(10) |
active(if(X1,X2,X3)) |
→ |
if(active(X1),X2,X3) |
(11) |
active(add(X1,X2)) |
→ |
add(active(X1),X2) |
(12) |
active(first(X1,X2)) |
→ |
first(active(X1),X2) |
(13) |
active(first(X1,X2)) |
→ |
first(X1,active(X2)) |
(14) |
(w.r.t. the implicit argument filter of the reduction pair),
the
rule
could be deleted.
1.1.1.1 Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
[top#(x1)] |
= |
2 · x1
|
[active(x1)] |
= |
x1 |
[and(x1, x2)] |
= |
2 · x1 + x2
|
[true] |
= |
2 |
[mark(x1)] |
= |
2 + x1
|
[false] |
= |
2 |
[if(x1, x2, x3)] |
= |
2 · x1 + x2 + x3
|
[add(x1, x2)] |
= |
2 + x1 + x2
|
[0] |
= |
2 |
[s(x1)] |
= |
1 |
[first(x1, x2)] |
= |
1 + 2 · x1 + x2
|
[nil] |
= |
2 |
[cons(x1, x2)] |
= |
-2 |
[from(x1)] |
= |
2 |
[proper(x1)] |
= |
x1 |
[ok(x1)] |
= |
x1 |
the
pair
top#(mark(X)) |
→ |
top#(proper(X)) |
(89) |
could be deleted.
1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
2 · x1
|
[and(x1, x2)] |
= |
2 · x1 + 2 · x2
|
[true] |
= |
0 |
[mark(x1)] |
= |
1 · x1
|
[false] |
= |
0 |
[if(x1, x2, x3)] |
= |
1 · x1 + 2 · x2 + 2 · x3
|
[add(x1, x2)] |
= |
2 · x1 + 2 · x2
|
[0] |
= |
1 |
[s(x1)] |
= |
1 · x1
|
[first(x1, x2)] |
= |
2 · x1 + 2 · x2
|
[nil] |
= |
2 |
[cons(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[from(x1)] |
= |
1 · x1
|
[ok(x1)] |
= |
2 · x1
|
[top#(x1)] |
= |
1 · x1
|
together with the usable
rules
active(and(true,X)) |
→ |
mark(X) |
(1) |
active(and(false,Y)) |
→ |
mark(false) |
(2) |
active(if(true,X,Y)) |
→ |
mark(X) |
(3) |
active(if(false,X,Y)) |
→ |
mark(Y) |
(4) |
active(add(0,X)) |
→ |
mark(X) |
(5) |
active(add(s(X),Y)) |
→ |
mark(s(add(X,Y))) |
(6) |
active(first(0,X)) |
→ |
mark(nil) |
(7) |
active(first(s(X),cons(Y,Z))) |
→ |
mark(cons(Y,first(X,Z))) |
(8) |
active(from(X)) |
→ |
mark(cons(X,from(s(X)))) |
(9) |
active(and(X1,X2)) |
→ |
and(active(X1),X2) |
(10) |
active(if(X1,X2,X3)) |
→ |
if(active(X1),X2,X3) |
(11) |
active(add(X1,X2)) |
→ |
add(active(X1),X2) |
(12) |
active(first(X1,X2)) |
→ |
first(active(X1),X2) |
(13) |
active(first(X1,X2)) |
→ |
first(X1,active(X2)) |
(14) |
first(mark(X1),X2) |
→ |
mark(first(X1,X2)) |
(18) |
first(X1,mark(X2)) |
→ |
mark(first(X1,X2)) |
(19) |
first(ok(X1),ok(X2)) |
→ |
ok(first(X1,X2)) |
(35) |
add(mark(X1),X2) |
→ |
mark(add(X1,X2)) |
(17) |
add(ok(X1),ok(X2)) |
→ |
ok(add(X1,X2)) |
(33) |
if(mark(X1),X2,X3) |
→ |
mark(if(X1,X2,X3)) |
(16) |
if(ok(X1),ok(X2),ok(X3)) |
→ |
ok(if(X1,X2,X3)) |
(32) |
and(mark(X1),X2) |
→ |
mark(and(X1,X2)) |
(15) |
and(ok(X1),ok(X2)) |
→ |
ok(and(X1,X2)) |
(31) |
s(ok(X)) |
→ |
ok(s(X)) |
(34) |
from(ok(X)) |
→ |
ok(from(X)) |
(37) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(36) |
(w.r.t. the implicit argument filter of the reduction pair),
the
rules
active(and(true,X)) |
→ |
mark(X) |
(1) |
active(if(true,X,Y)) |
→ |
mark(X) |
(3) |
active(add(0,X)) |
→ |
mark(X) |
(5) |
active(first(0,X)) |
→ |
mark(nil) |
(7) |
could be deleted.
1.1.1.1.1.1 Monotonic Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 + 2 · x1
|
[and(x1, x2)] |
= |
1 + 1 · x1 + 2 · x2
|
[false] |
= |
1 |
[mark(x1)] |
= |
1 · x1
|
[if(x1, x2, x3)] |
= |
1 + 1 · x1 + 2 · x2 + 2 · x3
|
[add(x1, x2)] |
= |
1 + 2 · x1 + 2 · x2
|
[s(x1)] |
= |
1 · x1
|
[first(x1, x2)] |
= |
1 + 2 · x1 + 2 · x2
|
[cons(x1, x2)] |
= |
1 + 2 · x1 + 1 · x2
|
[from(x1)] |
= |
2 · x1
|
[ok(x1)] |
= |
2 + 2 · x1
|
[top#(x1)] |
= |
1 · x1
|
the
pair
top#(ok(X)) |
→ |
top#(active(X)) |
(91) |
and
the
rules
active(and(false,Y)) |
→ |
mark(false) |
(2) |
active(if(false,X,Y)) |
→ |
mark(Y) |
(4) |
active(add(s(X),Y)) |
→ |
mark(s(add(X,Y))) |
(6) |
active(first(s(X),cons(Y,Z))) |
→ |
mark(cons(Y,first(X,Z))) |
(8) |
active(and(X1,X2)) |
→ |
and(active(X1),X2) |
(10) |
active(if(X1,X2,X3)) |
→ |
if(active(X1),X2,X3) |
(11) |
first(ok(X1),ok(X2)) |
→ |
ok(first(X1,X2)) |
(35) |
add(ok(X1),ok(X2)) |
→ |
ok(add(X1,X2)) |
(33) |
if(ok(X1),ok(X2),ok(X3)) |
→ |
ok(if(X1,X2,X3)) |
(32) |
and(ok(X1),ok(X2)) |
→ |
ok(and(X1,X2)) |
(31) |
from(ok(X)) |
→ |
ok(from(X)) |
(37) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(36) |
could be deleted.
1.1.1.1.1.1.1 P is empty
There are no pairs anymore.
-
The
2nd
component contains the
pair
active#(if(X1,X2,X3)) |
→ |
active#(X1) |
(50) |
active#(and(X1,X2)) |
→ |
active#(X1) |
(48) |
active#(add(X1,X2)) |
→ |
active#(X1) |
(52) |
active#(first(X1,X2)) |
→ |
active#(X1) |
(54) |
active#(first(X1,X2)) |
→ |
active#(X2) |
(56) |
1.1.2 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[if(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[and(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[add(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[first(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[active#(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.2.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
active#(if(X1,X2,X3)) |
→ |
active#(X1) |
(50) |
|
1 |
> |
1 |
active#(and(X1,X2)) |
→ |
active#(X1) |
(48) |
|
1 |
> |
1 |
active#(add(X1,X2)) |
→ |
active#(X1) |
(52) |
|
1 |
> |
1 |
active#(first(X1,X2)) |
→ |
active#(X1) |
(54) |
|
1 |
> |
1 |
active#(first(X1,X2)) |
→ |
active#(X2) |
(56) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
3rd
component contains the
pair
proper#(and(X1,X2)) |
→ |
proper#(X2) |
(64) |
proper#(and(X1,X2)) |
→ |
proper#(X1) |
(63) |
proper#(if(X1,X2,X3)) |
→ |
proper#(X1) |
(66) |
proper#(if(X1,X2,X3)) |
→ |
proper#(X2) |
(67) |
proper#(if(X1,X2,X3)) |
→ |
proper#(X3) |
(68) |
proper#(add(X1,X2)) |
→ |
proper#(X1) |
(70) |
proper#(add(X1,X2)) |
→ |
proper#(X2) |
(71) |
proper#(s(X)) |
→ |
proper#(X) |
(73) |
proper#(first(X1,X2)) |
→ |
proper#(X1) |
(75) |
proper#(first(X1,X2)) |
→ |
proper#(X2) |
(76) |
proper#(cons(X1,X2)) |
→ |
proper#(X1) |
(78) |
proper#(cons(X1,X2)) |
→ |
proper#(X2) |
(79) |
proper#(from(X)) |
→ |
proper#(X) |
(81) |
1.1.3 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[and(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[if(x1, x2, x3)] |
= |
1 · x1 + 1 · x2 + 1 · x3
|
[add(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[s(x1)] |
= |
1 · x1
|
[first(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[cons(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[from(x1)] |
= |
1 · x1
|
[proper#(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.3.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
proper#(and(X1,X2)) |
→ |
proper#(X2) |
(64) |
|
1 |
> |
1 |
proper#(and(X1,X2)) |
→ |
proper#(X1) |
(63) |
|
1 |
> |
1 |
proper#(if(X1,X2,X3)) |
→ |
proper#(X1) |
(66) |
|
1 |
> |
1 |
proper#(if(X1,X2,X3)) |
→ |
proper#(X2) |
(67) |
|
1 |
> |
1 |
proper#(if(X1,X2,X3)) |
→ |
proper#(X3) |
(68) |
|
1 |
> |
1 |
proper#(add(X1,X2)) |
→ |
proper#(X1) |
(70) |
|
1 |
> |
1 |
proper#(add(X1,X2)) |
→ |
proper#(X2) |
(71) |
|
1 |
> |
1 |
proper#(s(X)) |
→ |
proper#(X) |
(73) |
|
1 |
> |
1 |
proper#(first(X1,X2)) |
→ |
proper#(X1) |
(75) |
|
1 |
> |
1 |
proper#(first(X1,X2)) |
→ |
proper#(X2) |
(76) |
|
1 |
> |
1 |
proper#(cons(X1,X2)) |
→ |
proper#(X1) |
(78) |
|
1 |
> |
1 |
proper#(cons(X1,X2)) |
→ |
proper#(X2) |
(79) |
|
1 |
> |
1 |
proper#(from(X)) |
→ |
proper#(X) |
(81) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
4th
component contains the
pair
and#(ok(X1),ok(X2)) |
→ |
and#(X1,X2) |
(82) |
and#(mark(X1),X2) |
→ |
and#(X1,X2) |
(57) |
1.1.4 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[ok(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[and#(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.4.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
and#(ok(X1),ok(X2)) |
→ |
and#(X1,X2) |
(82) |
|
1 |
> |
1 |
2 |
> |
2 |
and#(mark(X1),X2) |
→ |
and#(X1,X2) |
(57) |
|
1 |
> |
1 |
2 |
≥ |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
5th
component contains the
pair
if#(ok(X1),ok(X2),ok(X3)) |
→ |
if#(X1,X2,X3) |
(83) |
if#(mark(X1),X2,X3) |
→ |
if#(X1,X2,X3) |
(58) |
1.1.5 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[ok(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[if#(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.
if#(ok(X1),ok(X2),ok(X3)) |
→ |
if#(X1,X2,X3) |
(83) |
|
1 |
> |
1 |
2 |
> |
2 |
3 |
> |
3 |
if#(mark(X1),X2,X3) |
→ |
if#(X1,X2,X3) |
(58) |
|
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
add#(ok(X1),ok(X2)) |
→ |
add#(X1,X2) |
(84) |
add#(mark(X1),X2) |
→ |
add#(X1,X2) |
(59) |
1.1.6 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[ok(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[add#(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.6.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
add#(ok(X1),ok(X2)) |
→ |
add#(X1,X2) |
(84) |
|
1 |
> |
1 |
2 |
> |
2 |
add#(mark(X1),X2) |
→ |
add#(X1,X2) |
(59) |
|
1 |
> |
1 |
2 |
≥ |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
7th
component contains the
pair
first#(X1,mark(X2)) |
→ |
first#(X1,X2) |
(61) |
first#(mark(X1),X2) |
→ |
first#(X1,X2) |
(60) |
first#(ok(X1),ok(X2)) |
→ |
first#(X1,X2) |
(86) |
1.1.7 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[ok(x1)] |
= |
1 · x1
|
[first#(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.
first#(X1,mark(X2)) |
→ |
first#(X1,X2) |
(61) |
|
1 |
≥ |
1 |
2 |
> |
2 |
first#(mark(X1),X2) |
→ |
first#(X1,X2) |
(60) |
|
1 |
> |
1 |
2 |
≥ |
2 |
first#(ok(X1),ok(X2)) |
→ |
first#(X1,X2) |
(86) |
|
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
1.1.8 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[ok(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.8.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
s#(ok(X)) |
→ |
s#(X) |
(85) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
9th
component contains the
pair
cons#(ok(X1),ok(X2)) |
→ |
cons#(X1,X2) |
(87) |
1.1.9 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[ok(x1)] |
= |
1 · x1
|
[cons#(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.9.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
cons#(ok(X1),ok(X2)) |
→ |
cons#(X1,X2) |
(87) |
|
1 |
> |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
10th
component contains the
pair
from#(ok(X)) |
→ |
from#(X) |
(88) |
1.1.10 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[ok(x1)] |
= |
1 · x1
|
[from#(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.10.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
from#(ok(X)) |
→ |
from#(X) |
(88) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.