CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-200/
normalized-aim-200-3-4-sat-2_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-3-4-sat-2_ext.xml
MD5SUM4babb72c1371a25adc758cf16867596e
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.033994
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints636
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension636
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-prime 1.3131053928SAT 0.033994 0.040033
Mistral-option 1.3141053927SAT 0.033994 0.0403989
cpHydra k_101053933SAT 0.043992 0.051521
cpHydra k_401053934SAT 0.046992 0.0521411
MDG-noprobe 2008-06-271053918SAT 0.050991 0.0561219
mddc-solv 2008-06-091053915SAT 0.164974 0.172882
MDG-probe 2008-06-271053917SAT 0.196969 0.197693
spider 2008-06-141053916SAT 0.261959 0.271795
Concrete + CSP4J - WMC Engine 2008-05-301053913SAT 0.6489 0.686614
Minion/Tailor 2008-07-041105055SAT 0.709891 0.725257
Sugar v1.13+minisat1053921SAT 1.18182 1.27554
Sugar v1.13+picosat1053920SAT 1.19582 1.32865
choco2_dwdeg 2008-06-261053924SAT 1.23481 1.26017
Abscon 112v4 AC1053931SAT 1.3378 1.41575
galac M1053925SAT 1.34979 1.41425
galac E1053926SAT 1.46278 1.52125
SAT4J CSP 2008-06-131053919SAT 1.51477 1.54564
Abscon 112v4 ESAC1053932SAT 1.66575 1.72129
casper zao1053929SAT 1.9657 1.97039
Concrete + CPS4J 2008-05-301053914SAT 2.12568 2.16044
choco2_impwdeg 2008-06-261053923SAT 6.40702 6.832
casper zito1053930SAT 13.6279 13.736
bpsolver 2008-06-271053922SAT 107.806 108.686
Concrete + CSP4J - Tabu Engine 2008-05-301053912SAT 166.171 167.673

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