Researchers have successfully compiled temporal numeric planning into discrete PDDL+, a significant milestone in the development of planning languages. This compilation captures the full semantics of temporal planning with durative actions, previously only theoretically possible, and assumes non-self-overlapping actions1. The introduction of PDDL+ aimed to address the limitations of its predecessors, and this breakthrough provides a practical solution for compiling complex planning problems. By extending the capabilities of PDDL+, this work enables more efficient and effective planning in various domains. The compilation process allows for the representation of temporal planning with durative actions, enhancing the expressiveness of PDDL+. This advancement has significant implications for fields that rely on automated planning, such as robotics and logistics. The ability to compile temporal numeric planning into discrete PDDL+ matters to practitioners because it enables them to tackle complex planning challenges with greater precision and accuracy.