this repo has no description
dekker.one
1% ignore
2int:n;
3set of int: NODES = 1..n;
4array [NODES,NODES] of bool: adj;
5bool: t = true;
6bool: f = false;
7n = 4;
8adj = [| false, true, true, false
9 | true, false, true, false
10 | true, true, false, true
11 | false, false, true, false |];
12solve satisfy;
13int: count = sum( i,j in NODES where i < j /\ adj[i,j])(
14 sum([trace("("++show(i)++","++show(j)++","++show(k)++")",1) |
15 k in NODES where j < k /\ adj[i,k] /\ adj[j,k]]));
16% ignore
17constraint trace("\n",true);