CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-3-4-sat-1_ext.xml
MD5SUM3e19610c3dc09e554ab878308faf72cd
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.115982
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints646
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension646
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.3131053721SAT 0.115982 0.115974
cpHydra k_401053727SAT 0.138978 0.145693
cpHydra k_101053726SAT 0.139978 0.146264
MDG-probe 2008-06-271053710SAT 0.175972 0.183077
Mistral-option 1.3141053720SAT 0.182971 0.187573
MDG-noprobe 2008-06-271053711SAT 0.232964 0.235246
mddc-solv 2008-06-091053708SAT 0.461928 0.475514
casper zito1053723SAT 0.491924 0.493247
casper zao1053722SAT 0.517921 0.529875
Concrete + CPS4J 2008-05-301053707SAT 0.71489 0.739067
Minion/Tailor 2008-07-041105046SAT 0.768882 0.822903
Sugar v1.13+minisat1053714SAT 1.04884 1.19878
Sugar v1.13+picosat1053713SAT 1.15682 1.24615
spider 2008-06-141053709SAT 1.17582 1.18869
Concrete + CSP4J - WMC Engine 2008-05-301053706SAT 1.36579 1.40863
SAT4J CSP 2008-06-131053712SAT 1.39679 1.41551
galac M1053718SAT 1.40879 1.48157
Abscon 112v4 ESAC1053725SAT 1.42078 1.48229
Abscon 112v4 AC1053724SAT 1.43778 1.46284
galac E1053719SAT 1.52877 1.62466
choco2_dwdeg 2008-06-261053717SAT 1.55576 1.60519
choco2_impwdeg 2008-06-261053716SAT 10.8084 10.8986
Concrete + CSP4J - Tabu Engine 2008-05-301053705SAT 352.153 352.351
bpsolver 2008-06-271053715SAT 413.578 414.624

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