| Name | Rlfap_mini/Rlfap-dec-scens11_mini/ Rlfap-ext-scen-11-f02_c18.xml |
| MD5SUM | 7ac25fa9c4532324d4bc78edd5427656 |
| 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 | 95.9442 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 680 |
| Number of constraints | 4103 |
| Number of domains | 5 |
| Minimum domain size | 6 |
| Maximum domain size | 42 |
| Distribution of domain sizes | [{"size":6,"count":2},{"size":22,"count":10},{"size":23,"count":4},{"size":35,"count":336},{"size":42,"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.5-Hybrid (complete) | 4391403 | UNSAT | 95.9442 | 95.9438 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407880 | UNSAT | 181.22 | 181.225 |
| cosoco 2.0 (complete) | 4408543 | UNSAT | 298.414 | 298.415 |
| cosoco 2.0 (complete) | 4397283 | UNSAT | 299.338 | 299.308 |
| cosoco 2 (complete) | 4390003 | UNSAT | 300.456 | 300.466 |
| NACRE 1.0.5 (complete) | 4391603 | UNSAT | 1877.41 | 1877.32 |
| miniBTD 19.06.16 (complete) | 4391803 | ? (TO) | 2400.07 | 2400.2 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: