checkpoint

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

src/tactic/arith/degree_shift_tactic.h

@@ -28,4 +28,8 @@ class tactic;
 
 tactic * mk_degree_shift_tactic(ast_manager & m, params_ref const & p = params_ref());
 
+/*
+  ADD_TACTIC("degree-shift", "try to reduce degree of polynomials (remark: :mul2power simplification is automatically applied).", "mk_degree_shift_tactic(m, p)")
+*/
+
 #endif

src/tactic/arith/diff_neq_tactic.h

@@ -28,5 +28,7 @@ class ast_manager;
 class tactic;
 
 tactic * mk_diff_neq_tactic(ast_manager & m, params_ref const & p = params_ref());
-
+/*
+  ADD_TACTIC("diff-neq", "specialized solver for integer arithmetic problems that contain only atoms of the form (<= k x) (<= x k) and (not (= (- x y) k)), where x and y are constants and k is a numberal, and all constants are bounded.", "mk_diff_neq_tactic(m, p)")
+*/
 #endif

src/tactic/arith/factor_tactic.h

@@ -24,5 +24,7 @@ class ast_manager;
 class tactic;
 
 tactic * mk_factor_tactic(ast_manager & m, params_ref const & p = params_ref());
-
+/*
+  ADD_TACTIC("factor", "polynomial factorization.", "mk_factor_tactic(m, p)")
+*/
 #endif

src/tactic/arith/fix_dl_var_tactic.h

@@ -30,4 +30,8 @@ class tactic;
 
 tactic * mk_fix_dl_var_tactic(ast_manager & m, params_ref const & p = params_ref());
 
+/*
+  ADD_TACTIC("fix-dl-var", "if goal is in the difference logic fragment, then fix the variable with the most number of occurrences at 0.", "mk_fix_dl_var_tactic(m, p)")
+*/
+
 #endif

src/tactic/arith/fm_tactic.h

@@ -29,5 +29,8 @@ class ast_manager;
 class tactic;
 
 tactic * mk_fm_tactic(ast_manager & m, params_ref const & p = params_ref());
+/*
+  ADD_TACTIC("fm", "eliminate variables using fourier-motzkin elimination.", "mk_fm_tactic(m, p)")
+*/
 
 #endif

src/tactic/arith/lia2pb_tactic.h

@@ -24,5 +24,8 @@ class ast_manager;
 class tactic;
 
 tactic * mk_lia2pb_tactic(ast_manager & m, params_ref const & p = params_ref());
+/*
+  ADD_TACTIC("lia2pb", "convert bounded integer variables into a sequence of 0-1 variables.", "mk_lia2pb_tactic(m, p)")
+*/
 
 #endif

src/tactic/arith/nla2bv_tactic.h

@@ -25,6 +25,9 @@ class ast_manager;
 class tactic;
 
 tactic * mk_nla2bv_tactic(ast_manager & m, params_ref const & p = params_ref());
+/*
+  ADD_TACTIC("nla2bv", "convert a nonlinear arithmetic problem into a bit-vector problem, in most cases the resultant goal is an under approximation and is useul for finding models.", "mk_nla2bv_tactic(m, p)")
+*/
 
 #endif
 

src/tactic/arith/pb2bv_tactic.h

@@ -24,6 +24,9 @@ class ast_manager;
 class tactic;
 
 tactic * mk_pb2bv_tactic(ast_manager & m, params_ref const & p = params_ref());
+/*
+  ADD_TACTIC("pb2bv", "convert pseudo-boolean constraints to bit-vectors.", "mk_pb2bv_tactic(m, p)")
+*/
 
 probe * mk_is_pb_probe();
 

src/tactic/arith/propagate_ineqs_tactic.h

@@ -38,5 +38,8 @@ class ast_manager;
 class tactic;
 
 tactic * mk_propagate_ineqs_tactic(ast_manager & m, params_ref const & p = params_ref());
+/*
+  ADD_TACTIC("propagate-ineqs", "propagate ineqs/bounds, remove subsumed inequalities.", "mk_propagate_ineqs_tactic(m, p)")
+*/
 
 #endif

src/tactic/arith/purify_arith_tactic.h

@@ -54,5 +54,9 @@ class tactic;
 
 tactic * mk_purify_arith_tactic(ast_manager & m, params_ref const & p = params_ref());
 
+/*
+  ADD_TACTIC("purify-arith", "eliminate unnecessary operators: -, /, div, mod, rem, is-int, to-int, ^, root-objects.", "mk_purify_arith_tactic(m, p)")
+*/
+
 #endif
 

src/tactic/arith/recover_01_tactic.h

@@ -38,5 +38,8 @@ class ast_manager;
 class tactic;
 
 tactic * mk_recover_01_tactic(ast_manager & m, params_ref const & p = params_ref());
+/*
+  ADD_TACTIC("recover-01", "recover 0-1 variables hidden as Boolean variables.", "mk_recover_01_tactic(m, p)")
+*/
 
 #endif