CSP 2008 Competition: solvers results per benchmarks

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

Name	csp/aim-50/ normalized-aim-50-2-0-sat-4_ext.xml
MD5SUM	963d57a0df404d44b649a4574462e315
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.005998
Satisfiable
(Un)Satisfiability was proved
Number of variables	50
Number of constraints	94
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	94
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	1052798	SAT	0.005998	0.014651
MDG-noprobe 2008-06-27	1052788	SAT	0.007998	0.014837
Mistral-option 1.314	1052797	SAT	0.007998	0.0148471
casper zao	1052799	SAT	0.010997	0.018661
spider 2008-06-14	1052786	SAT	0.012997	0.020287
casper zito	1052800	SAT	0.012997	0.0209769
MDG-probe 2008-06-27	1052787	SAT	0.012997	0.0178379
cpHydra k_10	1052803	SAT	0.018996	0.026131
cpHydra k_40	1052804	SAT	0.019996	0.0262669
mddc-solv 2008-06-09	1052785	SAT	0.044992	0.0503189
bpsolver 2008-06-27	1052792	SAT	0.052991	0.0560849
Minion/Tailor 2008-07-04	1105087	SAT	0.329949	0.394576
Concrete + CSP4J - WMC Engine 2008-05-30	1052783	SAT	0.377941	0.425116
Concrete + CPS4J 2008-05-30	1052784	SAT	0.38994	0.449139
Concrete + CSP4J - Tabu Engine 2008-05-30	1052782	SAT	0.419936	0.437707
choco2_impwdeg 2008-06-26	1052793	SAT	0.424935	0.46745
choco2_dwdeg 2008-06-26	1052794	SAT	0.436933	0.47197
Sugar v1.13+picosat	1052790	SAT	0.605907	0.683636
Sugar v1.13+minisat	1052791	SAT	0.608906	0.660201
Abscon 112v4 AC	1052801	SAT	0.723889	0.786331
SAT4J CSP 2008-06-13	1052789	SAT	0.741886	0.772143
Abscon 112v4 ESAC	1052802	SAT	0.772881	0.786144
galac M	1052795	SAT	0.796878	0.878957
galac E	1052796	SAT	1.00085	1.06963

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