summaryrefslogtreecommitdiff
path: root/test/java/Combination.java
blob: 5b22945a1cd5476b4d316470adc641099aa62b73 (plain)
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
/*********************                                                        */
/*! \file Combination.java
 ** \verbatim
 ** Top contributors (to current version):
 **   Pat Hawks
 ** This file is part of the CVC4 project.
 ** Copyright (c) 2009-2019 by the authors listed in the file AUTHORS
 ** in the top-level source directory) and their institutional affiliations.
 ** All rights reserved.  See the file COPYING in the top-level source
 ** directory for licensing information.\endverbatim
 **
 ** \brief [[ Add one-line brief description here ]]
 **
 ** [[ Add lengthier description here ]]
 ** \todo document this file
 **/

import static org.junit.Assert.assertEquals;
import org.junit.Before;
import org.junit.Test;

import edu.nyu.acsys.CVC4.*;

public class Combination {
  static {
    System.loadLibrary("cvc4jni");
  }
  ExprManager em;
  SmtEngine smt;

  @Before
  public void initialize() {
    em = new ExprManager();
    smt = new SmtEngine(em);
  }

  @Test
  public void evaluatesExpression() {
    smt.setOption("tlimit", new SExpr(100));
    smt.setOption("produce-models", new SExpr(true)); // Produce Models
    smt.setOption("output-language", new SExpr("cvc4")); // output-language
    smt.setOption("default-dag-thresh", new SExpr(0)); //Disable dagifying the output
    smt.setLogic("QF_UFLIRA");

    // Sorts
    SortType u = em.mkSort("u");
    Type integer = em.integerType();
    Type booleanType = em.booleanType();
    Type uToInt = em.mkFunctionType(u, integer);
    Type intPred = em.mkFunctionType(integer, booleanType);

    // Variables
    Expr x = em.mkVar("x", u);
    Expr y = em.mkVar("y", u);

    // Functions
    Expr f = em.mkVar("f", uToInt);
    Expr p = em.mkVar("p", intPred);

    // Constants
    Expr zero = em.mkConst(new Rational(0));
    Expr one = em.mkConst(new Rational(1));

    // Terms
    Expr f_x = em.mkExpr(Kind.APPLY_UF, f, x);
    Expr f_y = em.mkExpr(Kind.APPLY_UF, f, y);
    Expr sum = em.mkExpr(Kind.PLUS, f_x, f_y);
    Expr p_0 = em.mkExpr(Kind.APPLY_UF, p, zero);
    Expr p_f_y = em.mkExpr(Kind.APPLY_UF, p, f_y);

    // Construct the assumptions
    Expr assumptions =
      em.mkExpr(Kind.AND,
                em.mkExpr(Kind.LEQ, zero, f_x), // 0 <= f(x)
                em.mkExpr(Kind.LEQ, zero, f_y), // 0 <= f(y)
                em.mkExpr(Kind.LEQ, sum, one),  // f(x) + f(y) <= 1
                p_0.notExpr(),                  // not p(0)
                p_f_y);                         // p(f(y))
    smt.assertFormula(assumptions);

    assertEquals(
        Result.Validity.VALID,
        smt.query(em.mkExpr(Kind.DISTINCT, x, y)).isValid()
    );

    assertEquals(
        Result.Sat.SAT,
        smt.checkSat(em.mkConst(true)).isSat()
    );
  }
}
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback