MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/insertion/full-insertion/
normalized-1-fullins-3-3.xml
MD5SUMc3d0c1818cdafcfe59c7c1beb4678b57
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints2
Best CPU time to get the best result obtained on this benchmark1.51977
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints100
Maximum constraint arity2
Maximum domain size3
Number of constraints which are defined in extension0
Number of constraints which are defined in intension100
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-inc1113687OPTIMUM2 1.51977 1.76097
Sugar v1.13+minisat1113688OPTIMUM2 1.61375 1.82517
AbsconMax 112 pc-d1113686OPTIMUM2 35.9095 44.1508
AbsconMax 112 pc-w1113685OPTIMUM2 38.9391 51.4844
Concrete + CSP4J - MCRW Engine 2008-05-301113683MSAT (TO)2 3600.01 3611.82
Concrete + CSP4J - Tabu Engine 2008-05-301113684MSAT (TO)2 3600.05 3601.72

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