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

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

Jump to solvers results

General information on the benchmark

NameMarketSplit/MarketSplit-m1-gp/
MarketSplit-10.xml
MD5SUM12bfb070d62c3c52bb7bd12298b2d530
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 benchmark1563.25
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 degree3
Maximum variable degree4
Distribution of variable degrees[{"degree":3,"count":1},{"degree":4,"count":29}]
Minimum constraint arity29
Maximum constraint arity30
Distribution of constraint arities[{"arity":29,"count":1},{"arity":30,"count":3}]
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
Naxos 1.1.0 (complete)4252944SAT 65.1679 65.1713
cosoco-mini 1.1 (2017-07-29) (complete)4260152SAT 273.12601 273.20499
cosoco-mini 1.12 (complete)4267333SAT 273.194 273.18201
cosoco-mini 1.1 (2017-06-27) (complete)4252943SAT 276.528 276.52
miniBTD 2017-06-30 (complete)4252942SAT 1562.3 1562.33
miniBTD 2017-08-10 (complete)4264892SAT 1563.25 1563.5

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