2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
RectPacking/RectPacking-m1-perf/
RectPacking-perfect-097.xml

Jump to solvers results

General information on the benchmark

NameRectPacking/RectPacking-m1-perf/
RectPacking-perfect-097.xml
MD5SUM8967691277ed469002b27945208c5243
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 benchmark53.043
Satisfiable
(Un)Satisfiability was proved
Number of variables50
Number of constraints53
Number of domains1
Minimum domain size336
Maximum domain size336
Distribution of domain sizes[{"size":336,"count":50}]
Minimum variable degree2
Maximum variable degree4
Distribution of variable degrees[{"degree":2,"count":48},{"degree":3,"count":1},{"degree":4,"count":1}]
Minimum constraint arity1
Maximum constraint arity50
Distribution of constraint arities[{"arity":1,"count":51},{"arity":2,"count":1},{"arity":50,"count":1}]
Number of extensional constraints0
Number of intensional constraints52
Distribution of constraint types[{"type":"intension","count":52},{"type":"noOverlap","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4387891SAT 53.043 49.3315
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4387890SAT 57.9751 54.0883
PicatSAT 2019-09-12 (complete)4394923SAT 81.1382 81.1496
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392643SAT 171.552 25.1203
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405503SAT 171.666 25.1696
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405203SAT 172.048 25.5647
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392343SAT 173.821 25.2058
cosoco 2.O parallel (complete)4398003? 350.927 351.134
cosoco 2.0 parallel (complete)4409263? 405.543 405.747
cosoco 2.0 (complete)4407983? (MO) 171.074 172.757
cosoco 2.0 (complete)4396723? (MO) 173.536 175.367
cosoco 2 (complete)4389443? (MO) 175.041 176.773
BTD 19.07.01 (complete)4386771? (NS) 0.011352 0.0116339
AbsCon 2019-07-23 (complete)4390543? (TO) 2520.02 2510.31
Concrete 3.10 (complete)4387199? (TO) 2520.04 2469.23
Concrete 3.12.2 (complete)4400703? (TO) 2520.08 2470.33
Concrete 3.12.3 (complete)4402503? (TO) 2520.11 2470.04
choco-solver 2019-09-24 (complete)4405803? (TO) 2520.11 2496.71
Concrete 3.12.2 (complete)4395823? (TO) 2520.13 2467.04
choco-solver 2019-09-16 (complete)4398903? (TO) 2520.33 637.074
choco-solver 2019-06-14 (complete)4392943? (TO) 2520.35 637.461
choco-solver 2019-09-20 (complete)4403403? (TO) 2520.52 637.391
choco-solver 2019-09-20 parallel (complete)4404303? (TO) 19755.3 2520.17
choco-solver 2019-09-16 parallel (complete)4399503? (TO) 19793.2 2520.1
choco-solver 2019-09-24 parallel (complete)4406703? (TO) 19950.1 2520.12
choco-solver 2019-06-14 parallel (complete)4393543? (TO) 19964.1 2520.13

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] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8] y[9] y[10] y[11] y[12] y[13] y[14] y[15] y[16] y[17] y[18] y[19] y[20]
y[21] y[22] y[23] y[24]</list> <values>224 105 101 101 176 108 118 101 79 105 73 226 224 184 73 176 79 118 0 262 0 132 226 184 0 190 253 253
246 184 246 242 229 257 256 229 190 152 152 184 192 283 184 184 152 257 242 226 0 0</values> </instantiation>