Testcase for ordergraph
[satune.git] / src / Test / elemequalsattest.c
1 #include "csolver.h"
2 /**
3  * e1 = {0, 1, 2}
4  * e2 = {3, 1, 7}
5  * e1 == e2
6  *
7  * Result (Enumeration):
8  *      e1=1 e2=1
9  * Result (circuit):
10  *      e1=0 e2=3
11  *      e1=1 e2=1
12  *      e1=2 e2=7
13  */
14 int main(int numargs, char **argv) {
15         CSolver *solver = allocCSolver();
16         uint64_t set1[] = {0, 1, 2};
17         uint64_t set2[] = {3, 1, 7};
18         Set *s1 = createSet(solver, 0, set1, 3);
19         Set *s2 = createSet(solver, 0, set2, 3);
20         Element *e1 = getElementVar(solver, s1);
21         Element *e2 = getElementVar(solver, s2);
22         Set *domain[] = {s1, s2};
23         Predicate *equals = createPredicateOperator(solver, EQUALS, domain, 2);
24         Element *inputs[] = {e1, e2};
25         Boolean *b = applyPredicate(solver, equals, inputs, 2);
26         addConstraint(solver, b);
27
28         if (startEncoding(solver) == 1)
29                 printf("e1=%llu e2=%llu\n", getElementValue(solver,e1), getElementValue(solver, e2));
30         else
31                 printf("UNSAT\n");
32         deleteSolver(solver);
33 }