Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-2-fullins-5.xml |
MD5SUM | 7175cc64c8263572fa1d1d1459976d33 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 6 |
Best CPU time to get the best result obtained on this benchmark | 58.1955 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 852 |
Number of constraints | 12201 |
Number of domains | 1 |
Minimum domain size | 852 |
Maximum domain size | 852 |
Distribution of domain sizes | [{"size":852,"count":852}] |
Minimum variable degree | 9 |
Maximum variable degree | 216 |
Distribution of variable degrees | [{"degree":9,"count":4},{"degree":10,"count":10},{"degree":11,"count":10},{"degree":12,"count":24},{"degree":13,"count":14},{"degree":14,"count":28},{"degree":15,"count":20},{"degree":16,"count":40},{"degree":17,"count":26},{"degree":18,"count":52},{"degree":19,"count":24},{"degree":20,"count":52},{"degree":21,"count":10},{"degree":22,"count":20},{"degree":23,"count":24},{"degree":24,"count":48},{"degree":25,"count":18},{"degree":26,"count":36},{"degree":27,"count":20},{"degree":28,"count":40},{"degree":29,"count":16},{"degree":30,"count":32},{"degree":31,"count":32},{"degree":32,"count":64},{"degree":33,"count":4},{"degree":34,"count":8},{"degree":35,"count":4},{"degree":36,"count":8},{"degree":41,"count":4},{"degree":42,"count":8},{"degree":43,"count":8},{"degree":44,"count":16},{"degree":45,"count":8},{"degree":46,"count":16},{"degree":47,"count":16},{"degree":48,"count":32},{"degree":58,"count":4},{"degree":61,"count":4},{"degree":62,"count":8},{"degree":63,"count":8},{"degree":64,"count":16},{"degree":111,"count":4},{"degree":112,"count":8},{"degree":216,"count":4}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":12201}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 12201 |
Distribution of constraint types | [{"type":"intension","count":12201}] |
Optimization problem | YES |
Type of objective | min MAXIMUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 6<instantiation> <list> x[] </list> <values> 3 0 5 5 1 6 0 0 5 6 0 1 3 2 5 2 3 6 3 3 3 6 3 3 1 1 5 1 1 1 1 1 0 1 1 1 0 0 0 0 0 0 3 3 0 3 3 3 5 0 3 6 1 2 5 2 6 1 2 2 2 6 2 2 2 2 5 5 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 0 2 0 2 0 2 2 2 0 2 2 2 1 1 2 1 0 3 0 3 0 3 3 3 0 3 3 1 0 0 0 3 0 0 0 0 0 0 0 0 0 1 0 3 0 1 1 1 0 3 1 1 0 0 0 0 0 0 0 0 0 0 0 0 3 3 0 3 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 3 2 0 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 3 4 4 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 1 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 6 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 3 2 4 0 </values> </instantiation>