2018 XCSP3 competition: sequential solvers tracks: solvers results per benchmarks

Result page for benchmark
CarSequencing/
CarSequencing-90-02_c18.xml

Jump to solvers results

General information on the benchmark

NameCarSequencing/
CarSequencing-90-02_c18.xml
MD5SUMa45a1bbd084788784bb8b4db38c38ff4
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 benchmark129.751
Satisfiable
(Un)Satisfiability was proved
Number of variables1200
Number of constraints1453
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":22,"count":1},{"arity":24,"count":1},{"arity":26,"count":1},{"arity":28,"count":1},{"arity":29,"count":1},{"arity":30,"count":1},{"arity":32,"count":2},{"arity":34,"count":1},{"arity":35,"count":1},{"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":47,"count":2},{"arity":48,"count":1},{"arity":50,"count":4},{"arity":52,"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":1252},{"type":"cardinality","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
PicatSAT 2018-06-15 (complete)4295063SAT 129.751 129.769
PicatSAT 2018-08-02 (complete)4303247SAT 130.246 130.245
scop order+MapleCOMSPS (2018-07-31) (complete)4305328SAT 212.261 189.661
PicatSAT 2018-08-14 (complete)4309587SAT 246.37 246.355
scop order+MapleCOMSPS (2018-06-13) (complete)4295065? (MO) 41.5421 22.0563
scop both+MapleCOMSPS (2018-06-13) (complete)4295064? (MO) 46.1549 26.1576
BTD 2018.06.11_3 (complete)4295058? (NS) 0.010707 0.0110531
macht 2018.06.11 (complete)4295062? (NS) 0.010783 0.0110411
macht 2018.07.27 (complete)4305800? (NS) 0.011013 0.011248
BTD 2018.07.27_3 (complete)4306272? (NS) 0.011046 0.011177
BTD_12 2018.07.27_12 (complete)4306036? (NS) 0.011733 0.0119871
BTD_12 2018-06-11_12 (complete)4295057? (NS) 0.012003 0.0124859
Mistral-2.0 2018-06-15 (complete)4289563? (TO) 2400.05 2399.9
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290521? (TO) 2400.07 2383.31
OscaR - Conflict Ordering 2018-07-02 (complete)4290745? (TO) 2400.07 2385.02
Choco-solver 4.0.7 seq (493a269) (complete)4292477? (TO) 2400.12 2392.31
Sat4j-CSP 2018-07-11 (complete)4290034? (TO) 2400.18 2381.57
Mistral-2.0 2018-08-01 (complete)4303833? (TO) 2519.75 2520.01
cosoco 1.12 (complete)4295061? (TO) 2519.95 2520.01
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311801? (TO) 2520.06 2503.71
Concrete 3.8-SuperNG 2018-06-13 (complete)4295060? (TO) 2520.09 2345.26
Choco-solver 4.0.7b seq (e747e1e) (complete)4306771? (TO) 2520.09 2512.12
Concrete 3.8 2018-06-13 (complete)4295059? (TO) 2520.1 2364.95
OscaR - Conflict Ordering 2018-08-14 (complete)4307566? (TO) 2520.1 2504.02
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4308065? (TO) 2520.11 2504.21
scop both+MapleCOMSPS (2018-07-31) (complete)4305564? (TO) 2520.12 2496.65
Concrete 3.9.2 (complete)4305133? (TO) 2520.14 2282.36
Concrete 3.9.2-SuperNG (complete)4305134? (TO) 2520.19 2264.04

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> opt[][] cls[]  </list> <values> 1 1 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 0 0 1 1 0 0 1 0 0 0 0 0 1 0
1 0 1 0 1 0 1 0 0 0 1 0 1 1 0 0 0 0 1 1 0 0 1 0 0 0 0 0 0 0 1 1 1 0 1 1 0 0 1 0 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 1 0 1 0 1 0 1 0 1 0 0 0 1 0
0 0 0 0 0 1 0 1 1 1 0 1 0 1 0 1 0 1 0 0 0 0 0 1 1 0 0 1 1 0 0 0 0 0 0 1 1 1 1 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 1 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 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 1 0 1 0 0 0 1 0 1 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 0 1 1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 1 0 1 1 1 1 0 1 0 0 0 1 0 0 1 1 0 0 0 0 1 0 0 0 1 0 0
1 0 0 1 0 0 1 0 0 0 1 0 1 1 1 0 0 0 1 0 0 0 1 0 0 0 0 0 1 1 1 0 1 1 0 0 0 0 0 0 0 1 0 1 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 1 1 1 0
0 0 0 0 1 0 0 0 1 0 1 0 1 1 0 0 0 0 0 1 0 0 0 1 0 1 0 1 1 0 0 0 0 0 1 1 0 0 1 0 0 1 1 0 0 0 0 0 1 1 0 0 0 1 0 1 0 1 0 0 0 0 0 1 1 1 0 0 1 0
0 0 1 0 0 0 1 0 1 1 1 0 1 0 0 0 0 0 1 0 1 0 0 1 1 0 0 1 0 0 0 0 0 1 0 0 1 0 1 1 1 0 1 0 0 0 0 0 1 0 0 0 1 1 1 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0
1 0 1 1 1 0 0 0 1 0 0 1 1 0 0 1 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 0 0 0 0 0 1 1 0 1 1 0 0 0 0 0 1 0 1 0 1 1 1 0 0 0 0 0
1 0 1 1 0 0 0 0 1 1 0 0 1 0 0 0 1 0 1 0 1 0 1 0 1 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 0 0 1 0 0 1 0 0 0 1 1 0 0 0 0 0 1
1 0 1 0 0 0 1 0 0 0 1 0 1 1 0 0 0 0 1 0 0 0 1 0 0 1 0 0 0 0 0 1 1 1 0 0 0 0 1 1 0 0 1 0 0 1 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0
1 0 1 1 0 1 0 0 0 1 0 0 1 0 0 0 1 0 1 0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 1 0
0 0 0 1 0 1 0 1 0 0 0 0 0 1 0 1 0 1 1 0 0 0 0 0 0 0 1 0 1 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 1 0 0 1 1 0 0 0 1 0 0 0 1 0 0 1 0 0 1 1 0 0 1 1 0
0 0 0 0 0 1 0 1 1 0 0 0 0 1 1 0 1 1 0 0 0 0 0 1 0 0 0 1 0 0 1 0 0 1 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 0 0 0 1 1 1 0 0 0 0 0 1 0 1 1 0 0 0 0 1 0
1 0 1 0 0 0 0 0 1 1 0 1 0 1 0 1 0 1 0 0 0 0 0 1 1 1 0 0 1 0 0 0 1 0 0 0 0 0 1 1 1 1 1 1 0 0 0  9 8 5 13 18 15 7 5 15 17 21 2 7 5 14 10 8 8
11 24 15 6 8 21 12 15 26 7 2 14 9 15 5 11 18 8 9 21 2 0 5 8 23 21 2 0 26 8 3 1 3 8 6 8 3 13 2 8 6 22 3 11 2 8 4 24 21 23 8 5 0 2 16 7 5 8 6
16 2 11 15 2 11 15 2 13 24 26 7 15 26 0 8 18 0 5 15 7 5 24 0 5 8 9 21 2 21 9 24 4 7 4 8 23 21 5 19 5 15 9 21 2 7 18 15 6 8 5 7 3 16 4 8 2 13
18 21 2 8 4 16 2 7 4 21 6 16 5 15 3 11 18 8 4 8 4 8 26 15 18 15 5 8 15 5 15 2 16 7 4 8 4 7 8 4 7 2 21 2 19 25 8 4 8 20 5 8 9 21 2 15 5 19 15
26 0 8 26 20 2   </values> </instantiation>