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 benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.013997
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 NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271090683UNSAT 0.013997 0.0146521
Mistral-option 1.3141090692UNSAT 0.013997 0.0195831
Mistral-prime 1.3131090693UNSAT 0.014997 0.014765
cpHydra k_401090699UNSAT 0.022995 0.0375009
cpHydra k_101090698UNSAT 0.024995 0.0289271
bpsolver 2008-06-271090687UNSAT 0.049992 0.0538901
MDG-probe 2008-06-271090682UNSAT 0.049992 0.0505611
Minion/Tailor 2008-07-041105659UNSAT 0.436933 0.489793
choco2_impwdeg 2008-06-261090688UNSAT 0.736887 0.78651
Sugar v1.13+minisat1090686UNSAT 0.769882 0.885809
choco2_dwdeg 2008-06-261090689UNSAT 0.78488 0.814165
galac E1090691UNSAT 0.800877 0.834718
Concrete + CPS4J 2008-05-301090681UNSAT 0.801877 0.841697
Sugar v1.13+picosat1090685UNSAT 0.808876 0.95519
galac M1090690UNSAT 0.821874 0.881852
Abscon 112v4 AC1090696UNSAT 0.859868 0.891326
Abscon 112v4 ESAC1090697UNSAT 0.871867 0.94555
SAT4J CSP 2008-06-131090684UNSAT 1.52777 1.57618
casper zao1090694UNSAT 3.43448 3.45539
casper zito1090695UNSAT 5.03523 5.04064
Concrete + CSP4J - Tabu Engine 2008-05-301090679? (TO) 1800.04 1814.62
Concrete + CSP4J - WMC Engine 2008-05-301090680? (TO) 1800.04 1814.12

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: