CSP 2008 Competition: solvers results per benchmarks

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

Name	csp/aim-50/ normalized-aim-50-6-0-sat-3_ext.xml
MD5SUM	1222a6082410e00ae5ca7726a5dee972
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.010997
Satisfiable
(Un)Satisfiability was proved
Number of variables	50
Number of constraints	268
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	268
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
Mistral-prime 1.313	1053258	SAT	0.010997	0.0189379
MDG-noprobe 2008-06-27	1053248	SAT	0.011997	0.0184079
MDG-probe 2008-06-27	1053247	SAT	0.011997	0.0189861
Mistral-option 1.314	1053257	SAT	0.011997	0.0187591
casper zito	1053260	SAT	0.015997	0.02447
casper zao	1053259	SAT	0.016996	0.0258121
spider 2008-06-14	1053246	SAT	0.022995	0.028502
cpHydra k_40	1053264	SAT	0.023996	0.030632
cpHydra k_10	1053263	SAT	0.024995	0.0310739
bpsolver 2008-06-27	1053252	SAT	0.06099	0.067746
mddc-solv 2008-06-09	1053245	SAT	0.088985	0.0940961
Concrete + CPS4J 2008-05-30	1053244	SAT	0.447931	0.478398
Concrete + CSP4J - WMC Engine 2008-05-30	1053243	SAT	0.460929	0.47737
Minion/Tailor 2008-07-04	1105107	SAT	0.477926	0.510231
choco2_impwdeg 2008-06-26	1053253	SAT	0.574911	0.578417
choco2_dwdeg 2008-06-26	1053254	SAT	0.574912	0.630197
Concrete + CSP4J - Tabu Engine 2008-05-30	1053242	SAT	0.622904	0.646917
Sugar v1.13+minisat	1053251	SAT	0.759884	0.874423
Abscon 112v4 ESAC	1053262	SAT	0.77888	0.834216
Abscon 112v4 AC	1053261	SAT	0.856869	0.89725
Sugar v1.13+picosat	1053250	SAT	0.861868	0.920514
SAT4J CSP 2008-06-13	1053249	SAT	0.899862	0.929168
galac E	1053256	SAT	1.02784	1.09453
galac M	1053255	SAT	1.20582	1.27338

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