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

Result page for benchmark
XCSP19/ConsecutiveSquarePacking/
ConsecutiveSquarePacking-sp-30-098.xml

Jump to solvers results

General information on the benchmark

NameXCSP19/ConsecutiveSquarePacking/
ConsecutiveSquarePacking-sp-30-098.xml
MD5SUMfb27cd1d2814d0f1760e6f4b9d041fef
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 benchmark153.956
Satisfiable
(Un)Satisfiability was proved
Number of variables60
Number of constraints435
Number of domains30
Minimum domain size69
Maximum domain size98
Distribution of domain sizes[{"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},{"size":81,"count":2},{"size":82,"count":2},{"size":83,"count":2},{"size":84,"count":2},{"size":85,"count":2},{"size":86,"count":2},{"size":87,"count":2},{"size":88,"count":2},{"size":89,"count":2},{"size":90,"count":2},{"size":91,"count":2},{"size":92,"count":2},{"size":93,"count":2},{"size":94,"count":2},{"size":95,"count":2},{"size":96,"count":2},{"size":97,"count":2},{"size":98,"count":2}]
Minimum variable degree29
Maximum variable degree29
Distribution of variable degrees[{"degree":29,"count":60}]
Minimum constraint arity4
Maximum constraint arity4
Distribution of constraint arities[{"arity":4,"count":435}]
Number of extensional constraints0
Number of intensional constraints435
Distribution of constraint types[{"type":"intension","count":435}]
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)4388443SAT 153.956 149.075
PicatSAT 2019-09-12 (complete)4395111SAT 373.511 373.543
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388442SAT 970.752 965.798
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405691SAT 2196.64 283.855
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405391SAT 2201.61 286.531
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392531SAT 2203.92 285.802
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392831SAT 2314.79 300.73
cosoco 2.0 (complete)4396911? (TO) 2519.81 2520.01
BTD 19.07.01 (complete)4386955? (TO) 2519.82 2520.01
cosoco 2.0 (complete)4408171? (TO) 2519.82 2520.01
cosoco 2 (complete)4389631? (TO) 2520.03 2520.01
Concrete 3.12.2 (complete)4396011? (TO) 2520.06 2474.83
Concrete 3.12.3 (complete)4402691? (TO) 2520.07 2468.84
choco-solver 2019-09-24 (complete)4405991? (TO) 2520.09 2512.41
AbsCon 2019-07-23 (complete)4390731? (TO) 2520.11 2516.12
Concrete 3.10 (complete)4387555? (TO) 2520.12 2467.14
Concrete 3.12.2 (complete)4400891? (TO) 2520.12 2467.74
choco-solver 2019-09-16 (complete)4399091? (TO) 2520.48 633.494
choco-solver 2019-06-14 (complete)4393131? (TO) 2520.69 633.596
choco-solver 2019-09-20 (complete)4403591? (TO) 2520.73 633.605
choco-solver 2019-09-24 parallel (complete)4406891? (TO) 20041.3 2520.09
choco-solver 2019-09-16 parallel (complete)4399691? (TO) 20041.8 2520.1
choco-solver 2019-09-20 parallel (complete)4404491? (TO) 20048.2 2520.1
choco-solver 2019-06-14 parallel (complete)4393731? (TO) 20058 2520.1
cosoco 2.0 parallel (complete)4409451? (TO) 20116.2 2520.02
cosoco 2.O parallel (complete)4398191? (TO) 20119.2 2520.02

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] x[26] x[27] x[28] x[29] 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] y[26] y[27] y[28] y[29]</list> <values>25 0 75 71 70 72 10 2 69 40 38 25 56 56
25 22 0 38 56 78 50 0 75 17 0 0 71 70 41 26 26 79 25 24 19 28 74 73 34 59 48 47 34 19 59 30 81 30 0 23 48 26 0 74 48 0 43 70 69 0</values>
</instantiation>