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

Result page for benchmark
MarketSplit/MarketSplit-m1-gp/
MarketSplit-08.xml

Jump to solvers results

General information on the benchmark

NameMarketSplit/MarketSplit-m1-gp/
MarketSplit-08.xml
MD5SUMc33b611f783ff62a93dcb2ff1216bc06
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 benchmark7.18976
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints4
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":30}]
Minimum variable degree4
Maximum variable degree4
Distribution of variable degrees[{"degree":4,"count":30}]
Minimum constraint arity30
Maximum constraint arity30
Distribution of constraint arities[{"arity":30,"count":4}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":4}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 19.06.16 (complete)4391843SAT 7.18976 7.19384
(reference) PicatSAT 2019-09-12 (complete)4407682SAT 52.7474 52.7494
cosoco 2 (complete)4390043SAT 68.8443 68.8386
cosoco 2.0 (complete)4397323SAT 69.2283 69.2228
cosoco 2.0 (complete)4408583SAT 80.3296 80.3332
NACRE 1.0.5-Hybrid (complete)4391443SAT 226.792 226.798
NACRE 1.0.5 (complete)4391643SAT 466.269 466.227

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