7 * e3= e1+e2 {0, 1, 2, 3, 4}
16 int main(int numargs, char **argv) {
17 CSolver *solver = new CSolver();
18 uint64_t set1[] = {0, 1, 2};
19 uint64_t setbigarray[] = {0, 1, 2, 3, 4};
21 Set *s = solver->createSet(0, set1, 3);
22 Set *setbig = solver->createSet(0, setbigarray, 5);
23 Element *e1 = solver->getElementVar(s);
24 Element *e2 = solver->getElementVar(s);
25 Set *domain[] = {s, s};
26 Predicate *equals = solver->createPredicateOperator(SATC_EQUALS, domain, 2);
27 Element *inputs[] = {e1, e2};
28 BooleanEdge b = solver->applyPredicate(equals, inputs, 2);
29 solver->addConstraint(b);
31 uint64_t set2[] = {2, 3};
32 Set *rangef1 = solver->createSet(1, set2, 2);
33 Function *f1 = solver->createFunctionOperator(SATC_ADD, domain, 2, setbig, SATC_IGNORE);
35 Table *table = solver->createTable(domain, 2, s);
36 uint64_t row1[] = {0, 1};
37 uint64_t row2[] = {1, 1};
38 uint64_t row3[] = {2, 1};
39 uint64_t row4[] = {2, 2};
40 solver->addTableEntry(table, row1, 2, 0);
41 solver->addTableEntry(table, row2, 2, 0);
42 solver->addTableEntry(table, row3, 2, 2);
43 solver->addTableEntry(table, row4, 2, 2);
44 Function *f2 = solver->completeTable(table, SATC_IGNOREBEHAVIOR); //its range would be as same as s
45 BooleanEdge overflow = solver->getBooleanVar(2);
46 Element *e3 = solver->applyFunction(f1, inputs, 2, overflow);
47 Element *e4 = solver->applyFunction(f2, inputs, 2, overflow);
48 Set *domain2[] = {s,rangef1};
49 Predicate *equal2 = solver->createPredicateOperator(SATC_EQUALS, domain2, 2);
50 Element *inputs2 [] = {e4, e3};
51 BooleanEdge pred = solver->applyPredicate(equal2, inputs2, 2);
52 solver->addConstraint(pred);
54 if (solver->solve() == 1)
55 printf("e1=%" PRIu64 " e2=%" PRIu64 " \n", solver->getElementValue(e1), solver->getElementValue(e2));