PB'16 competition: satisfaction and optimization track: results by benchmark

Results by benchmark for category optimisation, big integers, linear constraints (OPT-BIGINT-LIN), subcategory Handmade, subsubcategory Course Assignment

This page displays the results of the different solvers for each benchmark for category optimisation, big integers, linear constraints (OPT-BIGINT-LIN), subcategory Handmade, subsubcategory Course Assignment

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
f=...value of the objective function for the model reported by the solver
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
f=...Value of the objective function
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 could give an answer (SAT)
textthe solver gave a definitive answer (OPTIMUM FOUND or UNSAT)
textthe solver performed better than the other ones on that instance (complete solvers point of view)
textthe solver performed better than the other ones on that instance (incomplete solvers point of view)
textthe solver was ended by a signal or other problem
textthe solver gave an incomplete answer
textthe solver gave a wrong answer

For better readability, you may choose to hide some solvers:
minisatp 2012-10-02 git-d91742b (complete)
NaPS 1.02 (complete)
Sat4j PB 2.3.6 Res+CP PB16 (complete)
Sat4j PB 2.3.6 Resolution PB16 (complete)
toysat 2016-05-02 (complete)

Bench nameBest results
on this
instance
minisatp
2012-10-02 git-d91742b
(complete)
NaPS
1.02
(complete)
Sat4j PB 2.3.6 Res+CP
PB16
(complete)
Sat4j PB 2.3.6 Resolution
PB16
(complete)
toysat
2016-05-02
(complete)
normalized-PB06/OPT-MEDINT/web/
www.ps.uni-sb.de/~walser/benchmarks/
course-ass/normalized-ws97-3.opb
SAT
f=3033
TT=1800.1
T1=1800.4
SAT (TO)
f=4061
TT=1800.11
T1=1800.4
SAT (TO)
f=3033
TT=1800.1
T1=1800.4
SAT (TO)
f=3052
TT=1800.13
T1=667.31
SAT (TO)
f=3075
TT=1800.02
T1=0.41
? (TO)

TT=1800.03




Statisticsminisatp
2012-10-02 git-d91742b
(complete)
NaPS
1.02
(complete)
Sat4j PB 2.3.6 Res+CP
PB16
(complete)
Sat4j PB 2.3.6 Resolution
PB16
(complete)
toysat
2016-05-02
(complete)
Number of times the solver is able to give the best known answer01000
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)
01000