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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164

/*
 * Test: Running multiple proofs in sequence
 *
 * This tests that the library can handle multiple independent
 * proving tasks in a row.
 */

#include <iostream>
#include "Api/VampireAPI.hpp"

using namespace Api;
using namespace Kernel;

bool runProof1() {
    std::cout << "=== Proof 1: P(a), P(x)->Q(x) |- Q(a) ===" << std::endl;

    unsigned a = addFunction("a", 0);
    unsigned P = addPredicate("P", 1);
    unsigned Q = addPredicate("Q", 1);

    TermList aConst = constant(a);
    TermList x = var(0);

    Clause* c1 = axiom({lit(P, true, {aConst})});
    Clause* c2 = axiom({lit(P, false, {x}), lit(Q, true, {x})});
    Clause* c3 = conjecture({lit(Q, false, {aConst})});

    Problem* prb = problem({c1, c2, c3});
    ProofResult result = prove(prb);

    if (result == ProofResult::PROOF) {
        std::cout << "PASSED: Theorem proved" << std::endl;
        printProof(std::cout, getRefutation());
        delete prb;
        return true;
    } else {
        std::cout << "FAILED: Expected proof" << std::endl;
        delete prb;
        return false;
    }
}

bool runProof2() {
    std::cout << "\n=== Proof 2: R(b,c), R(x,y)->S(y) |- S(c) ===" << std::endl;

    unsigned b = addFunction("b", 0);
    unsigned c = addFunction("c", 0);
    unsigned R = addPredicate("R", 2);
    unsigned S = addPredicate("S", 1);

    TermList bConst = constant(b);
    TermList cConst = constant(c);
    TermList x = var(0);
    TermList y = var(1);

    Clause* c1 = axiom({lit(R, true, {bConst, cConst})});
    Clause* c2 = axiom({lit(R, false, {x, y}), lit(S, true, {y})});
    Clause* c3 = conjecture({lit(S, false, {cConst})});

    Problem* prb = problem({c1, c2, c3});
    ProofResult result = prove(prb);

    if (result == ProofResult::PROOF) {
        std::cout << "PASSED: Theorem proved" << std::endl;
        printProof(std::cout, getRefutation());
        delete prb;
        return true;
    } else {
        std::cout << "FAILED: Expected proof" << std::endl;
        delete prb;
        return false;
    }
}

bool runProof3() {
    std::cout << "\n=== Proof 3: Equality - f(a)=b, b=c |- f(a)=c ===" << std::endl;

    unsigned a = addFunction("a", 0);
    unsigned b = addFunction("b", 0);
    unsigned c = addFunction("c", 0);
    unsigned f = addFunction("f", 1);

    TermList aConst = constant(a);
    TermList bConst = constant(b);
    TermList cConst = constant(c);
    TermList fa = term(f, {aConst});

    // f(a) = b
    Clause* c1 = axiom({eq(true, fa, bConst)});
    // b = c
    Clause* c2 = axiom({eq(true, bConst, cConst)});
    // ~(f(a) = c) - negated conjecture
    Clause* c3 = conjecture({eq(false, fa, cConst)});

    Problem* prb = problem({c1, c2, c3});
    ProofResult result = prove(prb);

    if (result == ProofResult::PROOF) {
        std::cout << "PASSED: Theorem proved" << std::endl;
        printProof(std::cout, getRefutation());
        delete prb;
        return true;
    } else {
        std::cout << "FAILED: Expected proof" << std::endl;
        delete prb;
        return false;
    }
}

bool runProof4() {
    std::cout << "\n=== Proof 4: Satisfiable (should NOT find proof) ===" << std::endl;

    // P(a) alone - no contradiction
    unsigned a = addFunction("a", 0);
    unsigned P = addPredicate("P", 1);

    TermList aConst = constant(a);
    Clause* c1 = axiom({lit(P, true, {aConst})});

    Problem* prb = problem({c1});
    ProofResult result = prove(prb);

    if (result == ProofResult::SATISFIABLE) {
        std::cout << "PASSED: Correctly identified as satisfiable" << std::endl;
        delete prb;
        return true;
    } else if (result == ProofResult::PROOF) {
        std::cout << "FAILED: Should not find proof for satisfiable problem" << std::endl;
        delete prb;
        return false;
    } else {
        std::cout << "PASSED: No proof found (result: " << static_cast<int>(result) << ")" << std::endl;
        delete prb;
        return true;
    }
}

int main() {
    options().setTimeLimitInSeconds(10);

    int passed = 0;
    int failed = 0;

    // Proof 1
    if (runProof1()) passed++; else failed++;
    prepareForNextProof();

    // Proof 2
    if (runProof2()) passed++; else failed++;
    prepareForNextProof();

    // Proof 3 (with equality)
    if (runProof3()) passed++; else failed++;
    prepareForNextProof();

    // Proof 4 (satisfiable - no proof)
    if (runProof4()) passed++; else failed++;

    std::cout << "\n=== Summary ===" << std::endl;
    std::cout << "Passed: " << passed << std::endl;
    std::cout << "Failed: " << failed << std::endl;

    return failed == 0 ? 0 : 1;
}