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

Result page for benchmark
Subisomorphism/
Subisomorphism-g11-g44_c18.xml

Jump to solvers results

General information on the benchmark

NameSubisomorphism/
Subisomorphism-g11-g44_c18.xml
MD5SUM691a51199f261ec138535be56fe101c2
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark5427.21
Satisfiable
(Un)Satisfiability was proved
Number of variables42
Number of constraints157
Number of domains1
Minimum domain size128
Maximum domain size128
Distribution of domain sizes[{"size":128,"count":42}]
Minimum variable degree3
Maximum variable degree12
Distribution of variable degrees[{"degree":3,"count":1},{"degree":4,"count":1},{"degree":5,"count":4},{"degree":6,"count":6},{"degree":7,"count":10},{"degree":8,"count":6},{"degree":9,"count":11},{"degree":10,"count":2},{"degree":12,"count":1}]
Minimum constraint arity1
Maximum constraint arity42
Distribution of constraint arities[{"arity":1,"count":42},{"arity":2,"count":114},{"arity":42,"count":1}]
Number of extensional constraints156
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":156},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
OscaR - Parallel with EPS 2018-08-14 (complete)4309129UNSAT 5427.21 690.346
OscaR - Parallel with EPS 2018-07-02 (complete)4291360UNSAT 6114.42 778.305
Choco-solver 4.0.7b par (e747e1e) (complete)4297773UNSAT 15285.6 1920.09
scop both+glucose-syrup (2018-07-31) (complete)4307458? (TO) 19871.7 2520.09
scop order+glucose-syrup (2018-07-31) (complete)4307222? (TO) 19877.4 2520.08
scop order+glucose-syrup (2018-07-07) (complete)4297038? (TO) 19880.7 2520.12
scop both+glucose-syrup (2018-07-07) (complete)4297274? (TO) 19887.1 2520.11

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: