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-36-92.xml

Jump to solvers results

General information on the benchmark

NameCarSequencing/CarSequencing-m1-jcr/
CarSequencing-36-92.xml
MD5SUMe7221c19415bed5c98fc37c567f19ceb
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark67.5998
Satisfiable
(Un)Satisfiability was proved
Number of variables600
Number of constraints731
Number of domains2
Minimum domain size2
Maximum domain size22
Distribution of domain sizes[{"size":2,"count":500},{"size":22,"count":100}]
Minimum variable degree2
Maximum variable degree48
Distribution of variable degrees[{"degree":2,"count":100},{"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":19},{"degree":18,"count":19},{"degree":19,"count":19},{"degree":20,"count":19},{"degree":21,"count":39},{"degree":22,"count":14},{"degree":23,"count":14},{"degree":24,"count":14},{"degree":25,"count":14},{"degree":26,"count":9},{"degree":27,"count":8},{"degree":28,"count":8},{"degree":29,"count":8},{"degree":30,"count":8},{"degree":31,"count":9},{"degree":32,"count":9},{"degree":33,"count":19},{"degree":34,"count":5},{"degree":35,"count":5},{"degree":36,"count":7},{"degree":37,"count":4},{"degree":38,"count":2},{"degree":39,"count":2},{"degree":40,"count":2},{"degree":41,"count":2},{"degree":42,"count":2},{"degree":43,"count":2},{"degree":44,"count":2},{"degree":45,"count":2},{"degree":46,"count":2},{"degree":47,"count":3},{"degree":48,"count":11}]
Minimum constraint arity1
Maximum constraint arity100
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":99},{"arity":3,"count":196},{"arity":4,"count":1},{"arity":5,"count":193},{"arity":6,"count":100},{"arity":7,"count":1},{"arity":10,"count":2},{"arity":12,"count":1},{"arity":13,"count":1},{"arity":14,"count":1},{"arity":15,"count":1},{"arity":16,"count":3},{"arity":18,"count":1},{"arity":19,"count":2},{"arity":20,"count":2},{"arity":22,"count":3},{"arity":24,"count":1},{"arity":25,"count":3},{"arity":26,"count":1},{"arity":28,"count":3},{"arity":30,"count":3},{"arity":31,"count":2},{"arity":32,"count":1},{"arity":34,"count":3},"...",{"arity":67,"count":2}, {"arity":68,"count":1}, {"arity":70,"count":5}, {"arity":72,"count":1}, {"arity":73,"count":2}, {"arity":74,"count":1}, {"arity":75,"count":2}, {"arity":76,"count":3}, {"arity":78,"count":1}, {"arity":79,"count":2}, {"arity":80,"count":3}, {"arity":82,"count":3}, {"arity":84,"count":1}, {"arity":85,"count":4}, {"arity":86,"count":1}, {"arity":88,"count":3}, {"arity":90,"count":3}, {"arity":91,"count":2}, {"arity":92,"count":1}, {"arity":94,"count":3}, {"arity":95,"count":2}, {"arity":96,"count":1}, {"arity":97,"count":2}, {"arity":98,"count":1}, {"arity":100,"count":6}]
Number of extensional constraints100
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":100},{"type":"sum","count":630},{"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)4395032UNSAT 67.5998 67.6305
AbsCon 2019-07-23 (complete)4390652UNSAT 1551.79 1545.84
cosoco 2.0 (complete)4396832? (TO) 2520 2520.01
cosoco 2.0 (complete)4408092? (TO) 2520.01 2520.01
cosoco 2 (complete)4389552? (TO) 2520.02 2519.8
BTD 19.07.01 (complete)4386789? (TO) 2520.03 2520
Concrete 3.12.2 (complete)4395932? (TO) 2520.06 2483.64
choco-solver 2019-09-24 (complete)4405912? (TO) 2520.07 2505.83
Concrete 3.10 (complete)4387232? (TO) 2520.08 2465.73
Concrete 3.12.3 (complete)4402612? (TO) 2520.09 2470.04
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4387944? (TO) 2520.13 2507.03
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4387945? (TO) 2520.13 2505.93
Concrete 3.12.2 (complete)4400812? (TO) 2520.16 2471.05
choco-solver 2019-09-16 (complete)4399012? (TO) 2520.34 634.184
choco-solver 2019-09-20 (complete)4403512? (TO) 2520.36 634.382
choco-solver 2019-06-14 (complete)4393052? (TO) 2520.43 635.072
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405312? (TO) 18515.7 2520.11
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392452? (TO) 18974 2520.1
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405612? (TO) 19321.5 2520.09
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392752? (TO) 19445.1 2520.1
choco-solver 2019-09-24 parallel (complete)4406812? (TO) 20036.3 2520.09
choco-solver 2019-09-20 parallel (complete)4404412? (TO) 20038.7 2520.05
choco-solver 2019-09-16 parallel (complete)4399612? (TO) 20042.5 2520.1
choco-solver 2019-06-14 parallel (complete)4393652? (TO) 20051 2520.1
cosoco 2.0 parallel (complete)4409372? (TO) 20112.3 2520.03
cosoco 2.O parallel (complete)4398112? (TO) 20113.5 2520.03

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: