use of kodkod.instance.TupleFactory in project org.alloytools.alloy by AlloyTools.
the class BugTests method testMana_01312007.
public final void testMana_01312007() {
final Relation A = Relation.unary("A");
final Relation first1 = Relation.unary("first1");
final Relation first2 = Relation.unary("first2");
final Relation last1 = Relation.unary("last1");
final Relation last2 = Relation.unary("last2");
final Relation next1 = Relation.binary("next1");
final Relation next2 = Relation.binary("next2");
final Formula f0 = next1.totalOrder(A, first1, last1);
final Formula f1 = next2.totalOrder(A, first2, last2);
final Formula f2 = first1.eq(last2);
final Formula f3 = f0.and(f1).and(f2);
final Universe u = new Universe(Arrays.asList("a0", "a1", "a2"));
final TupleFactory f = u.factory();
final Bounds b = new Bounds(u);
b.bound(A, f.allOf(1));
b.bound(first1, f.allOf(1));
b.bound(first2, f.allOf(1));
b.bound(last1, f.allOf(1));
b.bound(last2, f.allOf(1));
b.bound(next1, f.allOf(2));
b.bound(next2, f.allOf(2));
final Solver solver = new Solver();
final Solution sol = solver.solve(f3, b);
assertEquals(Solution.Outcome.SATISFIABLE, sol.outcome());
}
use of kodkod.instance.TupleFactory in project org.alloytools.alloy by AlloyTools.
the class BugTests method testFelix_02222008.
public final void testFelix_02222008() {
List<String> atomlist = Arrays.asList("X1", "X2", "X3");
Universe universe = new Universe(atomlist);
TupleFactory factory = universe.factory();
Bounds bounds = new Bounds(universe);
Relation x = Relation.unary("X");
TupleSet x_upper = factory.noneOf(1);
x_upper.add(factory.tuple("X1"));
x_upper.add(factory.tuple("X2"));
x_upper.add(factory.tuple("X3"));
bounds.bound(x, x_upper);
Variable a = Variable.unary("a");
Variable b = Variable.unary("b");
Variable c = Variable.unary("c");
Formula goal = x.lone().not().and(b.union(c).eq(a).forSome(c.oneOf(x)).forAll(b.oneOf(x)).forSome(a.setOf(x)));
Solver solver = new Solver();
solver.options().setSolver(SATFactory.DefaultSAT4J);
solver.options().setBitwidth(4);
solver.options().setIntEncoding(Options.IntEncoding.TWOSCOMPLEMENT);
solver.options().setSymmetryBreaking(0);
solver.options().setSkolemDepth(2);
Iterator<Solution> itr = solver.solveAll(goal, bounds);
int sols = 0;
while (itr.hasNext()) {
Solution sol = itr.next();
Instance inst = sol.instance();
if (inst == null)
break;
sols++;
for (Relation rel : inst.relations()) {
if (rel != x) {
if (rel.arity() == 1) {
// rel = a
assertEquals(inst.tuples(x), inst.tuples(rel));
} else {
// rel = c
final TupleSet dom = factory.noneOf(1);
for (Tuple t : inst.tuples(rel)) {
dom.add(factory.tuple(t.atom(0)));
}
assertEquals(inst.tuples(x), dom);
}
}
}
}
assertEquals(3, sols);
}
use of kodkod.instance.TupleFactory in project org.alloytools.alloy by AlloyTools.
the class BugTests method testFelix_08022006.
public final void testFelix_08022006() {
Relation x = Relation.nary("P", 1);
String[] atoms = { "-8", "-7", "-6", "-5", "-4", "-3", "-2", "-1", "0", "1", "2", "3", "4", "5", "6", "7" };
java.util.ArrayList<String> atomlist = new java.util.ArrayList<String>();
for (String a : atoms) atomlist.add(a);
Universe universe = new Universe(atomlist);
TupleFactory factory = universe.factory();
Bounds bounds = new Bounds(universe);
for (int i = -8; i <= 7; i++) bounds.boundExactly(i, factory.setOf(String.valueOf(i)));
bounds.bound(x, factory.allOf(1));
Formula f = x.in(Expression.INTS).and(x.some());
// System.out.println(bounds);
Solver solver = new Solver();
// solver.options().setSolver(SATFactory.ZChaff);
solver.options().setSolver(SATFactory.DefaultSAT4J);
solver.options().setBitwidth(4);
solver.options().setIntEncoding(Options.IntEncoding.TWOSCOMPLEMENT);
Solution sol;
try {
sol = solver.solve(f, bounds);
assertNotNull(sol.instance());
} catch (HigherOrderDeclException e) {
// TODO Auto-generated catch block
e.printStackTrace();
} catch (UnboundLeafException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
use of kodkod.instance.TupleFactory in project org.alloytools.alloy by AlloyTools.
the class BugTests method testGreg_01052006.
public final void testGreg_01052006() {
// final TreeSequence<Integer> t = new TreeSequence<Integer>();
// final int[] elts = {107, 31, 86, 72, 6, 119, 23, 131};
// for(int i = 0; i < elts.length; i++) {
// t.put(elts[i], 0);
// }
// final int[] sorted = new int[elts.length];
// System.arraycopy(elts, 0, sorted, 0, elts.length);
// Arrays.sort(sorted);
// int count = 0;
// for(IndexedEntry<Integer> e : t) {
// assertEquals(sorted[count++], e.index());
// }
// t.remove(72);
// t.put(72,0);
// count = 0;
// for(IndexedEntry<Integer> e : t) {
// assertEquals(sorted[count++], e.index());
// }
final List<Object> atoms = new ArrayList<Object>(12);
atoms.add(2);
atoms.add(4);
atoms.add(-2);
atoms.add("null");
atoms.add("array0");
atoms.add(6);
atoms.add(1);
atoms.add(-1);
atoms.add(-3);
atoms.add(3);
atoms.add(5);
atoms.add(0);
final Universe u = new Universe(atoms);
final TupleFactory f = u.factory();
final TupleSet tdiv = f.noneOf(3);
for (int i = -3; i <= 6; i++) {
for (int j = -3; j <= 6; j++) {
if (j != 0) {
int divij = i / j;
if (-3 <= divij && divij <= 6)
tdiv.add(f.tuple(i, j, divij));
else
tdiv.add(f.tuple(i, j, (10 + divij) % 10));
}
}
}
final TupleSet tdivcopy = tdiv.clone();
for (int i = -3; i <= 6; i++) {
for (int j = -3; j <= 6; j++) {
if (j != 0) {
int divij = i / j;
if (-3 <= divij && divij <= 6)
assertTrue(tdivcopy.contains(f.tuple(i, j, divij)));
else
assertTrue(tdivcopy.contains(f.tuple(i, j, (10 + divij) % 10)));
}
}
}
}
use of kodkod.instance.TupleFactory in project org.alloytools.alloy by AlloyTools.
the class BugTests method testFelix_05152007_1.
public final void testFelix_05152007_1() {
Relation x5 = Relation.nary("A", 1);
List<String> atomlist = Arrays.asList("A0", "A1", "A2");
Universe universe = new Universe(atomlist);
TupleFactory factory = universe.factory();
Bounds bounds = new Bounds(universe);
TupleSet x5_upper = factory.noneOf(1);
x5_upper.add(factory.tuple("A2"));
x5_upper.add(factory.tuple("A1"));
x5_upper.add(factory.tuple("A0"));
bounds.bound(x5, x5_upper);
Formula x7 = x5.some();
Formula x8 = x5.no();
Formula x6 = x7.and(x8);
Solver solver = new Solver();
solver.options().setLogTranslation(1);
solver.options().setSolver(SATFactory.MiniSatProver);
solver.options().setBitwidth(4);
solver.options().setIntEncoding(Options.IntEncoding.TWOSCOMPLEMENT);
Solution sol = solver.solve(x6, bounds);
// System.out.println("Sol="+sol);
Set<Formula> core = Nodes.minRoots(x6, sol.proof().highLevelCore().values());
assertEquals(2, core.size());
assertTrue(core.contains(x7));
assertTrue(core.contains(x8));
}
Aggregations