2018 XCSP3 competition: parallel solvers tracks: solvers results per benchmarks

Result page for benchmark
Frb/
frb-45-21-1_c18.xml

Jump to solvers results

General information on the benchmark

NameFrb/
frb-45-21-1_c18.xml
MD5SUMb87938282b595c2beb3624311f73a470
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark221.514
Satisfiable
(Un)Satisfiability was proved
Number of variables45
Number of constraints476
Number of domains1
Minimum domain size21
Maximum domain size21
Distribution of domain sizes[{"size":21,"count":45}]
Minimum variable degree13
Maximum variable degree29
Distribution of variable degrees[{"degree":13,"count":1},{"degree":14,"count":2},{"degree":15,"count":1},{"degree":16,"count":2},{"degree":17,"count":4},{"degree":18,"count":4},{"degree":19,"count":3},{"degree":20,"count":2},{"degree":21,"count":2},{"degree":22,"count":5},{"degree":23,"count":6},{"degree":24,"count":3},{"degree":25,"count":3},{"degree":26,"count":3},{"degree":27,"count":1},{"degree":28,"count":2},{"degree":29,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":476}]
Number of extensional constraints476
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":476}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
scop both+glucose-syrup (2018-07-31) (complete)4307468SAT 221.514 31.9327
scop order+glucose-syrup (2018-07-07) (complete)4297048SAT 674.523 88.427
scop both+glucose-syrup (2018-07-07) (complete)4297284SAT 4814.22 607.207
scop order+glucose-syrup (2018-07-31) (complete)4307232SAT 6267.18 790.158
Choco-solver 4.0.7b par (e747e1e) (complete)4297783SAT 14318.8 1796.85
OscaR - Parallel with EPS 2018-07-02 (complete)4291370? (TO) 19993.3 2520.37
OscaR - Parallel with EPS 2018-08-14 (complete)4309139? (TO) 20033.2 2520.4

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:
Solution found:
<instantiation> <list>x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20]
x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43]
x[44]</list> <values>5 5 1 12 18 4 9 19 2 8 6 9 8 9 6 1 1 1 13 12 18 18 7 7 4 11 7 8 7 9 3 13 15 7 17 6 20 5 13 19 7 7 20 8 2</values>
</instantiation>