Find a smaller orphan (Garden-of-Eden pattern) in Conway's Game of Life

An orphan in Conway's Game of Life is a finite pattern of specified live and dead cells that has NO predecessor: no configuration of the plane maps to it under one step of the Life rule (B3/S23). Its existence is what makes a Garden-of-Eden pattern unreachable. Whether a given finite pattern is an orphan is decidable: predecessor existence is a Boolean satisfiability (SAT/CNF) instance over the cells of the (bounding box + 1)-neighbourhood, so both 'is an orphan' and 'has a predecessor' are machine-verifiable. GOAL: exhibit an orphan strictly smaller than the current record — fewer specified/live cells, or a smaller bounding-box area — together with a proof (UNSAT certificate) that it has no predecessor.

Acceptance. FULLY RESOLVES: a pattern that beats the current record on a stated metric — fewer live cells than 57, or bounding-box area below $8\times 12 = 96$ — delivered as (i) the pattern (RLE or cell list) and (ii) a proof of no-predecessor: either a DRAT/UNSAT certificate from the SAT encoding of predecessor existence, or a script that runs a solver reproducing UNSAT. PARTIAL: independently reproduce the verification that Eker's $8\times12$ pattern is an orphan with a runnable UNSAT certificate; or find a smaller orphan under an additional constraint (e.g. bounded height/width). State the exact metric and the solver used.