Name | Tpp/Tpp-zinc-s1/ Tpp-7-3-20-1.xml |
MD5SUM | 38f06f34c6c373f6142c39e9ab89bcc1 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 125 |
Best CPU time to get the best result obtained on this benchmark | 0.251194 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 82 |
Number of constraints | 463 |
Number of domains | 43 |
Minimum domain size | 2 |
Maximum domain size | 21 |
Distribution of domain sizes | [{"size":2,"count":1},{"size":3,"count":4},{"size":4,"count":13},{"size":5,"count":3},{"size":11,"count":3},{"size":12,"count":3},{"size":13,"count":5},{"size":14,"count":4},{"size":15,"count":5},{"size":20,"count":20},{"size":21,"count":21}] |
Minimum variable degree | 2 |
Maximum variable degree | 23 |
Distribution of variable degrees | [{"degree":2,"count":41},{"degree":22,"count":40},{"degree":23,"count":1}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 21 |
Distribution of constraint arities | [{"arity":1,"count":1},{"arity":2,"count":461},{"arity":21,"count":1}] |
Number of extensional constraints | 41 |
Number of intensional constraints | 421 |
Distribution of constraint types | [{"type":"extension","count":41},{"type":"intension","count":421},{"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: 125<instantiation type='solution' cost='125'> <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[18] d[19] d[1] d[20] 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[18] s[19] s[1] s[20] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list> <values>4 1 1 5 4 1 2 4 5 2 2 1 1 9 5 5 2 3 1 9 0 7 1 1 18 0 0 0 16 10 1 0 4 0 0 0 0 0 0 0 0 13 19 19 19 10 13 11 18 18 19 10 17 18 19 12 17 11 10 10 11 0 11 12 13 20 14 15 16 10 17 18 1 19 2 3 4 5 6 7 8 9 </values> </instantiation>