booyah

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

src/tactic/aig/aig.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef AIG_H_
-#define AIG_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "tactic/tactic_exception.h"
@@ -75,4 +74,3 @@ public:
     unsigned get_num_aigs() const;
 };
 
-#endif

src/tactic/aig/aig_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef AIG_TACTIC_H_
-#define AIG_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class tactic;
@@ -26,4 +25,3 @@ 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

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef ADD_BOUNDS_H_
-#define ADD_BOUNDS_H_
+#pragma once
 
 #include "util/params.h"
 
@@ -36,4 +35,3 @@ tactic * mk_add_bounds_tactic(ast_manager & m, params_ref const & p = params_ref
   ADD_PROBE("is-unbounded", "true if the goal contains integer/real constants that do not have lower/upper bounds.", "mk_is_unbounded_probe()")
 */
 
-#endif

src/tactic/arith/arith_bounds_tactic.h

@@ -28,10 +28,8 @@ Notes:
     subsumption of atoms. 
 
 --*/
-#ifndef ARITH_BOUNDS_TACTIC_H_
-#define ARITH_BOUNDS_TACTIC_H_
+#pragma once
 #include "tactic/tactic.h"
 
 tactic * mk_arith_bounds_tactic(ast_manager & m, params_ref const & p = params_ref());
 
-#endif

src/tactic/arith/bound_manager.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BOUND_MANAGER_H_
-#define BOUND_MANAGER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "ast/arith_decl_plugin.h"
@@ -112,4 +111,3 @@ public:
     void display(std::ostream & out) const;
 };
 
-#endif

src/tactic/arith/bound_propagator.h

@@ -17,8 +17,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef BOUND_PROPAGATOR_H_
-#define BOUND_PROPAGATOR_H_
+#pragma once
 
 #include "util/mpq.h"
 #include "util/vector.h"
@@ -262,4 +261,3 @@ public:
     unsigned get_num_propagations() const { return m_propagations; }
 };
 
-#endif

src/tactic/arith/bv2int_rewriter.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BV2INT_REWRITER_H_
-#define BV2INT_REWRITER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "ast/rewriter/rewriter.h"
@@ -119,4 +118,3 @@ public:
         m_cfg(m, ctx) {}
 };
 
-#endif

src/tactic/arith/bv2real_rewriter.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BV2REAL_REWRITER_H_
-#define BV2REAL_REWRITER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "ast/rewriter/rewriter.h"
@@ -230,4 +229,3 @@ public:
         m_cfg(u) {}
 };
 
-#endif

src/tactic/arith/card2bv_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef CARD2BV_TACTIC_H_
-#define CARD2BV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 #include "ast/pb_decl_plugin.h"
@@ -108,4 +107,3 @@ tactic * mk_card2bv_tactic(ast_manager & m, params_ref const & p = params_ref())
 */
 
 
-#endif

src/tactic/arith/degree_shift_tactic.h

@@ -19,8 +19,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef DEGREE_SHIFT_TACTIC_H_
-#define DEGREE_SHIFT_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -32,4 +31,3 @@ tactic * mk_degree_shift_tactic(ast_manager & m, params_ref const & p = params_r
   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

@@ -20,8 +20,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef DIFF_NEQ_TACTIC_H_
-#define DIFF_NEQ_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -31,4 +30,3 @@ 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 numeral, and all constants are bounded.", "mk_diff_neq_tactic(m, p)")
 */
-#endif

src/tactic/arith/eq2bv_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef EQ2BV_TACTIC_H_
-#define EQ2BV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -31,4 +30,3 @@ tactic * mk_eq2bv_tactic(ast_manager & m);
 */
 
 
-#endif

src/tactic/arith/factor_tactic.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef FACTOR_TACTIC_H_
-#define FACTOR_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -27,4 +26,3 @@ 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

@@ -21,8 +21,7 @@ Author:
 Notes:
 
 --*/
-#ifndef FIX_DL_VAR_TACTIC_H_
-#define FIX_DL_VAR_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -34,4 +33,3 @@ 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

@@ -21,8 +21,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef FM_TACTIC_H_
-#define FM_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -33,4 +32,3 @@ 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/lia2card_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef LIA2CARD_TACTIC_H_
-#define LIA2CARD_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -32,4 +31,3 @@ tactic * mk_lia2card_tactic(ast_manager & m, params_ref const & p = params_ref()
 
 bool get_pb_sum(expr* term, expr_ref_vector& args, vector<rational>& coeffs, rational& coeff);
 
-#endif

src/tactic/arith/lia2pb_tactic.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef LIA2PB_TACTIC_H_
-#define LIA2PB_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -28,4 +27,3 @@ 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/linear_equation.h

@@ -18,8 +18,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef LINEAR_EQUATION_H_
-#define LINEAR_EQUATION_H_
+#pragma once
 
 #include "util/mpq.h"
 #include "util/small_object_allocator.h"
@@ -82,4 +81,3 @@ public:
     void display(std::ostream & out, linear_equation const & eq) const;
 };
 
-#endif

src/tactic/arith/nla2bv_tactic.h

@@ -17,8 +17,7 @@ Notes:
     Ported to tactic framework on 2012-02-28
 
 --*/
-#ifndef NLA2BV_TACTIC_H_
-#define NLA2BV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -29,5 +28,4 @@ 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/normalize_bounds_tactic.h

@@ -18,8 +18,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef NORMALIZE_BOUNDS_TACTIC_H_
-#define NORMALIZE_BOUNDS_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -31,4 +30,3 @@ tactic * mk_normalize_bounds_tactic(ast_manager & m, params_ref const & p = para
   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/arith/pb2bv_model_converter.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef PB2BV_MODEL_CONVERTER_H_
-#define PB2BV_MODEL_CONVERTER_H_
+#pragma once
 
 #include "tactic/model_converter.h"
 #include "tactic/arith/bound_manager.h"
@@ -37,4 +36,3 @@ public:
     model_converter * translate(ast_translation & translator) override;
 };
 
-#endif

src/tactic/arith/pb2bv_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef PB2BV_TACTIC_H_
-#define PB2BV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -34,4 +33,3 @@ probe * mk_is_pb_probe();
   ADD_PROBE("is-pb", "true if the goal is a pseudo-boolean problem.", "mk_is_pb_probe()")
 */
 
-#endif

src/tactic/arith/probe_arith.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef PROBE_ARITH_H_
-#define PROBE_ARITH_H_
+#pragma once
 
 class probe;
 probe * mk_arith_avg_bw_probe();
@@ -68,4 +67,3 @@ probe * mk_is_qfufnra_probe();
   ADD_PROBE("is-lira", "true if the goal is in LIRA (linear integer and real arithmetic, formula may have quantifiers).", "mk_is_lira_probe()")
   ADD_PROBE("is-qfufnra", "true if the goal is QF_UFNRA (quantifier-free nonlinear real arithmetic with other theories).", "mk_is_qfufnra_probe()")
 */
-#endif

src/tactic/arith/propagate_ineqs_tactic.h

@@ -30,8 +30,7 @@ Author:
 Notes:
 
 --*/
-#ifndef PROPAGATE_INEQS_TACTIC_H_
-#define PROPAGATE_INEQS_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -42,4 +41,3 @@ tactic * mk_propagate_ineqs_tactic(ast_manager & m, params_ref const & p = param
   ADD_TACTIC("propagate-ineqs", "propagate ineqs/bounds, remove subsumed inequalities.", "mk_propagate_ineqs_tactic(m, p)")
 */
 
-#endif

src/tactic/arith/purify_arith_tactic.h

@@ -45,8 +45,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef PURIFY_ARITH_TACTIC_H_
-#define PURIFY_ARITH_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -58,5 +57,4 @@ tactic * mk_purify_arith_tactic(ast_manager & m, params_ref const & p = params_r
   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

@@ -30,8 +30,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef RECOVER_01_TACTIC_H_
-#define RECOVER_01_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -42,4 +41,3 @@ 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

src/tactic/bv/bit_blaster_model_converter.h

@@ -16,12 +16,10 @@ Author:
 Notes:
 
 --*/
-#ifndef BIT_BLASTER_MODEL_CONVERTER_H_
-#define BIT_BLASTER_MODEL_CONVERTER_H_
+#pragma once
 
 #include "tactic/model_converter.h"
 
 model_converter * mk_bit_blaster_model_converter(ast_manager & m, obj_map<func_decl, expr*> const & const2bits, ptr_vector<func_decl> const& newbits);
 model_converter * mk_bv1_blaster_model_converter(ast_manager & m, obj_map<func_decl, expr*> const & const2bits, ptr_vector<func_decl> const& newbits);
 
-#endif

src/tactic/bv/bit_blaster_tactic.h

@@ -16,8 +16,7 @@ Copyright (c) 2011 Microsoft Corporation
  Notes:
  
  --*/
-#ifndef BIT_BLASTER_TACTIC_H_
-#define BIT_BLASTER_TACTIC_H_
+#pragma once
  
 #include "util/params.h"
 #include "ast/rewriter/bit_blaster/bit_blaster_rewriter.h"
@@ -29,5 +28,4 @@ tactic * mk_bit_blaster_tactic(ast_manager & m, bit_blaster_rewriter* rw, params
  /*
   ADD_TACTIC("bit-blast", "reduce bit-vector expressions into SAT.", "mk_bit_blaster_tactic(m, p)")
  */
- #endif
 

src/tactic/bv/bv1_blaster_tactic.h

@@ -22,8 +22,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BV1_BLASTER_TACTIC_H_
-#define BV1_BLASTER_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -35,4 +34,3 @@ probe * mk_is_qfbv_eq_probe();
   ADD_TACTIC("bv1-blast", "reduce bit-vector expressions into bit-vectors of size 1 (notes: only equality, extract and concat are supported).", "mk_bv1_blaster_tactic(m, p)")
   ADD_PROBE("is-qfbv-eq", "true if the goal is in a fragment of QF_BV which uses only =, extract, concat.", "mk_is_qfbv_eq_probe()")
 */
-#endif

src/tactic/bv/bv_bound_chk_tactic.h

@@ -14,8 +14,7 @@
 
  Revision History:
  --*/
-#ifndef BV_BOUND_CHK_TACTIC_H_
-#define BV_BOUND_CHK_TACTIC_H_
+#pragma once
 
 #include "tactic/tactical.h"
 #include "util/params.h"
@@ -27,4 +26,3 @@ tactic* mk_bv_bound_chk_tactic(ast_manager & m, params_ref const & p = params_re
   ADD_TACTIC("bv_bound_chk", "attempts to detect inconsistencies of bounds on bv expressions.", "mk_bv_bound_chk_tactic(m, p)")
 */
 
-#endif /* BV_BOUND_CHK_TACTIC_H_*/

src/tactic/bv/bv_bounds_tactic.h

@@ -16,8 +16,7 @@ Author:
 
 
 --*/
-#ifndef BV_BOUNDS_TACTIC_H_
-#define BV_BOUNDS_TACTIC_H_
+#pragma once
 #include "tactic/tactic.h"
 
 tactic * mk_bv_bounds_tactic(ast_manager & m, params_ref const & p = params_ref());
@@ -33,4 +32,3 @@ tactic * mk_dom_bv_bounds_tactic(ast_manager & m, params_ref const & p = params_
 
 */
 
-#endif

src/tactic/bv/bvarray2uf_rewriter.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BVARRAY2UF_REWRITER_H_
-#define BVARRAY2UF_REWRITER_H_
+#pragma once
 
 #include "ast/rewriter/rewriter.h"
 #include "tactic/generic_model_converter.h"
@@ -80,5 +79,4 @@ struct bvarray2uf_rewriter : public rewriter_tpl<bvarray2uf_rewriter_cfg> {
     void set_mcs(generic_model_converter * fmc) { m_cfg.set_mcs(fmc); }
 };
 
-#endif
 

src/tactic/bv/bvarray2uf_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BV_ARRAY2UF_TACTIC_H_
-#define BV_ARRAY2UF_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -30,4 +29,3 @@ tactic * mk_bvarray2uf_tactic(ast_manager & m, params_ref const & p = params_ref
 */
 
 
-#endif

src/tactic/bv/dt2bv_tactic.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef DT2BV_TACTIC_H_
-#define DT2BV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 #include "util/obj_hashtable.h"
@@ -30,4 +29,3 @@ tactic * mk_dt2bv_tactic(ast_manager & m, params_ref const & p = params_ref());
     ADD_TACTIC("dt2bv", "eliminate finite domain data-types. Replace by bit-vectors.", "mk_dt2bv_tactic(m, p)")
 */
 
-#endif

src/tactic/bv/max_bv_sharing_tactic.h

@@ -19,8 +19,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef MAX_BV_SHARING_TACTIC_H_
-#define MAX_BV_SHARING_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -31,5 +30,4 @@ tactic * mk_max_bv_sharing_tactic(ast_manager & m, params_ref const & p = params
   ADD_TACTIC("max-bv-sharing", "use heuristics to maximize the sharing of bit-vector expressions such as adders and multipliers.", "mk_max_bv_sharing_tactic(m, p)")
 */
 
-#endif
 

src/tactic/converter.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef CONVERTER_H_
-#define CONVERTER_H_
+#pragma once
 
 #include "util/vector.h"
 #include "util/ref.h"
@@ -124,5 +123,4 @@ public:
     }
 };
 
-#endif
 

src/tactic/core/blast_term_ite_tactic.h

@@ -20,8 +20,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BLAST_TERM_ITE_TACTIC_H_
-#define BLAST_TERM_ITE_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -35,4 +34,3 @@ tactic * mk_blast_term_ite_tactic(ast_manager & m, params_ref const & p = params
 
 void blast_term_ite(expr_ref& fml, unsigned max_inflation);
 
-#endif

src/tactic/core/cofactor_elim_term_ite.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef COFACTOR_ELIM_TERM_ITE_H_
-#define COFACTOR_ELIM_TERM_ITE_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "util/params.h"
@@ -39,4 +38,3 @@ public:
 
 };
 
-#endif

src/tactic/core/cofactor_term_ite_tactic.h

@@ -17,8 +17,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef COFACTOR_TERM_ITE_TACTIC_H_
-#define COFACTOR_TERM_ITE_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -29,4 +28,3 @@ tactic * mk_cofactor_term_ite_tactic(ast_manager & m, params_ref const & p = par
   ADD_TACTIC("cofactor-term-ite", "eliminate term if-the-else using cofactors.", "mk_cofactor_term_ite_tactic(m, p)")
 */
 
-#endif

src/tactic/core/collect_occs.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef COLLECT_OCCS_H_
-#define COLLECT_OCCS_H_
+#pragma once
 
 class collect_occs {
     expr_fast_mark1  m_visited;
@@ -35,4 +34,3 @@ public:
 
 };
 
-#endif

src/tactic/core/collect_statistics_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef COLLECT_STATISTICS_H_
-#define COLLECT_STATISTICS_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -30,4 +29,3 @@ tactic * mk_collect_statistics_tactic(ast_manager & m, params_ref const & p = pa
 */
 
 
-#endif

src/tactic/core/ctx_simplify_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef CTX_SIMPLIFY_TACTIC_H_
-#define CTX_SIMPLIFY_TACTIC_H_
+#pragma once
 
 #include "tactic/tactical.h"
 #include "tactic/goal_num_occurs.h"
@@ -65,4 +64,3 @@ tactic * mk_ctx_simplify_tactic(ast_manager & m, params_ref const & p = params_r
   ADD_TACTIC("ctx-simplify", "apply contextual simplification rules.", "mk_ctx_simplify_tactic(m, p)")
 */
 
-#endif

src/tactic/core/der_tactic.h

@@ -14,8 +14,7 @@ Author:
     Leonardo de Moura (leonardo) 2012-10-20
 
 --*/
-#ifndef DER_TACTIC_H_
-#define DER_TACTIC_H_
+#pragma once
 
 class ast_manager;
 class tactic;
@@ -26,4 +25,3 @@ tactic * mk_der_tactic(ast_manager & m);
   ADD_TACTIC("der", "destructive equality resolution.", "mk_der_tactic(m)")
 */
 
-#endif /* DER_TACTIC_H_ */

src/tactic/core/distribute_forall_tactic.h

@@ -14,8 +14,7 @@ Author:
     Leonardo de Moura (leonardo) 2012-02-18.
 
 --*/
-#ifndef DISTRIBUTE_FORALL_TACTIC_H_
-#define DISTRIBUTE_FORALL_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -27,4 +26,3 @@ 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/dom_simplify_tactic.h

@@ -18,8 +18,7 @@ Notes:
 
 --*/
 
-#ifndef DOM_SIMPLIFY_TACTIC_H_
-#define DOM_SIMPLIFY_TACTIC_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "ast/expr_substitution.h"
@@ -148,4 +147,3 @@ tactic * mk_dom_simplify_tactic(ast_manager & m, params_ref const & p = params_r
 ADD_TACTIC("dom-simplify", "apply dominator simplification rules.", "mk_dom_simplify_tactic(m, p)")
 */
 
-#endif

src/tactic/core/elim_term_ite_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef ELIM_TERM_ITE_TACTIC_H_
-#define ELIM_TERM_ITE_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -30,4 +29,3 @@ tactic * mk_elim_term_ite_tactic(ast_manager & m, params_ref const & p = params_
     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/injectivity_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef INJECTIVITY_TACTIC_H_
-#define INJECTIVITY_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -29,4 +28,3 @@ tactic * mk_injectivity_tactic(ast_manager & m, params_ref const & p = params_re
   ADD_TACTIC("injectivity",  "Identifies and applies injectivity axioms.", "mk_injectivity_tactic(m, p)")
 */
 
-#endif

src/tactic/core/nnf_tactic.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef NNF_TACTIC_H_
-#define NNF_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -31,5 +30,4 @@ tactic * mk_nnf_tactic(ast_manager & m, params_ref const & p = params_ref());
   ADD_TACTIC("nnf", "put goal in negation normal form.", "mk_nnf_tactic(m, p)")
 */
 
-#endif
 

src/tactic/core/occf_tactic.h

@@ -21,8 +21,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef OCCF_TACTIC_H_
-#define OCCF_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -34,5 +33,4 @@ 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/pb_preprocess_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef PB_PREPROCESS_TACTIC_H_
-#define PB_PREPROCESS_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -31,4 +30,3 @@ tactic * mk_pb_preprocess_tactic(ast_manager & m, params_ref const & p = params_
 */
 
 
-#endif

src/tactic/core/reduce_args_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef REDUCE_ARGS_TACTIC_H_
-#define REDUCE_ARGS_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -28,4 +27,3 @@ tactic * mk_reduce_args_tactic(ast_manager & m, params_ref const & p = params_re
   ADD_TACTIC("reduce-args", "reduce the number of arguments of function applications, when for all occurrences of a function f the i-th is a value.", "mk_reduce_args_tactic(m, p)")
 */
 
-#endif

src/tactic/core/simplify_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef SIMPLIFY_TACTIC_H_
-#define SIMPLIFY_TACTIC_H_
+#pragma once
 
 #include "tactic/tactic.h"
 #include "tactic/tactical.h"
@@ -54,4 +53,3 @@ tactic * mk_elim_and_tactic(ast_manager & m, params_ref const & p = params_ref()
   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

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef SOLVE_EQS_TACTIC_H_
-#define SOLVE_EQS_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -30,5 +29,4 @@ tactic * mk_solve_eqs_tactic(ast_manager & m, params_ref const & p = params_ref(
   ADD_TACTIC("solve-eqs", "eliminate variables by solving equations.", "mk_solve_eqs_tactic(m, p)")
 */
 
-#endif
 

src/tactic/core/special_relations_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef SPECIAL_RELATIONS_TACTIC_H_
-#define SPECIAL_RELATIONS_TACTIC_H_
+#pragma once
 
 #include "tactic/tactic.h"
 #include "tactic/tactical.h"
@@ -69,4 +68,3 @@ tactic * mk_special_relations_tactic(ast_manager & m, params_ref const & p = par
   ADD_TACTIC("special-relations", "detect and replace by special relations.", "mk_special_relations_tactic(m, p)")
 */
 
-#endif

src/tactic/core/split_clause_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef SPLIT_CLAUSE_TACTIC_H_
-#define SPLIT_CLAUSE_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class tactic;
@@ -29,4 +28,3 @@ 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

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef SYMMETRY_REDUCE_TACTIC_H_
-#define SYMMETRY_REDUCE_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -29,4 +28,3 @@ 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/core/tseitin_cnf_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef TSEITIN_CNF_TACTIC_H_
-#define TSEITIN_CNF_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -33,4 +32,3 @@ tactic * mk_tseitin_cnf_tactic(ast_manager & m, params_ref const & p = params_re
   ADD_TACTIC("tseitin-cnf-core", "convert goal into CNF using tseitin-like encoding (note: quantifiers are ignored). This tactic does not apply required simplifications to the input goal like the tseitin-cnf tactic.", "mk_tseitin_cnf_core_tactic(m, p)")
 */
 
-#endif

src/tactic/dependency_converter.h

@@ -17,8 +17,7 @@ Notes:
 
 
 --*/
-#ifndef DEPENDENCY_CONVERTER_H_
-#define DEPENDENCY_CONVERTER_H_
+#pragma once
 
 #include "util/ref.h"
 #include "ast/ast_pp_util.h"
@@ -44,4 +43,3 @@ typedef ref<dependency_converter> dependency_converter_ref;
 typedef sref_vector<dependency_converter> dependency_converter_ref_vector;
 typedef sref_buffer<dependency_converter> dependency_converter_ref_buffer;
 
-#endif

src/tactic/equiv_proof_converter.h

@@ -21,8 +21,7 @@ Revision History:
 
 --*/
 
-#ifndef EQUIV_PROOF_CONVERTER_H_
-#define EQUIV_PROOF_CONVERTER_H_
+#pragma once
 
 #include "tactic/replace_proof_converter.h"
 
@@ -50,4 +49,3 @@ public:
     void display(std::ostream & out) override {}
 };
 
-#endif

src/tactic/fd_solver/bounded_int2bv_solver.h

@@ -16,8 +16,7 @@ Author:
 Notes:
    
 --*/
-#ifndef BOUNDED_INT2BV_SOLVER_H_
-#define BOUNDED_INT2BV_SOLVER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "util/params.h"
@@ -26,4 +25,3 @@ class solver;
 
 solver * mk_bounded_int2bv_solver(ast_manager & m, params_ref const & p, solver* s);
 
-#endif

src/tactic/fd_solver/enum2bv_solver.h

@@ -16,8 +16,7 @@ Author:
 Notes:
    
 --*/
-#ifndef ENUM2BV_SOLVER_H_
-#define ENUM2BV_SOLVER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "util/params.h"
@@ -26,4 +25,3 @@ class solver;
 
 solver * mk_enum2bv_solver(ast_manager & m, params_ref const & p, solver* s);
 
-#endif

src/tactic/fd_solver/fd_solver.h

@@ -16,8 +16,7 @@ Author:
 Notes:
    
 --*/
-#ifndef FD_SOLVER_H_
-#define FD_SOLVER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "util/params.h"
@@ -34,4 +33,3 @@ tactic * mk_parallel_qffd_tactic(ast_manager& m, params_ref const& p);
     ADD_TACTIC("pqffd", "builtin strategy for solving QF_FD problems in parallel.", "mk_parallel_qffd_tactic(m, p)")
 */
 
-#endif

src/tactic/fd_solver/pb2bv_solver.h

@@ -16,8 +16,7 @@ Author:
 Notes:
    
 --*/
-#ifndef PB2BV_SOLVER_H_
-#define PB2BV_SOLVER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "util/params.h"
@@ -26,4 +25,3 @@ class solver;
 
 solver * mk_pb2bv_solver(ast_manager & m, params_ref const & p, solver* s);
 
-#endif

src/tactic/fd_solver/smtfd_solver.h

@@ -16,8 +16,7 @@ Author:
 Notes:
    
 --*/
-#ifndef SMTFD_SOLVER_H_
-#define SMTFD_SOLVER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "util/params.h"
@@ -32,4 +31,3 @@ tactic * mk_smtfd_tactic(ast_manager & m, params_ref const & p);
     ADD_TACTIC("smtfd", "builtin strategy for solving SMT problems by reduction to FD.", "mk_smtfd_tactic(m, p)")
 */
 
-#endif

src/tactic/filter_model_converter.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef FILTER_MODEL_CONVERTER_H_
-#define FILTER_MODEL_CONVERTER_H_
+#pragma once
 
 #include "tactic/model_converter.h"
 
@@ -49,4 +48,3 @@ public:
 
 typedef ref<filter_model_converter> filter_model_converter_ref;
 
-#endif

src/tactic/fpa/fpa2bv_model_converter.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef FPA2BV_MODEL_CONVERTER_H_
-#define FPA2BV_MODEL_CONVERTER_H_
+#pragma once
 
 #include "ast/fpa/fpa2bv_converter.h"
 #include "tactic/model_converter.h"
@@ -58,4 +57,3 @@ protected:
 
 model_converter * mk_fpa2bv_model_converter(ast_manager & m, fpa2bv_converter & conv);
 
-#endif

src/tactic/fpa/fpa2bv_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef FPA2BV_TACTIC_H_
-#define FPA2BV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -28,4 +27,3 @@ tactic * mk_fpa2bv_tactic(ast_manager & m, params_ref const & p = params_ref());
   ADD_TACTIC("fpa2bv", "convert floating point numbers to bit-vectors.", "mk_fpa2bv_tactic(m, p)")
 */
 
-#endif

src/tactic/fpa/qffp_tactic.h

@@ -17,8 +17,7 @@ Notes:
 
 
 --*/
-#ifndef QFFP_TACTIC_H_
-#define QFFP_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -38,4 +37,3 @@ probe * mk_is_qffpbv_probe();
   ADD_PROBE("is-qffpbv", "true if the goal is in QF_FPBV (floats+bit-vectors).", "mk_is_qffpbv_probe()")
 */
 
-#endif

src/tactic/fpa/qffplra_tactic.h

@@ -18,8 +18,7 @@ Notes:
 
 
 --*/
-#ifndef QFFPLRA_TACTIC_H_
-#define QFFPLRA_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -35,4 +34,3 @@ probe * mk_is_qffplra_probe();
 ADD_PROBE("is-qffplra", "true if the goal is in QF_FPLRA.", "mk_is_qffplra_probe()")
 */
 
-#endif

src/tactic/generic_model_converter.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef GENERIC_MODEL_CONVERTER_H_
-#define GENERIC_MODEL_CONVERTER_H_
+#pragma once
 
 #include "tactic/model_converter.h"
 
@@ -70,4 +69,3 @@ public:
 
 typedef ref<generic_model_converter> generic_model_converter_ref;
 
-#endif

src/tactic/goal.h

@@ -25,8 +25,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef GOAL_H_
-#define GOAL_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "ast/ast_translation.h"
@@ -208,4 +207,3 @@ bool test(goal const & g) {
     return test(g, proc);
 }
 
-#endif

src/tactic/goal_num_occurs.h

@@ -15,8 +15,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef GOAL_NUM_OCCURS_H_
-#define GOAL_NUM_OCCURS_H_
+#pragma once
 
 #include "ast/num_occurs.h"
 
@@ -35,4 +34,3 @@ public:
 };
 
 
-#endif

src/tactic/goal_shared_occs.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef GOAL_SHARED_OCCS_H_
-#define GOAL_SHARED_OCCS_H_
+#pragma once
 
 #include "tactic/goal.h"
 #include "ast/shared_occs.h"
@@ -42,4 +41,3 @@ public:
 };
 
 
-#endif

src/tactic/goal_util.h

@@ -16,10 +16,8 @@ Author:
 Revision History:
 
 --*/
-#ifndef GOAL_UTIL_H_
-#define GOAL_UTIL_H_
+#pragma once
 
 class goal;
 bool has_term_ite(goal const & g);
 
-#endif

src/tactic/horn_subsume_model_converter.h

@@ -32,8 +32,7 @@ Subsumption transformation (remove Horn clause):
 
 --*/
 
-#ifndef HORN_SUBSUME_MODEL_CONVERTER_H_
-#define HORN_SUBSUME_MODEL_CONVERTER_H_
+#pragma once
 
 #include "tactic/model_converter.h"
 #include "ast/rewriter/th_rewriter.h"
@@ -85,4 +84,3 @@ public:
 
 };
 
-#endif

src/tactic/model_converter.h

@@ -52,8 +52,7 @@ Notes:
     that are required to interpret G fully in the context of F_s.
 
 --*/
-#ifndef MODEL_CONVERTER_H_
-#define MODEL_CONVERTER_H_
+#pragma once
 
 #include "util/ref.h"
 #include "ast/ast_pp_util.h"
@@ -107,4 +106,3 @@ void model_converter2model(ast_manager & mng, model_converter * mc, model_ref &
 void apply(model_converter_ref & mc, model_ref & m);
 
 
-#endif

src/tactic/portfolio/default_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef DEFAULT_TACTIC_H_
-#define DEFAULT_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -29,4 +28,3 @@ tactic * mk_default_tactic(ast_manager & m, params_ref const & p = params_ref())
 ADD_TACTIC("default", "default strategy used when no logic is specified.", "mk_default_tactic(m, p)")
 */
 
-#endif

src/tactic/portfolio/solver2lookahead.h

@@ -16,11 +16,9 @@ Author:
 Notes:
    
 --*/
-#ifndef SOLVER2LOOKAHEAD_H_
-#define SOLVER2LOOKAHEAD_H_
+#pragma once
 
 class solver;
 
 solver * mk_solver2lookahead(solver* s);
 
-#endif

src/tactic/probe.h

@@ -21,8 +21,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef PROBE_H_
-#define PROBE_H_
+#pragma once
 
 #include "tactic/goal.h"
 
@@ -126,4 +125,3 @@ probe * mk_is_qfufbv_probe();
   ADD_PROBE("is-qfaufbv", "true if the goal is in QF_AUFBV.", "mk_is_qfaufbv_probe()")
 */
 
-#endif

src/tactic/proof_converter.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef PROOF_CONVERTER_H_
-#define PROOF_CONVERTER_H_
+#pragma once
 
 #include "ast/ast.h"
 #include "util/ref.h"
@@ -50,4 +49,3 @@ void apply(ast_manager & m, proof_converter * pc, proof_ref & pr);
 
 proof_ref apply(ast_manager & m, proof_converter_ref & pc1, proof_converter_ref_buffer & pc2s);
 
-#endif

src/tactic/replace_proof_converter.h

@@ -20,8 +20,7 @@ Revision History:
 
 --*/
 
-#ifndef REPLACE_PROOF_CONVERTER_H_
-#define REPLACE_PROOF_CONVERTER_H_
+#pragma once
 
 #include "tactic/proof_converter.h"
 
@@ -49,4 +48,3 @@ public:
 
 };
 
-#endif

src/tactic/sine_filter.h

@@ -16,8 +16,7 @@ Author:
 Revision History:
 
 --*/
-#ifndef SINE_TACTIC_H_
-#define SINE_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -29,4 +28,3 @@ tactic * mk_sine_tactic(ast_manager & m, params_ref const & p = params_ref());
     ADD_TACTIC("sine-filter", "eliminate premises using Sine Qua Non", "mk_sine_tactic(m, p)")
 */
 
-#endif

src/tactic/sls/bvsls_opt_engine.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef BVSLS_OPT_ENGINE_H_
-#define BVSLS_OPT_ENGINE_H_
+#pragma once
 
 #include "tactic/sls/sls_engine.h"
 
@@ -79,4 +78,3 @@ protected:
     bool randomize_wrt_hard();
 };
 
-#endif

src/tactic/sls/sls_engine.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef SLS_ENGINE_H_
-#define SLS_ENGINE_H_
+#pragma once
 
 #include "util/stopwatch.h"
 #include "util/lbool.h"
@@ -138,4 +137,3 @@ protected:
     unsigned check_restart(unsigned curr_value);
 };
 
-#endif

src/tactic/sls/sls_evaluator.h

@@ -17,8 +17,7 @@ Notes:
 
 --*/
 
-#ifndef SLS_EVALUATOR_H_
-#define SLS_EVALUATOR_H_
+#pragma once
 
 #include "model/model_evaluator.h"
 
@@ -820,4 +819,3 @@ public:
     } 
 };
 
-#endif

src/tactic/sls/sls_powers.h

@@ -17,8 +17,7 @@ Notes:
 
 --*/
 
-#ifndef SLS_POWERS_H_
-#define SLS_POWERS_H_
+#pragma once
 
 #include "util/mpz.h"
 
@@ -46,4 +45,3 @@ public:
     }
 };  
 
-#endif

src/tactic/sls/sls_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef SLS_TACTIC_H_
-#define SLS_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -29,4 +28,3 @@ tactic * mk_qfbv_sls_tactic(ast_manager & m, params_ref const & p = params_ref()
   ADD_TACTIC("qfbv-sls", "(try to) solve using stochastic local search for QF_BV.", "mk_qfbv_sls_tactic(m, p)")
 */
 
-#endif

src/tactic/sls/sls_tracker.h

@@ -17,8 +17,7 @@ Notes:
 
 --*/
 
-#ifndef SLS_TRACKER_H_
-#define SLS_TRACKER_H_
+#pragma once
 
 #include<math.h>
 #include "ast/for_each_expr.h"
@@ -1108,4 +1107,3 @@ public:
     }
 };
 
-#endif

src/tactic/smtlogics/nra_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef NRA_TACTIC_H_
-#define NRA_TACTIC_H_
+#pragma once
 
 tactic * mk_nra_tactic(ast_manager & m, params_ref const & p = params_ref());
 
@@ -25,4 +24,3 @@ tactic * mk_nra_tactic(ast_manager & m, params_ref const & p = params_ref());
 ADD_TACTIC("nra", "builtin strategy for solving NRA problems.", "mk_nra_tactic(m, p)")
 */
 
-#endif

src/tactic/smtlogics/qfaufbv_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef QFAUFBV_TACTIC_H_
-#define QFAUFBV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -29,4 +28,3 @@ tactic * mk_qfaufbv_tactic(ast_manager & m, params_ref const & p = params_ref())
   ADD_TACTIC("qfaufbv",  "builtin strategy for solving QF_AUFBV problems.", "mk_qfaufbv_tactic(m, p)")
 */
 
-#endif

src/tactic/smtlogics/qfauflia_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef QFAUFLIA_TACTIC_H_
-#define QFAUFLIA_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -29,4 +28,3 @@ tactic * mk_qfauflia_tactic(ast_manager & m, params_ref const & p = params_ref()
   ADD_TACTIC("qfauflia",  "builtin strategy for solving QF_AUFLIA problems.", "mk_qfauflia_tactic(m, p)")
 */
 
-#endif

src/tactic/smtlogics/qfbv_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef QFBV_TACTIC_H_
-#define QFBV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -33,4 +32,3 @@ tactic * mk_qfbv_preamble(ast_manager& m, params_ref const& p);
 
 tactic * mk_qfbv_tactic(ast_manager & m, params_ref const & p, tactic* sat, tactic* smt);
 
-#endif

src/tactic/smtlogics/qfidl_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef QFIDL_TACTIC_H_
-#define QFIDL_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -29,4 +28,3 @@ tactic * mk_qfidl_tactic(ast_manager & m, params_ref const & p = params_ref());
     ADD_TACTIC("qfidl", "builtin strategy for solving QF_IDL problems.", "mk_qfidl_tactic(m, p)")
 */
 
-#endif

src/tactic/smtlogics/qflia_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef QFLIA_TACTIC_H_
-#define QFLIA_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -37,4 +36,3 @@ probe * mk_is_quasi_pb_probe();
   ADD_PROBE("is-quasi-pb", "true if the goal is quasi-pb.", "mk_is_quasi_pb_probe()")
 */
 
-#endif

src/tactic/smtlogics/qflra_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef QFLRA_TACTIC_H_
-#define QFLRA_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -28,4 +27,3 @@ tactic * mk_qflra_tactic(ast_manager & m, params_ref const & p = params_ref());
   ADD_TACTIC("qflra", "builtin strategy for solving QF_LRA problems.", "mk_qflra_tactic(m, p)")
 */
 
-#endif

src/tactic/smtlogics/qfnia_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef QFNIA_TACTIC_H_
-#define QFNIA_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -28,4 +27,3 @@ tactic * mk_qfnia_tactic(ast_manager & m, params_ref const & p = params_ref());
   ADD_TACTIC("qfnia", "builtin strategy for solving QF_NIA problems.", "mk_qfnia_tactic(m, p)")
 */
 
-#endif

src/tactic/smtlogics/qfnra_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef QFNRA_TACTIC_H_
-#define QFNRA_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -28,4 +27,3 @@ tactic * mk_qfnra_tactic(ast_manager & m, params_ref const & p = params_ref());
   ADD_TACTIC("qfnra", "builtin strategy for solving QF_NRA problems.", "mk_qfnra_tactic(m, p)")
 */
 
-#endif

src/tactic/smtlogics/qfuf_tactic.h

@@ -17,8 +17,7 @@ Author:
 Notes:
 
 --*/
-#ifndef QFUF_TACTIC_H_
-#define QFUF_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -30,4 +29,3 @@ tactic * mk_qfuf_tactic(ast_manager & m, params_ref const & p);
   ADD_TACTIC("qfuf", "builtin strategy for solving QF_UF problems.", "mk_qfuf_tactic(m, p)")
 */
 
-#endif

src/tactic/smtlogics/qfufbv_ackr_model_converter.h

@@ -14,12 +14,10 @@
 
  Revision History:
  --*/
-#ifndef QFUFBV_ACKR_MODEL_CONVERTER_H_
-#define QFUFBV_ACKR_MODEL_CONVERTER_H_
+#pragma once
 
 #include "tactic/model_converter.h"
 #include "ackermannization/ackr_info.h"
 
 model_converter * mk_qfufbv_ackr_model_converter(ast_manager & m, const ackr_info_ref& info, model_ref& abstr_model);
 
-#endif /* QFUFBV_ACKR_MODEL_CONVERTER_H_ */

src/tactic/smtlogics/qfufbv_tactic.h

@@ -16,8 +16,7 @@ Author:
 Notes:
 
 --*/
-#ifndef QFUFBV_TACTIC_H_
-#define QFUFBV_TACTIC_H_
+#pragma once
 
 #include "util/params.h"
 class ast_manager;
@@ -32,4 +31,3 @@ tactic * mk_qfufbv_ackr_tactic(ast_manager & m, params_ref const & p);
   ADD_TACTIC("qfufbv_ackr", "A tactic for solving QF_UFBV based on Ackermannization.", "mk_qfufbv_ackr_tactic(m, p)")
 */
 
-#endif