trying trim

Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>

src/sat/sat_proof_trim.h

@@ -0,0 +1,79 @@
+/*++
+  Copyright (c) 2020 Microsoft Corporation
+
+  Module Name:
+
+   sat_trim.h
+
+  Abstract:
+   
+    proof replay and trim
+
+  Author:
+
+    Nikolaj Bjorner 2023-10-04
+
+  Notes:
+  
+
+--*/
+
+#pragma once
+
+#include "util/params.h"
+#include "util/statistics.h"
+#include "sat/sat_clause.h"
+#include "sat/sat_types.h"
+#include "sat/sat_solver.h"
+
+namespace sat {
+
+    class proof_trim {
+        solver         s;
+        literal_vector m_clause;
+        uint_set       m_in_clause;
+        uint_set       m_in_coi;
+        vector<std::tuple<literal_vector, clause*, bool, bool>> m_trail;
+        
+        struct hash {
+            unsigned operator()(literal_vector const& v) const {
+                return string_hash((char const*)v.begin(), v.size()*sizeof(literal), 3);
+            }
+        };
+        struct eq {
+            bool operator()(literal_vector const& a, literal_vector const& b) const {
+                return a == b;
+            }
+        };
+        map<literal_vector, clause_vector, hash, eq> m_clauses;
+
+        void del(literal_vector const& cl, clause* cp);
+
+        bool match_clause(literal_vector const& cl, literal l1, literal l2) const;
+        bool match_clause(literal_vector const& cl, literal l1, literal l2, literal l3) const;
+
+        void prune_trail(literal_vector const& cl, clause* cp);
+        void conflict_analysis_core(unsigned init_sz, vector<literal_vector>& clauses);
+        void add_core(literal l, justification j, vector<literal_vector>& clauses);
+        void revive(literal_vector const& cl, clause* cp);        
+        clause* del(literal_vector const& cl);
+        void save(literal_vector const& lits, clause* cl);
+        
+    public:
+
+        proof_trim(params_ref const& p, reslimit& lim);
+
+        bool_var mk_var() { return s.mk_var(true, true); }
+        void init_clause() { m_clause.reset(); }
+        void add_literal(bool_var v, bool sign) { m_clause.push_back(literal(v, sign)); }
+        unsigned num_vars() { return s.num_vars(); }
+
+        void assume(bool is_initial = true);
+        void del();
+        void infer();
+        void updt_params(params_ref const& p) { s.updt_params(p); }
+
+        void trim();
+
+    };
+}