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

Result page for benchmark
SumColoring/
SumColoring-1-fullins-4_c18.xml

Jump to solvers results

General information on the benchmark

NameSumColoring/
SumColoring-1-fullins-4_c18.xml
MD5SUMce812152122c21d5982c9c6047fc1378
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark73
Best CPU time to get the best result obtained on this benchmark859.495
Satisfiable
(Un)Satisfiability was proved
Number of variables93
Number of constraints593
Number of domains1
Minimum domain size93
Maximum domain size93
Distribution of domain sizes[{"size":93,"count":93}]
Minimum variable degree7
Maximum variable degree33
Distribution of variable degrees[{"degree":7,"count":4},{"degree":8,"count":6},{"degree":9,"count":11},{"degree":10,"count":8},{"degree":11,"count":9},{"degree":12,"count":9},{"degree":13,"count":7},{"degree":14,"count":10},{"degree":15,"count":4},{"degree":16,"count":4},{"degree":17,"count":3},{"degree":18,"count":3},{"degree":19,"count":3},{"degree":20,"count":3},{"degree":23,"count":3},{"degree":24,"count":3},{"degree":33,"count":3}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":593}]
Number of extensional constraints0
Number of intensional constraints593
Distribution of constraint types[{"type":"intension","count":593}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2018-06-15 (complete)4293667OPT73 810.444 810.468
PicatSAT 2018-08-14 (complete)4309523OPT73 859.495 859.465
PicatSAT 2018-08-02 (complete)4303183OPT73 864.321 864.327
Concrete 3.9.2 (complete)4304363SAT (TO)73 2520.05 2464.63
Concrete 3.8 2018-06-13 (complete)4293664SAT (TO)73 2520.12 2465.83
Concrete 3.9.2-SuperNG (complete)4304364SAT (TO)73 2520.12 2492.14
cosoco 1.12 (complete)4293666SAT (TO)84 2519.98 2520.01
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290457SAT (TO)86 2400.04 2374.61
Concrete 3.8-SuperNG 2018-06-13 (complete)4293665SAT (TO)86 2520.15 2491.14
Mistral-2.0 2018-06-15 (complete)4289364SAT (TO)87 2400.06 2400.11
Mistral-2.0 2018-08-01 (complete)4303769SAT (TO)87 2519.74 2520.01
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311737SAT (TO)88 2520.04 2492.81
OscaR - Hybrid 2018-07-02 (complete)4291655SAT (TO)91 2400.11 2335.02
OscaR - Hybrid 2018-08-14 (complete)4308587SAT (TO)91 2520.03 2449.32
Choco-solver 4.0.7 seq (493a269) (complete)4292413SAT (TO)93 2400.09 2378.91
Choco-solver 4.0.7b seq (e747e1e) (complete)4306707SAT (TO)93 2520.07 2499.32
Sat4j-CSP 2018-07-11 (complete)4289970SAT (TO)139 2400.37 2371.57
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4308001SAT (TO)294 2520.11 2495.91

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: 73
Solution found:
<instantiation> <list> c[]  </list> <values> 0 4 3 3 0 0 4 0 3 2 2 2 2 2 2 2 2 2 0 0 0 0 0 0 0 0 0 2 0 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 1   </values> </instantiation>