CSP 2008 Competition: solvers results per benchmarks

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

Name	csp/aim-50/ normalized-aim-50-1-6-sat-1_ext.xml
MD5SUM	0c9a56e751f6dc36c0959b04db789da6
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	77
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	77
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	1053050	SAT	0.006998	0.00870789
casper zao	1053052	SAT	0.008997	0.0114731
MDG-noprobe 2008-06-27	1053041	SAT	0.008997	0.0161321
Mistral-prime 1.313	1053051	SAT	0.010997	0.016519
spider 2008-06-14	1053039	SAT	0.014997	0.0233891
casper zito	1053053	SAT	0.020996	0.0285829
MDG-probe 2008-06-27	1053040	SAT	0.020996	0.023935
cpHydra k_40	1053057	SAT	0.022996	0.0236149
cpHydra k_10	1053056	SAT	0.022996	0.028818
mddc-solv 2008-06-09	1053038	SAT	0.033994	0.0368311
bpsolver 2008-06-27	1053045	SAT	0.085986	0.0917259
Minion/Tailor 2008-07-04	1105098	SAT	0.32195	0.341319
Concrete + CSP4J - WMC Engine 2008-05-30	1053036	SAT	0.372942	0.418689
Concrete + CPS4J 2008-05-30	1053037	SAT	0.39194	0.427189
choco2_impwdeg 2008-06-26	1053046	SAT	0.404938	0.41921
choco2_dwdeg 2008-06-26	1053047	SAT	0.433933	0.481959
Sugar v1.13+minisat	1053044	SAT	0.589909	0.660578
Sugar v1.13+picosat	1053043	SAT	0.606906	0.692306
SAT4J CSP 2008-06-13	1053042	SAT	0.736887	0.715352
Abscon 112v4 AC	1053054	SAT	0.744885	0.787374
Abscon 112v4 ESAC	1053055	SAT	0.770882	0.786965
galac E	1053049	SAT	0.78188	0.87104
galac M	1053048	SAT	0.860868	0.941544
Concrete + CSP4J - Tabu Engine 2008-05-30	1053035	SAT	127.314	128.439

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