CSP 2008 Competition: solvers results per benchmarks

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

Name	csp/aim-50/ normalized-aim-50-2-0-sat-3_ext.xml
MD5SUM	4e08b59db74331f3fc708d750c6151ad
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	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
MDG-noprobe 2008-06-27	1053271	SAT	0.008998	0.015024
Mistral-option 1.314	1053280	SAT	0.008998	0.015308
Mistral-prime 1.313	1053281	SAT	0.009998	0.015121
MDG-probe 2008-06-27	1053270	SAT	0.011997	0.017539
casper zao	1053282	SAT	0.012997	0.022373
casper zito	1053283	SAT	0.014997	0.0217881
spider 2008-06-14	1053269	SAT	0.019996	0.0256179
cpHydra k_40	1053287	SAT	0.019996	0.0269559
cpHydra k_10	1053286	SAT	0.020996	0.0272599
mddc-solv 2008-06-09	1053268	SAT	0.051991	0.0571669
bpsolver 2008-06-27	1053275	SAT	0.070989	0.0771049
Minion/Tailor 2008-07-04	1105108	SAT	0.32295	0.335947
Concrete + CPS4J 2008-05-30	1053267	SAT	0.355945	0.366225
Concrete + CSP4J - WMC Engine 2008-05-30	1053266	SAT	0.419935	0.477401
choco2_dwdeg 2008-06-26	1053277	SAT	0.442931	0.467683
choco2_impwdeg 2008-06-26	1053276	SAT	0.472927	0.528124
Concrete + CSP4J - Tabu Engine 2008-05-30	1053265	SAT	0.553915	0.592496
Sugar v1.13+minisat	1053274	SAT	0.598908	0.65877
Sugar v1.13+picosat	1053273	SAT	0.609906	0.697611
SAT4J CSP 2008-06-13	1053272	SAT	0.747885	0.763835
Abscon 112v4 ESAC	1053285	SAT	0.762883	0.789301
galac M	1053278	SAT	0.842871	0.875733
galac E	1053279	SAT	0.85387	0.965097
Abscon 112v4 AC	1053284	SAT	0.871867	0.904309

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

Solution found:

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