CSP 2009 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/aim/
normalized-aim-100-1-6-1.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/aim/
normalized-aim-100-1-6-1.xml
MD5SUM2decc9dc305621bad0aff0ec0a7ae11c
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.041993
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints260
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension260
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral 1.545 (complete)2067949SAT 0.041993 0.044025
pcs 0.3.2 (complete)2067941SAT 0.06499 0.0756621
pcs-restart 0.3.2 (complete)2067942SAT 0.087986 0.0949139
Sugar v1.14.6+picosat (complete)2067946SAT 0.880865 0.972795
Sugar v1.14.6+minisat (complete)2067947SAT 1.04184 1.1189
Abscon 112v4 AC (complete)2095003SAT 1.07483 1.09966
Choco2.1.1b 2009-07-16 (complete)2115413SAT 1.08083 1.11974
Abscon 112v4 ESAC (complete)2095004SAT 1.08783 1.15482
Choco2.1.1 2009-06-10 (complete)2067945SAT 1.21581 1.28205
Concrete 2009-07-14 (complete)2067943SAT 1.58876 1.65855
Concrete DC 2009-07-14 (complete)2067944SAT 1.70174 1.76482
SAT4J CSP 2.1.1 (complete)2067940SAT 1.85072 1.88884
bpsolver 09 (complete)2067950SAT 852.743 853.538

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