2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
Rcpsp/
Rcpsp-j90-01-02_c18.xml

Jump to solvers results

General information on the benchmark

NameRcpsp/
Rcpsp-j90-01-02_c18.xml
MD5SUM7549aa093fe24285400bc63faca9f795
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark92
Best CPU time to get the best result obtained on this benchmark3.02642
Satisfiable
(Un)Satisfiability was proved
Number of variables92
Number of constraints142
Number of domains2
Minimum domain size1
Maximum domain size478
Distribution of domain sizes[{"size":1,"count":1},{"size":478,"count":91}]
Minimum variable degree3
Maximum variable degree6
Distribution of variable degrees[{"degree":3,"count":37},{"degree":4,"count":20},{"degree":5,"count":34},{"degree":6,"count":1}]
Minimum constraint arity2
Maximum constraint arity32
Distribution of constraint arities[{"arity":2,"count":138},{"arity":16,"count":1},{"arity":19,"count":1},{"arity":23,"count":1},{"arity":32,"count":1}]
Number of extensional constraints0
Number of intensional constraints138
Distribution of constraint types[{"type":"intension","count":138},{"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 2018-08-01 (complete)4312673OPT92 2.24001 2.24511
Choco-solver 4.0.7b seq (e747e1e) (complete)4301921OPT92 3.02642 1.21396
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312210OPT92 4.16703 1.88791
OscaR - Hybrid 2018-08-14 (complete)4310350OPT92 5.08884 2.20701
Concrete 3.9.2-SuperNG (complete)4302724OPT92 10.9549 5.25151
Concrete 3.9.2 (complete)4302374OPT92 11.0027 4.99616
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310000SAT (TO)92 252.107 246.328
cosoco 1.12 (complete)4301923? (NS) 0.058653 0.059605
Sat4j-CSP 2018-07-11 (complete)4301922? (TO) 259.949 89.0632

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: 92
Solution found:
<instantiation type="optimum" cost="92"> <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] s[32] s[33] s[34] s[35] s[36] s[37] s[38] s[39]
s[40] s[41] s[42] s[43] s[44] s[45] s[46] s[47] s[48] s[49] s[50] s[51] s[52] s[53] s[54] s[55] s[56] s[57] s[58] s[59] s[60] s[61] s[62]
s[63] s[64] s[65] s[66] s[67] s[68] s[69] s[70] s[71] s[72] s[73] s[74] s[75] s[76] s[77] s[78] s[79] s[80] s[81] s[82] s[83] s[84] s[85]
s[86] s[87] s[88] s[89] s[90] s[91] </list> <values> 0 0 0 0 5 5 6 11 9 2 14 14 7 5 17 6 25 2 25 35 14 27 7 14 14 11 7 12 24 6 24 24 22 32
26 32 28 26 24 39 25 27 36 28 28 12 43 14 46 29 16 33 36 44 69 31 44 37 44 53 12 32 47 56 48 29 61 43 26 44 59 17 32 33 55 59 16 65 32 73 33
68 75 47 77 69 80 77 84 81 88 92 </values> </instantiation>