CSP 2008 Competition: solvers results per benchmarks

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

Name	csp/aim-50/ normalized-aim-50-3-4-sat-1_ext.xml
MD5SUM	e59b31b0b6f75c78723aae407ab90ce5
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.007997
Satisfiable
(Un)Satisfiability was proved
Number of variables	50
Number of constraints	156
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	156
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	1053120	SAT	0.007997	0.0158761
MDG-noprobe 2008-06-27	1053110	SAT	0.008997	0.016002
Mistral-option 1.314	1053119	SAT	0.010997	0.013167
MDG-probe 2008-06-27	1053109	SAT	0.010997	0.0156411
casper zito	1053122	SAT	0.012997	0.0134179
casper zao	1053121	SAT	0.012997	0.02001
spider 2008-06-14	1053108	SAT	0.018996	0.026851
cpHydra k_10	1053125	SAT	0.021996	0.028043
cpHydra k_40	1053126	SAT	0.022996	0.0228789
bpsolver 2008-06-27	1053114	SAT	0.05399	0.0617001
mddc-solv 2008-06-09	1053107	SAT	0.065989	0.074275
Concrete + CSP4J - Tabu Engine 2008-05-30	1053104	SAT	0.406938	0.421086
Minion/Tailor 2008-07-04	1105101	SAT	0.408936	0.417233
Concrete + CPS4J 2008-05-30	1053106	SAT	0.418936	0.475536
choco2_dwdeg 2008-06-26	1053116	SAT	0.468927	0.52921
Concrete + CSP4J - WMC Engine 2008-05-30	1053105	SAT	0.479926	0.54236
choco2_impwdeg 2008-06-26	1053115	SAT	0.51792	0.533901
Sugar v1.13+minisat	1053113	SAT	0.627903	0.731508
Sugar v1.13+picosat	1053112	SAT	0.664898	0.7689
Abscon 112v4 ESAC	1053124	SAT	0.78188	0.835838
Abscon 112v4 AC	1053123	SAT	0.802877	0.851409
SAT4J CSP 2008-06-13	1053111	SAT	0.862867	0.873729
galac M	1053117	SAT	1.08783	1.16868
galac E	1053118	SAT	1.10483	1.2013

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