Name | Haystacks/ Haystacks-ext-08_c18.xml |
MD5SUM | 86e4590fdf2acf70e62b7e4d974dbe81 |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 0.125109 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 64 |
Number of constraints | 231 |
Number of domains | 1 |
Minimum domain size | 8 |
Maximum domain size | 8 |
Distribution of domain sizes | [{"size":8,"count":64}] |
Minimum variable degree | 7 |
Maximum variable degree | 8 |
Distribution of variable degrees | [{"degree":7,"count":50},{"degree":8,"count":14}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":231}] |
Number of extensional constraints | 231 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":231}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
NACRE 1.0.4 (complete) | 4299568 | UNSAT | 0.125109 | 0.126022 |
miniBTD 2018.07.27_3 (complete) | 4301177 | UNSAT | 0.228991 | 0.230211 |
miniBTD_12 2018.07.27_12 (complete) | 4301001 | UNSAT | 0.231564 | 0.236578 |
cosoco 1.12 (complete) | 4299565 | ? (TO) | 2519.88 | 2520.01 |
minimacht 2018.07.27 (complete) | 4300825 | ? (TO) | 2519.93 | 2520.01 |
GG's minicp 2018-04-29 (complete) | 4299566 | ? (TO) | 2520.02 | 2483.12 |
MiniCPFever 2018-04-29 (complete) | 4299567 | ? (TO) | 2520.04 | 2476.91 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299570 | ? (TO) | 2520.05 | 2479.71 |
slowpoke 2018-04-29 (incomplete) | 4299569 | ? (TO) | 2520.07 | 2493.02 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299571 | ? (TO) | 2520.09 | 2481.51 |
The dodo solver 2018-04-29 (complete) | 4299572 | ? (TO) | 2520.11 | 2492.21 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: