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
133
134
135
136
137

/*
 * 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 "Test/SyntaxSugar.hpp"
#include "Test/UnitTesting.hpp"

IntegerConstantType quotientE(int lhs, int rhs) {
  return IntegerConstantType(lhs).quotientE(IntegerConstantType(rhs));
}

IntegerConstantType remainderE(int lhs, int rhs) {
  return IntegerConstantType(lhs).remainderE(IntegerConstantType(rhs));
}

template<class Const>
void checkQuotientE(Const i, Const j) {
  if (j != 0) {
    DBG("")
    auto q =  i.quotientE(j);
    auto r = i.remainderE(j);

    DBG(" quotientE(", i, ", ", j, ")\t= ", q);
    DBG("remainderE(", i, ", ", j, ")\t= ", r);
    ASS_EQ(q * j + r, i)
    ASS(Const(0) <= r && r < j.abs())
  }
}

TEST_FUN(check_int) 
{
  int range = 10;
  for (int i = -range; i < range; i++) {
    for (int j = -range; j < range; j++) {
      checkQuotientE(IntegerConstantType(i), IntegerConstantType(j));
    }
  }
}

TEST_FUN(bug01)
{
  checkQuotientE(IntegerConstantType(1), IntegerConstantType(5));
}

// REMOVED until there are benchmarks that actually use (quotient|remainder)_(e|t|r) with non-integral number types
//
// template<class Const>
// void checkQuotientEFrac() 
// {
//   int range = 10;
//   for (int i = -range; i < range; i++) {
//     for (int j = -range; j < range; j++) {
//       for (int k = -range; k < range; k++) {
//         for (int l = -range; l < range; l++) {
//           if (j != 0 && l != 0) {
//             checkQuotientE(Const(i, j), Const(k, l));
//           }
//         }
//       }
//     }
//   }
// }
//
// TEST_FUN(check_real) 
// { checkQuotientEFrac<RealConstantType>(); }
//
// TEST_FUN(check_rat) 
// { checkQuotientEFrac<RationalConstantType>(); }

template<class Const>
void checkFloor() 
{
  ASS_EQ(Const( 3, 2).floor(), 1)
  ASS_EQ(Const(-3, 2).floor(), -2)
  ASS_EQ(Const( 4, 2).floor(), 2)
  ASS_EQ(Const(-4, 2).floor(), -2)
  ASS_EQ(Const( 0, 2).floor(), 0)
}

template<class Const>
void checkCeiling() 
{
  ASS_EQ(Const( 3, 2).ceiling(), Const( 2))
  ASS_EQ(Const(-3, 2).ceiling(), Const(-1))
  ASS_EQ(Const( 4, 2).ceiling(), Const( 2))
  ASS_EQ(Const(-4, 2).ceiling(), Const(-2))
  ASS_EQ(Const( 0, 2).ceiling(), Const( 0))
}


#define CHECK_FRAC(Const)                                                                           \
  TEST_FUN(check_ceiling_##Const) { checkCeiling<Const>(); }                                        \
  TEST_FUN(check_floor_  ##Const) { checkFloor  <Const>(); }                                        \

CHECK_FRAC(RationalConstantType)
CHECK_FRAC(RealConstantType)


template<class Quot, class Rem>
void check_quotient(int n_, int d_, int q_, Quot quotient, Rem remainder)
{
  auto n = IntegerConstantType(n_);
  auto d = IntegerConstantType(d_);
  auto q = IntegerConstantType(q_);
  auto res = quotient(n,d);
  auto rem = remainder(n,d);
  auto exp = q;
  if (res != exp) {
    std::cout << "[ fail ]" << n << " / " << d << std::endl;
    std::cout << "[   is ]" << n.quotientT(d) << std::endl;
    std::cout << "[  exp ]" << q << std::endl;
    ASSERTION_VIOLATION
  } else if (res * d + rem != n) {
    std::cout << "[ fail ]" << n << " mod " <<  d << std::endl;
    std::cout << "[   is ]" << rem << std::endl;
    std::cout << "[  exp ]" << n - exp * d << std::endl;
    ASSERTION_VIOLATION
  }
};


TEST_FUN(quotient_t) {
  auto check = [](auto n, auto d, auto q) {
    check_quotient(n,d,q, 
        [](auto l, auto r) { return l.quotientT(r); },
        [](auto l, auto r) { return l.remainderT(r); });
  };

  check( 1, 2,  0);
  check( 7, 2,  3);
  check(-7, 2, -3);
}