CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-100/
normalized-aim-100-2-0-sat-1_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-2-0-sat-1_ext.xml
MD5SUMf67ecb4bac030d74a148dda664e43948
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.012997
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints194
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension194
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.3141054907SAT 0.012997 0.0204109
Mistral-prime 1.3131054908SAT 0.012997 0.0200961
MDG-noprobe 2008-06-271054898SAT 0.014997 0.0220901
cpHydra k_101054913SAT 0.023996 0.030824
cpHydra k_401054914SAT 0.025995 0.0276539
casper zito1054910SAT 0.035993 0.042777
MDG-probe 2008-06-271054897SAT 0.042992 0.04784
mddc-solv 2008-06-091054895SAT 0.048992 0.054456
spider 2008-06-141054896SAT 0.064989 0.070927
casper zao1054909SAT 0.065989 0.071617
Minion/Tailor 2008-07-041105124SAT 0.39194 0.456614
Concrete + CPS4J 2008-05-301054894SAT 0.536917 0.597629
Concrete + CSP4J - WMC Engine 2008-05-301054893SAT 0.589909 0.634082
choco2_dwdeg 2008-06-261054904SAT 0.637902 0.680923
Sugar v1.13+picosat1054900SAT 0.707892 0.76814
Sugar v1.13+minisat1054901SAT 0.734887 0.809809
SAT4J CSP 2008-06-131054899SAT 0.826874 0.888718
choco2_impwdeg 2008-06-261054903SAT 0.833873 0.89644
Abscon 112v4 AC1054911SAT 0.867867 0.890246
Abscon 112v4 ESAC1054912SAT 0.928857 0.951315
galac M1054905SAT 0.939856 1.02579
galac E1054906SAT 1.07583 1.20047
Concrete + CSP4J - Tabu Engine 2008-05-301054892SAT 18.4472 18.6839
bpsolver 2008-06-271054902SAT 193.579 195.022

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