CSP 2009 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/aim/
normalized-aim-100-2-0-3.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/aim/
normalized-aim-100-2-0-3.xml
MD5SUM9250a0aca721acdd39a9a2a3247033ca
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.077988
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints300
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension300
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
pcs-restart 0.3.2 (complete)2067755SAT 0.077988 0.095017
pcs 0.3.2 (complete)2067754SAT 0.098984 0.107215
Mistral 1.545 (complete)2067762SAT 0.12598 0.128817
Sugar v1.14.6+minisat (complete)2067760SAT 0.861868 0.966937
Sugar v1.14.6+picosat (complete)2067759SAT 0.888864 1.00011
Choco2.1.1b 2009-07-16 (complete)2115396SAT 1.11583 1.15544
Abscon 112v4 AC (complete)2094969SAT 1.49577 1.51795
Choco2.1.1 2009-06-10 (complete)2067758SAT 1.75273 1.80404
SAT4J CSP 2.1.1 (complete)2067753SAT 1.75273 1.81058
Abscon 112v4 ESAC (complete)2094970SAT 1.75773 1.78364
Concrete 2009-07-14 (complete)2067756SAT 1.81072 1.87863
Concrete DC 2009-07-14 (complete)2067757SAT 2.00069 2.03462
bpsolver 09 (complete)2067763? (TO) 1800.04 1814.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 0 1 1 0 0 1 1 0 1 0 0 1 0 1 0 1 1 0 1 0 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 0 1 0 1 1 0 1 0 0 1
0 1 0 1 0 1 0 1 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 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 1 1 0 1 0 1 0 1 0 0 1 0 1 1 0
0 1 0 1 0 1 0 1 1 0 1 0 0 1 1 0 0 1 1 0 0 1 1 0 1 0 0 1 1 0 1 0 0 1 0 1 0 1 1 0 0 1 0 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0