CSP 2008 Competition: solvers results per benchmarks

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

Name	csp/aim-50/ normalized-aim-50-3-4-sat-2_ext.xml
MD5SUM	db6913143b44bf8d8aa7dc729e0c2597
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.009997
Satisfiable
(Un)Satisfiability was proved
Number of variables	50
Number of constraints	161
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	161
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	1053143	SAT	0.009997	0.0167659
MDG-noprobe 2008-06-27	1053133	SAT	0.010997	0.016702
Mistral-option 1.314	1053142	SAT	0.010997	0.0159389
MDG-probe 2008-06-27	1053132	SAT	0.014996	0.021892
casper zao	1053144	SAT	0.018996	0.0264391
casper zito	1053145	SAT	0.020996	0.021314
cpHydra k_40	1053149	SAT	0.021996	0.0337991
cpHydra k_10	1053148	SAT	0.021996	0.0283989
spider 2008-06-14	1053131	SAT	0.029994	0.036073
bpsolver 2008-06-27	1053137	SAT	0.052991	0.0605859
mddc-solv 2008-06-09	1053130	SAT	0.05499	0.062826
Concrete + CPS4J 2008-05-30	1053129	SAT	0.372942	0.434932
Minion/Tailor 2008-07-04	1105102	SAT	0.409936	0.416515
Concrete + CSP4J - Tabu Engine 2008-05-30	1053127	SAT	0.436933	0.496053
Concrete + CSP4J - WMC Engine 2008-05-30	1053128	SAT	0.441932	0.493077
choco2_impwdeg 2008-06-26	1053138	SAT	0.460929	0.526158
choco2_dwdeg 2008-06-26	1053139	SAT	0.512921	0.527548
Sugar v1.13+picosat	1053135	SAT	0.6509	0.744673
Sugar v1.13+minisat	1053136	SAT	0.661898	0.746676
Abscon 112v4 ESAC	1053147	SAT	0.827873	0.834789
SAT4J CSP 2008-06-13	1053134	SAT	0.870866	0.932106
galac E	1053141	SAT	0.905862	0.989759
Abscon 112v4 AC	1053146	SAT	0.918859	0.949631
galac M	1053140	SAT	1.16682	1.24699

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