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

Result page for benchmark
Random/Random-D-t065/
rand-2-40-40-135-065-20.xml

Jump to solvers results

General information on the benchmark

NameRandom/Random-D-t065/
rand-2-40-40-135-065-20.xml
MD5SUM29440b03c0dd3c0c5f2298a79016991a
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 benchmark0.29316
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints135
Number of domains1
Minimum domain size40
Maximum domain size40
Distribution of domain sizes[{"size":40,"count":40}]
Minimum variable degree3
Maximum variable degree13
Distribution of variable degrees[{"degree":3,"count":2},{"degree":4,"count":7},{"degree":5,"count":6},{"degree":6,"count":5},{"degree":7,"count":5},{"degree":8,"count":7},{"degree":9,"count":3},{"degree":11,"count":3},{"degree":12,"count":1},{"degree":13,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":135}]
Number of extensional constraints135
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":135}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco 2 (complete)4389964SAT 0.29316 0.294078
cosoco 2.0 (complete)4397244SAT 0.293609 0.295159
cosoco 2.0 (complete)4408504SAT 0.295788 0.297511
miniBTD 19.06.16 (complete)4391764SAT 0.391867 0.396188
NACRE 1.0.5 (complete)4391564SAT 0.452964 0.457481
NACRE 1.0.5-Hybrid (complete)4391364SAT 0.706303 0.709445
(reference) PicatSAT 2019-09-12 (complete)4407559SAT 28.7831 28.802

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] </list>
<values>21 28 10 28 32 39 32 33 24 28 20 7 7 19 1 29 7 6 23 31 39 16 10 19 3 5 0 1 35 3 25 2 15 23 31 8 15 20 36 5 </values>
</instantiation>