Problem:
__(__(X,Y),Z) -> __(X,__(Y,Z))
__(X,nil()) -> X
__(nil(),X) -> X
and(tt(),X) -> activate(X)
isList(V) -> isNeList(activate(V))
isList(n__nil()) -> tt()
isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(V) -> isQid(activate(V))
isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2)))
isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2)))
isNePal(V) -> isQid(activate(V))
isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P)))
isPal(V) -> isNePal(activate(V))
isPal(n__nil()) -> tt()
isQid(n__a()) -> tt()
isQid(n__e()) -> tt()
isQid(n__i()) -> tt()
isQid(n__o()) -> tt()
isQid(n__u()) -> tt()
nil() -> n__nil()
__(X1,X2) -> n____(X1,X2)
isList(X) -> n__isList(X)
isNeList(X) -> n__isNeList(X)
isPal(X) -> n__isPal(X)
a() -> n__a()
e() -> n__e()
i() -> n__i()
o() -> n__o()
u() -> n__u()
activate(n__nil()) -> nil()
activate(n____(X1,X2)) -> __(X1,X2)
activate(n__isList(X)) -> isList(X)
activate(n__isNeList(X)) -> isNeList(X)
activate(n__isPal(X)) -> isPal(X)
activate(n__a()) -> a()
activate(n__e()) -> e()
activate(n__i()) -> i()
activate(n__o()) -> o()
activate(n__u()) -> u()
activate(X) -> X
Proof:
Complexity Transformation Processor:
strict:
__(__(X,Y),Z) -> __(X,__(Y,Z))
__(X,nil()) -> X
__(nil(),X) -> X
and(tt(),X) -> activate(X)
isList(V) -> isNeList(activate(V))
isList(n__nil()) -> tt()
isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(V) -> isQid(activate(V))
isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2)))
isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2)))
isNePal(V) -> isQid(activate(V))
isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P)))
isPal(V) -> isNePal(activate(V))
isPal(n__nil()) -> tt()
isQid(n__a()) -> tt()
isQid(n__e()) -> tt()
isQid(n__i()) -> tt()
isQid(n__o()) -> tt()
isQid(n__u()) -> tt()
nil() -> n__nil()
__(X1,X2) -> n____(X1,X2)
isList(X) -> n__isList(X)
isNeList(X) -> n__isNeList(X)
isPal(X) -> n__isPal(X)
a() -> n__a()
e() -> n__e()
i() -> n__i()
o() -> n__o()
u() -> n__u()
activate(n__nil()) -> nil()
activate(n____(X1,X2)) -> __(X1,X2)
activate(n__isList(X)) -> isList(X)
activate(n__isNeList(X)) -> isNeList(X)
activate(n__isPal(X)) -> isPal(X)
activate(n__a()) -> a()
activate(n__e()) -> e()
activate(n__i()) -> i()
activate(n__o()) -> o()
activate(n__u()) -> u()
activate(X) -> X
weak:
Matrix Interpretation Processor:
dimension: 1
max_matrix:
1
interpretation:
[u] = 0,
[o] = 0,
[i] = 0,
[e] = 0,
[a] = 0,
[n__u] = 8,
[n__o] = 12,
[n__i] = 1,
[n__e] = 0,
[n__a] = 0,
[isPal](x0) = x0,
[n__isPal](x0) = x0,
[isNePal](x0) = x0,
[n__isNeList](x0) = x0 + 12,
[isQid](x0) = x0 + 4,
[n__isList](x0) = x0,
[n____](x0, x1) = x0 + x1 + 13,
[n__nil] = 5,
[isNeList](x0) = x0 + 1,
[isList](x0) = x0,
[activate](x0) = x0 + 8,
[and](x0, x1) = x0 + x1 + 3,
[tt] = 0,
[nil] = 4,
[__](x0, x1) = x0 + x1 + 13
orientation:
__(__(X,Y),Z) = X + Y + Z + 26 >= X + Y + Z + 26 = __(X,__(Y,Z))
__(X,nil()) = X + 17 >= X = X
__(nil(),X) = X + 17 >= X = X
and(tt(),X) = X + 3 >= X + 8 = activate(X)
isList(V) = V >= V + 9 = isNeList(activate(V))
isList(n__nil()) = 5 >= 0 = tt()
isList(n____(V1,V2)) = V1 + V2 + 13 >= V1 + V2 + 19 = and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(V) = V + 1 >= V + 12 = isQid(activate(V))
isNeList(n____(V1,V2)) = V1 + V2 + 14 >= V1 + V2 + 31 = and(isList(activate(V1)),n__isNeList(activate(V2)))
isNeList(n____(V1,V2)) = V1 + V2 + 14 >= V1 + V2 + 20 = and(isNeList(activate(V1)),n__isList(activate(V2)))
isNePal(V) = V >= V + 12 = isQid(activate(V))
isNePal(n____(I,__(P,I))) = 2I + P + 26 >= I + P + 23 = and(isQid(activate(I)),n__isPal(activate(P)))
isPal(V) = V >= V + 8 = isNePal(activate(V))
isPal(n__nil()) = 5 >= 0 = tt()
isQid(n__a()) = 4 >= 0 = tt()
isQid(n__e()) = 4 >= 0 = tt()
isQid(n__i()) = 5 >= 0 = tt()
isQid(n__o()) = 16 >= 0 = tt()
isQid(n__u()) = 12 >= 0 = tt()
nil() = 4 >= 5 = n__nil()
__(X1,X2) = X1 + X2 + 13 >= X1 + X2 + 13 = n____(X1,X2)
isList(X) = X >= X = n__isList(X)
isNeList(X) = X + 1 >= X + 12 = n__isNeList(X)
isPal(X) = X >= X = n__isPal(X)
a() = 0 >= 0 = n__a()
e() = 0 >= 0 = n__e()
i() = 0 >= 1 = n__i()
o() = 0 >= 12 = n__o()
u() = 0 >= 8 = n__u()
activate(n__nil()) = 13 >= 4 = nil()
activate(n____(X1,X2)) = X1 + X2 + 21 >= X1 + X2 + 13 = __(X1,X2)
activate(n__isList(X)) = X + 8 >= X = isList(X)
activate(n__isNeList(X)) = X + 20 >= X + 1 = isNeList(X)
activate(n__isPal(X)) = X + 8 >= X = isPal(X)
activate(n__a()) = 8 >= 0 = a()
activate(n__e()) = 8 >= 0 = e()
activate(n__i()) = 9 >= 0 = i()
activate(n__o()) = 20 >= 0 = o()
activate(n__u()) = 16 >= 0 = u()
activate(X) = X + 8 >= X = X
problem:
strict:
__(__(X,Y),Z) -> __(X,__(Y,Z))
and(tt(),X) -> activate(X)
isList(V) -> isNeList(activate(V))
isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(V) -> isQid(activate(V))
isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2)))
isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2)))
isNePal(V) -> isQid(activate(V))
isPal(V) -> isNePal(activate(V))
nil() -> n__nil()
__(X1,X2) -> n____(X1,X2)
isList(X) -> n__isList(X)
isNeList(X) -> n__isNeList(X)
isPal(X) -> n__isPal(X)
a() -> n__a()
e() -> n__e()
i() -> n__i()
o() -> n__o()
u() -> n__u()
weak:
__(X,nil()) -> X
__(nil(),X) -> X
isList(n__nil()) -> tt()
isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) -> tt()
isQid(n__a()) -> tt()
isQid(n__e()) -> tt()
isQid(n__i()) -> tt()
isQid(n__o()) -> tt()
isQid(n__u()) -> tt()
activate(n__nil()) -> nil()
activate(n____(X1,X2)) -> __(X1,X2)
activate(n__isList(X)) -> isList(X)
activate(n__isNeList(X)) -> isNeList(X)
activate(n__isPal(X)) -> isPal(X)
activate(n__a()) -> a()
activate(n__e()) -> e()
activate(n__i()) -> i()
activate(n__o()) -> o()
activate(n__u()) -> u()
activate(X) -> X
Matrix Interpretation Processor:
dimension: 1
max_matrix:
1
interpretation:
[u] = 3,
[o] = 0,
[i] = 2,
[e] = 0,
[a] = 0,
[n__u] = 2,
[n__o] = 10,
[n__i] = 0,
[n__e] = 0,
[n__a] = 0,
[isPal](x0) = x0 + 8,
[n__isPal](x0) = x0 + 8,
[isNePal](x0) = x0 + 12,
[n__isNeList](x0) = x0,
[isQid](x0) = x0 + 1,
[n__isList](x0) = x0 + 2,
[n____](x0, x1) = x0 + x1 + 10,
[n__nil] = 0,
[isNeList](x0) = x0 + 2,
[isList](x0) = x0,
[activate](x0) = x0 + 2,
[and](x0, x1) = x0 + x1 + 9,
[tt] = 0,
[nil] = 0,
[__](x0, x1) = x0 + x1
orientation:
__(__(X,Y),Z) = X + Y + Z >= X + Y + Z = __(X,__(Y,Z))
and(tt(),X) = X + 9 >= X + 2 = activate(X)
isList(V) = V >= V + 4 = isNeList(activate(V))
isList(n____(V1,V2)) = V1 + V2 + 10 >= V1 + V2 + 15 = and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(V) = V + 2 >= V + 3 = isQid(activate(V))
isNeList(n____(V1,V2)) = V1 + V2 + 12 >= V1 + V2 + 13 = and(isList(activate(V1)),n__isNeList(activate(V2)))
isNeList(n____(V1,V2)) = V1 + V2 + 12 >= V1 + V2 + 17 = and(isNeList(activate(V1)),n__isList(activate(V2)))
isNePal(V) = V + 12 >= V + 3 = isQid(activate(V))
isPal(V) = V + 8 >= V + 14 = isNePal(activate(V))
nil() = 0 >= 0 = n__nil()
__(X1,X2) = X1 + X2 >= X1 + X2 + 10 = n____(X1,X2)
isList(X) = X >= X + 2 = n__isList(X)
isNeList(X) = X + 2 >= X = n__isNeList(X)
isPal(X) = X + 8 >= X + 8 = n__isPal(X)
a() = 0 >= 0 = n__a()
e() = 0 >= 0 = n__e()
i() = 2 >= 0 = n__i()
o() = 0 >= 10 = n__o()
u() = 3 >= 2 = n__u()
__(X,nil()) = X >= X = X
__(nil(),X) = X >= X = X
isList(n__nil()) = 0 >= 0 = tt()
isNePal(n____(I,__(P,I))) = 2I + P + 22 >= I + P + 22 = and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) = 8 >= 0 = tt()
isQid(n__a()) = 1 >= 0 = tt()
isQid(n__e()) = 1 >= 0 = tt()
isQid(n__i()) = 1 >= 0 = tt()
isQid(n__o()) = 11 >= 0 = tt()
isQid(n__u()) = 3 >= 0 = tt()
activate(n__nil()) = 2 >= 0 = nil()
activate(n____(X1,X2)) = X1 + X2 + 12 >= X1 + X2 = __(X1,X2)
activate(n__isList(X)) = X + 4 >= X = isList(X)
activate(n__isNeList(X)) = X + 2 >= X + 2 = isNeList(X)
activate(n__isPal(X)) = X + 10 >= X + 8 = isPal(X)
activate(n__a()) = 2 >= 0 = a()
activate(n__e()) = 2 >= 0 = e()
activate(n__i()) = 2 >= 2 = i()
activate(n__o()) = 12 >= 0 = o()
activate(n__u()) = 4 >= 3 = u()
activate(X) = X + 2 >= X = X
problem:
strict:
__(__(X,Y),Z) -> __(X,__(Y,Z))
isList(V) -> isNeList(activate(V))
isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(V) -> isQid(activate(V))
isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2)))
isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2)))
isPal(V) -> isNePal(activate(V))
nil() -> n__nil()
__(X1,X2) -> n____(X1,X2)
isList(X) -> n__isList(X)
isPal(X) -> n__isPal(X)
a() -> n__a()
e() -> n__e()
o() -> n__o()
weak:
and(tt(),X) -> activate(X)
isNePal(V) -> isQid(activate(V))
isNeList(X) -> n__isNeList(X)
i() -> n__i()
u() -> n__u()
__(X,nil()) -> X
__(nil(),X) -> X
isList(n__nil()) -> tt()
isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) -> tt()
isQid(n__a()) -> tt()
isQid(n__e()) -> tt()
isQid(n__i()) -> tt()
isQid(n__o()) -> tt()
isQid(n__u()) -> tt()
activate(n__nil()) -> nil()
activate(n____(X1,X2)) -> __(X1,X2)
activate(n__isList(X)) -> isList(X)
activate(n__isNeList(X)) -> isNeList(X)
activate(n__isPal(X)) -> isPal(X)
activate(n__a()) -> a()
activate(n__e()) -> e()
activate(n__i()) -> i()
activate(n__o()) -> o()
activate(n__u()) -> u()
activate(X) -> X
Matrix Interpretation Processor:
dimension: 1
max_matrix:
1
interpretation:
[u] = 7,
[o] = 0,
[i] = 0,
[e] = 0,
[a] = 1,
[n__u] = 7,
[n__o] = 1,
[n__i] = 0,
[n__e] = 10,
[n__a] = 0,
[isPal](x0) = x0 + 5,
[n__isPal](x0) = x0 + 4,
[isNePal](x0) = x0 + 2,
[n__isNeList](x0) = x0 + 15,
[isQid](x0) = x0 + 1,
[n__isList](x0) = x0 + 6,
[n____](x0, x1) = x0 + x1 + 7,
[n__nil] = 1,
[isNeList](x0) = x0 + 15,
[isList](x0) = x0,
[activate](x0) = x0 + 1,
[and](x0, x1) = x0 + x1,
[tt] = 1,
[nil] = 0,
[__](x0, x1) = x0 + x1
orientation:
__(__(X,Y),Z) = X + Y + Z >= X + Y + Z = __(X,__(Y,Z))
isList(V) = V >= V + 16 = isNeList(activate(V))
isList(n____(V1,V2)) = V1 + V2 + 7 >= V1 + V2 + 8 = and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(V) = V + 15 >= V + 2 = isQid(activate(V))
isNeList(n____(V1,V2)) = V1 + V2 + 22 >= V1 + V2 + 17 = and(isList(activate(V1)),n__isNeList(activate(V2)))
isNeList(n____(V1,V2)) = V1 + V2 + 22 >= V1 + V2 + 23 = and(isNeList(activate(V1)),n__isList(activate(V2)))
isPal(V) = V + 5 >= V + 3 = isNePal(activate(V))
nil() = 0 >= 1 = n__nil()
__(X1,X2) = X1 + X2 >= X1 + X2 + 7 = n____(X1,X2)
isList(X) = X >= X + 6 = n__isList(X)
isPal(X) = X + 5 >= X + 4 = n__isPal(X)
a() = 1 >= 0 = n__a()
e() = 0 >= 10 = n__e()
o() = 0 >= 1 = n__o()
and(tt(),X) = X + 1 >= X + 1 = activate(X)
isNePal(V) = V + 2 >= V + 2 = isQid(activate(V))
isNeList(X) = X + 15 >= X + 15 = n__isNeList(X)
i() = 0 >= 0 = n__i()
u() = 7 >= 7 = n__u()
__(X,nil()) = X >= X = X
__(nil(),X) = X >= X = X
isList(n__nil()) = 1 >= 1 = tt()
isNePal(n____(I,__(P,I))) = 2I + P + 9 >= I + P + 7 = and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) = 6 >= 1 = tt()
isQid(n__a()) = 1 >= 1 = tt()
isQid(n__e()) = 11 >= 1 = tt()
isQid(n__i()) = 1 >= 1 = tt()
isQid(n__o()) = 2 >= 1 = tt()
isQid(n__u()) = 8 >= 1 = tt()
activate(n__nil()) = 2 >= 0 = nil()
activate(n____(X1,X2)) = X1 + X2 + 8 >= X1 + X2 = __(X1,X2)
activate(n__isList(X)) = X + 7 >= X = isList(X)
activate(n__isNeList(X)) = X + 16 >= X + 15 = isNeList(X)
activate(n__isPal(X)) = X + 5 >= X + 5 = isPal(X)
activate(n__a()) = 1 >= 1 = a()
activate(n__e()) = 11 >= 0 = e()
activate(n__i()) = 1 >= 0 = i()
activate(n__o()) = 2 >= 0 = o()
activate(n__u()) = 8 >= 7 = u()
activate(X) = X + 1 >= X = X
problem:
strict:
__(__(X,Y),Z) -> __(X,__(Y,Z))
isList(V) -> isNeList(activate(V))
isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2)))
nil() -> n__nil()
__(X1,X2) -> n____(X1,X2)
isList(X) -> n__isList(X)
e() -> n__e()
o() -> n__o()
weak:
isNeList(V) -> isQid(activate(V))
isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2)))
isPal(V) -> isNePal(activate(V))
isPal(X) -> n__isPal(X)
a() -> n__a()
and(tt(),X) -> activate(X)
isNePal(V) -> isQid(activate(V))
isNeList(X) -> n__isNeList(X)
i() -> n__i()
u() -> n__u()
__(X,nil()) -> X
__(nil(),X) -> X
isList(n__nil()) -> tt()
isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) -> tt()
isQid(n__a()) -> tt()
isQid(n__e()) -> tt()
isQid(n__i()) -> tt()
isQid(n__o()) -> tt()
isQid(n__u()) -> tt()
activate(n__nil()) -> nil()
activate(n____(X1,X2)) -> __(X1,X2)
activate(n__isList(X)) -> isList(X)
activate(n__isNeList(X)) -> isNeList(X)
activate(n__isPal(X)) -> isPal(X)
activate(n__a()) -> a()
activate(n__e()) -> e()
activate(n__i()) -> i()
activate(n__o()) -> o()
activate(n__u()) -> u()
activate(X) -> X
Matrix Interpretation Processor:
dimension: 1
max_matrix:
1
interpretation:
[u] = 4,
[o] = 3,
[i] = 14,
[e] = 0,
[a] = 5,
[n__u] = 4,
[n__o] = 2,
[n__i] = 12,
[n__e] = 6,
[n__a] = 5,
[isPal](x0) = x0 + 4,
[n__isPal](x0) = x0 + 4,
[isNePal](x0) = x0 + 2,
[n__isNeList](x0) = x0 + 2,
[isQid](x0) = x0,
[n__isList](x0) = x0 + 8,
[n____](x0, x1) = x0 + x1 + 10,
[n__nil] = 11,
[isNeList](x0) = x0 + 2,
[isList](x0) = x0 + 6,
[activate](x0) = x0 + 2,
[and](x0, x1) = x0 + x1,
[tt] = 2,
[nil] = 8,
[__](x0, x1) = x0 + x1 + 1
orientation:
__(__(X,Y),Z) = X + Y + Z + 2 >= X + Y + Z + 2 = __(X,__(Y,Z))
isList(V) = V + 6 >= V + 4 = isNeList(activate(V))
isList(n____(V1,V2)) = V1 + V2 + 16 >= V1 + V2 + 18 = and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(n____(V1,V2)) = V1 + V2 + 12 >= V1 + V2 + 14 = and(isNeList(activate(V1)),n__isList(activate(V2)))
nil() = 8 >= 11 = n__nil()
__(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 10 = n____(X1,X2)
isList(X) = X + 6 >= X + 8 = n__isList(X)
e() = 0 >= 6 = n__e()
o() = 3 >= 2 = n__o()
isNeList(V) = V + 2 >= V + 2 = isQid(activate(V))
isNeList(n____(V1,V2)) = V1 + V2 + 12 >= V1 + V2 + 12 = and(isList(activate(V1)),n__isNeList(activate(V2)))
isPal(V) = V + 4 >= V + 4 = isNePal(activate(V))
isPal(X) = X + 4 >= X + 4 = n__isPal(X)
a() = 5 >= 5 = n__a()
and(tt(),X) = X + 2 >= X + 2 = activate(X)
isNePal(V) = V + 2 >= V + 2 = isQid(activate(V))
isNeList(X) = X + 2 >= X + 2 = n__isNeList(X)
i() = 14 >= 12 = n__i()
u() = 4 >= 4 = n__u()
__(X,nil()) = X + 9 >= X = X
__(nil(),X) = X + 9 >= X = X
isList(n__nil()) = 17 >= 2 = tt()
isNePal(n____(I,__(P,I))) = 2I + P + 13 >= I + P + 8 = and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) = 15 >= 2 = tt()
isQid(n__a()) = 5 >= 2 = tt()
isQid(n__e()) = 6 >= 2 = tt()
isQid(n__i()) = 12 >= 2 = tt()
isQid(n__o()) = 2 >= 2 = tt()
isQid(n__u()) = 4 >= 2 = tt()
activate(n__nil()) = 13 >= 8 = nil()
activate(n____(X1,X2)) = X1 + X2 + 12 >= X1 + X2 + 1 = __(X1,X2)
activate(n__isList(X)) = X + 10 >= X + 6 = isList(X)
activate(n__isNeList(X)) = X + 4 >= X + 2 = isNeList(X)
activate(n__isPal(X)) = X + 6 >= X + 4 = isPal(X)
activate(n__a()) = 7 >= 5 = a()
activate(n__e()) = 8 >= 0 = e()
activate(n__i()) = 14 >= 14 = i()
activate(n__o()) = 4 >= 3 = o()
activate(n__u()) = 6 >= 4 = u()
activate(X) = X + 2 >= X = X
problem:
strict:
__(__(X,Y),Z) -> __(X,__(Y,Z))
isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2)))
nil() -> n__nil()
__(X1,X2) -> n____(X1,X2)
isList(X) -> n__isList(X)
e() -> n__e()
weak:
isList(V) -> isNeList(activate(V))
o() -> n__o()
isNeList(V) -> isQid(activate(V))
isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2)))
isPal(V) -> isNePal(activate(V))
isPal(X) -> n__isPal(X)
a() -> n__a()
and(tt(),X) -> activate(X)
isNePal(V) -> isQid(activate(V))
isNeList(X) -> n__isNeList(X)
i() -> n__i()
u() -> n__u()
__(X,nil()) -> X
__(nil(),X) -> X
isList(n__nil()) -> tt()
isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) -> tt()
isQid(n__a()) -> tt()
isQid(n__e()) -> tt()
isQid(n__i()) -> tt()
isQid(n__o()) -> tt()
isQid(n__u()) -> tt()
activate(n__nil()) -> nil()
activate(n____(X1,X2)) -> __(X1,X2)
activate(n__isList(X)) -> isList(X)
activate(n__isNeList(X)) -> isNeList(X)
activate(n__isPal(X)) -> isPal(X)
activate(n__a()) -> a()
activate(n__e()) -> e()
activate(n__i()) -> i()
activate(n__o()) -> o()
activate(n__u()) -> u()
activate(X) -> X
Matrix Interpretation Processor:
dimension: 1
max_matrix:
1
interpretation:
[u] = 9,
[o] = 8,
[i] = 12,
[e] = 13,
[a] = 8,
[n__u] = 9,
[n__o] = 8,
[n__i] = 12,
[n__e] = 12,
[n__a] = 8,
[isPal](x0) = x0 + 15,
[n__isPal](x0) = x0 + 15,
[isNePal](x0) = x0 + 14,
[n__isNeList](x0) = x0 + 2,
[isQid](x0) = x0 + 1,
[n__isList](x0) = x0 + 2,
[n____](x0, x1) = x0 + x1 + 5,
[n__nil] = 8,
[isNeList](x0) = x0 + 2,
[isList](x0) = x0 + 3,
[activate](x0) = x0 + 1,
[and](x0, x1) = x0 + x1,
[tt] = 1,
[nil] = 0,
[__](x0, x1) = x0 + x1
orientation:
__(__(X,Y),Z) = X + Y + Z >= X + Y + Z = __(X,__(Y,Z))
isList(n____(V1,V2)) = V1 + V2 + 8 >= V1 + V2 + 7 = and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(n____(V1,V2)) = V1 + V2 + 7 >= V1 + V2 + 6 = and(isNeList(activate(V1)),n__isList(activate(V2)))
nil() = 0 >= 8 = n__nil()
__(X1,X2) = X1 + X2 >= X1 + X2 + 5 = n____(X1,X2)
isList(X) = X + 3 >= X + 2 = n__isList(X)
e() = 13 >= 12 = n__e()
isList(V) = V + 3 >= V + 3 = isNeList(activate(V))
o() = 8 >= 8 = n__o()
isNeList(V) = V + 2 >= V + 2 = isQid(activate(V))
isNeList(n____(V1,V2)) = V1 + V2 + 7 >= V1 + V2 + 7 = and(isList(activate(V1)),n__isNeList(activate(V2)))
isPal(V) = V + 15 >= V + 15 = isNePal(activate(V))
isPal(X) = X + 15 >= X + 15 = n__isPal(X)
a() = 8 >= 8 = n__a()
and(tt(),X) = X + 1 >= X + 1 = activate(X)
isNePal(V) = V + 14 >= V + 2 = isQid(activate(V))
isNeList(X) = X + 2 >= X + 2 = n__isNeList(X)
i() = 12 >= 12 = n__i()
u() = 9 >= 9 = n__u()
__(X,nil()) = X >= X = X
__(nil(),X) = X >= X = X
isList(n__nil()) = 11 >= 1 = tt()
isNePal(n____(I,__(P,I))) = 2I + P + 19 >= I + P + 18 = and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) = 23 >= 1 = tt()
isQid(n__a()) = 9 >= 1 = tt()
isQid(n__e()) = 13 >= 1 = tt()
isQid(n__i()) = 13 >= 1 = tt()
isQid(n__o()) = 9 >= 1 = tt()
isQid(n__u()) = 10 >= 1 = tt()
activate(n__nil()) = 9 >= 0 = nil()
activate(n____(X1,X2)) = X1 + X2 + 6 >= X1 + X2 = __(X1,X2)
activate(n__isList(X)) = X + 3 >= X + 3 = isList(X)
activate(n__isNeList(X)) = X + 3 >= X + 2 = isNeList(X)
activate(n__isPal(X)) = X + 16 >= X + 15 = isPal(X)
activate(n__a()) = 9 >= 8 = a()
activate(n__e()) = 13 >= 13 = e()
activate(n__i()) = 13 >= 12 = i()
activate(n__o()) = 9 >= 8 = o()
activate(n__u()) = 10 >= 9 = u()
activate(X) = X + 1 >= X = X
problem:
strict:
__(__(X,Y),Z) -> __(X,__(Y,Z))
nil() -> n__nil()
__(X1,X2) -> n____(X1,X2)
weak:
isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2)))
isList(X) -> n__isList(X)
e() -> n__e()
isList(V) -> isNeList(activate(V))
o() -> n__o()
isNeList(V) -> isQid(activate(V))
isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2)))
isPal(V) -> isNePal(activate(V))
isPal(X) -> n__isPal(X)
a() -> n__a()
and(tt(),X) -> activate(X)
isNePal(V) -> isQid(activate(V))
isNeList(X) -> n__isNeList(X)
i() -> n__i()
u() -> n__u()
__(X,nil()) -> X
__(nil(),X) -> X
isList(n__nil()) -> tt()
isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) -> tt()
isQid(n__a()) -> tt()
isQid(n__e()) -> tt()
isQid(n__i()) -> tt()
isQid(n__o()) -> tt()
isQid(n__u()) -> tt()
activate(n__nil()) -> nil()
activate(n____(X1,X2)) -> __(X1,X2)
activate(n__isList(X)) -> isList(X)
activate(n__isNeList(X)) -> isNeList(X)
activate(n__isPal(X)) -> isPal(X)
activate(n__a()) -> a()
activate(n__e()) -> e()
activate(n__i()) -> i()
activate(n__o()) -> o()
activate(n__u()) -> u()
activate(X) -> X
Matrix Interpretation Processor:
dimension: 1
max_matrix:
1
interpretation:
[u] = 9,
[o] = 10,
[i] = 6,
[e] = 9,
[a] = 6,
[n__u] = 9,
[n__o] = 10,
[n__i] = 4,
[n__e] = 8,
[n__a] = 4,
[isPal](x0) = x0 + 10,
[n__isPal](x0) = x0 + 8,
[isNePal](x0) = x0 + 2,
[n__isNeList](x0) = x0,
[isQid](x0) = x0,
[n__isList](x0) = x0 + 3,
[n____](x0, x1) = x0 + x1 + 7,
[n__nil] = 0,
[isNeList](x0) = x0 + 2,
[isList](x0) = x0 + 5,
[activate](x0) = x0 + 2,
[and](x0, x1) = x0 + x1,
[tt] = 4,
[nil] = 2,
[__](x0, x1) = x0 + x1 + 9
orientation:
__(__(X,Y),Z) = X + Y + Z + 18 >= X + Y + Z + 18 = __(X,__(Y,Z))
nil() = 2 >= 0 = n__nil()
__(X1,X2) = X1 + X2 + 9 >= X1 + X2 + 7 = n____(X1,X2)
isList(n____(V1,V2)) = V1 + V2 + 12 >= V1 + V2 + 12 = and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(n____(V1,V2)) = V1 + V2 + 9 >= V1 + V2 + 9 = and(isNeList(activate(V1)),n__isList(activate(V2)))
isList(X) = X + 5 >= X + 3 = n__isList(X)
e() = 9 >= 8 = n__e()
isList(V) = V + 5 >= V + 4 = isNeList(activate(V))
o() = 10 >= 10 = n__o()
isNeList(V) = V + 2 >= V + 2 = isQid(activate(V))
isNeList(n____(V1,V2)) = V1 + V2 + 9 >= V1 + V2 + 9 = and(isList(activate(V1)),n__isNeList(activate(V2)))
isPal(V) = V + 10 >= V + 4 = isNePal(activate(V))
isPal(X) = X + 10 >= X + 8 = n__isPal(X)
a() = 6 >= 4 = n__a()
and(tt(),X) = X + 4 >= X + 2 = activate(X)
isNePal(V) = V + 2 >= V + 2 = isQid(activate(V))
isNeList(X) = X + 2 >= X = n__isNeList(X)
i() = 6 >= 4 = n__i()
u() = 9 >= 9 = n__u()
__(X,nil()) = X + 11 >= X = X
__(nil(),X) = X + 11 >= X = X
isList(n__nil()) = 5 >= 4 = tt()
isNePal(n____(I,__(P,I))) = 2I + P + 18 >= I + P + 12 = and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) = 10 >= 4 = tt()
isQid(n__a()) = 4 >= 4 = tt()
isQid(n__e()) = 8 >= 4 = tt()
isQid(n__i()) = 4 >= 4 = tt()
isQid(n__o()) = 10 >= 4 = tt()
isQid(n__u()) = 9 >= 4 = tt()
activate(n__nil()) = 2 >= 2 = nil()
activate(n____(X1,X2)) = X1 + X2 + 9 >= X1 + X2 + 9 = __(X1,X2)
activate(n__isList(X)) = X + 5 >= X + 5 = isList(X)
activate(n__isNeList(X)) = X + 2 >= X + 2 = isNeList(X)
activate(n__isPal(X)) = X + 10 >= X + 10 = isPal(X)
activate(n__a()) = 6 >= 6 = a()
activate(n__e()) = 10 >= 9 = e()
activate(n__i()) = 6 >= 6 = i()
activate(n__o()) = 12 >= 10 = o()
activate(n__u()) = 11 >= 9 = u()
activate(X) = X + 2 >= X = X
problem:
strict:
__(__(X,Y),Z) -> __(X,__(Y,Z))
weak:
nil() -> n__nil()
__(X1,X2) -> n____(X1,X2)
isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2)))
isList(X) -> n__isList(X)
e() -> n__e()
isList(V) -> isNeList(activate(V))
o() -> n__o()
isNeList(V) -> isQid(activate(V))
isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2)))
isPal(V) -> isNePal(activate(V))
isPal(X) -> n__isPal(X)
a() -> n__a()
and(tt(),X) -> activate(X)
isNePal(V) -> isQid(activate(V))
isNeList(X) -> n__isNeList(X)
i() -> n__i()
u() -> n__u()
__(X,nil()) -> X
__(nil(),X) -> X
isList(n__nil()) -> tt()
isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) -> tt()
isQid(n__a()) -> tt()
isQid(n__e()) -> tt()
isQid(n__i()) -> tt()
isQid(n__o()) -> tt()
isQid(n__u()) -> tt()
activate(n__nil()) -> nil()
activate(n____(X1,X2)) -> __(X1,X2)
activate(n__isList(X)) -> isList(X)
activate(n__isNeList(X)) -> isNeList(X)
activate(n__isPal(X)) -> isPal(X)
activate(n__a()) -> a()
activate(n__e()) -> e()
activate(n__i()) -> i()
activate(n__o()) -> o()
activate(n__u()) -> u()
activate(X) -> X
Matrix Interpretation Processor:
dimension: 2
max_matrix:
[1 3]
[0 1]
interpretation:
[2]
[u] = [0],
[0]
[o] = [0],
[0]
[i] = [0],
[0]
[e] = [0],
[0]
[a] = [0],
[2]
[n__u] = [0],
[0]
[n__o] = [0],
[0]
[n__i] = [0],
[0]
[n__e] = [0],
[0]
[n__a] = [0],
[1 3]
[isPal](x0) = [0 0]x0,
[1 3]
[n__isPal](x0) = [0 0]x0,
[1 3]
[isNePal](x0) = [0 0]x0,
[n__isNeList](x0) = x0,
[1 0]
[isQid](x0) = [0 0]x0,
[0]
[n__isList](x0) = x0 + [1],
[1 1] [0]
[n____](x0, x1) = [0 1]x0 + x1 + [2],
[2]
[n__nil] = [2],
[isNeList](x0) = x0,
[0]
[isList](x0) = x0 + [1],
[activate](x0) = x0,
[1 0]
[and](x0, x1) = [0 0]x0 + x1,
[0]
[tt] = [0],
[2]
[nil] = [2],
[1 1] [0]
[__](x0, x1) = [0 1]x0 + x1 + [2]
orientation:
[1 2] [1 1] [2] [1 1] [1 1] [0]
__(__(X,Y),Z) = [0 1]X + [0 1]Y + Z + [4] >= [0 1]X + [0 1]Y + Z + [4] = __(X,__(Y,Z))
[2] [2]
nil() = [2] >= [2] = n__nil()
[1 1] [0] [1 1] [0]
__(X1,X2) = [0 1]X1 + X2 + [2] >= [0 1]X1 + X2 + [2] = n____(X1,X2)
[1 1] [0] [1 0] [0]
isList(n____(V1,V2)) = [0 1]V1 + V2 + [3] >= [0 0]V1 + V2 + [1] = and(isList(activate(V1)),n__isList(activate(V2)))
[1 1] [0] [1 0] [0]
isNeList(n____(V1,V2)) = [0 1]V1 + V2 + [2] >= [0 0]V1 + V2 + [1] = and(isNeList(activate(V1)),n__isList(activate(V2)))
[0] [0]
isList(X) = X + [1] >= X + [1] = n__isList(X)
[0] [0]
e() = [0] >= [0] = n__e()
[0]
isList(V) = V + [1] >= V = isNeList(activate(V))
[0] [0]
o() = [0] >= [0] = n__o()
[1 0]
isNeList(V) = V >= [0 0]V = isQid(activate(V))
[1 1] [0] [1 0]
isNeList(n____(V1,V2)) = [0 1]V1 + V2 + [2] >= [0 0]V1 + V2 = and(isList(activate(V1)),n__isNeList(activate(V2)))
[1 3] [1 3]
isPal(V) = [0 0]V >= [0 0]V = isNePal(activate(V))
[1 3] [1 3]
isPal(X) = [0 0]X >= [0 0]X = n__isPal(X)
[0] [0]
a() = [0] >= [0] = n__a()
and(tt(),X) = X >= X = activate(X)
[1 3] [1 0]
isNePal(V) = [0 0]V >= [0 0]V = isQid(activate(V))
isNeList(X) = X >= X = n__isNeList(X)
[0] [0]
i() = [0] >= [0] = n__i()
[2] [2]
u() = [0] >= [0] = n__u()
[1 1] [2]
__(X,nil()) = [0 1]X + [4] >= X = X
[4]
__(nil(),X) = X + [4] >= X = X
[2] [0]
isList(n__nil()) = [3] >= [0] = tt()
[2 7] [1 4] [12] [1 0] [1 3]
isNePal(n____(I,__(P,I))) = [0 0]I + [0 0]P + [0 ] >= [0 0]I + [0 0]P = and(isQid(activate(I)),n__isPal(activate(P)))
[8] [0]
isPal(n__nil()) = [0] >= [0] = tt()
[0] [0]
isQid(n__a()) = [0] >= [0] = tt()
[0] [0]
isQid(n__e()) = [0] >= [0] = tt()
[0] [0]
isQid(n__i()) = [0] >= [0] = tt()
[0] [0]
isQid(n__o()) = [0] >= [0] = tt()
[2] [0]
isQid(n__u()) = [0] >= [0] = tt()
[2] [2]
activate(n__nil()) = [2] >= [2] = nil()
[1 1] [0] [1 1] [0]
activate(n____(X1,X2)) = [0 1]X1 + X2 + [2] >= [0 1]X1 + X2 + [2] = __(X1,X2)
[0] [0]
activate(n__isList(X)) = X + [1] >= X + [1] = isList(X)
activate(n__isNeList(X)) = X >= X = isNeList(X)
[1 3] [1 3]
activate(n__isPal(X)) = [0 0]X >= [0 0]X = isPal(X)
[0] [0]
activate(n__a()) = [0] >= [0] = a()
[0] [0]
activate(n__e()) = [0] >= [0] = e()
[0] [0]
activate(n__i()) = [0] >= [0] = i()
[0] [0]
activate(n__o()) = [0] >= [0] = o()
[2] [2]
activate(n__u()) = [0] >= [0] = u()
activate(X) = X >= X = X
problem:
strict:
weak:
__(__(X,Y),Z) -> __(X,__(Y,Z))
nil() -> n__nil()
__(X1,X2) -> n____(X1,X2)
isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2)))
isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2)))
isList(X) -> n__isList(X)
e() -> n__e()
isList(V) -> isNeList(activate(V))
o() -> n__o()
isNeList(V) -> isQid(activate(V))
isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2)))
isPal(V) -> isNePal(activate(V))
isPal(X) -> n__isPal(X)
a() -> n__a()
and(tt(),X) -> activate(X)
isNePal(V) -> isQid(activate(V))
isNeList(X) -> n__isNeList(X)
i() -> n__i()
u() -> n__u()
__(X,nil()) -> X
__(nil(),X) -> X
isList(n__nil()) -> tt()
isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P)))
isPal(n__nil()) -> tt()
isQid(n__a()) -> tt()
isQid(n__e()) -> tt()
isQid(n__i()) -> tt()
isQid(n__o()) -> tt()
isQid(n__u()) -> tt()
activate(n__nil()) -> nil()
activate(n____(X1,X2)) -> __(X1,X2)
activate(n__isList(X)) -> isList(X)
activate(n__isNeList(X)) -> isNeList(X)
activate(n__isPal(X)) -> isPal(X)
activate(n__a()) -> a()
activate(n__e()) -> e()
activate(n__i()) -> i()
activate(n__o()) -> o()
activate(n__u()) -> u()
activate(X) -> X
Qed