MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/insertion/full-insertion/
normalized-5-fullins-3-6.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/insertion/full-insertion/
normalized-5-fullins-3-6.xml
MD5SUM28b7e475c71c9833073a377e192d6f34
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints3
Best CPU time to get the best result obtained on this benchmark9.82151
Satisfiable
(Un)Satisfiability was proved
Number of variables154
Number of constraints792
Maximum constraint arity2
Maximum domain size6
Number of constraints which are defined in extension0
Number of constraints which are defined in intension792
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+minisat-inc1113669OPTIMUM3 9.82151 11.148
Sugar v1.13+minisat1113670OPTIMUM3 17.3684 17.8077
AbsconMax 112 pc-w1113667MSAT (TO)3 1632.94 4000.09
AbsconMax 112 pc-d1113668MSAT (TO)3 1664.9 4000.07
Concrete + CSP4J - MCRW Engine 2008-05-301113665MSAT (TO)3 3600.04 3606.93
Concrete + CSP4J - Tabu Engine 2008-05-301113666MSAT (TO)3 3600.05 3615.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: 3
Solution found:
5 4 5 4 1 4 2 2 4 4 2 2 5 0 1 2 0 4 5 5 4 5 3 5 3 3 3 5 5 3 3 3 3 5 5 3 3 3 3 3 3 3 5 4 4 1 1 4 4 4 4 4 2 1 1 1 1 4 4 4 4 1 4 3 2 2 2 2 5 2
5 2 5 5 2 5 5 2 2 2 5 5 5 2 5 1 3 5 3 5 3 3 4 3 4 4 5 3 3 3 1 1 1 3 1 4 2 4 2 4 4 4 2 2 2 4 2 2 2 2 4 4 4 2 2 4 0 5 3 0 5 0 0 0 0 0 0 0 3 0
3 3 0 5 0 3 5 1 4 3 0 2 5 2