Name | Tpp/Tpp-zinc-s1/ Tpp-6-3-20-1.xml |
MD5SUM | b4cf0cb08a05c1b083ee2f2000733b36 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 131 |
Best CPU time to get the best result obtained on this benchmark | 0.189143 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 76 |
Number of constraints | 400 |
Number of domains | 40 |
Minimum domain size | 3 |
Maximum domain size | 18 |
Distribution of domain sizes | [{"size":3,"count":6},{"size":4,"count":9},{"size":5,"count":3},{"size":8,"count":1},{"size":10,"count":2},{"size":11,"count":4},{"size":12,"count":6},{"size":13,"count":5},{"size":14,"count":1},{"size":15,"count":1},{"size":17,"count":20},{"size":18,"count":18}] |
Minimum variable degree | 2 |
Maximum variable degree | 23 |
Distribution of variable degrees | [{"degree":2,"count":38},{"degree":19,"count":20},{"degree":22,"count":17},{"degree":23,"count":1}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 18 |
Distribution of constraint arities | [{"arity":1,"count":1},{"arity":2,"count":398},{"arity":18,"count":1}] |
Number of extensional constraints | 38 |
Number of intensional constraints | 361 |
Distribution of constraint types | [{"type":"extension","count":38},{"type":"intension","count":361},{"type":"circuit","count":1}] |
Optimization problem | YES |
Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 131<instantiation type='solution' cost='131'> <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] d[0] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] l[0] l[10] l[11] l[12] l[13] l[14] l[15] l[16] l[17] l[18] l[19] l[1] l[2] l[3] l[4] l[5] l[6] l[7] l[8] l[9] s[0] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17] s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list> <values>7 3 3 6 3 6 8 2 1 1 8 5 2 3 5 2 2 14 7 2 0 4 1 0 0 0 1 13 16 0 0 0 0 0 0 0 0 6 9 15 15 11 9 15 9 11 15 10 16 10 10 10 9 16 9 11 10 11 0 11 17 12 13 14 9 15 16 1 2 3 4 5 6 7 8 10 </values> </instantiation>