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;
8int:count=sum([ 1 | i,j,k in NODES where
9 trace("+", i<j /\j<k /\ adj[i,j] /\ adj[i,k] /\ adj[j,k]) ]);
10adj = [| false, true, true, false
11 | true, false, true, false
12 | true, true, false, true
13 | false, false, true, false |];
14constraint trace("\n",true);
15solve satisfy;