CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/mpsReduced/
normalized-mps-red-p0282.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/mpsReduced/
normalized-mps-red-p0282.xml
MD5SUM1442269d9a7d88f20282612d7f47defc
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.063989
Satisfiable
(Un)Satisfiability was proved
Number of variables282
Number of constraints221
Maximum constraint arity57
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension221
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-probe 2008-06-271063745SAT 0.063989 0.0636331
Mistral-option 1.3141063755SAT 0.066988 0.0696389
MDG-noprobe 2008-06-271063746SAT 0.067988 0.068377
Mistral-prime 1.3131063756SAT 0.070988 0.0777539
cpHydra k_401063762SAT 0.077987 0.082341
cpHydra k_101063761SAT 0.079987 0.083924
bpsolver 2008-06-271063750SAT 0.165974 0.176477
casper zao1063757SAT 0.573911 0.575373
casper zito1063758SAT 0.58991 0.607149
Minion/Tailor 2008-07-041106518SAT 0.97885 1.01643
choco2_dwdeg 2008-06-261063752SAT 1.21981 1.26218
choco2_impwdeg 2008-06-261063751SAT 1.36779 1.41973
Sugar v1.13+minisat1063749SAT 36.1765 36.8276
Abscon 112v4 AC1063759SAT 54.2567 55.3191
Concrete + CPS4J 2008-05-301063744SAT 131.655 132.322
Abscon 112v4 ESAC1063760SAT 139.239 139.854
Sugar v1.13+picosat1063748SAT 146.682 151.163
Concrete + CSP4J - Tabu Engine 2008-05-301063742SAT 239.739 240.228
Concrete + CSP4J - WMC Engine 2008-05-301063743SAT 256.452 258.919
galac E1063754? (problem) 73.7578 74.5012
galac M1063753? (problem) 75.6725 76.6382
SAT4J CSP 2008-06-131063747? (TO) 1801.47 1808.66

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