Name | GracefulGraph/ GracefulGraph-K04-P04_c18.xml |
MD5SUM | bba9b3428f0c8228a4e28ff2342631fb |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 2.51133 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 92 |
Number of constraints | 38 |
Number of domains | 2 |
Minimum domain size | 36 |
Maximum domain size | 37 |
Distribution of domain sizes | [{"size":36,"count":36},{"size":37,"count":16}] |
Minimum variable degree | 0 |
Maximum variable degree | 6 |
Distribution of variable degrees | [{"degree":0,"count":40},{"degree":2,"count":36},{"degree":5,"count":8},{"degree":6,"count":8}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 36 |
Distribution of constraint arities | [{"arity":3,"count":36},{"arity":16,"count":1},{"arity":36,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 36 |
Distribution of constraint types | [{"type":"intension","count":36},{"type":"allDifferent","count":2}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
cosoco 2 (complete) | 4390036 | SAT | 2.51133 | 2.5128 |
cosoco 2.0 (complete) | 4408576 | SAT | 2.51476 | 2.51634 |
cosoco 2.0 (complete) | 4397316 | SAT | 2.5268 | 2.52823 |
(reference) PicatSAT 2019-09-12 (complete) | 4407892 | SAT | 82.5233 | 82.5167 |
miniBTD 19.06.16 (complete) | 4391836 | SAT | 175.743 | 175.751 |
NACRE 1.0.5 (complete) | 4391636 | ? (TO) | 2400.06 | 2400.01 |
NACRE 1.0.5-Hybrid (complete) | 4391436 | ? (TO) | 2400.07 | 2400.11 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type='solution'> <list>cn[0][0] cn[0][1] cn[0][2] cn[0][3] cn[1][0] cn[1][1] cn[1][2] cn[1][3] cn[2][0] cn[2][1] cn[2][2] cn[2][3] cn[3][0] cn[3][1] cn[3][2] cn[3][3] ce[0][0][0] ce[0][0][1] ce[0][0][2] ce[0][0][3] ce[0][1][0] ce[0][1][1] ce[0][1][2] ce[0][1][3] ce[0][2][0] ce[0][2][1] ce[0][2][2] ce[0][2][3] ce[0][3][0] ce[0][3][1] ce[0][3][2] ce[0][3][3] ce[1][0][0] ce[1][0][1] ce[1][0][2] ce[1][0][3] ce[1][1][0] ce[1][1][1] ce[1][1][2] ce[1][1][3] ce[1][2][0] ce[1][2][1] ce[1][2][2] ce[1][2][3] ce[1][3][0] ce[1][3][1] ce[1][3][2] ce[1][3][3] ce[2][0][0] ce[2][0][1] ce[2][0][2] ce[2][0][3] ce[2][1][0] ce[2][1][1] ce[2][1][2] ce[2][1][3] ce[2][2][0] ce[2][2][1] ce[2][2][2] ce[2][2][3] ce[2][3][0] ce[2][3][1] ce[2][3][2] ce[2][3][3] ce[3][0][0] ce[3][0][1] ce[3][0][2] ce[3][0][3] ce[3][1][0] ce[3][1][1] ce[3][1][2] ce[3][1][3] ce[3][2][0] ce[3][2][1] ce[3][2][2] ce[3][2][3] ce[3][3][0] ce[3][3][1] ce[3][3][2] ce[3][3][3] cie[0][0] cie[0][1] cie[0][2] cie[0][3] cie[1][0] cie[1][1] cie[1][2] cie[1][3] cie[2][0] cie[2][1] cie[2][2] cie[2][3] </list> <values>13 36 4 14 6 0 33 31 21 35 9 1 25 7 28 12 * 23 9 1 * * 32 22 * * * 10 * * * * * 6 27 25 * * 33 31 * * * 2 * * * * * 14 12 20 * * 26 34 * * * 8 * * * * * 18 3 13 * * 21 5 * * * 16 * * * * 7 36 29 17 15 35 24 30 4 28 19 11 </values> </instantiation>