tutorial2.md

Challenge 1:

Define a predicate Intersecting that takes in two sets and outputs 2 circles that overlap.

.dsl

type Set
predicate Intersecting(Set s1, Set s2)

.sub

Set A
Set B
Intersecting(A, B)

.sty

canvas {
  width = 800
  height = 700
}

forall Set x {
    x.icon = Circle {
        strokeWidth : 0.0
    }
    ensure minSize(x.icon, 50)
    ensure maxSize(x.icon, 300)
}

forall Set x; Set y
where Intersecting(x, y) {
    ensure overlapping(x.icon, y.icon, -15)
}

Challenge 2:

Define a predicate that takes in two sets and outputs 2 circles that are disjoint.

.dsl

type Set
predicate NotIntersecting(Set s1, Set s2)

.sub

Set A
Set B
NotIntersecting(A, B)

.sty

canvas {
  width = 800
  height = 700
}

forall Set x {
    x.icon = Circle {
        strokeWidth : 0.0
    }
    ensure minSize(x.icon, 50)
    ensure maxSize(x.icon, 400)
}

forall Set x; Set y
where NotIntersecting(x, y) {
    ensure disjoint(x.icon, y.icon, 15)
}