What statements are true?

Techniques that work well in optimal planning also work well in satisficing planning

SAT planning can be used for optimal and satisficing planning

Symbolic search is always more efficient than other approaches because exponential state sets are encoded as polynomially sized decision diagrams

Symbolic breadth-first search in principle works like a normal breadth-first search where each search node represents a set of states instead of a single state

Solutions encountered with symbolic progression breadth-first search are optimal