Name | Eternity/ Eternity-10-04_c18.xml |
MD5SUM | f6e7bfb75851ce9d6d95540719dd30c6 |
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 | 1.06941 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 134 |
Number of constraints | 69 |
Number of domains | 2 |
Minimum domain size | 9 |
Maximum domain size | 40 |
Distribution of domain sizes | [{"size":9,"count":94},{"size":40,"count":40}] |
Minimum variable degree | 1 |
Maximum variable degree | 11 |
Distribution of variable degrees | [{"degree":1,"count":9},{"degree":2,"count":124},{"degree":11,"count":1}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 40 |
Distribution of constraint arities | [{"arity":1,"count":28},{"arity":5,"count":40},{"arity":40,"count":1}] |
Number of extensional constraints | 40 |
Number of intensional constraints | 28 |
Distribution of constraint types | [{"type":"extension","count":40},{"type":"intension","count":28},{"type":"allDifferent","count":1}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
NACRE 1.0.4 (complete) | 4300526 | SAT | 1.06941 | 1.07383 |
MiniCPFever 2018-04-29 (complete) | 4300525 | SAT | 1.50419 | 0.583598 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300529 | SAT | 1.63879 | 0.624852 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300528 | SAT | 1.77324 | 0.669127 |
minimacht 2018.07.27 (complete) | 4300732 | SAT | 1.9203 | 1.92084 |
cosoco 1.12 (complete) | 4300523 | SAT | 2.07868 | 2.08038 |
miniBTD 2018.07.27_3 (complete) | 4301084 | SAT | 2.38702 | 2.38799 |
GG's minicp 2018-04-29 (complete) | 4300524 | SAT | 4.52329 | 2.70637 |
miniBTD_12 2018.07.27_12 (complete) | 4300908 | SAT | 4.69024 | 4.69159 |
slowpoke 2018-04-29 (incomplete) | 4300527 | SAT | 6.01286 | 3.99015 |
The dodo solver 2018-04-29 (complete) | 4300530 | SAT (TO) | 2520.08 | 2514.13 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <list> id[0][0] id[0][1] id[0][2] id[0][3] id[1][0] id[1][1] id[1][2] id[1][3] id[2][0] id[2][1] id[2][2] id[2][3] id[3][0] id[3][1] id[3][2] id[3][3] id[4][0] id[4][1] id[4][2] id[4][3] id[5][0] id[5][1] id[5][2] id[5][3] id[6][0] id[6][1] id[6][2] id[6][3] id[7][0] id[7][1] id[7][2] id[7][3] id[8][0] id[8][1] id[8][2] id[8][3] id[9][0] id[9][1] id[9][2] id[9][3] top[0][0] top[0][1] top[0][2] top[0][3] top[1][0] top[1][1] top[1][2] top[1][3] top[2][0] top[2][1] top[2][2] top[2][3] top[3][0] top[3][1] top[3][2] top[3][3] top[4][0] top[4][1] top[4][2] top[4][3] top[5][0] top[5][1] top[5][2] top[5][3] top[6][0] top[6][1] top[6][2] top[6][3] top[7][0] top[7][1] top[7][2] top[7][3] top[8][0] top[8][1] top[8][2] top[8][3] top[9][0] top[9][1] top[9][2] top[9][3] left[0][0] left[0][1] left[0][2] left[0][3] left[1][0] left[1][1] left[1][2] left[1][3] left[2][0] left[2][1] left[2][2] left[2][3] left[3][0] left[3][1] left[3][2] left[3][3] left[4][0] left[4][1] left[4][2] left[4][3] left[5][0] left[5][1] left[5][2] left[5][3] left[6][0] left[6][1] left[6][2] left[6][3] left[7][0] left[7][1] left[7][2] left[7][3] left[8][0] left[8][1] left[8][2] left[8][3] left[9][0] left[9][1] left[9][2] left[9][3] bot[0] bot[1] bot[2] bot[3] right[0] right[1] right[2] right[3] right[4] right[5] right[6] right[7] right[8] right[9] </list> <values> 2 9 8 0 13 33 36 20 6 34 31 19 15 30 25 5 10 24 26 17 21 38 37 14 11 39 32 18 4 29 35 7 12 27 28 23 1 22 16 3 0 0 0 0 2 6 6 2 1 5 6 3 2 6 7 3 1 4 4 1 3 5 5 2 1 6 8 2 1 7 8 3 2 5 6 1 2 7 7 3 0 3 1 1 0 5 8 5 0 5 8 4 0 7 6 4 0 7 4 8 0 7 7 6 0 8 8 4 0 4 5 5 0 4 4 8 0 3 2 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>