MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/insertion/k-insertion/
normalized-2-insertions-3-3.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/insertion/k-insertion/
normalized-2-insertions-3-3.xml
MD5SUM9b2dd82651de0f42341e7b0a0468449b
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark1.43478
Satisfiable
(Un)Satisfiability was proved
Number of variables37
Number of constraints72
Maximum constraint arity2
Maximum domain size3
Number of constraints which are defined in extension0
Number of constraints which are defined in intension72
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar v1.13+minisat1113718OPTIMUM1 1.43478 1.67989
Sugar++ v1.13+minisat-inc1113717OPTIMUM1 1.44478 2.11031
AbsconMax 112 pc-d1113716OPTIMUM1 37.2703 46.4309
AbsconMax 112 pc-w1113715OPTIMUM1 45.945 66.9086
Concrete + CSP4J - Tabu Engine 2008-05-301113714MSAT (TO)1 3600.03 3623.02
Concrete + CSP4J - MCRW Engine 2008-05-301113713MSAT (TO)1 3600.08 3632.12

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: 1
Solution found:
2 1 2 1 2 0 1 1 2 2 1 2 1 2 0 1 1 2 2 0 2 0 0 0 1 0 0 1 1 1 1 1 0 1 1 2 2