The definition of genetic outlier individuals, which are genetically dissimilar and highly fit, demonstrated that dissimilar and fit individuals had sporadic and variable survivability. This study showed that genetic programming populations consistently contain highly fit and dissimilar individuals that are often not considered in search due to their small numbers and their inability to produce fit offspring. The analyses of the in-lier population showed that in-liers contribute more consistently to future populations until they become genetically similar with many equal fitness values. When in-liers had less dissimilarity, the un-fit population and the genetic outliers contributed more to search. Lastly, the Tree-String problem was introduced. This problem is thought to be tunably difficult with many features related to other domains.