CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

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

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271062969SAT 0.012997 0.019895
casper zito1062981SAT 0.014997 0.0217159
casper zao1062980SAT 0.020996 0.02713
cpHydra k_401062985SAT 0.024995 0.032342
cpHydra k_101062984SAT 0.024995 0.0313661
Mistral-prime 1.3131062979SAT 0.026995 0.03381
Mistral-option 1.3141062978SAT 0.038993 0.045299
MDG-probe 2008-06-271062968SAT 0.047992 0.054088
bpsolver 2008-06-271062973SAT 0.080987 0.090227
Minion/Tailor 2008-07-041106297SAT 0.465929 0.495053
Sugar v1.13+minisat1062972SAT 0.707891 0.897526
choco2_dwdeg 2008-06-261062975SAT 0.732887 0.787285
choco2_impwdeg 2008-06-261062974SAT 0.78388 0.84226
Sugar v1.13+picosat1062971SAT 0.790879 0.863947
Concrete + CPS4J 2008-05-301062967SAT 0.837872 0.898607
Abscon 112v4 ESAC1062983SAT 0.857869 0.903072
Abscon 112v4 AC1062982SAT 0.988848 1.01525
SAT4J CSP 2008-06-131062970SAT 1.13883 1.17754
galac M1062976SAT 1.15182 1.27274
galac E1062977SAT 1.27981 1.36907
Concrete + CSP4J - Tabu Engine 2008-05-301062965SAT 110.969 112.057
Concrete + CSP4J - WMC Engine 2008-05-301062966? (TO) 1800.05 1807.42

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