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

Result page for benchmark
pseudoSeries/par/
par-8-2-c.xml

Jump to solvers results

General information on the benchmark

NamepseudoSeries/par/
par-8-2-c.xml
MD5SUMb061dca21e9625fb98e55e2e16c51b6d
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.037993
SatisfiableYES
(Un)Satisfiability was provedYES
Number of variables136
Number of constraints338
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension338
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Tramontane 2006-12-04213931SAT 0.037993 0.0403989
Mistral 2006-12-04213930SAT 0.038993 0.0417539
BPrologCSPSolver70a 2006-12-13213921SAT 0.039993 0.0418799
CSPtoSAT+minisat 0.3213933SAT 0.045992 0.0520019
sugar 0.40213932SAT 0.824874 1.10337
Abscon 109 ESAC213923SAT 0.926858 0.971585
Abscon 109 AC213924SAT 0.994848 1.02869
CSP4J - MAC 2007-01-16271127SAT 1.15782 1.18555
CSP4J - MAC 2006-12-19213926SAT 1.16182 1.22452
CSP4J - Combo 2006-12-19213925SAT 1.16782 1.22266
galacJ beta 1213922SAT 1.61675 1.70642
galac 1213927SAT 1.68174 1.83628
sat4jCSP 1.7 RC BF3213929SAT 1.71574 1.30105
SAT4JCSP-CACHED 1.7 RC BF3213928SAT 1.77373 1.29967