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

Result page for benchmark
Frb/
frb-35-17-1_c18.xml

Jump to solvers results

General information on the benchmark

NameFrb/
frb-35-17-1_c18.xml
MD5SUM938558367576662423373d61b63119a7
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 benchmark13.7294
Satisfiable
(Un)Satisfiability was proved
Number of variables35
Number of constraints346
Number of domains1
Minimum domain size17
Maximum domain size17
Distribution of domain sizes[{"size":17,"count":35}]
Minimum variable degree12
Maximum variable degree28
Distribution of variable degrees[{"degree":12,"count":3},{"degree":13,"count":3},{"degree":14,"count":1},{"degree":15,"count":1},{"degree":16,"count":1},{"degree":17,"count":1},{"degree":18,"count":3},{"degree":19,"count":2},{"degree":20,"count":2},{"degree":21,"count":4},{"degree":22,"count":3},{"degree":23,"count":4},{"degree":24,"count":1},{"degree":25,"count":3},{"degree":26,"count":1},{"degree":28,"count":2}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":346}]
Number of extensional constraints346
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":346}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
scop order+glucose-syrup (2018-07-07) (complete)4297046SAT 13.7294 4.27392
scop both+glucose-syrup (2018-07-31) (complete)4307466SAT 18.204 5.36675
scop both+glucose-syrup (2018-07-07) (complete)4297282SAT 20.1576 4.96444
scop order+glucose-syrup (2018-07-31) (complete)4307230SAT 21.1093 5.65299
Choco-solver 4.0.7b par (e747e1e) (complete)4297781SAT 24.7132 3.76934
OscaR - Parallel with EPS 2018-08-14 (complete)4309137SAT 122.129 18.1132
OscaR - Parallel with EPS 2018-07-02 (complete)4291368SAT 123.158 18.2232

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]</list> <values>4 4 6 10 15 3 7 15 2 7 9 1 6 11 0 1 1 14
10 9 15 15 6 5 3 9 6 6 6 7 2 10 12 5 14</values> </instantiation>