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

Result page for benchmark
CarSequencing/CarSequencing-m1-jcr/
CarSequencing-90-07.xml

Jump to solvers results

General information on the benchmark

NameCarSequencing/CarSequencing-m1-jcr/
CarSequencing-90-07.xml
MD5SUM62ab34719a1ca197804bba3dde19efaf
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 benchmark78.8072
Satisfiable
(Un)Satisfiability was proved
Number of variables1200
Number of constraints1463
Number of domains2
Minimum domain size2
Maximum domain size27
Distribution of domain sizes[{"size":2,"count":1000},{"size":27,"count":200}]
Minimum variable degree2
Maximum variable degree93
Distribution of variable degrees[{"degree":2,"count":200},{"degree":3,"count":5},{"degree":4,"count":5},{"degree":5,"count":6},{"degree":6,"count":10},{"degree":7,"count":10},{"degree":8,"count":18},{"degree":9,"count":18},{"degree":10,"count":18},{"degree":11,"count":18},{"degree":12,"count":18},{"degree":13,"count":18},{"degree":14,"count":18},{"degree":15,"count":18},{"degree":16,"count":18},{"degree":17,"count":18},{"degree":18,"count":18},{"degree":19,"count":18},{"degree":20,"count":18},{"degree":21,"count":18},{"degree":22,"count":18},{"degree":23,"count":18},{"degree":24,"count":18},{"degree":25,"count":18},{"degree":26,"count":18},"...",{"degree":69,"count":2}, {"degree":70,"count":2}, {"degree":71,"count":2}, {"degree":72,"count":2}, {"degree":73,"count":2}, {"degree":74,"count":2}, {"degree":75,"count":2}, {"degree":76,"count":2}, {"degree":77,"count":2}, {"degree":78,"count":2}, {"degree":79,"count":2}, {"degree":80,"count":2}, {"degree":81,"count":2}, {"degree":82,"count":2}, {"degree":83,"count":2}, {"degree":84,"count":2}, {"degree":85,"count":2}, {"degree":86,"count":2}, {"degree":87,"count":2}, {"degree":88,"count":2}, {"degree":89,"count":2}, {"degree":90,"count":2}, {"degree":91,"count":2}, {"degree":92,"count":3}, {"degree":93,"count":21}]
Minimum constraint arity2
Maximum constraint arity200
Distribution of constraint arities[{"arity":2,"count":199},{"arity":3,"count":396},{"arity":5,"count":392},{"arity":6,"count":200},{"arity":14,"count":1},{"arity":17,"count":1},{"arity":20,"count":1},{"arity":22,"count":1},{"arity":23,"count":1},{"arity":24,"count":1},{"arity":26,"count":2},{"arity":28,"count":1},{"arity":29,"count":2},{"arity":30,"count":1},{"arity":32,"count":3},{"arity":34,"count":1},{"arity":35,"count":2},{"arity":36,"count":1},{"arity":38,"count":3},{"arity":40,"count":2},{"arity":41,"count":2},{"arity":42,"count":1},{"arity":44,"count":3},{"arity":45,"count":1},{"arity":46,"count":1},"...",{"arity":167,"count":2}, {"arity":168,"count":1}, {"arity":170,"count":5}, {"arity":172,"count":1}, {"arity":173,"count":2}, {"arity":174,"count":1}, {"arity":175,"count":2}, {"arity":176,"count":3}, {"arity":178,"count":1}, {"arity":179,"count":2}, {"arity":180,"count":3}, {"arity":182,"count":3}, {"arity":184,"count":1}, {"arity":185,"count":4}, {"arity":186,"count":1}, {"arity":188,"count":3}, {"arity":190,"count":3}, {"arity":191,"count":2}, {"arity":192,"count":1}, {"arity":194,"count":3}, {"arity":195,"count":2}, {"arity":196,"count":1}, {"arity":197,"count":2}, {"arity":198,"count":1}, {"arity":200,"count":6}]
Number of extensional constraints200
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":200},{"type":"sum","count":1262},{"type":"cardinality","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4395049SAT 78.8072 78.827
AbsCon 2019-07-23 (complete)4390669SAT 1284.44 1279.68
cosoco 2.0 (complete)4408109? (TO) 2520.01 2519.7
cosoco 2.0 (complete)4396849? (TO) 2520.02 2519.7
cosoco 2 (complete)4389569? (TO) 2520.02 2519.7
Concrete 3.10 (complete)4387234? (TO) 2520.07 2453.63
choco-solver 2019-09-24 (complete)4405929? (TO) 2520.08 2512.91
Concrete 3.12.2 (complete)4395949? (TO) 2520.08 2470.64
BTD 19.07.01 (complete)4386791? (TO) 2520.11 2520.01
Concrete 3.12.3 (complete)4402629? (TO) 2520.12 2466.33
Concrete 3.12.2 (complete)4400829? (TO) 2520.13 2461.93
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4387951? (TO) 2520.15 2503.66
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4387950? (TO) 2520.17 2500.14
choco-solver 2019-06-14 (complete)4393069? (TO) 2520.38 633.576
choco-solver 2019-09-16 (complete)4399029? (TO) 2520.54 633.571
choco-solver 2019-09-20 (complete)4403529? (TO) 2520.67 633.387
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392769? (TO) 18166.2 2520.23
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405629? (TO) 18568.1 2520.23
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405329? (TO) 18805.2 2520.29
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392469? (TO) 19021.8 2520.27
choco-solver 2019-09-16 parallel (complete)4399629? (TO) 20020.7 2520.13
choco-solver 2019-09-24 parallel (complete)4406829? (TO) 20022.9 2520.12
choco-solver 2019-09-20 parallel (complete)4404429? (TO) 20025.4 2520.13
choco-solver 2019-06-14 parallel (complete)4393669? (TO) 20059.2 2520.11
cosoco 2.O parallel (complete)4398129? (TO) 20115.5 2520.02
cosoco 2.0 parallel (complete)4409389? (TO) 20117.6 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> cls[] opt[][]  </list> <values> 22 19 20 2 16 11 13 0 11 5 11 10 24 20 11 26 10 4 9 20 11 5 8 20 21 20 11 12 11 5 11
3 19 16 21 3 11 23 10 18 11 20 25 16 6 14 0 14 11 15 2 16 11 26 6 14 0 10 5 8 20 25 7 10 23 0 14 11 3 19 20 22 14 10 3 25 4 22 25 20 10 24
20 11 5 9 20 11 26 11 16 2 20 10 26 11 13 2 20 10 26 10 20 2 20 15 18 11 11 26 10 4 21 14 0 11 14 24 16 11 18 11 20 1 11 5 0 14 11 0 5 11 3
21 20 22 14 11 5 0 10 14 6 22 14 10 26 11 4 9 16 11 26 11 16 1 20 11 14 0 16 19 3 21 20 0 13 11 5 0 20 19 7 11 14 22 20 21 3 19 10 20 9 20
11 21 3 11 21 6 11 26 10 16 24 20 11 5 10 17  0 1 1 1 0 0 0 0 0 1 1 1 0 0 0 0 0 1 0 0 1 1 0 1 0 0 1 0 0 0 1 0 0 1 1 0 1 1 0 0 0 1 0 0 0 1 0
0 1 0 0 1 0 0 0 0 1 0 1 0 0 0 1 0 1 1 1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 0 0 1 1 0 1 1 0 0 0 0 1 0 0 0 1 0 0 1 0 0 1 1 0 1 1 1
0 0 0 0 0 0 1 0 1 1 0 0 0 0 1 0 0 0 1 0 1 0 1 0 1 0 0 0 1 0 0 1 0 0 1 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 0 1 0 0 0 0 1 0 1 1 1 0 0 0 1 0 0 0 1 0
0 0 1 0 1 0 1 0 1 0 1 1 0 0 1 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 1 0 0 1 0 0 1 1 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 1 0 0 0 0 1 0 1 1 0 0 1 0 0 1 1
0 1 0 0 1 0 0 0 1 0 1 0 0 0 1 0 0 1 1 0 0 0 0 0 1 1 0 0 0 1 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 1 0 1 0 1 0 0 0 1 0 1
1 0 0 1 0 0 0 0 0 1 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 0 0 0 0 1 1 1 0 1 0 0 0 0 0 1 0 1 0 1 1 1 0 0 0 0 0 0 0 1 1 0 0 1 0 1 1 1 0 0 0 0 0 0 1 1
0 0 0 0 1 0 1 0 0 0 1 0 1 1 1 0 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 1 0 1 1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 0 1 1 0 0 0 0 1
0 1 0 1 0 1 0 0 0 1 0 0 0 1 0 0 1 1 0 0 1 0 0 1 1 0 0 0 0 1 0 1 0 1 0 1 0 0 0 1 0 1 0 1 1 0 0 0 0 0 1 0 0 1 1 0 0 0 0 1 0 1 1 1 0 1 1 0 0 1
0 0 0 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 0 0 0 1 0 1 0 0 0 0 0 1 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 1 1 1 0 1 0 0 1 0 0 0 1 0 1 1 0 0 1
0 0 0 1 1 0 0 0 0 0 1 1 1 0 1 0 0 0 1 0 0 1 0 0 1 1 0 0 1 0 0 0 0 0 1 0 0 0 0 1 1 0 0 1 0 0 1 0 0 1 0 0 0 1 1 1 0 0 0 0 0 1 0 1 1 0 0 0 0 1
1 1 0 1 0 0 0 0 0 1 0 0 0 1 0 0 1 0 0 1 1 0 0 0 1 0 1 0 1 0 0 0 0 0 1 0 0 1 0 1 1 1 0 1 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 1 0 0 0 1 1 0 0 1 0 0
1 1 0 1 1 0 1 0 0 1 0 0 0 1 0 1 0 0 0 1 0 0 0 1 1 0 1 0 0 0 1 1 1 1 1 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 1 0 0 1 1 0 1 0 0 0 0 0 1 1 1 1 0 0 0 0
0 1 0 1 1 0 0 0 0 1 1 0 0 1 0 0 1 1 0 1 0 0 0 1 0 0 1 0 0 1 1 0 0 1 1 0 0 0 0 0 0 0 1 1 1 1 1 0 0 1 0 0 0 1 0 0 0 0 0 1 1 1 0 1 1 0 0 0 0 0
0 1 0 1 1 1 0 0 0 0 0 0 1 0 1 0 1 0 1 1 0 0 0 0 0 1 1 0 1 1 0 0 0 0 1 0 0 0 0 0 0 1 0 1 1 1 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 1 0 1 0 0 0 1 0
1 0 0 0 1 0 1 0 1 1 0 1 0 0 0 1 0 1 1 1 0 0 0 0 1 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 1 0 1   </values> </instantiation>