CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-50/
normalized-aim-50-1-6-sat-4_ext.xml

Name	csp/aim-50/ normalized-aim-50-1-6-sat-4_ext.xml
MD5SUM	98cc1ac7109a27c7b5eb44d5bffb3238
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.006998
Satisfiable
(Un)Satisfiability was proved
Number of variables	50
Number of constraints	77
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	77
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-noprobe 2008-06-27	1052834	SAT	0.006998	0.014977
Mistral-option 1.314	1052843	SAT	0.007998	0.014194
Mistral-prime 1.313	1052844	SAT	0.008998	0.014838
casper zao	1052845	SAT	0.008998	0.016932
casper zito	1052846	SAT	0.011997	0.019039
spider 2008-06-14	1052832	SAT	0.014997	0.02264
MDG-probe 2008-06-27	1052833	SAT	0.015997	0.022478
cpHydra k_40	1052850	SAT	0.019996	0.026448
cpHydra k_10	1052849	SAT	0.020996	0.0267059
mddc-solv 2008-06-09	1052831	SAT	0.038993	0.047504
bpsolver 2008-06-27	1052838	SAT	0.05699	0.0651089
Minion/Tailor 2008-07-04	1105089	SAT	0.32295	0.335918
Concrete + CPS4J 2008-05-30	1052830	SAT	0.341947	0.373239
Concrete + CSP4J - WMC Engine 2008-05-30	1052829	SAT	0.379941	0.425611
choco2_impwdeg 2008-06-26	1052839	SAT	0.411936	0.471784
choco2_dwdeg 2008-06-26	1052840	SAT	0.415936	0.420536
Concrete + CSP4J - Tabu Engine 2008-05-30	1052828	SAT	0.461929	0.493429
Sugar v1.13+minisat	1052837	SAT	0.578911	0.705373
Sugar v1.13+picosat	1052836	SAT	0.58191	0.696551
Abscon 112v4 ESAC	1052848	SAT	0.72189	0.74169
SAT4J CSP 2008-06-13	1052835	SAT	0.725889	0.731001
Abscon 112v4 AC	1052847	SAT	0.764883	0.782038
galac E	1052842	SAT	0.774882	0.866872
galac M	1052841	SAT	1.05484	1.08483

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

Solution found:

0 1 0 0 0 1 0 0 0 1 1 0 0 1 1 1 0 1 1 1 0 1 1 1 1 0 0 0 0 0 0 1 0 0 1 1 0 0 1 1 0 1 1 1 0 1 1 0 0 1