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

Result page for benchmark
Random/Random-D-t080/
rand-2-40-80-103-080-39.xml

Jump to solvers results

General information on the benchmark

NameRandom/Random-D-t080/
rand-2-40-80-103-080-39.xml
MD5SUM3eef0953f9cbf23d9932dd1c3605fafe
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 benchmark2.0959201
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints103
Number of domains1
Minimum domain size80
Maximum domain size80
Distribution of domain sizes[{"size":80,"count":40}]
Minimum variable degree2
Maximum variable degree12
Distribution of variable degrees[{"degree":2,"count":3},{"degree":3,"count":6},{"degree":4,"count":7},{"degree":5,"count":7},{"degree":6,"count":11},{"degree":7,"count":1},{"degree":8,"count":2},{"degree":9,"count":2},{"degree":12,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":103}]
Number of extensional constraints103
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":103}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco-mini 1.1 (2017-06-27) (complete)4251813SAT 2.06133 2.06134
cosoco-mini 1.1 (2017-07-29) (complete)4260243SAT 2.0655899 2.12906
cosoco-mini 1.12 (complete)4267424SAT 2.0959201 2.09723
miniBTD 2017-08-10 (complete)4264983SAT 2.4830999 2.5655899
miniBTD 2017-06-30 (complete)4251812SAT 2.5143 2.51546
Naxos 1.1.0 (complete)4251814? (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>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>18 56 33 39 68 33 39 52 4 2 38 56 1 75 38 42 36 2 74 22 54 2 54 17 34 8 70 32 16 75 59 1 37 31 0 55 62 73 43 14 </values>
</instantiation>