/******************************************************************************
 * Top contributors (to current version):
 *   Andrew Reynolds
 *
 * This file is part of the cvc5 project.
 *
 * Copyright (c) 2009-2025 by the authors listed in the file AUTHORS
 * in the top-level source directory and their institutional affiliations.
 * All rights reserved.  See the file COPYING in the top-level source
 * directory for licensing information.
 * ****************************************************************************
 *
 * The StaticRewrite preprocessing pass.
 */

#include "cvc5_private.h"

#ifndef CVC5__PREPROCESSING__PASSES__STATIC_REWRITE_H
#define CVC5__PREPROCESSING__PASSES__STATIC_REWRITE_H

#include "expr/node.h"
#include "preprocessing/preprocessing_pass.h"
#include "proof/conv_proof_generator.h"
#include "proof/trust_node.h"

namespace cvc5::internal {
namespace preprocessing {
namespace passes {

/**
 * Implements the preprocessing pass for calling ppStaticRewrite on all terms
 * in the input. This is required to be a preprocessing pass since it is not
 * recommended that ppRewrite is called on equalities generated in lemmas (e.g.
 * it may interfere with equality splitting in theory combination).
 */
class StaticRewrite : public PreprocessingPass
{
 public:
  StaticRewrite(PreprocessingPassContext* preprocContext);

 protected:
  PreprocessingPassResult applyInternal(
      AssertionPipeline* assertionsToPreprocess) override;
  /**
   * Rewrite the assertion based on rewriting equalities based on theory
   * specific rewriting.
   * An example is removing arithmetic equalities via:
   *   (= x y) ---> (and (>= x y) (<= x y))
   * Returns the trust node corresponding to the rewrite.
   */
  TrustNode rewriteAssertion(TNode assertion);

 private:
  /** A term conversion proof generator */
  std::unique_ptr<TConvProofGenerator> d_tpg;
};

}  // namespace passes
}  // namespace preprocessing
}  // namespace cvc5::internal

#endif /* CVC5__PREPROCESSING__PASSES__STATIC_PP_REWRITE_H */
