| Name | Sat/Sat-m1-jnh/ jnh-213.xml |
| MD5SUM | 209f05ce72d0c617a2bb68ea993901fe |
| 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.062155999 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 797 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":100}] |
| Minimum variable degree | 26 |
| Maximum variable degree | 58 |
| Distribution of variable degrees | [{"degree":26,"count":1},{"degree":28,"count":4},{"degree":29,"count":2},{"degree":30,"count":3},{"degree":32,"count":5},{"degree":33,"count":3},{"degree":34,"count":3},{"degree":35,"count":6},{"degree":36,"count":5},{"degree":37,"count":3},{"degree":38,"count":8},{"degree":39,"count":8},{"degree":40,"count":6},{"degree":41,"count":10},{"degree":42,"count":8},{"degree":43,"count":7},{"degree":44,"count":3},{"degree":45,"count":3},{"degree":46,"count":6},{"degree":47,"count":2},{"degree":48,"count":1},{"degree":49,"count":1},{"degree":51,"count":1},{"degree":58,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 11 |
| Distribution of constraint arities | [{"arity":2,"count":73},{"arity":3,"count":151},{"arity":4,"count":144},{"arity":5,"count":157},{"arity":6,"count":110},{"arity":7,"count":75},{"arity":8,"count":49},{"arity":9,"count":26},{"arity":10,"count":9},{"arity":11,"count":3}] |
| Number of extensional constraints | 797 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":797}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252024 | SAT | 0.035681 | 0.0375299 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260275 | SAT | 0.036270998 | 0.142341 |
| cosoco-mini 1.12 (complete) | 4267456 | SAT | 0.036853999 | 0.037034001 |
| Naxos 1.1.0 (complete) | 4252025 | SAT | 0.051678 | 0.0517721 |
| miniBTD 2017-06-30 (complete) | 4252023 | SAT | 0.061504 | 0.0620401 |
| miniBTD 2017-08-10 (complete) | 4265015 | SAT | 0.062155999 | 0.062896997 |
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] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] </list> <values>1 0 0 1 0 1 1 0 1 0 1 0 0 0 0 1 1 0 1 0 0 1 0 0 0 0 1 0 1 0 0 0 0 0 0 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 0 0 0 1 1 1 0 1 1 1 0 0 0 1 0 0 1 1 0 </values> </instantiation>