2017 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Rcpsp/Rcpsp-m1-j30/
Rcpsp-j30-40-08.xml

Jump to solvers results

General information on the benchmark

NameRcpsp/Rcpsp-m1-j30/
Rcpsp-j30-40-08.xml
MD5SUMa1a47bf7c0dfac46ae24643a1dca38e9
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark57
Best CPU time to get the best result obtained on this benchmark0.30547801
Satisfiable
(Un)Satisfiability was proved
Number of variables32
Number of constraints72
Number of domains2
Minimum domain size1
Maximum domain size177
Distribution of domain sizes[{"size":1,"count":1},{"size":177,"count":31}]
Minimum variable degree3
Maximum variable degree9
Distribution of variable degrees[{"degree":3,"count":1},{"degree":4,"count":1},{"degree":5,"count":6},{"degree":6,"count":12},{"degree":7,"count":9},{"degree":8,"count":1},{"degree":9,"count":2}]
Minimum constraint arity2
Maximum constraint arity17
Distribution of constraint arities[{"arity":2,"count":68},{"arity":14,"count":2},{"arity":16,"count":1},{"arity":17,"count":1}]
Number of extensional constraints0
Number of intensional constraints68
Distribution of constraint types[{"type":"intension","count":68},{"type":"cumulative","count":4}]
Optimization problemYES
Type of objectivemin VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Mistral-2.0 2017-07-28 (complete)4259213OPT57 0.30547801 0.38595799
choco-solver 4.0.5 seq (2017-08-09) (complete)4270237OPT57 1.06732 0.54979903
choco-solver 4.0.5 seq (2017-08-18) (complete)4282987OPT57 1.09173 0.55370498
choco-solver 4.0.5 seq (2017-07-26) (complete)4254243OPT57 1.1018 0.63142401
choco-solver 5a (2017-08-18) (complete)4284457OPT57 1.12356 0.562612
choco-solver 5a (2017-07-26) (complete)4255237OPT57 1.15411 0.72034597
choco-solver 4.0.5 par (2017-08-18) (complete)4281517OPT57 1.84044 0.71216202
choco-solver 4.0.5 par (2017-07-26) (complete)4254740OPT57 1.88307 0.89586401
choco-solver 4.0.5 par (2017-08-09) (complete)4271707OPT57 1.89635 0.72365397
OscaR - Conflict Ordering 2017-07-26 (complete)4256231OPT57 1.91152 1.14211
OscaR - Hybrid 2017-07-26 (complete)4256728OPT57 1.91246 1.13362
Concrete 3.4 (complete)4259710OPT57 10.1939 4.63762
OscaR - Parallel with EPS 2017-07-26 (complete)4257225OPT57 10.391 4.2114801
OscaR - Parallel with EPS 2017-08-22 (complete)4285927OPT57 11.2758 4.31811
OscaR - ALNS 2017-07-26 (complete)4255734SAT (TO)57 246.282 240.01199
sat4j-CSP 2017-07-05 (complete)4258219? 2.5290899 1.43053
cosoco-sat 1.12 (complete)4266836? (NS) 0.077136002 0.077687897
cosoco 1.12 (complete)4268767? (NS) 0.078284003 0.079040997
cosoco 1.1 (complete)4258716? (NS) 0.080835 0.195397
AbsCon-basic 2017-06-11 (complete)4257722? (NS) 1.1541899 0.68181998

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function: 57
Solution found:
<instantiation type="optimum" cost="57"> <list> s[0] s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] s[10] s[11] s[12] s[13] s[14] s[15] s[16]
s[17] s[18] s[19] s[20] s[21] s[22] s[23] s[24] s[25] s[26] s[27] s[28] s[29] s[30] s[31] </list> <values> 0 0 0 0 10 5 10 5 20 10 20 12 5
20 20 12 26 24 30 30 22 35 24 35 36 33 41 40 33 41 51 57 </values> </instantiation>