CSP 2009 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/sgb/games/
normalized-games120-9.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/sgb/games/
normalized-games120-9.xml
MD5SUMc96c1eea6ec5e4787605aedecea432e5
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.029994
Satisfiable
(Un)Satisfiability was proved
Number of variables120
Number of constraints638
Maximum constraint arity2
Maximum domain size9
Number of constraints which are defined in extension0
Number of constraints which are defined in intension638
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral 1.545 (complete)2085472SAT 0.029994 0.0372169
pcs 0.3.2 (complete)2085464SAT 0.042993 0.0501269
pcs-restart 0.3.2 (complete)2085465SAT 0.043993 0.0552221
bpsolver 09 (complete)2085473SAT 0.147976 0.156724
Abscon 112v4 ESAC (complete)2098190SAT 1.05784 1.11005
Abscon 112v4 AC (complete)2098189SAT 1.14482 1.20158
Sugar v1.14.6+minisat (complete)2085470SAT 1.17182 1.36266
Sugar v1.14.6+picosat (complete)2085469SAT 1.47278 1.58252
Choco2.1.1 2009-06-10 (complete)2085468SAT 1.54776 1.56859
Choco2.1.1b 2009-07-16 (complete)2117006SAT 1.80572 1.86097
Concrete 2009-07-14 (complete)2085466SAT 1.84972 1.9352
Concrete DC 2009-07-14 (complete)2085467SAT 1.90571 1.9779
SAT4J CSP 2.1.1 (complete)2085463SAT 2.36864 2.42675

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