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

Result page for benchmark
GraphColoring/
GraphColoring-qg-order100_c18.xml

Jump to solvers results

General information on the benchmark

NameGraphColoring/
GraphColoring-qg-order100_c18.xml
MD5SUMd2763c38ef24fdf1196893d726f1931a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark104
Best CPU time to get the best result obtained on this benchmark19059.4
Satisfiable
(Un)Satisfiability was proved
Number of variables10000
Number of constraints990000
Number of domains1
Minimum domain size10000
Maximum domain size10000
Distribution of domain sizes[{"size":10000,"count":10000}]
Minimum variable degree199
Maximum variable degree199
Distribution of variable degrees[{"degree":199,"count":10000}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":990000}]
Number of extensional constraints0
Number of intensional constraints990000
Distribution of constraint types[{"type":"intension","count":990000}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Choco-solver 4.0.7b par (e747e1e) (complete)4297388SAT (TO)104 19059.4 2520.2
OscaR - Parallel with EPS 2018-08-14 (complete)4308744? 1415.28 254.819
OscaR - Parallel with EPS 2018-07-02 (complete)4290975? 1918.78 328.362

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: 104
Solution found:
--too large--