CSP 2008 Competition: solvers results per benchmarks

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

Name	csp/aim-50/ normalized-aim-50-1-6-sat-2_ext.xml
MD5SUM	d51ed6be302aa69b11c6aa4939df7671
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	76
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	76
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-option 1.314	1053165	SAT	0.005998	0.01458
MDG-noprobe 2008-06-27	1053156	SAT	0.007998	0.015135
Mistral-prime 1.313	1053166	SAT	0.007998	0.014885
MDG-probe 2008-06-27	1053155	SAT	0.009997	0.014118
casper zito	1053168	SAT	0.010997	0.0124659
casper zao	1053167	SAT	0.011997	0.0179859
spider 2008-06-14	1053154	SAT	0.012997	0.0202571
cpHydra k_10	1053171	SAT	0.019996	0.026689
cpHydra k_40	1053172	SAT	0.019996	0.0262101
mddc-solv 2008-06-09	1053153	SAT	0.033994	0.040941
bpsolver 2008-06-27	1053160	SAT	0.135978	0.142316
Minion/Tailor 2008-07-04	1105103	SAT	0.31795	0.335549
Concrete + CSP4J - WMC Engine 2008-05-30	1053151	SAT	0.346947	0.367932
Concrete + CPS4J 2008-05-30	1053152	SAT	0.365943	0.418591
choco2_dwdeg 2008-06-26	1053162	SAT	0.426934	0.475471
choco2_impwdeg 2008-06-26	1053161	SAT	0.435933	0.477817
Sugar v1.13+minisat	1053159	SAT	0.554915	0.676294
Sugar v1.13+picosat	1053158	SAT	0.581911	0.695913
Abscon 112v4 ESAC	1053170	SAT	0.679896	0.730463
Abscon 112v4 AC	1053169	SAT	0.765882	0.793285
SAT4J CSP 2008-06-13	1053157	SAT	0.793878	0.809418
galac M	1053163	SAT	0.795878	0.871866
galac E	1053164	SAT	0.973851	1.08725
Concrete + CSP4J - Tabu Engine 2008-05-30	1053150	SAT	2.88056	2.92342

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