MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/sgb/
queen/normalized-queen8-12-10.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/sgb/
queen/normalized-queen8-12-10.xml
MD5SUM819f724ab904e5403549587a113ad0d6
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMSAT TO
Best Number of falsified constraints16
Best CPU time to get the best result obtained on this benchmark1618.64
Satisfiable
(Un)Satisfiability was proved
Number of variables96
Number of constraints1368
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension0
Number of constraints which are defined in intension1368
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
AbsconMax 112 pc-d1113488MSAT (TO)16 1618.64 4000.07
AbsconMax 112 pc-w1113487MSAT (TO)16 1639.77 4000.05
Concrete + CSP4J - MCRW Engine 2008-05-301113485MSAT (TO)16 3600.05 3615.42
Concrete + CSP4J - Tabu Engine 2008-05-301113486MSAT (TO)16 3600.08 3618.52
Sugar v1.13+minisat1113490MSAT (TO)33 3600.01 3615.8
Sugar++ v1.13+minisat-inc1113489MSAT (TO)51 3600.19 3626

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Number of falsified constraints: 16
Solution found:
6 3 5 0 0 1 5 4 7 8 2 9 0 1 4 2 3 8 7 6 9 5 3 5 3 6 8 5 9 5 1 2 0 1 4 7 1 4 2 3 6 3 4 7 5 9 8 0 5 9 0 1 4 0 6 8 3 4 7 2 4 7 3 8 5 9 2 1 6 2
0 4 2 8 9 6 1 4 0 9 4 7 5 3 9 0 7 4 7 2 3 5 8 0 1 6