CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-1-6-sat-1_ext.xml
MD5SUM050e223cdd8152fc99234b2af13abb8a
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.020996
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints315
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension315
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
MDG-noprobe 2008-06-271053734SAT 0.020996 0.0262821
Mistral-prime 1.3131053744SAT 0.023995 0.0240431
casper zao1053745SAT 0.024995 0.025728
Mistral-option 1.3141053743SAT 0.035993 0.036185
cpHydra k_101053749SAT 0.036993 0.0441019
cpHydra k_401053750SAT 0.038993 0.0439241
MDG-probe 2008-06-271053733SAT 0.049991 0.056104
mddc-solv 2008-06-091053731SAT 0.070988 0.077828
spider 2008-06-141053732SAT 0.096984 0.103587
casper zito1053746SAT 0.203968 0.21012
Minion/Tailor 2008-07-041105047SAT 0.497923 0.516139
Concrete + CPS4J 2008-05-301053730SAT 0.602907 0.632407
choco2_dwdeg 2008-06-261053740SAT 0.640902 0.680565
choco2_impwdeg 2008-06-261053739SAT 0.742886 0.784007
Sugar v1.13+minisat1053737SAT 0.944856 1.03122
Abscon 112v4 ESAC1053748SAT 1.00885 1.04634
Sugar v1.13+picosat1053736SAT 1.02084 1.0979
Abscon 112v4 AC1053747SAT 1.02284 1.04494
SAT4J CSP 2008-06-131053735SAT 1.09683 1.02666
galac E1053742SAT 1.26881 1.31082
galac M1053741SAT 1.47777 1.55068
Concrete + CSP4J - Tabu Engine 2008-05-301053728? (TO) 1800.01 1810.02
Concrete + CSP4J - WMC Engine 2008-05-301053729? (TO) 1800.06 1815.12
bpsolver 2008-06-271053738? (TO) 1800.1 1802.01

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