CSP 2008 Competition: solvers results per benchmarks

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

Name	csp/aim-50/ normalized-aim-50-3-4-sat-3_ext.xml
MD5SUM	3d242f327bde401f74131fd4aae82f88
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.008998
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-option 1.314	1052981	SAT	0.008998	0.0169939
MDG-probe 2008-06-27	1052971	SAT	0.009997	0.017443
MDG-noprobe 2008-06-27	1052972	SAT	0.010997	0.0175811
Mistral-prime 1.313	1052982	SAT	0.012997	0.0244801
casper zao	1052983	SAT	0.017996	0.024468
casper zito	1052984	SAT	0.019996	0.026704
cpHydra k_10	1052987	SAT	0.022996	0.0303201
cpHydra k_40	1052988	SAT	0.023995	0.030356
spider 2008-06-14	1052970	SAT	0.029994	0.0357221
bpsolver 2008-06-27	1052976	SAT	0.05299	0.062462
mddc-solv 2008-06-09	1052969	SAT	0.068989	0.0756501
Minion/Tailor 2008-07-04	1105095	SAT	0.370943	0.398896
Concrete + CSP4J - WMC Engine 2008-05-30	1052967	SAT	0.429933	0.479306
Concrete + CPS4J 2008-05-30	1052968	SAT	0.433934	0.481596
choco2_impwdeg 2008-06-26	1052977	SAT	0.470927	0.519733
Concrete + CSP4J - Tabu Engine 2008-05-30	1052966	SAT	0.477926	0.492211
choco2_dwdeg 2008-06-26	1052978	SAT	0.51992	0.581542
Sugar v1.13+picosat	1052974	SAT	0.675896	0.770339
Sugar v1.13+minisat	1052975	SAT	0.691894	0.746283
SAT4J CSP 2008-06-13	1052973	SAT	0.786879	0.817932
Abscon 112v4 ESAC	1052986	SAT	0.823873	0.85425
Abscon 112v4 AC	1052985	SAT	0.825873	0.84946
galac M	1052979	SAT	0.957853	1.06396
galac E	1052980	SAT	1.10183	1.16668

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

Solution found:

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