I’m not very good at using batch solver, but I think it’s like this
Unique Orientations and Equivelances: {UF UL UB UR} {UFR UFL UBL UBR}
Scramble: < R U R' , R U' R' , R U2 R' , U , U' , U2 >
Prune: (refer to this post https://www.speedsolving.com/threads/86934/#post-1480792 )
Search: I think the max of how long of an algorithm it will generate is the Search value plus the Prune value