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

Result page for benchmark
MaxCSP/MaxCSP-random-denseLoose/
rand-30-10-25-48-32.xml

Jump to solvers results

General information on the benchmark

NameMaxCSP/MaxCSP-random-denseLoose/
rand-30-10-25-48-32.xml
MD5SUM2ec9b332d00a6737d40ecfaa84fd3121
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.011318
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints109
Number of domains1
Minimum domain size10
Maximum domain size10
Distribution of domain sizes[{"size":10,"count":30}]
Minimum variable degree2
Maximum variable degree13
Distribution of variable degrees[{"degree":2,"count":3},{"degree":4,"count":1},{"degree":5,"count":3},{"degree":6,"count":4},{"degree":7,"count":3},{"degree":8,"count":8},{"degree":9,"count":1},{"degree":10,"count":4},{"degree":11,"count":2},{"degree":13,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":109}]
Number of extensional constraints109
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":109}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
NACRE 1.0.5-Hybrid (complete)4391372UNSAT 0.011318 0.0129231
NACRE 1.0.5 (complete)4391572UNSAT 0.011575 0.012638
cosoco 2 (complete)4389972UNSAT 0.020301 0.0249249
cosoco 2.0 (complete)4397252UNSAT 0.021708 0.0964339
miniBTD 19.06.16 (complete)4391772UNSAT 0.022368 0.0226119
cosoco 2.0 (complete)4408512UNSAT 0.023098 0.648383
(reference) PicatSAT 2019-09-12 (complete)4407527UNSAT 0.189231 0.209627

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: