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

/*
 * 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 ForwardGroundJoinability.hpp
 * Defines class ForwardGroundJoinability
 *
 */

#ifndef __ForwardGroundJoinability__
#define __ForwardGroundJoinability__

#include "Forwards.hpp"
#include "Indexing/TermIndex.hpp"
#include "InferenceEngine.hpp"

namespace Inferences
{

using namespace Kernel;
using namespace Indexing;
using namespace Saturation;

class ForwardGroundJoinability
: public ForwardSimplificationEngine
{
public:
  void attach(SaturationAlgorithm* salg) override;
  void detach() override;
  bool perform(Clause* cl, Clause*& replacement, ClauseIterator& premises) override;

  static bool makeEqual(Literal* lit, Stack<TermOrderingConstraint>& res);

private:
  struct RedundancyCheck
  {
    RedundancyCheck(const Ordering& ord, Literal* data);
    std::pair<Literal*,const TermPartialOrdering*> next(Stack<TermOrderingConstraint> cons, Literal* data);

    void pushNext();

    using Branch = TermOrderingDiagram::Branch;
    using Tag = TermOrderingDiagram::Node::Tag;

    TermOrderingDiagramUP tod;
    TermOrderingDiagram::Traversal<TermOrderingDiagram::DefaultIterator> traversal;
    Branch* _curr;
  };

  std::shared_ptr<DemodulationLHSIndex> _index;
};

};

#endif /*__ForwardGroundJoinability__*/