1 files changed, 0 insertions, 154 deletions
diff --git a/src/proof/lfsc_proof_printer.h b/src/proof/lfsc_proof_printer.h
deleted file mode 100644
index 62547676f..000000000
--- a/src/proof/lfsc_proof_printer.h
+++ /dev/null
@@ -1,154 +0,0 @@
-/*********************                                                        */
-/*! \file lfsc_proof_printer.h
- ** \verbatim
- ** Top contributors (to current version):
- **   Andres Noetzli, Alex Ozdemir, Mathias Preiner
- ** This file is part of the CVC4 project.
- ** Copyright (c) 2009-2020 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.\endverbatim
- **
- ** \brief Prints proofs in the LFSC format
- **
- ** Prints proofs in the LFSC format.
- **/
-
-#include "cvc4_private.h"
-
-#ifndef CVC4__PROOF__LFSC_PROOF_PRINTER_H
-#define CVC4__PROOF__LFSC_PROOF_PRINTER_H
-
-#include <iosfwd>
-#include <string>
-#include <vector>
-
-#include "proof/clause_id.h"
-#include "proof/proof_manager.h"
-#include "proof/sat_proof.h"
-#include "proof/sat_proof_implementation.h"
-#include "util/proof.h"
-
-namespace CVC4 {
-namespace proof {
-
-class LFSCProofPrinter
-{
- public:
-  /**
-   * Prints the resolution proof for an assumption conflict.
-   *
-   * @param satProof The record of the reasoning done by the SAT solver
-   * @param id The clause to print a proof for
-   * @param out The stream to print to
-   * @param paren A stream for the closing parentheses
-   */
-  template <class Solver>
-  static void printAssumptionsResolution(TSatProof<Solver>* satProof,
-                                         ClauseId id,
-                                         std::ostream& out,
-                                         std::ostream& paren);
-
-  /**
-   * Prints the resolution proofs for learned clauses that have been used to
-   * deduce unsat.
-   *
-   * @param satProof The record of the reasoning done by the SAT solver
-   * @param out The stream to print to
-   * @param paren A stream for the closing parentheses
-   */
-  template <class Solver>
-  static void printResolutions(TSatProof<Solver>* satProof,
-                               std::ostream& out,
-                               std::ostream& paren);
-
-  /**
-   * Prints the resolution proof for the empty clause.
-   *
-   * @param satProof The record of the reasoning done by the SAT solver
-   * @param out The stream to print to
-   * @param paren A stream for the closing parentheses
-   */
-  template <class Solver>
-  static void printResolutionEmptyClause(TSatProof<Solver>* satProof,
-                                         std::ostream& out,
-                                         std::ostream& paren);
-
-  /**
-   * The SAT solver is given a list of clauses.
-   * Assuming that each clause has alreay been individually proven,
-   * defines a proof of the input to the SAT solver.
-   *
-   * Prints an LFSC value corresponding to the proof, i.e. a value of type
-   * (cnf_holds ...)
-   *
-   * @param clauses The clauses to print a proof of
-   * @param out The stream to print to
-   * @param namingPrefix The prefix for LFSC names
-   */
-  static void printSatInputProof(const std::vector<ClauseId>& clauses,
-                                 std::ostream& out,
-                                 const std::string& namingPrefix);
-
-  /**
-   * The LRAT proof signature uses the concept of a _clause map_ (CMap), which
-   * represents an indexed collection of (conjoined) clauses.
-   *
-   * Specifically, the signatures rely on a proof that a CMap containing the
-   * clauses given to the SAT solver hold.
-   *
-   * Assuming that the individual clauses already have proofs, this function
-   * prints a proof of the CMap mapping 1 to the first clause, 2 to the second,
-   * and so on.
-   *
-   * That is, it prints a value of type (CMap_holds ...)
-   *
-   * @param clauses The clauses to print a proof of
-   * @param out The stream to print to
-   * @param namingPrefix The prefix for LFSC names
-   */
-  static void printCMapProof(const std::vector<ClauseId>& clauses,
-                             std::ostream& out,
-                             const std::string& namingPrefix);
-
-  /**
-   * Prints a clause
-   *
-   * @param clause The clause to print
-   * @param out The stream to print to
-   * @param namingPrefix The prefix for LFSC names
-   */
-  static void printSatClause(const prop::SatClause& clause,
-                             std::ostream& out,
-                             const std::string& namingPrefix);
-
- private:
-
-  /**
-   * Maps a clause id to a string identifier used in the LFSC proof.
-   *
-   * @param satProof The record of the reasoning done by the SAT solver
-   * @param id The clause to map to a string
-   */
-  template <class Solver>
-  static std::string clauseName(TSatProof<Solver>* satProof, ClauseId id);
-
-  /**
-   * Prints the resolution proof for a given clause.
-   *
-   * @param satProof The record of the reasoning done by the SAT solver
-   * @param id The clause to print a proof for
-   * @param out The stream to print to
-   * @param paren A stream for the closing parentheses
-   */
-  template <class Solver>
-  static void printResolution(TSatProof<Solver>* satProof,
-                              ClauseId id,
-                              std::ostream& out,
-                              std::ostream& paren);
-};
-
-}  // namespace proof
-}  // namespace CVC4
-
-#endif /* CVC4__PROOF__LFSC_PROOF_PRINTER_H */