CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-50/
normalized-aim-50-6-0-sat-2_ext.xml

Name	csp/aim-50/ normalized-aim-50-6-0-sat-2_ext.xml
MD5SUM	4aa7e33adc468a879a2cbe91836afef3
Bench Category	N-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.012997
Satisfiable
(Un)Satisfiability was proved
Number of variables	50
Number of constraints	284
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	284
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	1053201	SAT	0.010997	0.0193659
MDG-noprobe 2008-06-27	1053202	SAT	0.012997	0.0185601
Mistral-prime 1.313	1053212	SAT	0.012997	0.0189279
Mistral-option 1.314	1053211	SAT	0.014997	0.0197231
casper zito	1053214	SAT	0.018996	0.0284839
cpHydra k_40	1053218	SAT	0.022996	0.029873
spider 2008-06-14	1053200	SAT	0.023996	0.0296299
cpHydra k_10	1053217	SAT	0.023996	0.0305781
bpsolver 2008-06-27	1053206	SAT	0.06199	0.068687
mddc-solv 2008-06-09	1053199	SAT	0.082986	0.0886681
Minion/Tailor 2008-07-04	1105105	SAT	0.418935	0.454167
Concrete + CPS4J 2008-05-30	1053198	SAT	0.446931	0.479445
Concrete + CSP4J - WMC Engine 2008-05-30	1053197	SAT	0.469927	0.531128
Concrete + CSP4J - Tabu Engine 2008-05-30	1053196	SAT	0.469928	0.526439
choco2_dwdeg 2008-06-26	1053208	SAT	0.527919	0.58005
choco2_impwdeg 2008-06-26	1053207	SAT	0.549915	0.580116
Sugar v1.13+picosat	1053204	SAT	0.775881	0.856026
Abscon 112v4 ESAC	1053216	SAT	0.806877	0.833365
Sugar v1.13+minisat	1053205	SAT	0.809876	0.883315
Abscon 112v4 AC	1053215	SAT	0.854869	0.834227
SAT4J CSP 2008-06-13	1053203	SAT	0.927858	0.98159
galac E	1053210	SAT	1.09483	1.16867
galac M	1053209	SAT	1.22081	1.30357
casper zao	1053213	SAT	37.5573	37.7185

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