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

Result page for benchmark
XCSP19/ConsecutiveSquarePacking/
ConsecutiveSquarePacking-sp-26-080.xml

Jump to solvers results

General information on the benchmark

NameXCSP19/ConsecutiveSquarePacking/
ConsecutiveSquarePacking-sp-26-080.xml
MD5SUM82f2ba8c739d4bfd8362bd41c1ff224a
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 benchmark7.46308
Satisfiable
(Un)Satisfiability was proved
Number of variables52
Number of constraints325
Number of domains26
Minimum domain size55
Maximum domain size80
Distribution of domain sizes[{"size":55,"count":2},{"size":56,"count":2},{"size":57,"count":2},{"size":58,"count":2},{"size":59,"count":2},{"size":60,"count":2},{"size":61,"count":2},{"size":62,"count":2},{"size":63,"count":2},{"size":64,"count":2},{"size":65,"count":2},{"size":66,"count":2},{"size":67,"count":2},{"size":68,"count":2},{"size":69,"count":2},{"size":70,"count":2},{"size":71,"count":2},{"size":72,"count":2},{"size":73,"count":2},{"size":74,"count":2},{"size":75,"count":2},{"size":76,"count":2},{"size":77,"count":2},{"size":78,"count":2},{"size":79,"count":2},{"size":80,"count":2}]
Minimum variable degree25
Maximum variable degree25
Distribution of variable degrees[{"degree":25,"count":52}]
Minimum constraint arity4
Maximum constraint arity4
Distribution of constraint arities[{"arity":4,"count":325}]
Number of extensional constraints0
Number of intensional constraints325
Distribution of constraint types[{"type":"intension","count":325}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388433SAT 7.46308 3.93938
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4388434SAT 7.66902 3.61361
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405426SAT 8.45691 3.53452
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392566SAT 8.50997 3.66324
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392266SAT 8.69896 3.71934
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405126SAT 8.8867 3.48649
PicatSAT 2019-09-12 (complete)4394846SAT 90.0179 90.0216
choco-solver 2019-06-14 (complete)4392866SAT 188.926 47.8448
choco-solver 2019-06-14 parallel (complete)4393466SAT 395.692 50.5306
choco-solver 2019-09-16 (complete)4398826SAT 478.737 120.654
choco-solver 2019-09-20 (complete)4403326SAT 481.68 121.33
choco-solver 2019-09-24 parallel (complete)4406626SAT 972.873 123.348
choco-solver 2019-09-20 parallel (complete)4404226SAT 979.992 123.766
choco-solver 2019-09-16 parallel (complete)4399426SAT 1023.97 129.472
BTD 19.07.01 (complete)4386952? (TO) 2519.8 2520.01
cosoco 2 (complete)4389366? (TO) 2519.81 2520.01
cosoco 2.0 (complete)4407906? (TO) 2520.04 2520.01
Concrete 3.10 (complete)4387552? (TO) 2520.06 2468.14
Concrete 3.12.2 (complete)4395746? (TO) 2520.06 2484.43
Concrete 3.12.3 (complete)4402426? (TO) 2520.06 2470.54
cosoco 2.0 (complete)4396646? (TO) 2520.08 2519.8
choco-solver 2019-09-24 (complete)4405726? (TO) 2520.09 2512.02
AbsCon 2019-07-23 (complete)4390466? (TO) 2520.11 2513.31
Concrete 3.12.2 (complete)4400626? (TO) 2520.13 2469.64
cosoco 2.0 parallel (complete)4409186? (TO) 20118.6 2520.02
cosoco 2.O parallel (complete)4397926? (TO) 20119.4 2520.01

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] 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] y[25]</list> <values>10 32 23 22 47 47 32 39 1 0 19 53 19 18 65 64 47 0 0 10 26 0 57 30 32 54 39 24 63 59 51
57 51 51 1 10 20 51 31 44 49 64 63 40 20 0 59 58 26 0 26 0</values> </instantiation>