CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/primesDimacs/
normalized-bf-1355-638.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/primesDimacs/
normalized-bf-1355-638.xml
MD5SUMbddb728f1bba9acd4b4d127996acf647
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark1.03784
Satisfiable
(Un)Satisfiability was proved
Number of variables4354
Number of constraints8940
Maximum constraint arity6
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension8940
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cpHydra k_401050308UNSAT 1.03784 1.03861
Mistral-prime 1.3131050302UNSAT 1.05584 1.07225
cpHydra k_101050307UNSAT 1.06584 1.06493
MDG-noprobe 2008-06-271050292UNSAT 1.12783 1.14533
Sugar v1.13+minisat1050295UNSAT 2.37064 2.45212
Sugar v1.13+picosat1050294UNSAT 2.6196 2.72093
MDG-probe 2008-06-271050291UNSAT 5.44817 5.50821
casper zito1050304UNSAT 5.81612 5.82343
Abscon 112v4 AC1050305UNSAT 8.28674 8.39694
SAT4J CSP 2008-06-131050293UNSAT 8.5557 8.696
casper zao1050303UNSAT 11.0833 11.1851
choco2_dwdeg 2008-06-261050298UNSAT 11.1733 11.3301
Abscon 112v4 ESAC1050306UNSAT 11.6632 11.8401
galac M1050299UNSAT 17.9763 18.0748
galac E1050300UNSAT 18.4262 18.6639
Concrete + CPS4J 2008-05-301050290UNSAT 18.5052 18.7454
Minion/Tailor 2008-07-041104886UNSAT 94.8736 95.9127
Mistral-option 1.3141050301UNSAT 319.55 321.51
bpsolver 2008-06-271050296? (TO) 1800.02 1805.22
Concrete + CSP4J - WMC Engine 2008-05-301050289? (TO) 1800.03 1819.52
Concrete + CSP4J - Tabu Engine 2008-05-301050288? (TO) 1800.04 1816.52
choco2_impwdeg 2008-06-261050297? (TO) 1800.14 1802.89

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: