49 lines
1.4 KiB
C++
49 lines
1.4 KiB
C++
|
/*
|
||
|
|
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
|
||
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
||
|
|
|
||
|
|
Author: Leonardo de Moura
|
||
|
|
*/
|
||
|
|
#include "library/blast/revert.h"
|
||
|
|
#include "library/blast/blast.h"
|
||
|
|
|
||
|
|
namespace lean {
|
||
|
|
namespace blast {
|
||
|
|
struct revert_proof_step_cell : public proof_step_cell {
|
||
|
|
list<expr> m_hs;
|
||
|
|
revert_proof_step_cell(list<expr> const & hs):m_hs(hs) {}
|
||
|
|
|
||
|
|
virtual ~revert_proof_step_cell() {}
|
||
|
|
|
||
|
|
virtual action_result resolve(expr const & pr) const {
|
||
|
|
expr new_pr = mk_app(pr, m_hs);
|
||
|
|
return action_result::solved(new_pr);
|
||
|
|
}
|
||
|
|
|
||
|
|
virtual bool is_silent() const override { return true; }
|
||
|
|
};
|
||
|
|
|
||
|
|
unsigned revert(buffer<hypothesis_idx> & hidxs, hypothesis_idx_set & hidxs_set) {
|
||
|
|
lean_assert(hidxs.size() == hidxs_set.size());
|
||
|
|
state & s = curr_state();
|
||
|
|
unsigned hidxs_size = hidxs.size();
|
||
|
|
for (unsigned i = 0; i < hidxs_size; i++) {
|
||
|
|
s.collect_forward_deps(hidxs[i], hidxs, hidxs_set);
|
||
|
|
}
|
||
|
|
s.sort_hypotheses(hidxs);
|
||
|
|
buffer<expr> hs;
|
||
|
|
s.to_hrefs(hidxs, hs);
|
||
|
|
expr target = s.get_target();
|
||
|
|
expr new_target = s.mk_pi(hs, target);
|
||
|
|
s.set_target(new_target);
|
||
|
|
s.push_proof_step(new revert_proof_step_cell(to_list(hs)));
|
||
|
|
lean_verify(s.del_hypotheses(hidxs));
|
||
|
|
return hidxs.size();
|
||
|
|
}
|
||
|
|
|
||
|
|
unsigned revert(buffer<hypothesis_idx> & hidxs) {
|
||
|
|
hypothesis_idx_set hidxs_set(hidxs);
|
||
|
|
return revert(hidxs, hidxs_set);
|
||
|
|
}
|
||
|
|
}}
|