freeLunch is a Java library for planning, which takes input in the multivalued SAS+ formalism and produces optimal parallel plans. Currently the planning is done via reduction to satisfiability (using an encoding similar to SASE) and using Sat4J to solve the SAT part. Later we plan to add more algorithms (also non optimal ones) to create a portfolio of planning algorithms. Future plans include adding temporal actions, temporal predicates, resources, and planning modulo theories.