CSP 2006 Competition (second round): solvers results per benchmarks

Result page for benchmark
pseudoSeries/primesDimacs/
bf-2670-001.xml

Jump to solvers results

General information on the benchmark

NamepseudoSeries/primesDimacs/
bf-2670-001.xml
MD5SUM254fa29df9e9670d71c11b5fd4b239c4
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.01684
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables2786
Number of constraints4821
Maximum constraint arity5
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension4821
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Tramontane 2006-12-04212813UNSAT 1.01684 1.03479
Mistral 2006-12-04212812UNSAT 1.27381 1.29036
sugar 0.40212814UNSAT 1.71 1.89539
CSPtoSAT+minisat 0.3212815UNSAT 3.41448 3.4538
galacJ beta 1212804UNSAT 6.89195 6.9396
SAT4JCSP-CACHED 1.7 RC BF3212810UNSAT 7.04593 7.13796
galac 1212809UNSAT 7.62284 7.75202
Abscon 109 ESAC212805UNSAT 10.6024 10.7634
CSP4J - MAC 2006-12-19212808UNSAT 11.9522 12.173
CSP4J - Combo 2006-12-19212807UNSAT 12.0772 12.2212
CSP4J - MAC 2007-01-16271041UNSAT 12.3101 12.4758
Abscon 109 AC212806UNSAT 18.5902 18.8323
sat4jCSP 1.7 RC BF3212811? (MO) 6.69298 4.638
BPrologCSPSolver70a 2006-12-13212803? (TO) 1800.02 1808.61