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

Result page for benchmark
QRandom/QRandom-reg2ext-s1/
reg-s20-p03-c20-d10-n10-l5-73.xml

Jump to solvers results

General information on the benchmark

NameQRandom/QRandom-reg2ext-s1/
reg-s20-p03-c20-d10-n10-l5-73.xml
MD5SUM97112bc138fd6681517478d594a2a525
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 benchmark6.9692001
Satisfiable
(Un)Satisfiability was proved
Number of variables130
Number of constraints100
Number of domains23
Minimum domain size1
Maximum domain size20
Distribution of domain sizes[{"size":1,"count":20},{"size":6,"count":20},{"size":10,"count":10},{"size":20,"count":80}]
Minimum variable degree1
Maximum variable degree13
Distribution of variable degrees[{"degree":1,"count":40},{"degree":2,"count":80},{"degree":7,"count":1},{"degree":8,"count":1},{"degree":9,"count":2},{"degree":10,"count":2},{"degree":11,"count":2},{"degree":12,"count":1},{"degree":13,"count":1}]
Minimum constraint arity3
Maximum constraint arity3
Distribution of constraint arities[{"arity":3,"count":100}]
Number of extensional constraints100
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":100}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-08-10 (complete)4264976SAT 3.14972 3.1507299
miniBTD 2017-06-30 (complete)4252313SAT 3.20578 3.20694
cosoco-mini 1.12 (complete)4267417SAT 6.9692001 6.9689202
cosoco-mini 1.1 (2017-06-27) (complete)4252314SAT 6.97965 6.98007
cosoco-mini 1.1 (2017-07-29) (complete)4260236SAT 6.9945502 7.0613899
Naxos 1.1.0 (complete)4252315? (TO) 2400.02 2400

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> w3 w4 w5 w6 w7 w8 w9 w10 w11 w12 w13 w14 w15 w16 w17 w18 w19 w20 w21 w22 x[0] x[1] x[2] x[3] x[4]
x[5] x[6] x[7] x[8] x[9] 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] z[0]
z[1] z[2] z[3] z[4] z[5] z[6] z[7] z[8] z[9] z[10] z[11] z[12] z[13] z[14] z[15] z[16] z[17] z[18] z[19] z[20] z[21] z[22] z[23] z[24] z[25]
z[26] z[27] z[28] z[29] z[30] z[31] z[32] z[33] z[34] z[35] z[36] z[37] z[38] z[39] z[40] z[41] z[42] z[43] z[44] z[45] z[46] z[47] z[48]
z[49] z[50] z[51] z[52] z[53] z[54] z[55] z[56] z[57] z[58] z[59] z[60] z[61] z[62] z[63] z[64] z[65] z[66] z[67] z[68] z[69] z[70] z[71]
z[72] z[73] z[74] z[75] z[76] z[77] z[78] z[79] </list> <values> 12 17 5 9 1 10 4 6 18 17 9 10 2 18 14 5 18 9 0 18 1 7 1 5 5 5 5 9 6 9 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 14 5 14 10 6 12 9 7 2 18 10 4 13 16 2 4 7 18 17 16 11 1 14 2 9 3 13 12 6 5 0 6 12 7 7 7 5 19 15 15 7 19 18
5 6 3 3 17 1 6 2 6 6 4 0 17 16 7 3 3 7 5 11 18 3 8 0 1 14 11 2 7 10 7 16 12 17 4 17 5 </values> </instantiation>