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

/*
 * 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 Create.cpp
 */

#include "Kernel/HOL/HOL.hpp"

using Kernel::Term;

TermList HOL::create::app(TermList sort, TermList head, TermList arg) {
  ASS(sort.isArrowSort())

  return app(sort.domain(), sort.result(), head, arg);
}

TermList HOL::create::app(TermList head, TermList arg) {
  ASS(head.isTerm())

  return app(SortHelper::getResultSort(head.term()), head, arg);
}

TermList HOL::create::app(TermList s1, TermList s2, TermList arg1, TermList arg2, bool shared) {
  static TermStack args;

  args.reset();
  args.push(s1);
  args.push(s2);
  args.push(arg1);
  args.push(arg2);

  unsigned app = env.signature->getApp();
  return TermList(shared ? Term::create(app, 4, args.begin())
                         : Term::createNonShared(app, 4, args.begin()));
}

TermList HOL::create::app(TermList sort, TermList head, const TermStack& terms) {
  ASS(head.isVar() || SortHelper::getResultSort(head.term()) == sort)

  TermList res = head;

  for (std::size_t i = terms.size(); i > 0; i--) {
    TermList s1 = getNthArg(sort, 1);
    TermList s2 = getResultAppliedToNArgs(sort, 1);
    res = app(s1, s2, res, terms[i-1]);
    sort = s2;
  }

  return res;
}

TermList HOL::create::app(TermList head, const TermStack& terms) {
  ASS(head.isTerm())

  return app(SortHelper::getResultSort(head.term()), head, terms);
}

Term* HOL::create::lambda(unsigned numArgs, const unsigned* vars, const TermList* varSorts, TypedTermList body, TermList* resultExprSort) {
  auto s = new (0, sizeof(Term::SpecialTermData)) Term;
  s->makeSymbol(Term::toNormalFunctor(SpecialFunctor::LAMBDA), 0);

  auto sp = s->getSpecialData();
  sp->setLambdaExp(body.untyped());
  sp->setLambdaExpSort(body.sort());

  sp->setLambdaVars(VList::fromData(vars, numArgs));

  auto lambdaSort = AtomicSort::arrowSort(numArgs, varSorts, body.sort());
  sp->setLambdaVarSorts(SList::fromData(varSorts, numArgs));
  sp->setLambdaSort(lambdaSort);
  if (resultExprSort != nullptr)
    *resultExprSort = lambdaSort;

  return s;
}


TermList HOL::create::namelessLambda(TermList varSort, TermList termSort, TermList term) {
  ASS(varSort.isVar()  || varSort.term()->isSort());
  ASS(termSort.isVar() || termSort.term()->isSort());

  static const unsigned lam = env.signature->getLam();

  static TermStack args;
  args.reset();
  args.push(varSort);
  args.push(termSort);
  args.push(term);

  return TermList(Term::create(lam, 3, args.begin()));
}

TermList HOL::create::namelessLambda(TermList varSort, TermList term) {
  ASS(term.isTerm())

  TermList termSort = SortHelper::getResultSort(term.term());
  return namelessLambda(varSort, termSort, term);
}

TermList HOL::create::surroundWithLambdas(TermList t, TermStack& sorts, bool fromTop) {
  ASS(t.isTerm())

  TermList sort = SortHelper::getResultSort(t.term());
  return surroundWithLambdas(t, sorts, sort, fromTop);
}

TermList HOL::create::surroundWithLambdas(TermList t, TermStack& sorts, TermList sort, bool fromTop) {
  // TODO fromTop is very hacky. See if can merge these two into one loop
  if (fromTop) {
    for (auto i = sorts.size(); i-- > 0; ) {
      t = namelessLambda(sorts[i], sort, t);
      sort = AtomicSort::arrowSort(sorts[i], sort);
    }
    return t;
  }

  for (unsigned i = 0; i < sorts.size(); i++) {
    t = namelessLambda(sorts[i], sort, t);
    sort = AtomicSort::arrowSort(sorts[i], sort);
  }
  return t;
}