Name | Crossword/ Crossword-m18-ogd2008-vg-04-05_c18.xml |
MD5SUM | 340365fb59c69c653973bf6f753c5e6c |
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.043623 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 20 |
Number of constraints | 9 |
Number of domains | 1 |
Minimum domain size | 26 |
Maximum domain size | 26 |
Distribution of domain sizes | [{"size":26,"count":20}] |
Minimum variable degree | 2 |
Maximum variable degree | 2 |
Distribution of variable degrees | [{"degree":2,"count":20}] |
Minimum constraint arity | 4 |
Maximum constraint arity | 5 |
Distribution of constraint arities | [{"arity":4,"count":5},{"arity":5,"count":4}] |
Number of extensional constraints | 9 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":9}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
minimacht 2018.07.27 (complete) | 4300808 | SAT | 0.043623 | 0.044481 |
miniBTD_12 2018.07.27_12 (complete) | 4300984 | SAT | 0.0441 | 0.0453159 |
miniBTD 2018.07.27_3 (complete) | 4301160 | SAT | 0.044886 | 0.0450529 |
NACRE 1.0.4 (complete) | 4299730 | SAT | 0.101203 | 0.108789 |
cosoco 1.12 (complete) | 4299727 | SAT | 0.13909 | 0.140518 |
MiniCPFever 2018-04-29 (complete) | 4299729 | SAT | 1.36683 | 0.553327 |
slowpoke 2018-04-29 (incomplete) | 4299731 | SAT | 1.3797 | 0.547068 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299733 | SAT | 1.39848 | 0.562487 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299732 | SAT | 1.43781 | 0.577479 |
GG's minicp 2018-04-29 (complete) | 4299728 | SAT | 1.45713 | 0.58406 |
The dodo solver 2018-04-29 (complete) | 4299734 | SAT (TO) | 2520.04 | 2509.02 |
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> x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] </list> <values> 0 0 10 0 10 0 0 17 11 4 3 17 4 0 13 4 3 4 17 13 </values> </instantiation>