Name | Langford/ LangfordBin-12_c18.xml |
MD5SUM | d44a6c2f310df02cbd65e302b0bb5238 |
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 | 0.017614 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 48 |
Number of constraints | 36 |
Number of domains | 2 |
Minimum domain size | 12 |
Maximum domain size | 24 |
Distribution of domain sizes | [{"size":12,"count":24},{"size":24,"count":24}] |
Minimum variable degree | 2 |
Maximum variable degree | 24 |
Distribution of variable degrees | [{"degree":2,"count":24},{"degree":24,"count":24}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 25 |
Distribution of constraint arities | [{"arity":2,"count":12},{"arity":25,"count":24}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 12 |
Distribution of constraint types | [{"type":"intension","count":12},{"type":"element","count":24}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
cosoco 1.12 (complete) | 4299258 | SAT | 0.017614 | 0.019124 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299264 | SAT | 0.728346 | 0.383504 |
GG's minicp 2018-04-29 (complete) | 4299259 | SAT | 0.813644 | 0.417985 |
MiniCPFever 2018-04-29 (complete) | 4299260 | SAT | 0.913165 | 0.452421 |
slowpoke 2018-04-29 (incomplete) | 4299262 | SAT | 1.00909 | 0.472415 |
The dodo solver 2018-04-29 (complete) | 4299265 | SAT (TO) | 2520.09 | 2515.81 |
miniBTD 2018.07.27_3 (complete) | 4301050 | ? | 2520 | 2519.93 |
miniBTD_12 2018.07.27_12 (complete) | 4300874 | ? | 2520.01 | 2519.82 |
NACRE 1.0.4 (complete) | 4299261 | ? (TO) | 2519.79 | 2520.01 |
minimacht 2018.07.27 (complete) | 4300698 | ? (TO) | 2519.93 | 2520.01 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299263 | Wrong UNSAT | 0.613491 | 0.340474 |
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>v[0] v[1] v[2] v[3] v[4] v[5] v[6] v[7] v[8] v[9] v[10] v[11] v[12] v[13] v[14] v[15] v[16] v[17] v[18] v[19] v[20] v[21] v[22] v[23] p[0] p[1] p[2] p[3] p[4] p[5] p[6] p[7] p[8] p[9] p[10] p[11] p[12] p[13] p[14] p[15] p[16] p[17] p[18] p[19] p[20] p[21] p[22] p[23] </list> <values>12 9 11 3 4 6 8 3 7 4 10 9 6 12 11 8 7 5 1 2 1 10 2 5 20 18 22 19 7 3 9 4 23 17 12 5 16 8 15 6 11 1 21 10 14 2 13 0 </values> </instantiation>