pub fn solve_and_reduce<T>(
    start: &[T],
    goal: &[T],
    max_size: Option<usize>,
    filter: &[T],
    order_constraints: &[(T, T)],
    infer: fn(Solver<'_, T, ()>, &[T]) -> Option<T>
) -> (Vec<T, Global>, Result<(), Error>) where
    T: Clone + PartialEq<T> + Eq + Hash
Expand description

Solves and reduces the proof to those steps that are necessary.