CSP 2009 Competition: solvers results per benchmarks

Result page for benchmark
csp/nengfa/
normalized-schur.xml

Jump to solvers results

General information on the benchmark

Namecsp/nengfa/
normalized-schur.xml
MD5SUM84511ecf3a05d64f4feb7211658b4b0d
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 benchmark4.6113
Satisfiable
(Un)Satisfiability was proved
Number of variables110
Number of constraints3025
Maximum constraint arity3
Maximum domain size5
Number of constraints which are defined in extension0
Number of constraints which are defined in intension3025
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Abscon 112v4 AC (complete)2096989SAT 4.6113 4.70402
Abscon 112v4 ESAC (complete)2096990SAT 7.82181 7.9369
Sugar v1.14.6+picosat (complete)2078869SAT 9.29059 9.49538
Concrete 2009-07-14 (complete)2078866SAT 14.3358 14.5385
Concrete DC 2009-07-14 (complete)2078867SAT 15.3137 15.4116
bpsolver 09 (complete)2078873SAT 17.3184 17.4836
SAT4J CSP 2.1.1 (complete)2078863SAT 19.1071 19.2601
Mistral 1.545 (complete)2078872SAT 23.7884 23.7977
Sugar v1.14.6+minisat (complete)2078870SAT 28.1417 28.5716
Choco2.1.1b 2009-07-16 (complete)2116406SAT 37.5853 37.6399
pcs-restart 0.3.2 (complete)2078865SAT 62.3095 62.4706
pcs 0.3.2 (complete)2078864SAT 71.9841 72.3446
Choco2.1.1 2009-06-10 (complete)2078868SAT 544.12 544.41

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:
4 2 2 1 1 1 3 3 3 2 2 3 1 4 2 2 4 5 4 1 1 1 4 5 3 3 4 3 1 4 3 4 2 5 4 1 1 1 4 2 3 3 5 3 4 2 2 4 5 5 5 1 1 2 5 5 5 3 5 3 3 5 3 5 5 5 2 1 1 5
5 5 4 2 2 3 3 5 3 3 2 4 1 1 1 4 5 2 4 3 4 1 3 4 3 3 5 4 1 1 1 4 5 4 2 2 4 1 1 1