Exam scheduling is a combinatorial problem. One approach that can be used for solving the problem is boolean satisfiability problem (SAT). This paper present a proses conducted in solving an exam scheduling problem found at informatics Dept. Parahyangan Chatolic University using booelean satisfiability problem approach. The scheduling is encoded as a SAT problem and is solved by using two simple SAT inference technques. These techniques are unit propagation and failed literal rule. Keywords: Scheduling, SAT, Inference Technique, Propagation Unit, Failed Literal Rule