CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-1-6-sat-4_ext.xml
MD5SUM7944a2b777c28bf6ef2ff25cfcbc3735
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.010997
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints157
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension157
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-option 1.3141054792SAT 0.010997 0.0178219
Mistral-prime 1.3131054793SAT 0.010997 0.0173901
MDG-noprobe 2008-06-271054783SAT 0.011997 0.0166269
casper zito1054795SAT 0.019996 0.0266871
casper zao1054794SAT 0.021996 0.0238611
cpHydra k_401054799SAT 0.022995 0.0290299
cpHydra k_101054798SAT 0.022996 0.0222371
spider 2008-06-141054781SAT 0.023995 0.0275821
MDG-probe 2008-06-271054782SAT 0.031994 0.0357191
mddc-solv 2008-06-091054780SAT 0.038993 0.0430891
Minion/Tailor 2008-07-041105119SAT 0.353946 0.396552
Concrete + CPS4J 2008-05-301054779SAT 0.399938 0.416439
Concrete + CSP4J - WMC Engine 2008-05-301054778SAT 0.500922 0.53264
choco2_dwdeg 2008-06-261054789SAT 0.527919 0.57935
choco2_impwdeg 2008-06-261054788SAT 0.551915 0.584399
Sugar v1.13+picosat1054785SAT 0.6479 0.783979
Sugar v1.13+minisat1054786SAT 0.695894 0.780559
Abscon 112v4 AC1054796SAT 0.769882 0.7923
SAT4J CSP 2008-06-131054784SAT 0.804876 0.840904
Abscon 112v4 ESAC1054797SAT 0.818874 0.834479
galac E1054791SAT 0.928858 0.996802
galac M1054790SAT 1.10483 1.16182
bpsolver 2008-06-271054787SAT 1.3018 1.30407
Concrete + CSP4J - Tabu Engine 2008-05-301054777? (TO) 1800.05 1802.22

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