mirror of
https://github.com/Z3Prover/z3
synced 2025-05-09 16:55:47 +00:00
move proof_cmds
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
f5d2b9b89a
commit
f65a244385
5 changed files with 34 additions and 55 deletions
|
@ -3,6 +3,7 @@ z3_add_component(extra_cmds
|
|||
dbg_cmds.cpp
|
||||
polynomial_cmds.cpp
|
||||
subpaving_cmds.cpp
|
||||
proof_cmds.cpp
|
||||
COMPONENT_DEPENDENCIES
|
||||
arith_tactics
|
||||
cmd_context
|
||||
|
|
186
src/cmd_context/extra_cmds/proof_cmds.cpp
Normal file
186
src/cmd_context/extra_cmds/proof_cmds.cpp
Normal file
|
@ -0,0 +1,186 @@
|
|||
/*++
|
||||
Copyright (c) 2022 Microsoft Corporation
|
||||
|
||||
Module Name:
|
||||
|
||||
proof_cmds.cpp
|
||||
|
||||
Abstract:
|
||||
|
||||
Commands for reading and checking proofs.
|
||||
|
||||
Author:
|
||||
|
||||
Nikolaj Bjorner (nbjorner) 2022-8-26
|
||||
|
||||
Notes:
|
||||
|
||||
- add theory hint bypass using proof checker plugins of SMT
|
||||
- arith_proof_checker.h is currently
|
||||
- could use m_drat for drup premises.
|
||||
|
||||
--*/
|
||||
|
||||
#include "util/small_object_allocator.h"
|
||||
#include "ast/ast_util.h"
|
||||
#include "cmd_context/cmd_context.h"
|
||||
// include "smt/smt_solver.h"
|
||||
// include "sat/sat_solver.h"
|
||||
// include "sat/sat_drat.h"
|
||||
#include "sat/smt/euf_proof_checker.h"
|
||||
#include <iostream>
|
||||
|
||||
class smt_checker {
|
||||
ast_manager& m;
|
||||
params_ref m_params;
|
||||
euf::proof_checker m_checker;
|
||||
|
||||
scoped_ptr<solver> m_solver;
|
||||
|
||||
#if 0
|
||||
sat::solver sat_solver;
|
||||
sat::drat m_drat;
|
||||
sat::literal_vector m_units;
|
||||
sat::literal_vector m_drup_units;
|
||||
|
||||
void add_units() {
|
||||
auto const& units = m_drat.units();
|
||||
for (unsigned i = m_units.size(); i < units.size(); ++i)
|
||||
m_units.push_back(units[i].first);
|
||||
}
|
||||
#endif
|
||||
|
||||
public:
|
||||
smt_checker(ast_manager& m):
|
||||
m(m),
|
||||
m_checker(m)
|
||||
// sat_solver(m_params, m.limit()),
|
||||
// m_drat(sat_solver)
|
||||
{
|
||||
// m_solver = mk_smt_solver(m, m_params, symbol());
|
||||
}
|
||||
|
||||
void check(expr_ref_vector const& clause, expr* proof_hint) {
|
||||
|
||||
if (m_checker.check(clause, proof_hint)) {
|
||||
if (is_app(proof_hint))
|
||||
std::cout << "(verified-" << to_app(proof_hint)->get_name() << ")\n";
|
||||
else
|
||||
std::cout << "(verified-checker)\n";
|
||||
return;
|
||||
}
|
||||
|
||||
m_solver->push();
|
||||
for (expr* lit : clause)
|
||||
m_solver->assert_expr(m.mk_not(lit));
|
||||
lbool is_sat = m_solver->check_sat();
|
||||
if (is_sat != l_false) {
|
||||
std::cout << "did not verify: " << is_sat << " " << clause << "\n\n";
|
||||
m_solver->display(std::cout);
|
||||
if (is_sat == l_true) {
|
||||
model_ref mdl;
|
||||
m_solver->get_model(mdl);
|
||||
std::cout << *mdl << "\n";
|
||||
}
|
||||
exit(0);
|
||||
}
|
||||
m_solver->pop(1);
|
||||
std::cout << "(verified-smt)\n";
|
||||
// assume(clause);
|
||||
}
|
||||
|
||||
void assume(expr_ref_vector const& clause) {
|
||||
m_solver->assert_expr(mk_or(clause));
|
||||
}
|
||||
};
|
||||
|
||||
class proof_cmds_imp : public proof_cmds {
|
||||
ast_manager& m;
|
||||
expr_ref_vector m_lits;
|
||||
expr_ref m_proof_hint;
|
||||
smt_checker m_checker;
|
||||
public:
|
||||
proof_cmds_imp(ast_manager& m): m(m), m_lits(m), m_proof_hint(m), m_checker(m) {}
|
||||
|
||||
void add_literal(expr* e) override {
|
||||
if (m.is_proof(e))
|
||||
m_proof_hint = e;
|
||||
else
|
||||
m_lits.push_back(e);
|
||||
}
|
||||
|
||||
void end_assumption() override {
|
||||
m_checker.assume(m_lits);
|
||||
m_lits.reset();
|
||||
m_proof_hint.reset();
|
||||
}
|
||||
|
||||
void end_learned() {
|
||||
m_checker.check(m_lits, m_proof_hint);
|
||||
m_lits.reset();
|
||||
m_proof_hint.reset();
|
||||
}
|
||||
|
||||
void end_deleted() {
|
||||
m_lits.reset();
|
||||
m_proof_hint.reset();
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
static proof_cmds& get(cmd_context& ctx) {
|
||||
if (!ctx.get_proof_cmds())
|
||||
ctx.set_proof_cmds(alloc(proof_cmds_imp, ctx.m()));
|
||||
return *ctx.get_proof_cmds();
|
||||
}
|
||||
|
||||
// assumption
|
||||
class assume_cmd : public cmd {
|
||||
public:
|
||||
assume_cmd():cmd("assume") {}
|
||||
char const* get_usage() const override { return "<expr>+"; }
|
||||
char const * get_descr(cmd_context& ctx) const override { return "proof command for adding assumption (input assertion)"; }
|
||||
unsigned get_arity() const override { return VAR_ARITY; }
|
||||
void prepare(cmd_context & ctx) override {}
|
||||
void finalize(cmd_context & ctx) override {}
|
||||
void failure_cleanup(cmd_context & ctx) override {}
|
||||
cmd_arg_kind next_arg_kind(cmd_context & ctx) const override { return CPK_EXPR; }
|
||||
void set_next_arg(cmd_context & ctx, expr * arg) override { get(ctx).add_literal(arg); }
|
||||
void execute(cmd_context& ctx) override { get(ctx).end_assumption(); }
|
||||
};
|
||||
|
||||
// deleted clause
|
||||
class del_cmd : public cmd {
|
||||
public:
|
||||
del_cmd():cmd("del") {}
|
||||
char const* get_usage() const override { return "<expr>+"; }
|
||||
char const * get_descr(cmd_context& ctx) const override { return "proof command for clause deletion"; }
|
||||
unsigned get_arity() const override { return VAR_ARITY; }
|
||||
void prepare(cmd_context & ctx) override {}
|
||||
void finalize(cmd_context & ctx) override {}
|
||||
void failure_cleanup(cmd_context & ctx) override {}
|
||||
cmd_arg_kind next_arg_kind(cmd_context & ctx) const override { return CPK_EXPR; }
|
||||
void set_next_arg(cmd_context & ctx, expr * arg) override { get(ctx).add_literal(arg); }
|
||||
void execute(cmd_context& ctx) override { get(ctx).end_deleted(); }
|
||||
};
|
||||
|
||||
// learned/redundant clause
|
||||
class learn_cmd : public cmd {
|
||||
public:
|
||||
learn_cmd():cmd("learn") {}
|
||||
char const* get_usage() const override { return "<expr>+"; }
|
||||
char const* get_descr(cmd_context& ctx) const override { return "proof command for learned (redundant) clauses"; }
|
||||
unsigned get_arity() const override { return VAR_ARITY; }
|
||||
void prepare(cmd_context & ctx) override {}
|
||||
void finalize(cmd_context & ctx) override {}
|
||||
void failure_cleanup(cmd_context & ctx) override {}
|
||||
cmd_arg_kind next_arg_kind(cmd_context & ctx) const override { return CPK_EXPR; }
|
||||
void set_next_arg(cmd_context & ctx, expr * arg) override { get(ctx).add_literal(arg); }
|
||||
void execute(cmd_context& ctx) override { get(ctx).end_learned(); }
|
||||
};
|
||||
|
||||
void install_proof_cmds(cmd_context & ctx) {
|
||||
ctx.insert(alloc(del_cmd));
|
||||
ctx.insert(alloc(learn_cmd));
|
||||
ctx.insert(alloc(assume_cmd));
|
||||
}
|
36
src/cmd_context/extra_cmds/proof_cmds.h
Normal file
36
src/cmd_context/extra_cmds/proof_cmds.h
Normal file
|
@ -0,0 +1,36 @@
|
|||
/*++
|
||||
Copyright (c) 2022 Microsoft Corporation
|
||||
|
||||
Module Name:
|
||||
|
||||
proof_cmds.h
|
||||
|
||||
Abstract:
|
||||
Commands for reading proofs.
|
||||
|
||||
Author:
|
||||
|
||||
Nikolaj Bjorner (nbjorner) 2022-8-26
|
||||
|
||||
Notes:
|
||||
|
||||
--*/
|
||||
#pragma once
|
||||
|
||||
/**
|
||||
proof_cmds is a structure that tracks an evidence trail.
|
||||
|
||||
The main interface is to:
|
||||
add literals one by one,
|
||||
add proof hints
|
||||
until receiving end-command: assumption, learned, deleted.
|
||||
Evidence can be checked:
|
||||
- By DRUP
|
||||
- Theory lemmas
|
||||
|
||||
*/
|
||||
|
||||
|
||||
class cmd_context;
|
||||
void install_proof_cmds(cmd_context & ctx);
|
||||
|
Loading…
Add table
Add a link
Reference in a new issue