/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(X,nil())) -> mark(X) active(__(nil(),X)) -> mark(X) active(and(tt(),X)) -> mark(X) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isPal(nil())) -> mark(tt()) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(o())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Proof: Matrix Interpretation Processor: dim=1 interpretation: [u] = 2, [o] = 4, [i] = 2, [e] = 2, [a] = 2, [isPal](x0) = 4x0, [isNePal](x0) = 2x0, [isQid](x0) = x0, [isNeList](x0) = x0, [isList](x0) = x0, [and](x0, x1) = 4x0 + x1, [tt] = 2, [nil] = 2, [mark](x0) = x0, [active](x0) = x0, [__](x0, x1) = 4x0 + x1 orientation: active(__(__(X,Y),Z)) = 16X + 4Y + Z >= 4X + 4Y + Z = mark(__(X,__(Y,Z))) active(__(X,nil())) = 4X + 2 >= X = mark(X) active(__(nil(),X)) = X + 8 >= X = mark(X) active(and(tt(),X)) = X + 8 >= X = mark(X) active(isList(V)) = V >= V = mark(isNeList(V)) active(isList(nil())) = 2 >= 2 = mark(tt()) active(isList(__(V1,V2))) = 4V1 + V2 >= 4V1 + V2 = mark(and(isList(V1),isList(V2))) active(isNeList(V)) = V >= V = mark(isQid(V)) active(isNeList(__(V1,V2))) = 4V1 + V2 >= 4V1 + V2 = mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) = 4V1 + V2 >= 4V1 + V2 = mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) = 2V >= V = mark(isQid(V)) active(isNePal(__(I,__(P,I)))) = 10I + 8P >= 4I + 4P = mark(and(isQid(I),isPal(P))) active(isPal(V)) = 4V >= 2V = mark(isNePal(V)) active(isPal(nil())) = 8 >= 2 = mark(tt()) active(isQid(a())) = 2 >= 2 = mark(tt()) active(isQid(e())) = 2 >= 2 = mark(tt()) active(isQid(i())) = 2 >= 2 = mark(tt()) active(isQid(o())) = 4 >= 2 = mark(tt()) active(isQid(u())) = 2 >= 2 = mark(tt()) mark(__(X1,X2)) = 4X1 + X2 >= 4X1 + X2 = active(__(mark(X1),mark(X2))) mark(nil()) = 2 >= 2 = active(nil()) mark(and(X1,X2)) = 4X1 + X2 >= 4X1 + X2 = active(and(mark(X1),X2)) mark(tt()) = 2 >= 2 = active(tt()) mark(isList(X)) = X >= X = active(isList(X)) mark(isNeList(X)) = X >= X = active(isNeList(X)) mark(isQid(X)) = X >= X = active(isQid(X)) mark(isNePal(X)) = 2X >= 2X = active(isNePal(X)) mark(isPal(X)) = 4X >= 4X = active(isPal(X)) mark(a()) = 2 >= 2 = active(a()) mark(e()) = 2 >= 2 = active(e()) mark(i()) = 2 >= 2 = active(i()) mark(o()) = 4 >= 4 = active(o()) mark(u()) = 2 >= 2 = active(u()) __(mark(X1),X2) = 4X1 + X2 >= 4X1 + X2 = __(X1,X2) __(X1,mark(X2)) = 4X1 + X2 >= 4X1 + X2 = __(X1,X2) __(active(X1),X2) = 4X1 + X2 >= 4X1 + X2 = __(X1,X2) __(X1,active(X2)) = 4X1 + X2 >= 4X1 + X2 = __(X1,X2) and(mark(X1),X2) = 4X1 + X2 >= 4X1 + X2 = and(X1,X2) and(X1,mark(X2)) = 4X1 + X2 >= 4X1 + X2 = and(X1,X2) and(active(X1),X2) = 4X1 + X2 >= 4X1 + X2 = and(X1,X2) and(X1,active(X2)) = 4X1 + X2 >= 4X1 + X2 = and(X1,X2) isList(mark(X)) = X >= X = isList(X) isList(active(X)) = X >= X = isList(X) isNeList(mark(X)) = X >= X = isNeList(X) isNeList(active(X)) = X >= X = isNeList(X) isQid(mark(X)) = X >= X = isQid(X) isQid(active(X)) = X >= X = isQid(X) isNePal(mark(X)) = 2X >= 2X = isNePal(X) isNePal(active(X)) = 2X >= 2X = isNePal(X) isPal(mark(X)) = 4X >= 4X = isPal(X) isPal(active(X)) = 4X >= 4X = isPal(X) problem: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) active(isNeList(V)) -> mark(isQid(V)) active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) -> mark(isQid(V)) active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) active(isPal(V)) -> mark(isNePal(V)) active(isQid(a())) -> mark(tt()) active(isQid(e())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Matrix Interpretation Processor: dim=1 interpretation: [u] = 3, [o] = 4, [i] = 3, [e] = 4, [a] = 3, [isPal](x0) = 6x0, [isNePal](x0) = 4x0, [isQid](x0) = x0, [isNeList](x0) = x0, [isList](x0) = x0, [and](x0, x1) = 2x0 + x1, [tt] = 3, [nil] = 3, [mark](x0) = x0, [active](x0) = x0, [__](x0, x1) = 4x0 + x1 + 1 orientation: active(__(__(X,Y),Z)) = 16X + 4Y + Z + 5 >= 4X + 4Y + Z + 2 = mark(__(X,__(Y,Z))) active(isList(V)) = V >= V = mark(isNeList(V)) active(isList(nil())) = 3 >= 3 = mark(tt()) active(isList(__(V1,V2))) = 4V1 + V2 + 1 >= 2V1 + V2 = mark(and(isList(V1),isList(V2))) active(isNeList(V)) = V >= V = mark(isQid(V)) active(isNeList(__(V1,V2))) = 4V1 + V2 + 1 >= 2V1 + V2 = mark(and(isList(V1),isNeList(V2))) active(isNeList(__(V1,V2))) = 4V1 + V2 + 1 >= 2V1 + V2 = mark(and(isNeList(V1),isList(V2))) active(isNePal(V)) = 4V >= V = mark(isQid(V)) active(isNePal(__(I,__(P,I)))) = 20I + 16P + 8 >= 2I + 6P = mark(and(isQid(I),isPal(P))) active(isPal(V)) = 6V >= 4V = mark(isNePal(V)) active(isQid(a())) = 3 >= 3 = mark(tt()) active(isQid(e())) = 4 >= 3 = mark(tt()) active(isQid(i())) = 3 >= 3 = mark(tt()) active(isQid(u())) = 3 >= 3 = mark(tt()) mark(__(X1,X2)) = 4X1 + X2 + 1 >= 4X1 + X2 + 1 = active(__(mark(X1),mark(X2))) mark(nil()) = 3 >= 3 = active(nil()) mark(and(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = active(and(mark(X1),X2)) mark(tt()) = 3 >= 3 = active(tt()) mark(isList(X)) = X >= X = active(isList(X)) mark(isNeList(X)) = X >= X = active(isNeList(X)) mark(isQid(X)) = X >= X = active(isQid(X)) mark(isNePal(X)) = 4X >= 4X = active(isNePal(X)) mark(isPal(X)) = 6X >= 6X = active(isPal(X)) mark(a()) = 3 >= 3 = active(a()) mark(e()) = 4 >= 4 = active(e()) mark(i()) = 3 >= 3 = active(i()) mark(o()) = 4 >= 4 = active(o()) mark(u()) = 3 >= 3 = active(u()) __(mark(X1),X2) = 4X1 + X2 + 1 >= 4X1 + X2 + 1 = __(X1,X2) __(X1,mark(X2)) = 4X1 + X2 + 1 >= 4X1 + X2 + 1 = __(X1,X2) __(active(X1),X2) = 4X1 + X2 + 1 >= 4X1 + X2 + 1 = __(X1,X2) __(X1,active(X2)) = 4X1 + X2 + 1 >= 4X1 + X2 + 1 = __(X1,X2) and(mark(X1),X2) = 2X1 + X2 >= 2X1 + X2 = and(X1,X2) and(X1,mark(X2)) = 2X1 + X2 >= 2X1 + X2 = and(X1,X2) and(active(X1),X2) = 2X1 + X2 >= 2X1 + X2 = and(X1,X2) and(X1,active(X2)) = 2X1 + X2 >= 2X1 + X2 = and(X1,X2) isList(mark(X)) = X >= X = isList(X) isList(active(X)) = X >= X = isList(X) isNeList(mark(X)) = X >= X = isNeList(X) isNeList(active(X)) = X >= X = isNeList(X) isQid(mark(X)) = X >= X = isQid(X) isQid(active(X)) = X >= X = isQid(X) isNePal(mark(X)) = 4X >= 4X = isNePal(X) isNePal(active(X)) = 4X >= 4X = isNePal(X) isPal(mark(X)) = 6X >= 6X = isPal(X) isPal(active(X)) = 6X >= 6X = isPal(X) problem: active(isList(V)) -> mark(isNeList(V)) active(isList(nil())) -> mark(tt()) active(isNeList(V)) -> mark(isQid(V)) active(isNePal(V)) -> mark(isQid(V)) active(isPal(V)) -> mark(isNePal(V)) active(isQid(a())) -> mark(tt()) active(isQid(i())) -> mark(tt()) active(isQid(u())) -> mark(tt()) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Matrix Interpretation Processor: dim=1 interpretation: [u] = 4, [o] = 2, [i] = 0, [e] = 4, [a] = 1, [isPal](x0) = 2x0 + 4, [isNePal](x0) = 2x0 + 3, [isQid](x0) = 2x0 + 2, [isNeList](x0) = 3x0 + 4, [isList](x0) = 3x0 + 4, [and](x0, x1) = x0 + 2x1 + 4, [tt] = 0, [nil] = 1, [mark](x0) = x0, [active](x0) = x0, [__](x0, x1) = 2x0 + x1 + 4 orientation: active(isList(V)) = 3V + 4 >= 3V + 4 = mark(isNeList(V)) active(isList(nil())) = 7 >= 0 = mark(tt()) active(isNeList(V)) = 3V + 4 >= 2V + 2 = mark(isQid(V)) active(isNePal(V)) = 2V + 3 >= 2V + 2 = mark(isQid(V)) active(isPal(V)) = 2V + 4 >= 2V + 3 = mark(isNePal(V)) active(isQid(a())) = 4 >= 0 = mark(tt()) active(isQid(i())) = 2 >= 0 = mark(tt()) active(isQid(u())) = 10 >= 0 = mark(tt()) mark(__(X1,X2)) = 2X1 + X2 + 4 >= 2X1 + X2 + 4 = active(__(mark(X1),mark(X2))) mark(nil()) = 1 >= 1 = active(nil()) mark(and(X1,X2)) = X1 + 2X2 + 4 >= X1 + 2X2 + 4 = active(and(mark(X1),X2)) mark(tt()) = 0 >= 0 = active(tt()) mark(isList(X)) = 3X + 4 >= 3X + 4 = active(isList(X)) mark(isNeList(X)) = 3X + 4 >= 3X + 4 = active(isNeList(X)) mark(isQid(X)) = 2X + 2 >= 2X + 2 = active(isQid(X)) mark(isNePal(X)) = 2X + 3 >= 2X + 3 = active(isNePal(X)) mark(isPal(X)) = 2X + 4 >= 2X + 4 = active(isPal(X)) mark(a()) = 1 >= 1 = active(a()) mark(e()) = 4 >= 4 = active(e()) mark(i()) = 0 >= 0 = active(i()) mark(o()) = 2 >= 2 = active(o()) mark(u()) = 4 >= 4 = active(u()) __(mark(X1),X2) = 2X1 + X2 + 4 >= 2X1 + X2 + 4 = __(X1,X2) __(X1,mark(X2)) = 2X1 + X2 + 4 >= 2X1 + X2 + 4 = __(X1,X2) __(active(X1),X2) = 2X1 + X2 + 4 >= 2X1 + X2 + 4 = __(X1,X2) __(X1,active(X2)) = 2X1 + X2 + 4 >= 2X1 + X2 + 4 = __(X1,X2) and(mark(X1),X2) = X1 + 2X2 + 4 >= X1 + 2X2 + 4 = and(X1,X2) and(X1,mark(X2)) = X1 + 2X2 + 4 >= X1 + 2X2 + 4 = and(X1,X2) and(active(X1),X2) = X1 + 2X2 + 4 >= X1 + 2X2 + 4 = and(X1,X2) and(X1,active(X2)) = X1 + 2X2 + 4 >= X1 + 2X2 + 4 = and(X1,X2) isList(mark(X)) = 3X + 4 >= 3X + 4 = isList(X) isList(active(X)) = 3X + 4 >= 3X + 4 = isList(X) isNeList(mark(X)) = 3X + 4 >= 3X + 4 = isNeList(X) isNeList(active(X)) = 3X + 4 >= 3X + 4 = isNeList(X) isQid(mark(X)) = 2X + 2 >= 2X + 2 = isQid(X) isQid(active(X)) = 2X + 2 >= 2X + 2 = isQid(X) isNePal(mark(X)) = 2X + 3 >= 2X + 3 = isNePal(X) isNePal(active(X)) = 2X + 3 >= 2X + 3 = isNePal(X) isPal(mark(X)) = 2X + 4 >= 2X + 4 = isPal(X) isPal(active(X)) = 2X + 4 >= 2X + 4 = isPal(X) problem: active(isList(V)) -> mark(isNeList(V)) mark(__(X1,X2)) -> active(__(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isQid(X)) -> active(isQid(X)) mark(isNePal(X)) -> active(isNePal(X)) mark(isPal(X)) -> active(isPal(X)) mark(a()) -> active(a()) mark(e()) -> active(e()) mark(i()) -> active(i()) mark(o()) -> active(o()) mark(u()) -> active(u()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Matrix Interpretation Processor: dim=1 interpretation: [u] = 1, [o] = 0, [i] = 6, [e] = 0, [a] = 5, [isPal](x0) = 2x0, [isNePal](x0) = x0 + 6, [isQid](x0) = 3x0 + 2, [isNeList](x0) = 2x0, [isList](x0) = 6x0, [and](x0, x1) = 2x0 + 4x1 + 2, [tt] = 0, [nil] = 2, [mark](x0) = 3x0, [active](x0) = x0, [__](x0, x1) = x0 + x1 + 6 orientation: active(isList(V)) = 6V >= 6V = mark(isNeList(V)) mark(__(X1,X2)) = 3X1 + 3X2 + 18 >= 3X1 + 3X2 + 6 = active(__(mark(X1),mark(X2))) mark(nil()) = 6 >= 2 = active(nil()) mark(and(X1,X2)) = 6X1 + 12X2 + 6 >= 6X1 + 4X2 + 2 = active(and(mark(X1),X2)) mark(tt()) = 0 >= 0 = active(tt()) mark(isList(X)) = 18X >= 6X = active(isList(X)) mark(isNeList(X)) = 6X >= 2X = active(isNeList(X)) mark(isQid(X)) = 9X + 6 >= 3X + 2 = active(isQid(X)) mark(isNePal(X)) = 3X + 18 >= X + 6 = active(isNePal(X)) mark(isPal(X)) = 6X >= 2X = active(isPal(X)) mark(a()) = 15 >= 5 = active(a()) mark(e()) = 0 >= 0 = active(e()) mark(i()) = 18 >= 6 = active(i()) mark(o()) = 0 >= 0 = active(o()) mark(u()) = 3 >= 1 = active(u()) __(mark(X1),X2) = 3X1 + X2 + 6 >= X1 + X2 + 6 = __(X1,X2) __(X1,mark(X2)) = X1 + 3X2 + 6 >= X1 + X2 + 6 = __(X1,X2) __(active(X1),X2) = X1 + X2 + 6 >= X1 + X2 + 6 = __(X1,X2) __(X1,active(X2)) = X1 + X2 + 6 >= X1 + X2 + 6 = __(X1,X2) and(mark(X1),X2) = 6X1 + 4X2 + 2 >= 2X1 + 4X2 + 2 = and(X1,X2) and(X1,mark(X2)) = 2X1 + 12X2 + 2 >= 2X1 + 4X2 + 2 = and(X1,X2) and(active(X1),X2) = 2X1 + 4X2 + 2 >= 2X1 + 4X2 + 2 = and(X1,X2) and(X1,active(X2)) = 2X1 + 4X2 + 2 >= 2X1 + 4X2 + 2 = and(X1,X2) isList(mark(X)) = 18X >= 6X = isList(X) isList(active(X)) = 6X >= 6X = isList(X) isNeList(mark(X)) = 6X >= 2X = isNeList(X) isNeList(active(X)) = 2X >= 2X = isNeList(X) isQid(mark(X)) = 9X + 2 >= 3X + 2 = isQid(X) isQid(active(X)) = 3X + 2 >= 3X + 2 = isQid(X) isNePal(mark(X)) = 3X + 6 >= X + 6 = isNePal(X) isNePal(active(X)) = X + 6 >= X + 6 = isNePal(X) isPal(mark(X)) = 6X >= 2X = isPal(X) isPal(active(X)) = 2X >= 2X = isPal(X) problem: active(isList(V)) -> mark(isNeList(V)) mark(tt()) -> active(tt()) mark(isList(X)) -> active(isList(X)) mark(isNeList(X)) -> active(isNeList(X)) mark(isPal(X)) -> active(isPal(X)) mark(e()) -> active(e()) mark(o()) -> active(o()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) __(active(X1),X2) -> __(X1,X2) __(X1,active(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isList(active(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isNeList(active(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isQid(active(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isNePal(active(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) isPal(active(X)) -> isPal(X) Matrix Interpretation Processor: dim=1 interpretation: [o] = 2, [e] = 6, [isPal](x0) = x0 + 4, [isNePal](x0) = 2x0, [isQid](x0) = 2x0 + 4, [isNeList](x0) = 3x0 + 2, [isList](x0) = 5x0 + 4, [and](x0, x1) = 2x0 + x1 + 4, [tt] = 1, [mark](x0) = 5x0, [active](x0) = 3x0 + 2, [__](x0, x1) = 2x0 + 4x1 + 4 orientation: active(isList(V)) = 15V + 14 >= 15V + 10 = mark(isNeList(V)) mark(tt()) = 5 >= 5 = active(tt()) mark(isList(X)) = 25X + 20 >= 15X + 14 = active(isList(X)) mark(isNeList(X)) = 15X + 10 >= 9X + 8 = active(isNeList(X)) mark(isPal(X)) = 5X + 20 >= 3X + 14 = active(isPal(X)) mark(e()) = 30 >= 20 = active(e()) mark(o()) = 10 >= 8 = active(o()) __(mark(X1),X2) = 10X1 + 4X2 + 4 >= 2X1 + 4X2 + 4 = __(X1,X2) __(X1,mark(X2)) = 2X1 + 20X2 + 4 >= 2X1 + 4X2 + 4 = __(X1,X2) __(active(X1),X2) = 6X1 + 4X2 + 8 >= 2X1 + 4X2 + 4 = __(X1,X2) __(X1,active(X2)) = 2X1 + 12X2 + 12 >= 2X1 + 4X2 + 4 = __(X1,X2) and(mark(X1),X2) = 10X1 + X2 + 4 >= 2X1 + X2 + 4 = and(X1,X2) and(X1,mark(X2)) = 2X1 + 5X2 + 4 >= 2X1 + X2 + 4 = and(X1,X2) and(active(X1),X2) = 6X1 + X2 + 8 >= 2X1 + X2 + 4 = and(X1,X2) and(X1,active(X2)) = 2X1 + 3X2 + 6 >= 2X1 + X2 + 4 = and(X1,X2) isList(mark(X)) = 25X + 4 >= 5X + 4 = isList(X) isList(active(X)) = 15X + 14 >= 5X + 4 = isList(X) isNeList(mark(X)) = 15X + 2 >= 3X + 2 = isNeList(X) isNeList(active(X)) = 9X + 8 >= 3X + 2 = isNeList(X) isQid(mark(X)) = 10X + 4 >= 2X + 4 = isQid(X) isQid(active(X)) = 6X + 8 >= 2X + 4 = isQid(X) isNePal(mark(X)) = 10X >= 2X = isNePal(X) isNePal(active(X)) = 6X + 4 >= 2X = isNePal(X) isPal(mark(X)) = 5X + 4 >= X + 4 = isPal(X) isPal(active(X)) = 3X + 6 >= X + 4 = isPal(X) problem: mark(tt()) -> active(tt()) __(mark(X1),X2) -> __(X1,X2) __(X1,mark(X2)) -> __(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isList(mark(X)) -> isList(X) isNeList(mark(X)) -> isNeList(X) isQid(mark(X)) -> isQid(X) isNePal(mark(X)) -> isNePal(X) isPal(mark(X)) -> isPal(X) Matrix Interpretation Processor: dim=3 interpretation: [1 1 0] [isPal](x0) = [0 0 0]x0 [0 0 1] , [1 1 0] [isNePal](x0) = [0 0 0]x0 [0 0 0] , [1 1 0] [isQid](x0) = [0 0 0]x0 [0 0 0] , [1 1 0] [isNeList](x0) = [0 0 0]x0 [0 0 0] , [1 1 0] [isList](x0) = [0 0 0]x0 [0 0 0] , [1 1 0] [1 1 0] [and](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [0] [tt] = [1] [1], [1 1 0] [0] [mark](x0) = [0 0 0]x0 + [1] [0 0 1] [0], [1 0 0] [0] [active](x0) = [0 0 0]x0 + [1] [0 0 1] [0], [1 1 0] [1 1 0] [__](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] orientation: [1] [0] mark(tt()) = [1] >= [1] = active(tt()) [1] [1] [1 1 0] [1 1 0] [1] [1 1 0] [1 1 0] __(mark(X1),X2) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 = __(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [1 1 0] [1 1 0] [1] [1 1 0] [1 1 0] __(X1,mark(X2)) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 = __(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [1 1 0] [1 1 0] [1] [1 1 0] [1 1 0] and(mark(X1),X2) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 = and(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [1 1 0] [1 1 0] [1] [1 1 0] [1 1 0] and(X1,mark(X2)) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 = and(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [1 1 0] [1] [1 1 0] isList(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X = isList(X) [0 0 0] [0] [0 0 0] [1 1 0] [1] [1 1 0] isNeList(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X = isNeList(X) [0 0 0] [0] [0 0 0] [1 1 0] [1] [1 1 0] isQid(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X = isQid(X) [0 0 0] [0] [0 0 0] [1 1 0] [1] [1 1 0] isNePal(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X = isNePal(X) [0 0 0] [0] [0 0 0] [1 1 0] [1] [1 1 0] isPal(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X = isPal(X) [0 0 1] [0] [0 0 1] problem: Qed