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

/*
 * 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
 */
/**
 * @file TermShifter.cpp
 */

#include "Kernel/HOL/TermShifter.hpp"
#include "Kernel/HOL/HOL.hpp"

std::pair<TermList, Option<unsigned>> TermShifter::shift(TermList term, int shiftBy) {
  TermShifter ts = TermShifter(shiftBy);
  TermList result = ts.transform(term);

  return {result, ts._minFreeIndex};
}

TermList TermShifter::transformSubterm(TermList t) {
  if (t.deBruijnIndex().isSome()) {
    unsigned index = t.deBruijnIndex().unwrap();
    if (index >= _cutOff) {
      auto j = index - _cutOff;
      _minFreeIndex = Option<unsigned>(std::min(_minFreeIndex.unwrapOr(j), j));

      // free index. lift
      if (_shiftBy != 0) {
        TermList sort = SortHelper::getResultSort(t.term());
        ASS(_shiftBy >= 0 || index >= std::abs(_shiftBy));
        return HOL::getDeBruijnIndex(static_cast<int>(index) + _shiftBy, sort);
      }
    }
  }
  return t;
}