Trace number 2663494

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPnone SCIP 1.2.1.2 without any LP solverSAT 1.72274 1.72234

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_200_10_5_15.opb
MD5SUMfc2cc3328b52c15b44db6557e5f99e21
Bench CategoryDEC-SMALLINT-NLC (no optimisation, small integers, non linear constraints)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0.041993
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables400
Total number of constraints602
Number of constraints which are clauses200
Number of constraints which are cardinality constraints (but not clauses)1
Number of constraints which are nor clauses,nor cardinality constraints401
Minimum length of a constraint2
Maximum length of a constraint400
Number of terms in the objective function 0
Biggest coefficient in the objective function 0
Number of bits for the biggest coefficient in the objective function 0
Sum of the numbers in the objective function 0
Number of bits of the sum of numbers in the objective function 0
Biggest number in a constraint 15
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 400
Number of bits of the biggest sum of numbers9
Number of products (including duplicates)5056
Sum of products size (including duplicates)10112
Number of different products2528
Sum of products size5056

Solver Data 

0.00/0.00	c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
0.00/0.00	c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00	c 
0.00/0.00	c user parameter file <scip.set> not found - using default parameters
0.00/0.00	c reading problem <HOME/instance-2663494-1276683685.opb>
0.00/0.04	c original problem has 2928 variables (2928 bin, 0 int, 0 impl, 0 cont) and 3130 constraints
0.00/0.04	c problem read
0.00/0.04	c No objective function, only one solution is needed.
0.00/0.04	c presolving settings loaded
0.00/0.05	c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.08	c presolving:
0.29/0.31	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 20624 impls, 400 clqs
0.49/0.50	c presolving (2 rounds):
0.49/0.50	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.49/0.50	c  20624 implications, 400 cliques
0.49/0.50	c presolved problem has 2928 variables (2928 bin, 0 int, 0 impl, 0 cont) and 3130 constraints
0.49/0.50	c       1 constraints of type <knapsack>
0.49/0.50	c     400 constraints of type <setppc>
0.49/0.50	c    2528 constraints of type <and>
0.49/0.50	c       1 constraints of type <linear>
0.49/0.50	c     200 constraints of type <logicor>
0.49/0.50	c transformed objective value is always integral (scale: 1)
0.49/0.50	c Presolving Time: 0.26
0.49/0.50	c - non default parameters ----------------------------------------------------------------------
0.49/0.50	c # SCIP version 1.2.1.2
0.49/0.50	c 
0.49/0.50	c # frequency for displaying node information lines
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 100]
0.49/0.50	c display/freq = 10000
0.49/0.50	c 
0.49/0.50	c # maximal time in seconds to run
0.49/0.50	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.50	c limits/time = 1799.96
0.49/0.50	c 
0.49/0.50	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.49/0.50	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.50	c limits/memory = 1620
0.49/0.50	c 
0.49/0.50	c # solving stops, if the given number of solutions were found (-1: no limit)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.50	c limits/solutions = 1
0.49/0.50	c 
0.49/0.50	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50	c lp/solvefreq = -1
0.49/0.50	c 
0.49/0.50	c # maximal number of separation rounds per node (-1: unlimited)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 5]
0.49/0.50	c separating/maxrounds = 1
0.49/0.50	c 
0.49/0.50	c # maximal number of separation rounds in the root node (-1: unlimited)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.50	c separating/maxroundsroot = 5
0.49/0.50	c 
0.49/0.50	c # should presolving try to simplify inequalities
0.49/0.50	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.50	c constraints/linear/simplifyinequalities = TRUE
0.49/0.50	c 
0.49/0.50	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.49/0.50	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.49/0.50	c constraints/knapsack/disaggregation = FALSE
0.49/0.50	c 
0.49/0.50	c # should presolving try to simplify knapsacks
0.49/0.50	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.50	c constraints/knapsack/simplifyinequalities = TRUE
0.49/0.50	c 
0.49/0.50	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.50	c presolving/probing/maxrounds = 0
0.49/0.50	c 
0.49/0.50	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50	c heuristics/coefdiving/freq = -1
0.49/0.50	c 
0.49/0.50	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50	c heuristics/coefdiving/maxlpiterquot = 0.075
0.49/0.50	c 
0.49/0.50	c # additional number of allowed LP iterations
0.49/0.50	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50	c heuristics/coefdiving/maxlpiterofs = 1500
0.49/0.50	c 
0.49/0.50	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 30]
0.49/0.50	c heuristics/crossover/freq = -1
0.49/0.50	c 
0.49/0.50	c # number of nodes added to the contingent of the total nodes
0.49/0.50	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.50	c heuristics/crossover/nodesofs = 750
0.49/0.50	c 
0.49/0.50	c # number of nodes without incumbent change that heuristic should wait
0.49/0.50	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.49/0.50	c heuristics/crossover/nwaitingnodes = 100
0.49/0.50	c 
0.49/0.50	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.49/0.50	c # [type: real, range: [0,1], default: 0.1]
0.49/0.50	c heuristics/crossover/nodesquot = 0.15
0.49/0.50	c 
0.49/0.50	c # minimum percentage of integer variables that have to be fixed 
0.49/0.50	c # [type: real, range: [0,1], default: 0.666]
0.49/0.50	c heuristics/crossover/minfixingrate = 0.5
0.49/0.50	c 
0.49/0.50	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.50	c heuristics/feaspump/freq = -1
0.49/0.50	c 
0.49/0.50	c # additional number of allowed LP iterations
0.49/0.50	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50	c heuristics/feaspump/maxlpiterofs = 2000
0.49/0.50	c 
0.49/0.50	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50	c heuristics/fracdiving/freq = -1
0.49/0.50	c 
0.49/0.50	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50	c heuristics/fracdiving/maxlpiterquot = 0.075
0.49/0.50	c 
0.49/0.50	c # additional number of allowed LP iterations
0.49/0.50	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50	c heuristics/fracdiving/maxlpiterofs = 1500
0.49/0.50	c 
0.49/0.50	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50	c heuristics/guideddiving/freq = -1
0.49/0.50	c 
0.49/0.50	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50	c heuristics/guideddiving/maxlpiterquot = 0.075
0.49/0.50	c 
0.49/0.50	c # additional number of allowed LP iterations
0.49/0.50	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50	c heuristics/guideddiving/maxlpiterofs = 1500
0.49/0.50	c 
0.49/0.50	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50	c heuristics/intdiving/maxlpiterquot = 0.075
0.49/0.50	c 
0.49/0.50	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50	c heuristics/intshifting/freq = -1
0.49/0.50	c 
0.49/0.50	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50	c heuristics/linesearchdiving/freq = -1
0.49/0.50	c 
0.49/0.50	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.49/0.50	c 
0.49/0.50	c # additional number of allowed LP iterations
0.49/0.50	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.49/0.50	c 
0.49/0.50	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50	c heuristics/nlp/freq = -1
0.49/0.50	c 
0.49/0.50	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.50	c heuristics/objpscostdiving/freq = -1
0.49/0.50	c 
0.49/0.50	c # maximal fraction of diving LP iterations compared to total iteration number
0.49/0.50	c # [type: real, range: [0,1], default: 0.01]
0.49/0.50	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.49/0.50	c 
0.49/0.50	c # additional number of allowed LP iterations
0.49/0.50	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.50	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.49/0.50	c 
0.49/0.50	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.50	c heuristics/oneopt/freq = -1
0.49/0.50	c 
0.49/0.50	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.50	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.50	c heuristics/pscostdiving/freq = -1
0.49/0.50	c 
0.49/0.50	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.50	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.50	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/pscostdiving/maxlpiterofs = 1500
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51	c heuristics/rens/freq = -1
0.49/0.51	c 
0.49/0.51	c # minimum percentage of integer variables that have to be fixable 
0.49/0.51	c # [type: real, range: [0,1], default: 0.5]
0.49/0.51	c heuristics/rens/minfixingrate = 0.3
0.49/0.51	c 
0.49/0.51	c # number of nodes added to the contingent of the total nodes
0.49/0.51	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.51	c heuristics/rens/nodesofs = 2000
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.51	c heuristics/rootsoldiving/freq = -1
0.49/0.51	c 
0.49/0.51	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.49/0.51	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.51	c heuristics/rounding/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51	c heuristics/shifting/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.51	c heuristics/simplerounding/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51	c heuristics/trivial/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.51	c heuristics/trysol/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51	c heuristics/veclendiving/freq = -1
0.49/0.51	c 
0.49/0.51	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51	c heuristics/veclendiving/maxlpiterquot = 0.075
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/veclendiving/maxlpiterofs = 1500
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.51	c heuristics/zirounding/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51	c separating/cmir/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51	c separating/flowcover/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.51	c separating/rapidlearning/freq = 0
0.49/0.51	c 
0.49/0.51	c -----------------------------------------------------------------------------------------------
0.49/0.51	c start solving
0.49/0.51	c 
0.49/0.51	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.49/0.51	c   0.3s|     1 |     2 |     0 |     - |8031k|   0 |   - |2928 |3130 |   0 |   0 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.59/1.68	c * 1.4s|  1370 |     0 |     0 |   0.0 |9059k| 568 |   - |2928 |3130 |   0 |   0 |   0 |  18 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
1.59/1.69	c 
1.59/1.69	c SCIP Status        : problem is solved [optimal solution found]
1.59/1.69	c Solving Time (sec) : 1.42
1.59/1.69	c Solving Nodes      : 1370
1.59/1.69	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
1.59/1.69	c Dual Bound         : +0.00000000000000e+00
1.59/1.69	c Gap                : 0.00 %
1.59/1.69	s SATISFIABLE
1.59/1.69	v x385 -x378 -x363 x375 -x262 -x387 -x398 x331 -x303 -x394 -x240 -x255 -x271 -x360 -x239 -x350 -x260 -x283 -x370 -x297 -x231 -x306 
1.59/1.69	v -x334 -x292 -x356 x323 x393 -x257 -x349 x388 -x305 -x301 -x245 -x357 -x361 -x220 -x241 -x230 -x296 -x338 -x314 -x310 -x286 
1.59/1.69	v -x348 -x312 -x246 -x329 -x307 -x339 -x326 -x311 x376 -x337 -x300 -x218 -x217 -x365 -x244 -x226 -x256 -x358 -x284 -x335 x364 -x319 
1.59/1.69	v -x293 -x242 -x278 -x396 -x268 -x213 -x380 -x369 -x346 -x281 x395 x327 -x373 -x330 -x308 -x333 -x397 -x270 -x263 -x325 -x313 
1.59/1.69	v -x351 -x318 -x259 -x371 -x302 -x320 -x315 -x344 -x209 -x383 -x299 -x252 -x225 -x379 -x359 x392 -x235 -x295 -x219 -x264 -x279 
1.59/1.69	v -x275 -x304 -x207 -x391 -x352 -x336 -x316 -x267 -x210 -x288 -x345 -x291 -x251 -x340 -x289 -x269 -x234 -x381 -x342 -x298 -x282 
1.59/1.69	v -x317 -x243 -x390 -x228 -x324 -x354 -x389 -x386 -x372 -x353 -x223 -x216 -x294 -x208 -x224 -x236 -x214 -x204 -x290 -x266 
1.59/1.69	v -x238 -x254 -x341 -x362 -x400 -x309 -x285 -x203 -x265 -x237 -x328 -x347 -x368 -x253 x384 -x332 -x374 -x280 -x202 -x377 -x367 
1.59/1.70	v -x355 -x343 -x232 -x205 -x206 -x215 x287 -x229 -x221 -x399 -x261 -x249 -x227 -x201 -x322 -x272 -x258 -x248 -x247 -x222 -x212 
1.59/1.70	v x382 -x274 -x250 -x321 -x233 x277 -x273 -x211 -x366 -x276 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 x191 x190 -x189 
1.59/1.70	v -x188 -x187 x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 
1.59/1.70	v -x167 -x166 -x165 -x164 -x163 -x162 x161 x160 -x159 x158 -x157 -x156 -x155 -x154 x153 -x152 -x151 -x150 -x149 -x148 -x147 
1.59/1.70	v x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 x134 -x133 -x132 -x131 -x130 x129 -x128 -x127 x126 -x125 
1.59/1.70	v -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 
1.59/1.70	v -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 
1.59/1.70	v -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 
1.59/1.70	v -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 
1.59/1.70	v -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 
1.59/1.70	v -x2 -x1 
1.59/1.70	c SCIP Status        : problem is solved [optimal solution found]
1.59/1.70	c Solving Time       :       1.42
1.59/1.70	c Original Problem   :
1.59/1.70	c   Problem name     : HOME/instance-2663494-1276683685.opb
1.59/1.70	c   Variables        : 2928 (2928 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.70	c   Constraints      : 3130 initial, 3130 maximal
1.59/1.70	c Presolved Problem  :
1.59/1.70	c   Problem name     : t_HOME/instance-2663494-1276683685.opb
1.59/1.70	c   Variables        : 2928 (2928 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.70	c   Constraints      : 3130 initial, 3130 maximal
1.59/1.70	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.59/1.70	c   trivial          :       0.00          0          0          0          0          0          0          0          0
1.59/1.70	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.59/1.70	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.59/1.70	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.59/1.70	c   implics          :       0.00          0          0          0          0          0          0          0          0
1.59/1.70	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.59/1.70	c   knapsack         :       0.01          0          0          0          0          0          0          0          0
1.59/1.70	c   setppc           :       0.00          0          0          0          0          0          0          0          0
1.59/1.70	c   and              :       0.20          0          0          0          0          0          0          0          0
1.59/1.70	c   linear           :       0.03          0          0          0          0          0          0          0          0
1.59/1.70	c   logicor          :       0.01          0          0          0          0          0          0          0          0
1.59/1.70	c   root node        :          -          0          -          -          0          -          -          -          -
1.59/1.70	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.59/1.70	c   integral         :          0          0          0          0          0          0          0          0          0          0
1.59/1.70	c   knapsack         :          1          0       2389          0       1353          2        180          0          0          0
1.59/1.70	c   setppc           :        400          0       2255          0       1232          0          0          0          0          0
1.59/1.70	c   and              :       2528          0       2380          0       1344          0       7375          0          0          0
1.59/1.70	c   linear           :          1          0       2397          0       1353         15         62          0          0          0
1.59/1.70	c   logicor          :        200+         0         33          0       1354          1         90          0          0          0
1.59/1.70	c   countsols        :          0          0          0          0       1354          0          0          0          0          0
1.59/1.70	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.59/1.70	c   integral         :       0.00       0.00       0.00       0.00       0.00
1.59/1.70	c   knapsack         :       0.02       0.00       0.01       0.00       0.01
1.59/1.70	c   setppc           :       0.16       0.00       0.02       0.00       0.14
1.59/1.70	c   and              :       0.22       0.00       0.09       0.00       0.13
1.59/1.70	c   linear           :       0.14       0.00       0.14       0.00       0.00
1.59/1.70	c   logicor          :       0.03       0.00       0.00       0.00       0.03
1.59/1.70	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.59/1.70	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.59/1.70	c   vbounds          :       0.00          1          0          0
1.59/1.70	c   rootredcost      :       0.00          0          0          0
1.59/1.70	c   pseudoobj        :       0.00          0          0          0
1.59/1.70	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.59/1.70	c   propagation      :       0.02         18         18         39      369.6          0        0.0          -
1.59/1.70	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.59/1.70	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.59/1.70	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.59/1.70	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.59/1.70	c   applied globally :          -          -          -          0        0.0          -          -          -
1.59/1.70	c   applied locally  :          -          -          -         18      364.4          -          -          -
1.59/1.70	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.59/1.70	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
1.59/1.70	c   redcost          :       0.00          0          0          0          0          0
1.59/1.70	c   impliedbounds    :       0.00          0          0          0          0          0
1.59/1.70	c   intobj           :       0.00          0          0          0          0          0
1.59/1.70	c   cgmip            :       0.00          0          0          0          0          0
1.59/1.70	c   gomory           :       0.00          0          0          0          0          0
1.59/1.70	c   strongcg         :       0.00          0          0          0          0          0
1.59/1.70	c   cmir             :       0.00          0          0          0          0          0
1.59/1.70	c   flowcover        :       0.00          0          0          0          0          0
1.59/1.70	c   clique           :       0.00          0          0          0          0          0
1.59/1.70	c   zerohalf         :       0.00          0          0          0          0          0
1.59/1.70	c   mcf              :       0.00          0          0          0          0          0
1.59/1.70	c   rapidlearning    :       0.00          0          0          0          0          0
1.59/1.70	c Pricers            :       Time      Calls       Vars
1.59/1.70	c   problem variables:       0.00          0          0
1.59/1.70	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.59/1.70	c   relpscost        :       0.00          0          0          0          0          0          0
1.59/1.70	c   pscost           :       0.00          0          0          0          0          0          0
1.59/1.70	c   inference        :       0.48       1353          0          0          0          0       2706
1.59/1.70	c   mostinf          :       0.00          0          0          0          0          0          0
1.59/1.70	c   leastinf         :       0.00          0          0          0          0          0          0
1.59/1.70	c   fullstrong       :       0.00          0          0          0          0          0          0
1.59/1.70	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.59/1.70	c   random           :       0.00          0          0          0          0          0          0
1.59/1.70	c Primal Heuristics  :       Time      Calls      Found
1.59/1.70	c   LP solutions     :       0.00          -          0
1.59/1.70	c   pseudo solutions :       0.01          -          1
1.59/1.70	c   trivial          :       0.00          1          0
1.59/1.70	c   simplerounding   :       0.00          0          0
1.59/1.70	c   zirounding       :       0.00          0          0
1.59/1.70	c   rounding         :       0.00          0          0
1.59/1.70	c   shifting         :       0.00          0          0
1.59/1.70	c   intshifting      :       0.00          0          0
1.59/1.70	c   oneopt           :       0.00          0          0
1.59/1.70	c   twoopt           :       0.00          0          0
1.59/1.70	c   fixandinfer      :       0.00          0          0
1.59/1.70	c   feaspump         :       0.00          0          0
1.59/1.70	c   coefdiving       :       0.00          0          0
1.59/1.70	c   pscostdiving     :       0.00          0          0
1.59/1.70	c   fracdiving       :       0.00          0          0
1.59/1.70	c   veclendiving     :       0.00          0          0
1.59/1.70	c   intdiving        :       0.00          0          0
1.59/1.70	c   actconsdiving    :       0.00          0          0
1.59/1.70	c   objpscostdiving  :       0.00          0          0
1.59/1.70	c   rootsoldiving    :       0.00          0          0
1.59/1.70	c   linesearchdiving :       0.00          0          0
1.59/1.70	c   guideddiving     :       0.00          0          0
1.59/1.70	c   octane           :       0.00          0          0
1.59/1.70	c   rens             :       0.00          0          0
1.59/1.70	c   rins             :       0.00          0          0
1.59/1.70	c   localbranching   :       0.00          0          0
1.59/1.70	c   mutation         :       0.00          0          0
1.59/1.70	c   crossover        :       0.00          0          0
1.59/1.70	c   dins             :       0.00          0          0
1.59/1.70	c   undercover       :       0.00          0          0
1.59/1.70	c   nlp              :       0.00          0          0
1.59/1.70	c   trysol           :       0.00          0          0
1.59/1.70	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.59/1.70	c   primal LP        :       0.00          0          0       0.00          -
1.59/1.70	c   dual LP          :       0.00          0          0       0.00          -
1.59/1.70	c   lex dual LP      :       0.00          0          0       0.00          -
1.59/1.70	c   barrier LP       :       0.00          0          0       0.00          -
1.59/1.70	c   diving/probing LP:       0.00          0          0       0.00          -
1.59/1.70	c   strong branching :       0.00          0          0       0.00          -
1.59/1.70	c     (at root node) :          -          0          0       0.00          -
1.59/1.70	c   conflict analysis:       0.00          0          0       0.00          -
1.59/1.70	c B&B Tree           :
1.59/1.70	c   number of runs   :          1
1.59/1.70	c   nodes            :       1370
1.59/1.70	c   nodes (total)    :       1370
1.59/1.70	c   nodes left       :          0
1.59/1.70	c   max depth        :        568
1.59/1.70	c   max depth (total):        568
1.59/1.70	c   backtracks       :          2 (0.1%)
1.59/1.70	c   delayed cutoffs  :          2
1.59/1.70	c   repropagations   :         54 (67 domain reductions, 2 cutoffs)
1.59/1.70	c   avg switch length:       2.06
1.59/1.70	c   switching time   :       0.04
1.59/1.70	c Solution           :
1.59/1.70	c   Solutions found  :          1 (1 improvements)
1.59/1.70	c   First Solution   : +0.00000000000000e+00   (in run 1, after 1370 nodes, 1.41 seconds, depth 414, found by <relaxation>)
1.59/1.70	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 1370 nodes, 1.41 seconds, depth 414, found by <relaxation>)
1.59/1.70	c   Dual Bound       : +0.00000000000000e+00
1.59/1.70	c   Gap              :       0.00 %
1.59/1.70	c   Root Dual Bound  : +0.00000000000000e+00
1.59/1.70	c   Root Iterations  :          0
1.69/1.72	c Time complete: 1.71.

Verifier Data 

OK	0

Watcher Data 

runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2663494-1276683685/watcher-2663494-1276683685 -o /tmp/evaluation-result-2663494-1276683685/solver-2663494-1276683685 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2663494-1276683685.opb -t 1800 -m 1800 

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 0.92 0.97 0.99 3/106 8939
/proc/meminfo: memFree=1763928/2059040 swapFree=4136680/4192956
[pid=8939] ppid=8937 vsize=6584 CPUtime=0
/proc/8939/stat : 8939 (pbscip.linux.x8) R 8937 8939 8831 0 -1 4202496 962 0 0 0 0 0 0 0 20 0 1 0 42023921 6742016 885 1992294400 4194304 7136930 140734276088032 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/8939/statm: 1646 894 254 719 0 925 0

[startup+0.0137181 s]
/proc/loadavg: 0.92 0.97 0.99 3/106 8939
/proc/meminfo: memFree=1763928/2059040 swapFree=4136680/4192956
[pid=8939] ppid=8937 vsize=8604 CPUtime=0
/proc/8939/stat : 8939 (pbscip.linux.x8) R 8937 8939 8831 0 -1 4202496 1625 0 0 0 0 0 0 0 20 0 1 0 42023921 8810496 1547 1992294400 4194304 7136930 140734276088032 18446744073709551615 6328631 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/8939/statm: 2151 1548 269 719 0 1430 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 8604

[startup+0.100724 s]
/proc/loadavg: 0.92 0.97 0.99 3/106 8939
/proc/meminfo: memFree=1763928/2059040 swapFree=4136680/4192956
[pid=8939] ppid=8937 vsize=20988 CPUtime=0.09
/proc/8939/stat : 8939 (pbscip.linux.x8) R 8937 8939 8831 0 -1 4202496 4906 0 0 0 8 1 0 0 20 0 1 0 42023921 21491712 4474 1992294400 4194304 7136930 140734276088032 18446744073709551615 4333587 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/8939/statm: 5247 4474 327 719 0 4526 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 20988

[startup+0.30074 s]
/proc/loadavg: 0.92 0.97 0.99 3/106 8939
/proc/meminfo: memFree=1763928/2059040 swapFree=4136680/4192956
[pid=8939] ppid=8937 vsize=21216 CPUtime=0.29
/proc/8939/stat : 8939 (pbscip.linux.x8) R 8937 8939 8831 0 -1 4202496 5481 0 0 0 20 9 0 0 20 0 1 0 42023921 21725184 4535 1992294400 4194304 7136930 140734276088032 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/8939/statm: 5304 4535 351 719 0 4583 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 21216

[startup+0.700772 s]
/proc/loadavg: 0.92 0.97 0.99 3/106 8939
/proc/meminfo: memFree=1763928/2059040 swapFree=4136680/4192956
[pid=8939] ppid=8937 vsize=23588 CPUtime=0.69
/proc/8939/stat : 8939 (pbscip.linux.x8) R 8937 8939 8831 0 -1 4202496 7637 0 0 0 50 19 0 0 20 0 1 0 42023921 24154112 5149 1992294400 4194304 7136930 140734276088032 18446744073709551615 4436423 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/8939/statm: 5897 5149 389 719 0 5176 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 23588

[startup+1.50083 s]
/proc/loadavg: 0.92 0.97 0.99 2/107 8940
/proc/meminfo: memFree=1743832/2059040 swapFree=4136680/4192956
[pid=8939] ppid=8937 vsize=24780 CPUtime=1.49
/proc/8939/stat : 8939 (pbscip.linux.x8) R 8937 8939 8831 0 -1 4202496 7941 0 0 0 128 21 0 0 22 0 1 0 42023921 25374720 5453 1992294400 4194304 7136930 140734276088032 18446744073709551615 4948230 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/8939/statm: 6195 5453 394 719 0 5474 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 24780

Solver just ended. Dumping a history of the last processes samples

[startup+1.70144 s]
/proc/loadavg: 0.92 0.97 0.99 2/107 8940
/proc/meminfo: memFree=1743832/2059040 swapFree=4136680/4192956
[pid=8939] ppid=8937 vsize=24780 CPUtime=1.69
/proc/8939/stat : 8939 (pbscip.linux.x8) R 8937 8939 8831 0 -1 4202496 7956 0 0 0 147 22 0 0 23 0 1 0 42023921 25374720 5468 1992294400 4194304 7136930 140734276088032 18446744073709551615 5775442 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/8939/statm: 6195 5468 399 719 0 5474 0
Current children cumulated CPU time (s) 1.69
Current children cumulated vsize (KiB) 24780

Child status: 0
Real time (s): 1.72234
CPU time (s): 1.72274
CPU user time (s): 1.49277
CPU system time (s): 0.229965
CPU usage (%): 100.023
Max. virtual memory (cumulated for all children) (KiB): 24780

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.49277
system time used= 0.229965
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 7962
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 3
involuntary context switches= 5

runsolver used 0.007998 second user time and 0.015997 second system time

The end

Launcher Data 

Begin job on node026 at 2010-06-16 12:21:25
IDJOB=2663494
IDBENCH=48372
IDSOLVER=1167
FILE ID=node026/2663494-1276683685
PBS_JOBID= 11172584
Free space on /tmp= 62560 MiB

SOLVER NAME= SCIPnone SCIP 1.2.1.2 without any LP solver
BENCH NAME= PB07/normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/manquinho/dbsg/normalized-dbsg_200_10_5_15.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.none -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2663494-1276683685/watcher-2663494-1276683685 -o /tmp/evaluation-result-2663494-1276683685/solver-2663494-1276683685 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2663494-1276683685.opb -t 1800 -m 1800

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 1800 MiB
MAX NB THREAD= 0

MD5SUM BENCH= fc2cc3328b52c15b44db6557e5f99e21
RANDOM SEED=75040400

node026.alineos.net Linux 2.6.18-164.el5 #1 SMP Thu Sep 3 03:28:30 EDT 2009

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.201
cache size	: 2048 KB
physical id	: 0
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 6000.40
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.201
cache size	: 2048 KB
physical id	: 3
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5599.46
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1764332 kB
Buffers:         79424 kB
Cached:         122340 kB
SwapCached:       9808 kB
Active:          93388 kB
Inactive:       121764 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1764332 kB
SwapTotal:     4192956 kB
SwapFree:      4136680 kB
Dirty:            3360 kB
Writeback:           0 kB
AnonPages:       11608 kB
Mapped:           9448 kB
Slab:            57788 kB
PageTables:       3944 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181996 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264948 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62556 MiB
End job on node026 at 2010-06-16 12:21:27