CSP 2009 Competition: solvers results per benchmarks

Result page for benchmark
csp/radar-9-28-4-2/
normalized-radar-9-28-4-2-11.xml

Jump to solvers results

General information on the benchmark

Namecsp/radar-9-28-4-2/
normalized-radar-9-28-4-2-11.xml
MD5SUM871ea481d5d83bc5de69fc7155928cbb
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.070988
Satisfiable
(Un)Satisfiability was proved
Number of variables168
Number of constraints81
Maximum constraint arity22
Maximum domain size5
Number of constraints which are defined in extension0
Number of constraints which are defined in intension81
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral 1.545 (complete)2063648SAT 0.070988 0.073923
pcs-restart 0.3.2 (complete)2063641SAT 0.210967 0.21824
pcs 0.3.2 (complete)2063640SAT 0.284956 0.290053
Sugar v1.14.6+minisat (complete)2063646SAT 1.58276 1.68266
Sugar v1.14.6+picosat (complete)2063645SAT 2.33364 2.4598
Choco2.1.1 2009-06-10 (complete)2063644SAT 13.253 13.4096
Abscon 112v4 AC (complete)2094221SAT 118.487 118.568
Abscon 112v4 ESAC (complete)2094222SAT 119.903 121.062
Concrete 2009-07-14 (complete)2063642SAT 425.657 427.922
Concrete DC 2009-07-14 (complete)2063643SAT 996.643 997.703
SAT4J CSP 2.1.1 (complete)2063639? 1009.42 1016.63
bpsolver 09 (complete)2063649? (TO) 1800.05 1814.61
Choco2.1.1b 2009-07-16 (complete)2115022? (TO) 1800.14 1802.88

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:
0 2 0 1 0 0 0 3 0 2 1 0 0 4 3 2 0 0 4 4 4 0 2 2 0 0 0 1 0 0 1 0 0 0 0 3 4 4 0 0 1 1 4 0 0 4 0 1 2 0 2 4 0 0 4 0 0 4 0 0 0 0 4 0 0 0 4 0 0 0
4 0 0 3 1 0 2 4 4 2 4 0 0 4 2 0 0 0 0 0 3 4 0 3 0 0 4 0 4 3 4 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 3 1 2 2 1 4 4 0 0 2 0 0 4 4 4 0 0 4 0 0
4 1 2 2 0 0 3 4 1 1 2 1 0 0 4 0 0 1 0 0 1 4 2 1 0 0 3 1