MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/insertion/full-insertion/
normalized-2-fullins-3-4.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/insertion/full-insertion/
normalized-2-fullins-3-4.xml
MD5SUMe39e842e3e3021146201992a2d1cf419
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 benchmark2.23866
Satisfiable
(Un)Satisfiability was proved
Number of variables52
Number of constraints201
Maximum constraint arity2
Maximum domain size4
Number of constraints which are defined in extension0
Number of constraints which are defined in intension201
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-inc1113657OPTIMUM1 2.23866 2.59235
Sugar v1.13+minisat1113658OPTIMUM1 2.47662 2.90339
AbsconMax 112 pc-w1113655OPTIMUM1 157.779 342.262
AbsconMax 112 pc-d1113656OPTIMUM1 493.17 1151.68
Concrete + CSP4J - Tabu Engine 2008-05-301113654MSAT (TO)1 3600.03 3604.73
Concrete + CSP4J - MCRW Engine 2008-05-301113653MSAT (TO)1 3600.08 3634.82

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 3 0 0 3 3 2 2 3 2 0 1 1 1 0 0 1 1 2 2 0 2 0 1 2 2 3 3 1 1 3 3 3 2 3 3 0 0 3 3 0 0 0 0 0 0 0 0 1 3 0 2