Remember when I proposed this? Well, I've thought of 2 ways to make this an LL-skip method. One method would take 211 algorithms, one would take ~176 algorithms (excluding EPLL).
The first way is making use of TSLE/TTLL. You would first solve a Petrus block, then solve one F2L pair, then TSLE, then
EODF, then TTLL.
The other is to make a Petrus block, solve one F2L pair, insert the last pair while solving CO and CP (27
MLS cases * 6 CP configurations = 162 algs), then solve EODF with M/U and cancel into EPLL.
Or you could just with go a simpler OLL-skip method route and solve a Petrus block, then 1 F2L pair, then the second with MLS, then EODF, then PLL.
*MLS, or Manning Last Slot, is an LSLL subset similar to Winter Variation where you orient the LL corners while solving your last slot, but it differs from WV because you don't have to preserve LL EO.