Centralize and document TRACE tags using X-macros (#7657)

* Introduce X-macro-based trace tag definition
- Created trace_tags.def to centralize TRACE tag definitions
- Each tag includes a symbolic name and description
- Set up enum class TraceTag for type-safe usage in TRACE macros

* Add script to generate Markdown documentation from trace_tags.def
- Python script parses trace_tags.def and outputs trace_tags.md

* Refactor TRACE_NEW to prepend TraceTag and pass enum to is_trace_enabled

* trace: improve trace tag handling system with hierarchical tagging

- Introduce hierarchical tag-class structure: enabling a tag class activates all child tags
- Unify TRACE, STRACE, SCTRACE, and CTRACE under enum TraceTag
- Implement initial version of trace_tag.def using X(tag, tag_class, description)
  (class names and descriptions to be refined in a future update)

* trace: replace all string-based TRACE tags with enum TraceTag
- Migrated all TRACE, STRACE, SCTRACE, and CTRACE macros to use enum TraceTag values instead of raw string literals

* trace : add cstring header

* trace : Add Markdown documentation generation from trace_tags.def via mk_api_doc.py

* trace : rename macro parameter 'class' to 'tag_class' and remove Unicode comment in trace_tags.h.

* trace : Add TODO comment for future implementation of tag_class activation

* trace : Disable code related to tag_class until implementation is ready (#7663).

src/smt/tactic/ctx_solver_simplify_tactic.cpp

@@ -97,7 +97,7 @@ protected:
     void reduce(goal& g) {
         if (m.proofs_enabled())
             return;
-        TRACE("ctx_solver_simplify_tactic", g.display(tout););
+        TRACE(ctx_solver_simplify_tactic, g.display(tout););
         expr_ref fml(m);
         tactic_report report("ctx-solver-simplify", g);
         if (g.inconsistent())
@@ -111,7 +111,7 @@ protected:
         if (!m.inc())
             return;
         SASSERT(m_solver.get_scope_level() == 0);
-        TRACE("ctx_solver_simplify_tactic",
+        TRACE(ctx_solver_simplify_tactic,
               for (expr* f : fmls) {
                   tout << mk_pp(f, m) << "\n";
               }
@@ -127,11 +127,11 @@ protected:
             fml1 = m.mk_not(fml1);
             m_solver.assert_expr(fml1);
             lbool is_sat = m_solver.check();
-            TRACE("ctx_solver_simplify_tactic", tout << "is non-equivalence sat?: " << is_sat << "\n";);
+            TRACE(ctx_solver_simplify_tactic, tout << "is non-equivalence sat?: " << is_sat << "\n";);
             if (is_sat == l_true) {
                 model_ref mdl;
                 m_solver.get_model(mdl);
-                TRACE("ctx_solver_simplify_tactic", 
+                TRACE(ctx_solver_simplify_tactic, 
                       tout << "result is not equivalent to input\n";
                       tout << mk_pp(fml1, m) << "\n";
                       tout << "evaluates to: " << (*mdl)(fml1) << "\n";
@@ -203,7 +203,7 @@ protected:
                 goto done;
             }
             if (m.is_bool(e) && simplify_bool(n, res)) {
-                TRACE("ctx_solver_simplify_tactic",
+                TRACE(ctx_solver_simplify_tactic,
                     m_solver.display(tout) << "\n";
                       tout << "simplified: " << mk_pp(n, m) << "\n" << mk_pp(e, m) << " |-> " << mk_pp(res, m) << "\n";);
                 goto done;