This document is the Technical Appendix for the paper "Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem" accepted at IJCAI-2024. Section 1 contains the complete proof of a lemma from the IJCAI paper. Section 2 describes the constraints used in the constraint programming model used in the paper, and Section 3 presents the full results of the experiments. In Section 4, there is a link to the GitHub repository containing the Java code for the experiments.