checkpoint

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>

src/tactic/aig/aig_tactic.h

@@ -23,5 +23,7 @@ Notes:
 class tactic;
 
 tactic * mk_aig_tactic(params_ref const & p = params_ref());
-
+/*
+  ADD_TACTIC("aig", "simplify Boolean structure using AIGs.", "mk_aig_tactic")
+*/
 #endif

src/tactic/arith/add_bounds_tactic.h

@@ -31,4 +31,8 @@ probe * mk_is_unbounded_probe();
 
 tactic * mk_add_bounds_tactic(ast_manager & m, params_ref const & p = params_ref());
 
+/*
+    ADD_TACTIC("add-bounds", "add bounds to unbounded variables (under approximation).", "mk_add_bounds_tactic(m, p)")
+*/
+
 #endif

src/tactic/arith/normalize_bounds_tactic.h

@@ -27,4 +27,8 @@ class tactic;
 
 tactic * mk_normalize_bounds_tactic(ast_manager & m, params_ref const & p = params_ref());
 
+/*
+  ADD_TACTIC("normalize-bounds", "replace a variable x with lower bound k <= x with x' = x - k.", "mk_normalize_bounds_tactic(m, p)")
+*/
+
 #endif

src/tactic/bv/bit_blaster_tactic.h

@@ -24,5 +24,7 @@ class ast_manager;
 class tactic;
 
 tactic * mk_bit_blaster_tactic(ast_manager & m, params_ref const & p = params_ref());
-
+/*
+  ADD_TACTIC("bit-blast", "reduce bit-vector expressions into SAT.", "mk_bit_blaster_tactic(m, p)")
+*/
 #endif

src/tactic/core/distribute_forall_tactic.h

@@ -23,4 +23,8 @@ class tactic;
 
 tactic * mk_distribute_forall_tactic(ast_manager & m, params_ref const & p);
 
+/*
+  ADD_TACTIC("distribute-forall", "distribute forall over conjunctions.", "mk_distribute_forall_tactic(m, p)")
+*/
+
 #endif

src/tactic/core/elim_term_ite_tactic.h

@@ -26,4 +26,8 @@ class tactic;
 
 tactic * mk_elim_term_ite_tactic(ast_manager & m, params_ref const & p = params_ref());
 
+/*
+    ADD_TACTIC("elim-term-ite", "eliminate term if-then-else by adding fresh auxiliary declarations.", "mk_elim_term_ite_tactic(m, p)")
+*/
+
 #endif

src/tactic/core/elim_uncnstr_tactic.h

@@ -26,5 +26,8 @@ class ast_manager;
 
 tactic * mk_elim_uncnstr_tactic(ast_manager & m, params_ref const & p = params_ref());
 
+/*
+  ADD_TACTIC("elim-uncnstr", "eliminate application containing unconstrained variables.", "mk_elim_uncnstr_tactic(m, p)")
+*/
 #endif
 

src/tactic/core/nnf_tactic.h

@@ -26,5 +26,10 @@ class tactic;
 tactic * mk_snf_tactic(ast_manager & m, params_ref const & p = params_ref());
 tactic * mk_nnf_tactic(ast_manager & m, params_ref const & p = params_ref());
 
+/*
+  ADD_TACTIC("snf", "put goal in skolem normal form.", "mk_snf_tactic(m, p)")
+  ADD_TACTIC("nnf", "put goal in negation normal form.", "mk_nnf_tactic(m, p)")
+*/
+
 #endif
 

src/tactic/core/occf_tactic.h

@@ -30,5 +30,9 @@ class tactic;
 
 tactic * mk_occf_tactic(ast_manager & m, params_ref const & p = params_ref());
 
+/*
+  ADD_TACTIC("occf", "put goal in one constraint per clause normal form (notes: fails if proof generation is enabled; only clauses are considered).", "mk_occf_tactic(m, p)")
+*/
+
 #endif
 

src/tactic/core/propagate_values_tactic.h

@@ -26,4 +26,8 @@ class tactic;
 
 tactic * mk_propagate_values_tactic(ast_manager & m, params_ref const & p = params_ref());
 
+/*
+    ADD_TACTIC_CMD("propagate-values", "propagate constants.", "mk_propagate_values_tactic(m, p)")
+*/
+
 #endif

src/tactic/core/simplify_tactic.h

@@ -51,4 +51,9 @@ public:
 tactic * mk_simplify_tactic(ast_manager & m, params_ref const & p = params_ref());
 tactic * mk_elim_and_tactic(ast_manager & m, params_ref const & p = params_ref());
 
+/*
+  ADD_TACTIC("simplify", "apply simplification rules.", "mk_simplify_tactic(m, p)")
+  ADD_TACTIC("elim-and", "convert (and a b) into (not (or (not a) (not b))).", "mk_elim_and_tactic(m, p)")
+*/
+
 #endif

src/tactic/core/solve_eqs_tactic.h

@@ -26,5 +26,9 @@ class expr_replacer;
 
 tactic * mk_solve_eqs_tactic(ast_manager & m, params_ref const & p = params_ref(), expr_replacer * r = 0);
 
+/*
+  ADD_TACTIC("solve-eqs", "eliminate variables by solving equations.", "mk_solve_eqs_tactic(m, p)")
+*/
+
 #endif
 

src/tactic/core/split_clause_tactic.h

@@ -25,4 +25,8 @@ class tactic;
 
 tactic * mk_split_clause_tactic(params_ref const & p = params_ref());
 
+/*
+  ADD_TACTIC("split-clause", "split a clause in many subgoals.", "mk_split_clause_tactic(p)")
+*/
+
 #endif

src/tactic/core/symmetry_reduce_tactic.h

@@ -25,4 +25,8 @@ class tactic;
 
 tactic * mk_symmetry_reduce_tactic(ast_manager & m, params_ref const & p);
 
+/*
+  ADD_TACTIC("symmetry-reduce", "apply symmetry reduction.", "mk_symmetry_reduce_tactic(m, p)")
+*/
+
 #endif

src/tactic/smt/smt_tactic.h

@@ -27,4 +27,8 @@ tactic * mk_smt_tactic(params_ref const & p = params_ref());
 // syntax sugar for using_params(mk_smt_tactic(), p) where p = (:auto_config, auto_config)
 tactic * mk_smt_tactic_using(bool auto_config = true, params_ref const & p = params_ref());
 
+/*
+  ADD_TACTIC("smt", "apply a SAT based SMT solver.", "mk_smt_tactic(p)") 
+*/
+
 #endif

src/tactic/tactic.h

@@ -128,6 +128,11 @@ tactic * mk_skip_tactic();
 tactic * mk_fail_tactic();
 tactic * mk_fail_if_undecided_tactic();
 
+/*
+  ADD_TACTIC("skip", "do nothing tactic.", "mk_skip_tactic()")
+  ADD_TACTIC("fail", "always fail tactic.", "mk_fail_tactic()")
+*/
+
 tactic * mk_report_verbose_tactic(char const * msg, unsigned lvl);
 tactic * mk_trace_tactic(char const * tag);