2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
Mario/
Mario-easy-5_c18.xml

Jump to solvers results

General information on the benchmark

NameMario/
Mario-easy-5_c18.xml
MD5SUM4fc2559afebff091b84e9ba27308c103
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark445
Best CPU time to get the best result obtained on this benchmark2.49211
Satisfiable
(Un)Satisfiability was proved
Number of variables45
Number of constraints31
Number of domains30
Minimum domain size1
Maximum domain size15
Distribution of domain sizes[{"size":1,"count":2},{"size":2,"count":13},{"size":14,"count":1},{"size":15,"count":29}]
Minimum variable degree1
Maximum variable degree3
Distribution of variable degrees[{"degree":1,"count":2},{"degree":2,"count":29},{"degree":3,"count":14}]
Minimum constraint arity1
Maximum constraint arity15
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":28},{"arity":15,"count":2}]
Number of extensional constraints15
Number of intensional constraints14
Distribution of constraint types[{"type":"extension","count":15},{"type":"intension","count":14},{"type":"sum","count":1},{"type":"circuit","count":1}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - Hybrid 2018-08-14 (complete)4310474OPT445 2.49211 1.34997
Mistral-2.0 2018-08-01 (complete)4312700OPT445 2.67089 2.67154
Choco-solver 4.0.7b seq (e747e1e) (complete)4302002OPT445 2.71282 1.05747
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312334OPT445 2.79367 1.46156
Concrete 3.9.2 (complete)4302498OPT445 13.9973 6.4081
Concrete 3.9.2-SuperNG (complete)4302848OPT445 14.2538 6.386
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310124SAT (TO)445 252.048 247.22
cosoco 1.12 (complete)4302004? (NS) 0.010899 0.0118081
Sat4j-CSP 2018-07-11 (complete)4302003? (TO) 252.579 138.072

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: 445
Solution found:
<instantiation> <list> s[0] s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] s[10] s[11] s[12] s[13] s[14] f[0] f[1] f[2] f[3] f[4] f[5] f[6]
f[7] f[8] f[9] f[10] f[11] f[12] f[13] f[14] g[0] g[1] g[2] g[3] g[4] g[5] g[6] g[7] g[8] g[9] g[10] g[11] g[12] g[13] g[14] </list>
<values> 2 0 12 8 11 13 3 10 7 9 14 1 5 6 4 18 0 189 71 11 139 490 79 72 0 210 271 146 211 86 0 0 74 24 6 5 54 91 22 0 31 3 47 60 28
</values> </instantiation>