pub fn solve_and_reduce_with_accelerator<T, A>(
start: &[T],
goal: &[T],
max_size: Option<usize>,
filter: &[T],
order_constraints: &[(T, T)],
infer: fn(Solver<'_, T, A>, &[T]) -> Option<T>,
accelerator: fn(&[T], &[T]) -> A,
) -> (Vec<T>, Result<(), Error>)Expand description
Solves and reduces the proof to those steps that are necessary.
Uses an accelerator constructor initalized from start and goal.