We present an executable formally verified SAT encoding of ground classical AI planning problems. use the theorem prover Isabelle/HOL to perform verification. experimentally test and show that it can be used for reasonably sized standard benchmarks. also as a reference state-of-the-art SAT-based planner, showing sometimes falsely claims problems have no solutions certain lengths.