CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-1-6-sat-3_ext.xml
MD5SUM877c040c8ca5929fc3eff9971f2082bb
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.022995
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints311
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension311
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-option 1.3141054042SAT 0.022995 0.029517
casper zao1054044SAT 0.024995 0.0312331
MDG-noprobe 2008-06-271054033SAT 0.030994 0.0364371
Mistral-prime 1.3131054043SAT 0.032994 0.03808
MDG-probe 2008-06-271054032SAT 0.041992 0.0484769
cpHydra k_401054049SAT 0.043992 0.052401
cpHydra k_101054048SAT 0.044992 0.051167
mddc-solv 2008-06-091054030SAT 0.115982 0.122064
spider 2008-06-141054031SAT 0.131979 0.142667
casper zito1054045SAT 0.145977 0.153953
Minion/Tailor 2008-07-041105060SAT 0.502923 0.518965
Concrete + CPS4J 2008-05-301054029SAT 0.622904 0.653357
choco2_dwdeg 2008-06-261054039SAT 0.84887 0.893008
Sugar v1.13+minisat1054036SAT 0.953854 1.07041
Sugar v1.13+picosat1054035SAT 1.01584 1.14476
choco2_impwdeg 2008-06-261054038SAT 1.04184 1.08172
Abscon 112v4 ESAC1054047SAT 1.06884 1.09826
SAT4J CSP 2008-06-131054034SAT 1.17882 1.17904
Abscon 112v4 AC1054046SAT 1.17882 1.20483
galac M1054040SAT 1.23781 1.33568
galac E1054041SAT 1.48077 1.54511
Concrete + CSP4J - Tabu Engine 2008-05-301054027? (TO) 1800.03 1807.32
bpsolver 2008-06-271054037? (TO) 1800.03 1801.21
Concrete + CSP4J - WMC Engine 2008-05-301054028? (TO) 1800.08 1816.12

Additionnal information

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