more doc

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

src/tactic/arith/nla2bv_tactic.cpp

@@ -442,9 +442,9 @@ class nla2bv_tactic : public tactic {
 
     void collect_param_descrs(param_descrs & r) override {
         r.insert("nla2bv_max_bv_size", CPK_UINT, "(default: inf) maximum bit-vector size used by nla2bv tactic");
-        r.insert("nla2bv_bv_size", CPK_UINT, "(default: 4) default bit-vector size used by nla2bv tactic.");
-        r.insert("nla2bv_root", CPK_UINT, "(default: 2) nla2bv tactic encodes reals into bit-vectors using expressions of the form a+b*sqrt(c), this parameter sets the value of c used in the encoding.");
-        r.insert("nla2bv_divisor", CPK_UINT, "(default: 2) nla2bv tactic parameter.");
+        r.insert("nla2bv_bv_size", CPK_UINT, "default bit-vector size used by nla2bv tactic.", "4");
+        r.insert("nla2bv_root", CPK_UINT, "nla2bv tactic encodes reals into bit-vectors using expressions of the form a+b*sqrt(c), this parameter sets the value of c used in the encoding.", "2");
+        r.insert("nla2bv_divisor", CPK_UINT, "nla2bv tactic parameter.", "2");
     }
 
     /**

src/tactic/arith/normalize_bounds_tactic.cpp

@@ -161,7 +161,7 @@ class normalize_bounds_tactic : public tactic {
 
     void collect_param_descrs(param_descrs & r) override {
         insert_produce_models(r);
-        r.insert("norm_int_only", CPK_BOOL, "(default: true) normalize only the bounds of integer constants.");
+        r.insert("norm_int_only", CPK_BOOL, "normalize only the bounds of integer constants.", "true");
     }
 
     void operator()(goal_ref const & in, 

src/tactic/arith/purify_arith_tactic.cpp

@@ -911,11 +911,11 @@ class purify_arith_tactic : public tactic {
 
     void collect_param_descrs(param_descrs & r) override {
         r.insert("complete", CPK_BOOL, 
-                 "(default: true) add constraints to make sure that any interpretation of a underspecified arithmetic operators is a function. The result will include additional uninterpreted functions/constants: /0, div0, mod0, 0^0, neg-root");
+                 "add constraints to make sure that any interpretation of a underspecified arithmetic operators is a function. The result will include additional uninterpreted functions/constants: /0, div0, mod0, 0^0, neg-root", "true");
         r.insert("elim_root_objects", CPK_BOOL,
-                 "(default: true) eliminate root objects.");
+                 "eliminate root objects.", "true");
         r.insert("elim_inverses", CPK_BOOL,
-                 "(default: true) eliminate inverse trigonometric functions (asin, acos, atan).");
+                 "eliminate inverse trigonometric functions (asin, acos, atan).", "true");
         th_rewriter::get_param_descrs(r);
     }
 

src/tactic/arith/recover_01_tactic.cpp

@@ -407,7 +407,7 @@ class recover_01_tactic : public tactic {
 
     void collect_param_descrs(param_descrs & r) override {
         th_rewriter::get_param_descrs(r);
-        r.insert("recover_01_max_bits", CPK_UINT, "(default: 10) maximum number of bits to consider in a clause.");
+        r.insert("recover_01_max_bits", CPK_UINT, "maximum number of bits to consider in a clause.", "10");
     }
 
     void operator()(goal_ref const & g, 

src/tactic/bv/bit_blaster_tactic.cpp

@@ -129,10 +129,10 @@ class bit_blaster_tactic : public tactic {
     void collect_param_descrs(param_descrs & r) override {
         insert_max_memory(r);
         insert_max_steps(r);
-        r.insert("blast_mul", CPK_BOOL, "(default: true) bit-blast multipliers (and dividers, remainders).");
-        r.insert("blast_add", CPK_BOOL, "(default: true) bit-blast adders.");
-        r.insert("blast_quant", CPK_BOOL, "(default: false) bit-blast quantified variables.");
-        r.insert("blast_full", CPK_BOOL, "(default: false) bit-blast any term with bit-vector sort, this option will make E-matching ineffective in any pattern containing bit-vector terms.");
+        r.insert("blast_mul", CPK_BOOL, "bit-blast multipliers (and dividers, remainders).", "true");
+        r.insert("blast_add", CPK_BOOL, "bit-blast adders.", "true");
+        r.insert("blast_quant", CPK_BOOL, "bit-blast quantified variables.", "false");
+        r.insert("blast_full", CPK_BOOL, "bit-blast any term with bit-vector sort, this option will make E-matching ineffective in any pattern containing bit-vector terms.", "false");
     }
 
     void operator()(goal_ref const & g, 

src/tactic/bv/bit_blaster_tactic.h

@@ -1,21 +1,33 @@
  /*++
 Copyright (c) 2011 Microsoft Corporation
  
- Module Name:
+Module Name:
  
     bit_blaster_tactic.h
  
- Abstract:
+Author:
  
-    Apply bit-blasting to a given goal.
- 
- Author:
- 
-    Leonardo (leonardo) 2011-10-25
- 
- Notes:
+   Leonardo (leonardo) 2011-10-25
  
+Tactic Documentation:
+
+## Tactic bit-blast
+
+### Short Description
+
+Apply bit-blasting to a given goal.
+
+### Example
+
+```z3
+(declare-const x (_ BitVec 8))
+(declare-const y (_ BitVec 8))
+(assert (bvule x y))
+(apply bit-blast)
+```
+
  --*/
+
 #pragma once
 
 #include "util/params.h"