CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-6-0-sat-4_ext.xml
MD5SUMca0ea8677dce533cfa3f7a271be2e566
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.039993
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints1156
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension1156
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.3141053881SAT 0.039993 0.0476019
Mistral-prime 1.3131053882SAT 0.06099 0.0662991
cpHydra k_401053888SAT 0.066989 0.0702719
cpHydra k_101053887SAT 0.067989 0.0707621
MDG-noprobe 2008-06-271053872SAT 0.12898 0.134966
casper zao1053883SAT 0.208967 0.215809
MDG-probe 2008-06-271053871SAT 0.236963 0.244833
spider 2008-06-141053870SAT 0.25696 0.262325
casper zito1053884SAT 0.362944 0.370945
mddc-solv 2008-06-091053869SAT 0.426934 0.433105
Minion/Tailor 2008-07-041105053SAT 0.661898 0.69556
choco2_impwdeg 2008-06-261053877SAT 0.743886 0.785214
Concrete + CSP4J - WMC Engine 2008-05-301053867SAT 0.817874 0.84632
Concrete + CPS4J 2008-05-301053868SAT 0.97585 1.00753
choco2_dwdeg 2008-06-261053878SAT 0.995847 0.823549
Sugar v1.13+picosat1053874SAT 1.01884 1.07283
Abscon 112v4 ESAC1053886SAT 1.20082 1.24142
Sugar v1.13+minisat1053875SAT 1.22581 1.321
Abscon 112v4 AC1053885SAT 1.45178 1.52782
galac M1053879SAT 1.48977 1.72185
galac E1053880SAT 1.58876 1.69388
SAT4J CSP 2008-06-131053873SAT 1.90971 1.75591
bpsolver 2008-06-271053876SAT 11.7572 11.8613
Concrete + CSP4J - Tabu Engine 2008-05-301053866SAT 23.4694 23.7021

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