2018 XCSP3 competition: mini-solvers track: solvers results per benchmarks

Result page for benchmark
Dubois/
Dubois-018_c18.xml

Jump to solvers results

General information on the benchmark

NameDubois/
Dubois-018_c18.xml
MD5SUM87315209bf8a3d7a2526762832107213
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.005713
Satisfiable
(Un)Satisfiability was proved
Number of variables54
Number of constraints36
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":54}]
Minimum variable degree2
Maximum variable degree2
Distribution of variable degrees[{"degree":2,"count":54}]
Minimum constraint arity3
Maximum constraint arity3
Distribution of constraint arities[{"arity":3,"count":36}]
Number of extensional constraints36
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":36}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
NACRE 1.0.4 (complete)4299504UNSAT 0.005713 0.00659606
miniBTD_12 2018.07.27_12 (complete)4300879UNSAT 0.005881 0.00662109
miniBTD 2018.07.27_3 (complete)4301055UNSAT 0.005911 0.00662004
GG's minicp 2018-04-29 (complete)4299502UNSAT 5.65856 4.52352
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete)4299506UNSAT 6.77555 5.86929
MiniCPFever 2018-04-29 (complete)4299503UNSAT 6.90009 5.763
The dodo solver 2018-04-29 (complete)4299508UNSAT 7.37486 5.7105
minimacht 2018.07.27 (complete)4300703UNSAT 18.8356 18.8381
cosoco 1.12 (complete)4299501UNSAT 20.6362 20.6383
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete)4299507? 308.751 304.8
slowpoke 2018-04-29 (incomplete)4299505? (TO) 2520.06 2501.31

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: