| Name | Rlfap_mini/Rlfap-dec-scens11_mini/ Rlfap-ext-scen-11-f06_c18.xml |
| MD5SUM | cec9dbb3d02bbc946a79304f637ed809 |
| 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.438058 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 680 |
| Number of constraints | 4103 |
| Number of domains | 5 |
| Minimum domain size | 6 |
| Maximum domain size | 38 |
| Distribution of domain sizes | [{"size":6,"count":2},{"size":21,"count":4},{"size":22,"count":10},{"size":31,"count":336},{"size":38,"count":328}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 62 |
| Distribution of variable degrees | [{"degree":1,"count":1},{"degree":3,"count":26},{"degree":4,"count":13},{"degree":5,"count":86},{"degree":6,"count":20},{"degree":7,"count":89},{"degree":8,"count":12},{"degree":9,"count":87},{"degree":10,"count":28},{"degree":11,"count":42},{"degree":12,"count":25},{"degree":13,"count":40},{"degree":14,"count":14},{"degree":15,"count":40},{"degree":16,"count":8},{"degree":17,"count":29},{"degree":18,"count":6},{"degree":19,"count":18},{"degree":20,"count":13},{"degree":21,"count":11},{"degree":22,"count":7},{"degree":23,"count":7},{"degree":24,"count":8},{"degree":25,"count":8},{"degree":27,"count":9},{"degree":28,"count":8},{"degree":29,"count":2},{"degree":30,"count":6},{"degree":31,"count":1},{"degree":35,"count":3},{"degree":36,"count":3},{"degree":38,"count":2},{"degree":39,"count":2},{"degree":42,"count":1},{"degree":43,"count":1},{"degree":44,"count":1},{"degree":47,"count":1},{"degree":55,"count":1},{"degree":62,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":4103}] |
| Number of extensional constraints | 4103 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":4103}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.4 (complete) | 4298088 | UNSAT | 0.438058 | 0.43922 |
| cosoco 1.12 (complete) | 4298085 | UNSAT | 1.24692 | 1.24721 |
| miniBTD_12 2018.07.27_12 (complete) | 4301024 | UNSAT | 10.775 | 10.7752 |
| miniBTD 2018.07.27_3 (complete) | 4301200 | UNSAT | 12.2503 | 12.2527 |
| minimacht 2018.07.27 (complete) | 4300848 | UNSAT | 14.4229 | 14.4275 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298091 | ? (TO) | 2520.02 | 2505.31 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298090 | ? (TO) | 2520.02 | 2505.61 |
| The dodo solver 2018-04-29 (complete) | 4298092 | ? (TO) | 2520.05 | 2483.22 |
| GG's minicp 2018-04-29 (complete) | 4298086 | ? (TO) | 2520.08 | 2504.63 |
| MiniCPFever 2018-04-29 (complete) | 4298087 | ? (TO) | 2520.09 | 2471.43 |
| slowpoke 2018-04-29 (incomplete) | 4298089 | ? (TO) | 2520.1 | 2502.91 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: