CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-3-4-sat-3_ext.xml
MD5SUM57614d672ec175222f903f4ebc7fdb59
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.044993
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints641
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension641
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.3141053789SAT 0.044993 0.0482521
MDG-noprobe 2008-06-271053780SAT 0.054991 0.0548939
Mistral-prime 1.3131053790SAT 0.06199 0.062017
cpHydra k_401053796SAT 0.072988 0.0790259
cpHydra k_101053795SAT 0.080987 0.143753
mddc-solv 2008-06-091053777SAT 0.216966 0.224208
MDG-probe 2008-06-271053779SAT 0.278956 0.285001
casper zao1053791SAT 0.522919 0.526158
Minion/Tailor 2008-07-041105049SAT 0.618905 0.639703
Concrete + CSP4J - WMC Engine 2008-05-301053775SAT 0.665898 0.678505
Concrete + CPS4J 2008-05-301053776SAT 0.750885 0.781195
Sugar v1.13+minisat1053783SAT 0.921859 1.03773
spider 2008-06-141053778SAT 0.964852 0.966042
Sugar v1.13+picosat1053782SAT 1.09383 1.23877
choco2_dwdeg 2008-06-261053786SAT 1.17982 1.22646
galac E1053788SAT 1.3168 1.39791
galac M1053787SAT 1.3218 1.39202
choco2_impwdeg 2008-06-261053785SAT 1.37779 1.41387
SAT4J CSP 2008-06-131053781SAT 1.41578 1.47781
Abscon 112v4 ESAC1053794SAT 1.44178 1.50711
Abscon 112v4 AC1053793SAT 3.70644 3.75176
casper zito1053792SAT 19.96 20.06
bpsolver 2008-06-271053784SAT 60.5468 61.0404
Concrete + CSP4J - Tabu Engine 2008-05-301053774SAT 216.284 218.359

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