CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/coloring/
normalized-queens-5-5-5-ext.xml

Name	csp/coloring/ normalized-queens-5-5-5-ext.xml
MD5SUM	a5f92f8e20030303eecd19c901780c00
Bench Category	2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.008998
Satisfiable
(Un)Satisfiability was proved
Number of variables	25
Number of constraints	160
Maximum constraint arity	2
Maximum domain size	5
Number of constraints which are defined in extension	160
Number of constraints which are defined in intension	0
Global constraints used (with number of constraints)

Solver Name	TraceID	Answer	CPU time	Wall clock time
MDG-probe 2008-06-27	1038600	SAT	0.008998	0.0112131
Mistral-option 1.314	1038610	SAT	0.009997	0.0166619
Mistral-prime 1.313	1038611	SAT	0.009997	0.016719
MDG-noprobe 2008-06-27	1038601	SAT	0.009998	0.016857
spider 2008-06-14	1038597	SAT	0.013997	0.0216911
casper zito	1043676	SAT	0.014997	0.023011
cpHydra k_40	1046192	SAT	0.020996	0.0220981
cpHydra k_10	1045563	SAT	0.021996	0.02766
casper zao	1043047	SAT	0.033994	0.0409959
bpsolver 2008-06-27	1038605	SAT	0.040992	0.0474829
Minion/Tailor 2008-07-04	1104375	SAT	0.333949	0.38581
Concrete + CPS4J 2008-05-30	1038596	SAT	0.354945	0.372376
Concrete + CSP4J - WMC Engine 2008-05-30	1038595	SAT	0.38394	0.438088
Concrete + CSP4J - Tabu Engine 2008-05-30	1038594	SAT	0.464929	0.492213
choco2_impwdeg 2008-06-26	1038606	SAT	0.530919	0.582355
choco2_dwdeg 2008-06-26	1038607	SAT	0.551916	0.583819
Sugar v1.13+minisat	1038604	SAT	0.620905	0.728285
Sugar v1.13+picosat	1038603	SAT	0.726889	0.763033
Abscon 112v4 ESAC	1044934	SAT	0.761883	0.787129
SAT4J CSP 2008-06-13	1038602	SAT	0.767883	0.768094
Abscon 112v4 AC	1044305	SAT	0.778881	0.796478
galac E	1038609	SAT	1.01984	1.10296
galac M	1038608	SAT	1.22581	1.26189

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

Solution found:

2 3 1 0 4 1 0 4 2 3 4 2 3 1 0 3 1 0 4 2 0 4 2 3 1