Wouldn't cutting your key search space roughly in half reduce your cracking time greatly, though?
According to Wolfram, for a 12 character password:
password type | total number | example
digits 0 through 9 | ~~ 2^40~~1 trillion | 287088364476
case-insensitive alphabetic | ~~ 2^56~~95.43 quadrillion | ycwcgndabspw
case-insensitive alphanumeric | ~~ 2^62~~4.738×10^18 | okcm5tfe8odr
case-sensitive alphabetic | ~~ 2^68~~3.909×10^20 | SgilPtNTKmuQ
case-sensitive alphanumeric | ~~ 2^71~~3.226×10^21 | xhWuSN5HBETz
printable ASCII characters | ~~ 2^79~~4.759×10^23 | [i{}I"2Bz9sN
The difference comes out to be 6.7 bits of entropy for a 12 chraracter, case sensitive and case insensitive alphanumeric with symbols. 81.38 vs 88.08. (Note that this "bits of entropy" number is mostly beyond my comprehension.. could anyone elaborate a bit? I'd assume more==better)