2017 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
AllInterval/AllInterval-m1-s1/
AllInterval-080.xml

Jump to solvers results

General information on the benchmark

NameAllInterval/AllInterval-m1-s1/
AllInterval-080.xml
MD5SUMf0cd38ecba005234ebb464e977fa1d5a
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark12.5397
Satisfiable
(Un)Satisfiability was proved
Number of variables159
Number of constraints81
Number of domains2
Minimum domain size79
Maximum domain size80
Distribution of domain sizes[{"size":79,"count":79},{"size":80,"count":80}]
Minimum variable degree2
Maximum variable degree3
Distribution of variable degrees[{"degree":2,"count":81},{"degree":3,"count":78}]
Minimum constraint arity3
Maximum constraint arity80
Distribution of constraint arities[{"arity":3,"count":79},{"arity":79,"count":1},{"arity":80,"count":1}]
Number of extensional constraints0
Number of intensional constraints79
Distribution of constraint types[{"type":"intension","count":79},{"type":"allDifferent","count":2}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-08-10 (complete)4264798SAT 12.5397 12.6387
miniBTD 2017-06-30 (complete)4252110SAT 13.4974 13.4995
Naxos 1.1.0 (complete)4252112SAT 244.415 244.459
cosoco-mini 1.1 (2017-07-29) (complete)4260058? (TO) 2400.02 2400.21
cosoco-mini 1.1 (2017-06-27) (complete)4252111? (TO) 2400.04 2399.8
cosoco-mini 1.12 (complete)4267239? (TO) 2400.1101 2400.01

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function:
Solution found:
<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] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8]
y[9] y[10] y[11] y[12] y[13] y[14] y[15] y[16] y[17] y[18] y[19] y[20] y[21] y[22] y[23] y[24] y[25] y[26] y[27] y[28] y[29] y[30] y[31]
y[32] y[33] y[34] y[35] y[36] y[37] y[38] y[39] y[40] y[41] y[42] y[43] y[44] y[45] y[46] y[47] y[48] y[49] y[50] y[51] y[52] y[53] y[54]
y[55] y[56] y[57] y[58] y[59] y[60] y[61] y[62] y[63] y[64] y[65] y[66] y[67] y[68] y[69] y[70] y[71] y[72] y[73] y[74] y[75] y[76] y[77]
y[78] </list> <values> 79 0 78 1 77 2 76 3 75 4 74 5 73 6 72 7 71 8 70 9 69 10 68 11 67 12 66 13 65 14 64 15 63 16 62 17 61 18 60 19 59 20
58 21 57 22 56 23 55 24 54 25 53 26 52 27 51 28 50 29 49 30 48 31 47 32 46 33 45 34 44 35 43 36 42 37 41 38 40 39 79 78 77 76 75 74 73 72 71
70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24
23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 </values> </instantiation>