CSP 2009 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/circuits/
normalized-c8.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/circuits/
normalized-c8.xml
MD5SUMb481dfce7d7192b2f4754dc41eb7fdee
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.05899
Satisfiable
(Un)Satisfiability was proved
Number of variables239
Number of constraints523
Maximum constraint arity36
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension523
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral 1.545 (complete)2067685SAT 0.05899 0.0636219
pcs 0.3.2 (complete)2067677SAT 0.12098 0.128072
pcs-restart 0.3.2 (complete)2067678SAT 0.12498 0.140514
bpsolver 09 (complete)2067686SAT 0.19497 0.210523
Choco2.1.1b 2009-07-16 (complete)2115389SAT 1.2848 1.31358
Sugar v1.14.6+minisat (complete)2067683SAT 1.3418 1.4186
Choco2.1.1 2009-06-10 (complete)2067681SAT 1.35179 1.38364
Abscon 112v4 AC (complete)2094955SAT 1.42478 1.46267
Abscon 112v4 ESAC (complete)2094956SAT 1.44278 1.47101
Sugar v1.14.6+picosat (complete)2067682SAT 1.60276 1.68784
Concrete DC 2009-07-14 (complete)2067680SAT 62.7715 63.3861
Concrete 2009-07-14 (complete)2067679SAT 76.1854 76.5841
SAT4J CSP 2.1.1 (complete)2067676? (TO) 1801.73 1811.04

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:
1 0 1 1 0 0 1 0 1 1 0 1 1 0 0 0 0 1 1 1 0 1 0 0 1 0 0 0 1 1 1 1 1 1 1 1 1 1 0 1 0 1 0 0 1 1 1 1 0 0 0 1 1 0 1 1 1 0 0 0 0 1 1 0 0 1 1 0 1 0
0 1 1 0 0 0 1 1 1 0 1 1 0 0 1 0 0 0 0 0 1 1 0 0 1 1 1 1 0 1 1 1 0 1 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 1 1 0 0 0 0
1 0 1 0 0 1 1 1 0 1 1 0 1 1 0 1 1 0 0 1 0 0 1 0 1 1 1 1 1 1 0 0 1 1 0 0 1 1 0 1 1 1 0 1 0 1 0 1 0 0 0 1 0 1 1 0 0 1 1 0 0 0 0 0 1 1 0 1 1 1
1 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 0 0 0 0 1 0 1 1 1 0 1 0 1