aboutsummaryrefslogtreecommitdiff
path: root/tests/test_end_to_end.cc
diff options
context:
space:
mode:
Diffstat (limited to 'tests/test_end_to_end.cc')
-rw-r--r--tests/test_end_to_end.cc11
1 files changed, 6 insertions, 5 deletions
diff --git a/tests/test_end_to_end.cc b/tests/test_end_to_end.cc
index d45a101..ceb9991 100644
--- a/tests/test_end_to_end.cc
+++ b/tests/test_end_to_end.cc
@@ -28,14 +28,15 @@
#include <gtest/gtest.h>
#include <string>
+#include <utility>
namespace atp {
namespace {
/// Helper: parse a TPTP string and run the prover, return the result.
struct E2EResult {
- ProverResult result;
- std::string proof_output;
+ ProverResult result_;
+ std::string proof_output_;
};
E2EResult runProver(const std::string& tptp_input) {
@@ -48,7 +49,7 @@ E2EResult runProver(const std::string& tptp_input) {
Prover prover(bank, store);
prover.addClauses(std::move(clauses));
- ProverResult result = prover.prove();
+ ProverResult const result = prover.prove();
std::string proof_output;
if (result == ProverResult::kTheorem) {
@@ -140,10 +141,10 @@ TEST(EndToEnd, ProofOutputContainsAllSteps) {
// Must contain [resolution] for derived clauses
EXPECT_NE(proof.find("[resolution]"), std::string::npos) << proof;
// Must contain empty clause marker
- std::string empty_marker = "□";
+ std::string const empty_marker = "□";
EXPECT_NE(proof.find(empty_marker), std::string::npos) << proof;
// Must contain [X, Y] provenance (sequential numbers)
- EXPECT_NE(proof.find("["), std::string::npos) << proof;
+ EXPECT_NE(proof.find('['), std::string::npos) << proof;
}
// ═══════════════════════════════════════════════════════════════════════════