CSP 2008 Competition: solvers results per benchmarks

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

Name	csp/aim-50/ normalized-aim-50-2-0-sat-2_ext.xml
MD5SUM	037f3f7e3f335da9fef680f7176066ce
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	96
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	96
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	1053027	SAT	0.006998	0.00944505
MDG-noprobe 2008-06-27	1053018	SAT	0.008998	0.00915809
Mistral-prime 1.313	1053028	SAT	0.008998	0.00955006
casper zao	1053029	SAT	0.011997	0.0205349
casper zito	1053030	SAT	0.012997	0.015277
spider 2008-06-14	1053016	SAT	0.015997	0.02238
MDG-probe 2008-06-27	1053017	SAT	0.016996	0.024416
cpHydra k_10	1053033	SAT	0.019996	0.026988
cpHydra k_40	1053034	SAT	0.040993	0.0928091
mddc-solv 2008-06-09	1053015	SAT	0.041993	0.04834
bpsolver 2008-06-27	1053022	SAT	0.080987	0.0813711
Minion/Tailor 2008-07-04	1105097	SAT	0.329949	0.391341
Concrete + CPS4J 2008-05-30	1053014	SAT	0.351946	0.370057
Concrete + CSP4J - WMC Engine 2008-05-30	1053013	SAT	0.399939	0.430419
choco2_impwdeg 2008-06-26	1053023	SAT	0.435933	0.475621
choco2_dwdeg 2008-06-26	1053024	SAT	0.463928	0.47776
Concrete + CSP4J - Tabu Engine 2008-05-30	1053012	SAT	0.480926	0.532707
Sugar v1.13+picosat	1053020	SAT	0.58391	0.691129
Sugar v1.13+minisat	1053021	SAT	0.596908	0.68935
Abscon 112v4 ESAC	1053032	SAT	0.773881	0.839278
SAT4J CSP 2008-06-13	1053019	SAT	0.817874	0.875948
Abscon 112v4 AC	1053031	SAT	0.85187	0.887944
galac E	1053026	SAT	0.866867	0.957479
galac M	1053025	SAT	1.05084	1.08681

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