CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/aim/
normalized-aim-50-6-0-1.xml
MD5SUM2a7203aacc187d226d9c2b0caf9845a0
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.024995
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints350
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension350
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-prime 1.3131062916SAT 0.024995 0.0315301
casper zito1062918SAT 0.031994 0.037547
MDG-noprobe 2008-06-271062906SAT 0.034994 0.046983
Mistral-option 1.3141062915SAT 0.037994 0.0428759
casper zao1062917SAT 0.045992 0.0539049
cpHydra k_101062921SAT 0.047992 0.050494
cpHydra k_401062922SAT 0.048992 0.0550529
MDG-probe 2008-06-271062905SAT 0.080987 0.0868891
bpsolver 2008-06-271062910SAT 0.100984 0.106426
Minion/Tailor 2008-07-041106301SAT 0.860869 0.877851
Sugar v1.13+minisat1062909SAT 0.889864 0.991911
Sugar v1.13+picosat1062908SAT 0.900862 1.11481
Concrete + CPS4J 2008-05-301062904SAT 0.992849 1.04956
choco2_dwdeg 2008-06-261062912SAT 1.02484 1.04292
choco2_impwdeg 2008-06-261062911SAT 1.03684 1.05234
Concrete + CSP4J - WMC Engine 2008-05-301062903SAT 1.08083 1.16279
Abscon 112v4 AC1062919SAT 1.09283 1.14704
Abscon 112v4 ESAC1062920SAT 1.09483 1.09521
Concrete + CSP4J - Tabu Engine 2008-05-301062902SAT 1.09883 1.11514
galac M1062913SAT 1.54476 1.62518
galac E1062914SAT 1.71574 1.8304
SAT4J CSP 2008-06-131062907SAT 1.81972 1.86879

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