/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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:
   [tt] = 1,
   
   [u] = 6,
   
   [isQid](x0) = x0,
   
   [active](x0) = x0,
   
   [nil] = 1,
   
   [and](x0, x1) = x0 + x1,
   
   [isPal](x0) = 3x0,
   
   [__](x0, x1) = 2x0 + x1 + 4,
   
   [isNeList](x0) = 2x0,
   
   [o] = 2,
   
   [e] = 1,
   
   [a] = 4,
   
   [isNePal](x0) = 2x0,
   
   [i] = 6,
   
   [isList](x0) = 2x0 + 2,
   
   [mark](x0) = x0
  orientation:
   active(__(__(X,Y),Z)) = 4X + 2Y + Z + 12 >= 2X + 2Y + Z + 8 = mark(__(X,__(Y,Z)))
   
   active(__(X,nil())) = 2X + 5 >= X = mark(X)
   
   active(__(nil(),X)) = X + 6 >= X = mark(X)
   
   active(and(tt(),X)) = X + 1 >= X = mark(X)
   
   active(isList(V)) = 2V + 2 >= 2V = mark(isNeList(V))
   
   active(isList(nil())) = 4 >= 1 = mark(tt())
   
   active(isList(__(V1,V2))) = 4V1 + 2V2 + 10 >= 2V1 + 2V2 + 4 = mark(and(isList(V1),isList(V2)))
   
   active(isNeList(V)) = 2V >= V = mark(isQid(V))
   
   active(isNeList(__(V1,V2))) = 4V1 + 2V2 + 8 >= 2V1 + 2V2 + 2 = mark(and(isList(V1),isNeList(V2)))
   
   active(isNeList(__(V1,V2))) = 4V1 + 2V2 + 8 >= 2V1 + 2V2 + 2 = mark(and(isNeList(V1),isList(V2)))
   
   active(isNePal(V)) = 2V >= V = mark(isQid(V))
   
   active(isNePal(__(I,__(P,I)))) = 6I + 4P + 16 >= I + 3P = mark(and(isQid(I),isPal(P)))
   
   active(isPal(V)) = 3V >= 2V = mark(isNePal(V))
   
   active(isPal(nil())) = 3 >= 1 = mark(tt())
   
   active(isQid(a())) = 4 >= 1 = mark(tt())
   
   active(isQid(e())) = 1 >= 1 = mark(tt())
   
   active(isQid(i())) = 6 >= 1 = mark(tt())
   
   active(isQid(o())) = 2 >= 1 = mark(tt())
   
   active(isQid(u())) = 6 >= 1 = 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 + X2 >= X1 + X2 = active(and(mark(X1),X2))
   
   mark(tt()) = 1 >= 1 = active(tt())
   
   mark(isList(X)) = 2X + 2 >= 2X + 2 = active(isList(X))
   
   mark(isNeList(X)) = 2X >= 2X = active(isNeList(X))
   
   mark(isQid(X)) = X >= X = active(isQid(X))
   
   mark(isNePal(X)) = 2X >= 2X = active(isNePal(X))
   
   mark(isPal(X)) = 3X >= 3X = active(isPal(X))
   
   mark(a()) = 4 >= 4 = active(a())
   
   mark(e()) = 1 >= 1 = active(e())
   
   mark(i()) = 6 >= 6 = active(i())
   
   mark(o()) = 2 >= 2 = active(o())
   
   mark(u()) = 6 >= 6 = 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 + X2 >= X1 + X2 = and(X1,X2)
   
   and(X1,mark(X2)) = X1 + X2 >= X1 + X2 = and(X1,X2)
   
   and(active(X1),X2) = X1 + X2 >= X1 + X2 = and(X1,X2)
   
   and(X1,active(X2)) = X1 + X2 >= X1 + X2 = and(X1,X2)
   
   isList(mark(X)) = 2X + 2 >= 2X + 2 = isList(X)
   
   isList(active(X)) = 2X + 2 >= 2X + 2 = isList(X)
   
   isNeList(mark(X)) = 2X >= 2X = isNeList(X)
   
   isNeList(active(X)) = 2X >= 2X = 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)) = 3X >= 3X = isPal(X)
   
   isPal(active(X)) = 3X >= 3X = isPal(X)
  problem:
   active(isNeList(V)) -> mark(isQid(V))
   active(isNePal(V)) -> mark(isQid(V))
   active(isPal(V)) -> mark(isNePal(V))
   active(isQid(e())) -> 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:
    [tt] = 0,
    
    [u] = 0,
    
    [isQid](x0) = x0,
    
    [active](x0) = x0,
    
    [nil] = 2,
    
    [and](x0, x1) = 2x0 + x1,
    
    [isPal](x0) = x0 + 3,
    
    [__](x0, x1) = 2x0 + 4x1 + 6,
    
    [isNeList](x0) = 2x0 + 4,
    
    [o] = 4,
    
    [e] = 0,
    
    [a] = 0,
    
    [isNePal](x0) = x0,
    
    [i] = 0,
    
    [isList](x0) = x0 + 1,
    
    [mark](x0) = x0
   orientation:
    active(isNeList(V)) = 2V + 4 >= V = mark(isQid(V))
    
    active(isNePal(V)) = V >= V = mark(isQid(V))
    
    active(isPal(V)) = V + 3 >= V = mark(isNePal(V))
    
    active(isQid(e())) = 0 >= 0 = mark(tt())
    
    mark(__(X1,X2)) = 2X1 + 4X2 + 6 >= 2X1 + 4X2 + 6 = active(__(mark(X1),mark(X2)))
    
    mark(nil()) = 2 >= 2 = active(nil())
    
    mark(and(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = active(and(mark(X1),X2))
    
    mark(tt()) = 0 >= 0 = active(tt())
    
    mark(isList(X)) = X + 1 >= X + 1 = active(isList(X))
    
    mark(isNeList(X)) = 2X + 4 >= 2X + 4 = active(isNeList(X))
    
    mark(isQid(X)) = X >= X = active(isQid(X))
    
    mark(isNePal(X)) = X >= X = active(isNePal(X))
    
    mark(isPal(X)) = X + 3 >= X + 3 = active(isPal(X))
    
    mark(a()) = 0 >= 0 = active(a())
    
    mark(e()) = 0 >= 0 = active(e())
    
    mark(i()) = 0 >= 0 = active(i())
    
    mark(o()) = 4 >= 4 = active(o())
    
    mark(u()) = 0 >= 0 = active(u())
    
    __(mark(X1),X2) = 2X1 + 4X2 + 6 >= 2X1 + 4X2 + 6 = __(X1,X2)
    
    __(X1,mark(X2)) = 2X1 + 4X2 + 6 >= 2X1 + 4X2 + 6 = __(X1,X2)
    
    __(active(X1),X2) = 2X1 + 4X2 + 6 >= 2X1 + 4X2 + 6 = __(X1,X2)
    
    __(X1,active(X2)) = 2X1 + 4X2 + 6 >= 2X1 + 4X2 + 6 = __(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 + 1 >= X + 1 = isList(X)
    
    isList(active(X)) = X + 1 >= X + 1 = isList(X)
    
    isNeList(mark(X)) = 2X + 4 >= 2X + 4 = isNeList(X)
    
    isNeList(active(X)) = 2X + 4 >= 2X + 4 = isNeList(X)
    
    isQid(mark(X)) = X >= X = isQid(X)
    
    isQid(active(X)) = X >= X = isQid(X)
    
    isNePal(mark(X)) = X >= X = isNePal(X)
    
    isNePal(active(X)) = X >= X = isNePal(X)
    
    isPal(mark(X)) = X + 3 >= X + 3 = isPal(X)
    
    isPal(active(X)) = X + 3 >= X + 3 = isPal(X)
   problem:
    active(isNePal(V)) -> mark(isQid(V))
    active(isQid(e())) -> 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:
     [tt] = 1,
     
     [u] = 1,
     
     [isQid](x0) = x0 + 1,
     
     [active](x0) = x0 + 3,
     
     [nil] = 4,
     
     [and](x0, x1) = x0 + x1 + 1,
     
     [isPal](x0) = 4x0 + 2,
     
     [__](x0, x1) = x0 + 3x1 + 1,
     
     [isNeList](x0) = x0 + 4,
     
     [o] = 4,
     
     [e] = 2,
     
     [a] = 1,
     
     [isNePal](x0) = 5x0 + 4,
     
     [i] = 4,
     
     [isList](x0) = 4x0 + 1,
     
     [mark](x0) = 4x0
    orientation:
     active(isNePal(V)) = 5V + 7 >= 4V + 4 = mark(isQid(V))
     
     active(isQid(e())) = 6 >= 4 = mark(tt())
     
     mark(__(X1,X2)) = 4X1 + 12X2 + 4 >= 4X1 + 12X2 + 4 = active(__(mark(X1),mark(X2)))
     
     mark(nil()) = 16 >= 7 = active(nil())
     
     mark(and(X1,X2)) = 4X1 + 4X2 + 4 >= 4X1 + X2 + 4 = active(and(mark(X1),X2))
     
     mark(tt()) = 4 >= 4 = active(tt())
     
     mark(isList(X)) = 16X + 4 >= 4X + 4 = active(isList(X))
     
     mark(isNeList(X)) = 4X + 16 >= X + 7 = active(isNeList(X))
     
     mark(isQid(X)) = 4X + 4 >= X + 4 = active(isQid(X))
     
     mark(isNePal(X)) = 20X + 16 >= 5X + 7 = active(isNePal(X))
     
     mark(isPal(X)) = 16X + 8 >= 4X + 5 = active(isPal(X))
     
     mark(a()) = 4 >= 4 = active(a())
     
     mark(e()) = 8 >= 5 = active(e())
     
     mark(i()) = 16 >= 7 = active(i())
     
     mark(o()) = 16 >= 7 = active(o())
     
     mark(u()) = 4 >= 4 = active(u())
     
     __(mark(X1),X2) = 4X1 + 3X2 + 1 >= X1 + 3X2 + 1 = __(X1,X2)
     
     __(X1,mark(X2)) = X1 + 12X2 + 1 >= X1 + 3X2 + 1 = __(X1,X2)
     
     __(active(X1),X2) = X1 + 3X2 + 4 >= X1 + 3X2 + 1 = __(X1,X2)
     
     __(X1,active(X2)) = X1 + 3X2 + 10 >= X1 + 3X2 + 1 = __(X1,X2)
     
     and(mark(X1),X2) = 4X1 + X2 + 1 >= X1 + X2 + 1 = and(X1,X2)
     
     and(X1,mark(X2)) = X1 + 4X2 + 1 >= X1 + X2 + 1 = and(X1,X2)
     
     and(active(X1),X2) = X1 + X2 + 4 >= X1 + X2 + 1 = and(X1,X2)
     
     and(X1,active(X2)) = X1 + X2 + 4 >= X1 + X2 + 1 = and(X1,X2)
     
     isList(mark(X)) = 16X + 1 >= 4X + 1 = isList(X)
     
     isList(active(X)) = 4X + 13 >= 4X + 1 = isList(X)
     
     isNeList(mark(X)) = 4X + 4 >= X + 4 = isNeList(X)
     
     isNeList(active(X)) = X + 7 >= X + 4 = isNeList(X)
     
     isQid(mark(X)) = 4X + 1 >= X + 1 = isQid(X)
     
     isQid(active(X)) = X + 4 >= X + 1 = isQid(X)
     
     isNePal(mark(X)) = 20X + 4 >= 5X + 4 = isNePal(X)
     
     isNePal(active(X)) = 5X + 19 >= 5X + 4 = isNePal(X)
     
     isPal(mark(X)) = 16X + 2 >= 4X + 2 = isPal(X)
     
     isPal(active(X)) = 4X + 14 >= 4X + 2 = isPal(X)
    problem:
     mark(__(X1,X2)) -> active(__(mark(X1),mark(X2)))
     mark(and(X1,X2)) -> active(and(mark(X1),X2))
     mark(tt()) -> active(tt())
     mark(isList(X)) -> active(isList(X))
     mark(isQid(X)) -> active(isQid(X))
     mark(a()) -> active(a())
     mark(u()) -> active(u())
     __(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=1
     
     interpretation:
      [tt] = 4,
      
      [u] = 0,
      
      [isQid](x0) = x0 + 1,
      
      [active](x0) = x0,
      
      [and](x0, x1) = 4x0 + 4x1,
      
      [isPal](x0) = 2x0 + 4,
      
      [__](x0, x1) = 4x0 + 2x1,
      
      [isNeList](x0) = x0 + 4,
      
      [a] = 0,
      
      [isNePal](x0) = x0 + 4,
      
      [isList](x0) = x0 + 2,
      
      [mark](x0) = 4x0
     orientation:
      mark(__(X1,X2)) = 16X1 + 8X2 >= 16X1 + 8X2 = active(__(mark(X1),mark(X2)))
      
      mark(and(X1,X2)) = 16X1 + 16X2 >= 16X1 + 4X2 = active(and(mark(X1),X2))
      
      mark(tt()) = 16 >= 4 = active(tt())
      
      mark(isList(X)) = 4X + 8 >= X + 2 = active(isList(X))
      
      mark(isQid(X)) = 4X + 4 >= X + 1 = active(isQid(X))
      
      mark(a()) = 0 >= 0 = active(a())
      
      mark(u()) = 0 >= 0 = active(u())
      
      __(mark(X1),X2) = 16X1 + 2X2 >= 4X1 + 2X2 = __(X1,X2)
      
      __(X1,mark(X2)) = 4X1 + 8X2 >= 4X1 + 2X2 = __(X1,X2)
      
      and(mark(X1),X2) = 16X1 + 4X2 >= 4X1 + 4X2 = and(X1,X2)
      
      and(X1,mark(X2)) = 4X1 + 16X2 >= 4X1 + 4X2 = and(X1,X2)
      
      isList(mark(X)) = 4X + 2 >= X + 2 = isList(X)
      
      isNeList(mark(X)) = 4X + 4 >= X + 4 = isNeList(X)
      
      isQid(mark(X)) = 4X + 1 >= X + 1 = isQid(X)
      
      isNePal(mark(X)) = 4X + 4 >= X + 4 = isNePal(X)
      
      isPal(mark(X)) = 8X + 4 >= 2X + 4 = isPal(X)
     problem:
      mark(__(X1,X2)) -> active(__(mark(X1),mark(X2)))
      mark(and(X1,X2)) -> active(and(mark(X1),X2))
      mark(a()) -> active(a())
      mark(u()) -> active(u())
      __(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=1
      
      interpretation:
       [u] = 3,
       
       [isQid](x0) = x0,
       
       [active](x0) = x0,
       
       [and](x0, x1) = x0 + 4x1 + 4,
       
       [isPal](x0) = 2x0 + 6,
       
       [__](x0, x1) = 2x0 + 3x1 + 6,
       
       [isNeList](x0) = 4x0,
       
       [a] = 2,
       
       [isNePal](x0) = 2x0,
       
       [isList](x0) = 2x0 + 2,
       
       [mark](x0) = 4x0 + 3
      orientation:
       mark(__(X1,X2)) = 8X1 + 12X2 + 27 >= 8X1 + 12X2 + 21 = active(__(mark(X1),mark(X2)))
       
       mark(and(X1,X2)) = 4X1 + 16X2 + 19 >= 4X1 + 4X2 + 7 = active(and(mark(X1),X2))
       
       mark(a()) = 11 >= 2 = active(a())
       
       mark(u()) = 15 >= 3 = active(u())
       
       __(mark(X1),X2) = 8X1 + 3X2 + 12 >= 2X1 + 3X2 + 6 = __(X1,X2)
       
       __(X1,mark(X2)) = 2X1 + 12X2 + 15 >= 2X1 + 3X2 + 6 = __(X1,X2)
       
       and(mark(X1),X2) = 4X1 + 4X2 + 7 >= X1 + 4X2 + 4 = and(X1,X2)
       
       and(X1,mark(X2)) = X1 + 16X2 + 16 >= X1 + 4X2 + 4 = and(X1,X2)
       
       isList(mark(X)) = 8X + 8 >= 2X + 2 = isList(X)
       
       isNeList(mark(X)) = 16X + 12 >= 4X = isNeList(X)
       
       isQid(mark(X)) = 4X + 3 >= X = isQid(X)
       
       isNePal(mark(X)) = 8X + 6 >= 2X = isNePal(X)
       
       isPal(mark(X)) = 8X + 12 >= 2X + 6 = isPal(X)
      problem:
       
      Qed