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

Result page for benchmark
Driver/
Driver-m1-s1/driverlogw-01c.xml

Jump to solvers results

General information on the benchmark

NameDriver/
Driver-m1-s1/driverlogw-01c.xml
MD5SUM91a89527f75c87fa26db92386f49e27c
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.0076040002
Satisfiable
(Un)Satisfiability was proved
Number of variables71
Number of constraints217
Number of domains3
Minimum domain size2
Maximum domain size4
Distribution of domain sizes[{"size":2,"count":32},{"size":3,"count":25},{"size":4,"count":14}]
Minimum variable degree1
Maximum variable degree10
Distribution of variable degrees[{"degree":1,"count":2},{"degree":2,"count":5},{"degree":3,"count":3},{"degree":4,"count":7},{"degree":5,"count":5},{"degree":6,"count":14},{"degree":7,"count":20},{"degree":8,"count":6},{"degree":9,"count":2},{"degree":10,"count":7}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":217}]
Number of extensional constraints217
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":217}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-08-10 (complete)4264811SAT 0.0060279998 0.0073091001
miniBTD 2017-06-30 (complete)4252668SAT 0.006054 0.00665012
Naxos 1.1.0 (complete)4252670SAT 0.006525 0.00715097
cosoco-mini 1.1 (2017-07-29) (complete)4260071SAT 0.0073779998 0.048668101
cosoco-mini 1.12 (complete)4267252SAT 0.0076040002 0.0082600396
cosoco-mini 1.1 (2017-06-27) (complete)4252669SAT 0.007688 0.00835812

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] 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] 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] </list> <values> 0 0 1 0 1 1 0 0 1 1 0 1 0 1 1 1 0 0 1 1 0 1 0 0 0 0 1 1 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0
0 0 0 0 0 0 1 1 1 0 1 1 1 1 1 1 1 1 </values> </instantiation>