2019 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Cutstock/Cutstock-zinc-s1/
Cutstock-t13-4.xml

Jump to solvers results

General information on the benchmark

NameCutstock/Cutstock-zinc-s1/
Cutstock-t13-4.xml
MD5SUMb990a8dd86881825c48c70a9797e9fb6
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark48
Best CPU time to get the best result obtained on this benchmark17.0244
Satisfiable
(Un)Satisfiability was proved
Number of variables693
Number of constraints75
Number of domains8
Minimum domain size2
Maximum domain size21
Distribution of domain sizes[{"size":2,"count":189},{"size":5,"count":63},{"size":7,"count":126},{"size":10,"count":63},{"size":17,"count":63},{"size":19,"count":63},{"size":20,"count":63},{"size":21,"count":63}]
Minimum variable degree3
Maximum variable degree3
Distribution of variable degrees[{"degree":3,"count":693}]
Minimum constraint arity11
Maximum constraint arity630
Distribution of constraint arities[{"arity":11,"count":63},{"arity":63,"count":11},{"arity":630,"count":1}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"ordered","count":1},{"type":"lex","count":1},{"type":"sum","count":73}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
AbsCon 2019-07-23 (complete)4391197OPT48 17.0244 14.2286
choco-solver 2019-09-16 (complete)4400457OPT48 43.274 11.1916
choco-solver 2019-06-14 (complete)4394197OPT48 44.3297 13.8791
choco-solver 2019-09-20 (complete)4404057OPT48 44.7201 11.5691
PicatSAT 2019-09-12 (complete)4395577OPT48 68.3022 68.3002
choco-solver 2019-09-24 parallel (complete)4407357OPT48 89.1798 11.7831
choco-solver 2019-09-20 parallel (complete)4404957OPT48 97.5728 12.7846
choco-solver 2019-09-16 parallel (complete)4400157OPT48 98.9227 12.9535
Concrete 3.10 (complete)4392097OPT48 105.789 84.2446
choco-solver 2019-06-14 parallel (complete)4394497OPT48 107.703 14.1894
choco-solver 2019-09-24 (complete)4406457OPT48 420.518 415.738
cosoco 2.O parallel (complete)4398657OPT48 442.677 55.4742
cosoco 2.0 parallel (complete)4409917OPT48 488.242 61.2097
Concrete 3.12.2 (complete)4401357OPT48 685.203 667.998
Concrete 3.12.3 (complete)4403157OPT48 1392.89 1367.34
cosoco 2.0 (complete)4409017SAT (TO)48 2400.02 2400.11
cosoco 2.0 (complete)4397757SAT (TO)48 2400.03 2400
cosoco 2 (complete)4390297SAT (TO)48 2400.05 2400.01
Concrete 3.12.2 (complete)4396477SAT (TO)48 2400.06 2376.14

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: 48
Solution found:
<instantiation id='sol8' type='solution' cost='48'>  <list> p[] r[][] </list>  <values> 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0
0 0 0 0 0 0 1 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 1 0
0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 1 0
0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0
0 2 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0
0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 0 0 0 3 0 0 0
0 0 0 2 0 1 0 0 0 0 0 0 0 2 0 0 1 0 0 0 0 0 0 2 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values>  </instantiation>