Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-1-fullins-5.xml |
MD5SUM | d0b670f2d456fe73f660694510078368 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 5 |
Best CPU time to get the best result obtained on this benchmark | 7.63334 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 282 |
Number of constraints | 3247 |
Number of domains | 1 |
Minimum domain size | 282 |
Maximum domain size | 282 |
Distribution of domain sizes | [{"size":282,"count":282}] |
Minimum variable degree | 9 |
Maximum variable degree | 96 |
Distribution of variable degrees | [{"degree":9,"count":4},{"degree":10,"count":6},{"degree":11,"count":11},{"degree":12,"count":8},{"degree":13,"count":13},{"degree":14,"count":13},{"degree":15,"count":13},{"degree":16,"count":16},{"degree":17,"count":15},{"degree":18,"count":15},{"degree":19,"count":11},{"degree":20,"count":11},{"degree":21,"count":12},{"degree":22,"count":12},{"degree":23,"count":9},{"degree":24,"count":9},{"degree":25,"count":10},{"degree":26,"count":10},{"degree":27,"count":10},{"degree":28,"count":10},{"degree":29,"count":4},{"degree":30,"count":4},{"degree":31,"count":4},{"degree":32,"count":4},{"degree":33,"count":3},{"degree":34,"count":3},{"degree":35,"count":6},{"degree":36,"count":3},{"degree":37,"count":3},{"degree":38,"count":3},{"degree":39,"count":3},{"degree":40,"count":3},{"degree":45,"count":3},{"degree":46,"count":3},{"degree":47,"count":3},{"degree":48,"count":3},{"degree":65,"count":3},{"degree":66,"count":3},{"degree":96,"count":3}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":3247}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 3247 |
Distribution of constraint types | [{"type":"intension","count":3247}] |
Optimization problem | YES |
Type of objective | min MAXIMUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
(reference) PicatSAT 2019-09-12 (complete) | 4407532 | OPT | 5 | 7.63334 | 7.64354 |
cosoco 2.0 (complete) | 4397446 | OPT | 5 | 19.488 | 19.5419 |
cosoco 2 (complete) | 4394665 | OPT | 5 | 19.5222 | 19.523 |
cosoco 2.0 (complete) | 4408706 | OPT | 5 | 19.9923 | 20.3652 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 5<instantiation> <list> x[] </list> <values> 3 2 5 2 3 3 5 3 2 4 2 4 4 4 3 4 4 2 1 1 1 1 1 5 1 1 1 2 5 3 1 1 1 1 3 3 1 3 1 4 4 4 4 3 4 4 4 4 1 5 1 1 1 1 1 1 5 4 5 4 2 2 2 2 5 5 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 2 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 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 2 4 0 </values> </instantiation>