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

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

#include "Kernel/HOL/BetaNormaliser.hpp"
#include "Kernel/HOL/RedexReducer.hpp"
#include "Kernel/HOL/HOL.hpp"

TermList BetaNormaliser::normalise(TermList t) {
  return transform(t);
}

TermList BetaNormaliser::transformSubterm(TermList t) {
  if (t.isLambdaTerm())
    return t;

  auto [head, args] = HOL::getHeadAndArgs(t);

  while (HOL::canHeadReduce(head, args)) {
    t = RedexReducer().reduce(head, args);
    ++reductions;
    if (t.isLambdaTerm())
      break;

    head = HOL::getHeadAndArgs(t, args);
  }

  return t;
}

bool BetaNormaliser::exploreSubterms(TermList orig, TermList newTerm) {
  return newTerm.term()->hasRedex();
}