CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/mug/
normalized-mug100-1-4.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/mug/
normalized-mug100-1-4.xml
MD5SUM565fc5dc6c79c3ee37f5f5dd3ef63ad7
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.011997
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints166
Maximum constraint arity2
Maximum domain size4
Number of constraints which are defined in extension0
Number of constraints which are defined in intension166
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-option 1.3141091217SAT 0.011997 0.0190459
MDG-probe 2008-06-271091207SAT 0.012997 0.0192239
Mistral-prime 1.3131091218SAT 0.012997 0.018351
MDG-noprobe 2008-06-271091208SAT 0.013997 0.018779
casper zito1091220SAT 0.014997 0.021598
casper zao1091219SAT 0.020996 0.0255499
cpHydra k_401091224SAT 0.023995 0.630423
cpHydra k_101091223SAT 0.024996 0.026616
bpsolver 2008-06-271091212SAT 0.048991 0.054426
Minion/Tailor 2008-07-041105706SAT 0.45593 0.503968
Concrete + CPS4J 2008-05-301091206SAT 0.763883 0.78832
choco2_impwdeg 2008-06-261091213SAT 0.78288 0.841159
Concrete + CSP4J - Tabu Engine 2008-05-301091204SAT 0.794878 0.8538
Sugar v1.13+minisat1091211SAT 0.794878 0.909683
Concrete + CSP4J - WMC Engine 2008-05-301091205SAT 0.795878 0.841871
Sugar v1.13+picosat1091210SAT 0.800878 0.871314
choco2_dwdeg 2008-06-261091214SAT 0.815875 0.841606
Abscon 112v4 AC1091221SAT 0.839871 0.885442
Abscon 112v4 ESAC1091222SAT 0.866867 0.884977
galac E1091216SAT 1.3248 1.37007
SAT4J CSP 2008-06-131091209SAT 1.45278 1.497
galac M1091215SAT 1.66075 1.76997

Additionnal information

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

Solution found:
0 0 3 2 0 3 3 3 2 0 3 0 2 0 2 3 0 0 2 0 3 1 3 2 1 3 0 2 3 2 1 3 2 1 0 3 3 0 2 1 0 3 0 0 3 2 0 2 0 3 0 1 3 2 1 0 3 2 3 2 2 0 3 1 0 2 1 0 3 2
0 3 2 0 3 1 3 2 0 0 3 2 3 2 1 0 3 2 3 0 1 3 0 2 3 0 2 3 2 1