2017 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 benchmark33.587799
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
cosoco-mini 1.1 (2017-07-29) (complete)4260150SAT 33.577099 33.624901
cosoco-mini 1.12 (complete)4267331SAT 33.587799 33.594002
cosoco-mini 1.1 (2017-06-27) (complete)4252949SAT 33.6111 33.6087
Naxos 1.1.0 (complete)4252950SAT 51.6385 51.6436
miniBTD 2017-08-10 (complete)4264890SAT 2265.6499 2265.75
miniBTD 2017-06-30 (complete)4252948SAT 2291.99 2292.22

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>