CSP 2009 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/aim/
normalized-aim-100-1-6-4.xml
MD5SUMe5c5d92df12b009ff7647cd5cfcf618f
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.028995
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)2067850SAT 0.028995 0.0363471
pcs 0.3.2 (complete)2067842SAT 0.068989 0.0764151
pcs-restart 0.3.2 (complete)2067843SAT 0.076988 0.091334
Sugar v1.14.6+minisat (complete)2067848SAT 0.85387 0.905216
Sugar v1.14.6+picosat (complete)2067847SAT 0.895862 0.971716
Choco2.1.1 2009-06-10 (complete)2067846SAT 1.06384 1.10607
Choco2.1.1b 2009-07-16 (complete)2115404SAT 1.07383 1.12661
Abscon 112v4 ESAC (complete)2094986SAT 1.08283 1.15156
Abscon 112v4 AC (complete)2094985SAT 1.10883 1.15491
Concrete DC 2009-07-14 (complete)2067845SAT 1.63275 1.6612
SAT4J CSP 2.1.1 (complete)2067841SAT 1.67274 1.70817
Concrete 2009-07-14 (complete)2067844SAT 1.69474 1.77572
bpsolver 09 (complete)2067851? (TO) 1800.04 1808.81

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