vampire-sys 0.5.2

Low-level FFI bindings to the Vampire theorem prover (use the 'vampire' crate instead)
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132

/*
 * This file is part of the source code of the software program
 * Vampire. It is protected by applicable
 * copyright laws.
 *
 * This source code is distributed under the licence found here
 * https://vprover.github.io/license.html
 * and in the source directory
 */
#include "Inferences/AnswerLiteralProcessors.hpp"
#include "Inferences/ProofExtra.hpp"
#include "Kernel/Inference.hpp"
#include "Shell/AnswerLiteralManager.hpp"
#include "Test/UnitTesting.hpp"
#include "Test/SyntaxSugar.hpp"

#include "Test/SimplificationTester.hpp"

using namespace std;
using namespace Kernel;
using namespace Inferences;
using namespace Test;

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////// TEST UNIT INITIALIZATION
/////////////////////////////////////


#define MY_SYNTAX_SUGAR                                                                   \
  DECL_DEFAULT_VARS                                                                       \
  DECL_SORT(s)                                                                            \
  DECL_FUNC(f, {s}, s)                                                                    \
  DECL_FUNC(g, {s}, s)                                                                    \
  DECL_CONST(a, s)                                                                        \
  DECL_ANSWER_PRED (ans, {s})                                                             \
  DECL_PRED (p, {s})                                                                      \
  DECL_PRED (q, {s})                                                                      \

class SynthesisALProcessorTester : public Test::Simplification::SimplificationManyTester<SynthesisAnswerLiteralProcessor>
{
public:
  SynthesisALProcessorTester()
    : Test::Simplification::SimplificationManyTester<SynthesisAnswerLiteralProcessor>(SynthesisAnswerLiteralProcessor())
  {
    env.options->set("question_answering", "synthesis");
  }
  virtual Option<ClauseIterator> simplifyMany(Kernel::Clause* in) override 
  { return _rule.simplifyMany(in); }
};

REGISTER_SIMPL_MANY_TESTER(SynthesisALProcessorTester)

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////// TEST CASES
/////////////////////////////////////

TEST_SIMPLIFY_MANY(no_answer_literals,
    Simplification::NotApplicableMany()
      .input( clause({ p(x), q(a) }) )
    )

TEST_SIMPLIFY_MANY(one_answer_literal,
    Simplification::NotApplicableMany()
      .input( clause({ p(x), ans(y) }) )
    )

TEST_SIMPLIFY_MANY(two_answer_literals_generic_inference,
    Simplification::NotApplicableMany()
      .input( clause({ p(x), ans(y), ans(x) }) )
    )

TEST_SIMPLIFY_MANY(three_answer_literals,
    Simplification::NotApplicableMany()
      .input( clause({ p(x), ans(y), ans(x), ans(a) }) )
    )

TEST_SIMPLIFY_MANY(three_answer_literals_binary_resolution,
    Clause* cl = clause({ p(x), ans(y), ans(x), ans(a) }, Inference(Kernel::NonspecificInference0(UnitInputType::ASSUMPTION, InferenceRule::RESOLUTION)));
    Simplification::NotApplicableMany()
      .input(cl)
    )

TEST_SIMPLIFY_MANY(two_answer_literals_binary_resolution,
    Literal *al1 = ~ans(f(x)), *al2 = ~ans(a), *cond = q(a);
    Clause* cl = clause({ p(x), al1, al2 }, Inference(Kernel::NonspecificInference0(UnitInputType::ASSUMPTION, InferenceRule::RESOLUTION)));
    env.proofExtra.insert(cl, new Inferences::TwoLiteralInferenceExtra(
      q(a),
      ~q(a),
      cond,
      al1,
      al2
    ));
    Clause* exp1 = clause({ p(x), static_cast<Shell::SynthesisALManager*>(Shell::SynthesisALManager::getInstance())->makeITEAnswerLiteral(cond, al1, al2) });
    Clause* exp2 = clause({ p(x), f(x) != a, al1 });
    Simplification::SuccessMany()
      .input(cl)
      .expected({ exp1, exp2 })
    )

TEST_SIMPLIFY_MANY(two_answer_literals_superposition,
    Literal *al1 = ~ans(f(x)), *al2 = ~ans(a), *cond = g(a)==f(x);
    Clause* cl = clause({ p(g(a)), al1, al2 }, Inference(Kernel::NonspecificInference0(UnitInputType::ASSUMPTION, InferenceRule::SUPERPOSITION)));
    env.proofExtra.insert(cl, new Inferences::TwoLiteralRewriteInferenceExtra(
      p(f(x)),
      cond,
      g(a),
      f(x),
      cond,
      al1,
      al2
    ));
    Clause* exp1 = clause({ p(g(a)), static_cast<Shell::SynthesisALManager*>(Shell::SynthesisALManager::getInstance())->makeITEAnswerLiteral(cond, al1, al2) });
    Clause* exp2 = clause({ p(g(a)), f(x) != a, al1 });
    Simplification::SuccessMany()
      .input(cl)
      .expected({ exp1, exp2 })
    )

TEST_SIMPLIFY_MANY(twice_the_same_answer_literal_binary_resolution,
    Literal *al1 = ~ans(f(x)), *al2 = ~ans(f(x)), *cond = q(a);
    Clause* cl = clause({ p(x), al1, al2 }, Inference(Kernel::NonspecificInference0(UnitInputType::ASSUMPTION, InferenceRule::RESOLUTION)));
    env.proofExtra.insert(cl, new Inferences::TwoLiteralInferenceExtra(
      q(a),
      ~q(a),
      cond,
      al1,
      al2
    ));
    Simplification::SuccessMany()
      .input(cl)
      .expected({ clause({ p(x), al1 }) })
    )