CSP 2009 Competition: results by benchmark

Results by benchmark for category binary constraints in intension (2-ARY-INT), subcategory boolean problems

This page displays the results of the different solvers for each benchmark for category binary constraints in intension (2-ARY-INT), subcategory boolean problems

REMINDER

Keep in mind that the 'Best result' columns only provide the best result given by one of the solvers. This 'Best result' may be wrong in case of an UNSATISFIABLE or OPTIMUM FOUND answer (because there's no efficient way to check these answers).

Description of a cell contents:

Cell exampleMeaning
AnswerSolver result
TT=...Total Time (TT): this is the CPU time (in seconds) used by the solver until termination. This time is only meaningful for complete solvers because incomplete solvers will always run until they time out
Remember that CPU time and wall clock time are two very different notions. The CPU time represents the time during which the instructions of the solver were executed by the processor. The wall clock time represents how much time ellapsed on the clock. For a same event, the CPU time may be either smaller or greater than the wall clock time depending on the number of threads of execution and the number of processors.

Meaning of some abbreviations:

AbbreviationMeaning
TOTime Out
MOMem. Out (out of memory)

Meaning of the different colors:

ColorMeaning
textthe solver cannot handle this instance
textthe solver gave no answer
textthe solver gave a definitive answer (SAT or UNSAT)
textthe solver performed better than the other ones on that instance
textthe solver was ended by a signal
textthe solver gave an incomplete answer
textthe solver was disqualified in the category
textthe solver gave a wrong answer

For better readability, you may choose to hide some solvers:
Abscon 112v4 AC (complete)
Abscon 112v4 ESAC (complete)
bpsolver 09 (complete)
Choco2.1.1 2009-06-10 (complete)
Choco2.1.1b 2009-07-16 (complete)
Concrete 2009-07-14 (complete)
Concrete DC 2009-07-14 (complete)
Mistral 1.545 (complete)
pcs 0.3.2 (complete)
pcs-restart 0.3.2 (complete)
SAT4J CSP 2.1.1 (complete)
Sugar v1.14.6+minisat (complete)
Sugar v1.14.6+picosat (complete)

Bench nameBest results
on this
instance
Abscon 112v4
AC
(complete)
Abscon 112v4
ESAC
(complete)
bpsolver
09
(complete)
Choco2.1.1
2009-06-10
(complete)
Choco2.1.1b
2009-07-16
(complete)
Concrete
2009-07-14
(complete)
Concrete DC
2009-07-14
(complete)
Mistral
1.545
(complete)
pcs
0.3.2
(complete)
pcs-restart
0.3.2
(complete)
SAT4J CSP
2.1.1
(complete)
Sugar
v1.14.6+minisat
(complete)
Sugar
v1.14.6+picosat
(complete)
csp/pseudo/mps/
normalized-mps-diamond.xml
UNSAT
TT=0.006

UNSAT
TT=0.647

UNSAT
TT=0.637

UNSAT
TT=0.024

UNSAT
TT=0.441

UNSAT
TT=0.457

UNSAT
TT=1.054

UNSAT
TT=1.031

UNSAT
TT=0.006

UNSAT
TT=0.015

UNSAT
TT=0.016

UNSAT
TT=0.7

UNSAT
TT=0.469

UNSAT
TT=0.489




StatisticsAbscon 112v4
AC
(complete)
Abscon 112v4
ESAC
(complete)
bpsolver
09
(complete)
Choco2.1.1
2009-06-10
(complete)
Choco2.1.1b
2009-07-16
(complete)
Concrete
2009-07-14
(complete)
Concrete DC
2009-07-14
(complete)
Mistral
1.545
(complete)
pcs
0.3.2
(complete)
pcs-restart
0.3.2
(complete)
SAT4J CSP
2.1.1
(complete)
Sugar
v1.14.6+minisat
(complete)
Sugar
v1.14.6+picosat
(complete)
Number of times the solver is able to give the best known answer1111111111111
Number of times the solver is the best solver from a complete solver point of view
(i.e. best known answer and best TT time)
0000000100000