Download
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
language Essence 1.3
 
$ Problem : Steiner triplets
$
$ Problem details available at http://www.csplib.org/Problems/prob044/
$
$ Essence model by Andrew Martin
$
$ Licenced under CC-BY-4.0 : http://creativecommons.org/licenses/by/4.0/
 
 
 
given n : int(1..)
 
where    n % 6 = 1
      \/ n % 6 = 3
 
letting nb be n*(n-1) / 6
 
find sets : matrix indexed by [int(1..nb)] of set (size 3) of int(1..n)
 
$for each pair of sets, must share at most one element
 
such that
 
    forAll setA : int(1..nb-1) .
    forAll setB : int(setA+1..nb) .
 
        | sets[setA] intersect sets[setB] | <= 1