Trace number 2663455

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.68074 1.68107

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_200_10_3_15.opb
MD5SUMbbe3a085a15e9497809c2511fab038f0
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.040992
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)4976
Sum of products size (including duplicates)9952
Number of different products2488
Sum of products size4976

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-2663455-1276679464.opb>
0.01/0.04	c original problem has 2888 variables (2888 bin, 0 int, 0 impl, 0 cont) and 3090 constraints
0.01/0.04	c problem read
0.01/0.04	c No objective function, only one solution is needed.
0.01/0.04	c presolving settings loaded
0.01/0.04	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.01/0.07	c presolving:
0.19/0.29	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 20304 impls, 400 clqs
0.39/0.47	c presolving (2 rounds):
0.39/0.47	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.47	c  20304 implications, 400 cliques
0.39/0.47	c presolved problem has 2888 variables (2888 bin, 0 int, 0 impl, 0 cont) and 3090 constraints
0.39/0.47	c       1 constraints of type <knapsack>
0.39/0.47	c     400 constraints of type <setppc>
0.39/0.47	c    2488 constraints of type <and>
0.39/0.47	c       1 constraints of type <linear>
0.39/0.47	c     200 constraints of type <logicor>
0.39/0.47	c transformed objective value is always integral (scale: 1)
0.39/0.47	c Presolving Time: 0.24
0.39/0.47	c - non default parameters ----------------------------------------------------------------------
0.39/0.47	c # SCIP version 1.2.1.2
0.39/0.47	c 
0.39/0.47	c # frequency for displaying node information lines
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.47	c display/freq = 10000
0.39/0.47	c 
0.39/0.47	c # maximal time in seconds to run
0.39/0.47	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.47	c limits/time = 1799.96
0.39/0.47	c 
0.39/0.47	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.47	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.47	c limits/memory = 1620
0.39/0.47	c 
0.39/0.47	c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.47	c limits/solutions = 1
0.39/0.47	c 
0.39/0.47	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47	c lp/solvefreq = -1
0.39/0.47	c 
0.39/0.47	c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.47	c separating/maxrounds = 1
0.39/0.47	c 
0.39/0.47	c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.47	c separating/maxroundsroot = 5
0.39/0.47	c 
0.39/0.47	c # should presolving try to simplify inequalities
0.39/0.47	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.47	c constraints/linear/simplifyinequalities = TRUE
0.39/0.47	c 
0.39/0.47	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.47	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.47	c constraints/knapsack/disaggregation = FALSE
0.39/0.47	c 
0.39/0.47	c # should presolving try to simplify knapsacks
0.39/0.47	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.47	c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.47	c 
0.39/0.47	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.47	c presolving/probing/maxrounds = 0
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47	c heuristics/coefdiving/freq = -1
0.39/0.47	c 
0.39/0.47	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47	c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.47	c 
0.39/0.47	c # additional number of allowed LP iterations
0.39/0.47	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47	c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.47	c heuristics/crossover/freq = -1
0.39/0.47	c 
0.39/0.47	c # number of nodes added to the contingent of the total nodes
0.39/0.47	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.47	c heuristics/crossover/nodesofs = 750
0.39/0.47	c 
0.39/0.47	c # number of nodes without incumbent change that heuristic should wait
0.39/0.47	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.47	c heuristics/crossover/nwaitingnodes = 100
0.39/0.47	c 
0.39/0.47	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.47	c # [type: real, range: [0,1], default: 0.1]
0.39/0.47	c heuristics/crossover/nodesquot = 0.15
0.39/0.47	c 
0.39/0.47	c # minimum percentage of integer variables that have to be fixed 
0.39/0.47	c # [type: real, range: [0,1], default: 0.666]
0.39/0.47	c heuristics/crossover/minfixingrate = 0.5
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.47	c heuristics/feaspump/freq = -1
0.39/0.47	c 
0.39/0.47	c # additional number of allowed LP iterations
0.39/0.47	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47	c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47	c heuristics/fracdiving/freq = -1
0.39/0.47	c 
0.39/0.47	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47	c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.47	c 
0.39/0.47	c # additional number of allowed LP iterations
0.39/0.47	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47	c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47	c heuristics/guideddiving/freq = -1
0.39/0.47	c 
0.39/0.47	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47	c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.47	c 
0.39/0.47	c # additional number of allowed LP iterations
0.39/0.47	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47	c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.47	c 
0.39/0.47	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47	c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47	c heuristics/intshifting/freq = -1
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47	c heuristics/linesearchdiving/freq = -1
0.39/0.47	c 
0.39/0.47	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.47	c 
0.39/0.47	c # additional number of allowed LP iterations
0.39/0.47	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47	c heuristics/nlp/freq = -1
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.47	c heuristics/objpscostdiving/freq = -1
0.39/0.47	c 
0.39/0.47	c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.47	c # [type: real, range: [0,1], default: 0.01]
0.39/0.47	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.47	c 
0.39/0.47	c # additional number of allowed LP iterations
0.39/0.47	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47	c heuristics/oneopt/freq = -1
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47	c heuristics/pscostdiving/freq = -1
0.39/0.47	c 
0.39/0.47	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.47	c 
0.39/0.47	c # additional number of allowed LP iterations
0.39/0.47	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47	c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.47	c heuristics/rens/freq = -1
0.39/0.47	c 
0.39/0.47	c # minimum percentage of integer variables that have to be fixable 
0.39/0.47	c # [type: real, range: [0,1], default: 0.5]
0.39/0.47	c heuristics/rens/minfixingrate = 0.3
0.39/0.47	c 
0.39/0.47	c # number of nodes added to the contingent of the total nodes
0.39/0.47	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.47	c heuristics/rens/nodesofs = 2000
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.47	c heuristics/rootsoldiving/freq = -1
0.39/0.47	c 
0.39/0.47	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.47	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.47	c 
0.39/0.47	c # additional number of allowed LP iterations
0.39/0.47	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47	c heuristics/rounding/freq = -1
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47	c heuristics/shifting/freq = -1
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47	c heuristics/simplerounding/freq = -1
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.47	c heuristics/trivial/freq = -1
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47	c heuristics/trysol/freq = -1
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.47	c heuristics/veclendiving/freq = -1
0.39/0.47	c 
0.39/0.47	c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.47	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.47	c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.47	c 
0.39/0.47	c # additional number of allowed LP iterations
0.39/0.47	c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.47	c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.47	c 
0.39/0.47	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.47	c heuristics/zirounding/freq = -1
0.39/0.47	c 
0.39/0.47	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.47	c separating/cmir/freq = -1
0.39/0.47	c 
0.39/0.47	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.47	c separating/flowcover/freq = -1
0.39/0.47	c 
0.39/0.47	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.47	c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.47	c separating/rapidlearning/freq = 0
0.39/0.47	c 
0.39/0.47	c -----------------------------------------------------------------------------------------------
0.39/0.47	c start solving
0.39/0.47	c 
0.39/0.47	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.39/0.47	c   0.2s|     1 |     2 |     0 |     - |7930k|   0 |   - |2888 |3090 |   0 |   0 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.59/1.64	c * 1.4s|  1392 |     0 |     0 |   0.0 |8944k| 580 |   - |2888 |3090 |   0 |   0 |   0 |  33 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
1.59/1.65	c 
1.59/1.65	c SCIP Status        : problem is solved [optimal solution found]
1.59/1.65	c Solving Time (sec) : 1.40
1.59/1.65	c Solving Nodes      : 1392
1.59/1.65	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
1.59/1.65	c Dual Bound         : +0.00000000000000e+00
1.59/1.65	c Gap                : 0.00 %
1.59/1.65	s SATISFIABLE
1.59/1.65	v -x364 -x366 x370 -x297 -x268 -x312 -x330 -x310 -x388 -x395 -x260 -x319 -x263 -x331 -x276 x300 x373 -x374 -x358 -x250 -x380 -x356 
1.59/1.65	v -x292 -x315 -x361 -x332 -x293 -x281 x378 -x371 -x247 x321 -x233 -x359 -x383 -x223 x397 -x339 -x266 -x264 -x322 -x240 x313 -x352 
1.59/1.65	v -x326 -x257 -x218 -x367 -x280 -x234 -x344 -x285 -x333 -x311 -x306 -x277 -x219 -x363 -x379 -x385 -x389 -x232 -x290 x355 -x228 
1.59/1.65	v -x246 -x214 -x221 -x216 -x302 -x252 -x345 -x335 -x213 -x301 -x294 -x251 -x235 -x350 -x336 -x244 -x382 -x381 -x384 -x304 
1.59/1.65	v -x328 -x275 -x217 -x261 -x308 -x222 -x299 -x354 -x230 -x210 -x329 x357 -x284 -x346 -x227 -x398 -x314 -x209 -x396 -x365 -x270 
1.59/1.65	v x392 -x327 -x307 -x267 -x254 -x317 -x320 -x318 -x287 -x220 -x243 -x212 -x351 -x309 -x271 -x334 -x278 -x368 -x372 -x272 -x305 
1.59/1.65	v -x206 -x236 -x211 -x387 -x237 -x298 -x249 -x238 -x225 x390 -x400 -x283 -x205 -x324 -x303 -x245 -x229 -x323 -x353 -x282 -x348 
1.59/1.65	v -x289 -x393 x349 -x295 -x204 -x360 -x342 -x256 -x291 -x279 x362 -x207 -x375 -x337 -x215 -x255 x399 -x288 -x231 -x208 -x269 -x338 
1.59/1.65	v -x286 -x248 -x274 -x239 -x343 -x316 -x391 -x253 -x224 -x296 -x376 -x242 -x203 -x340 -x394 -x325 x259 -x201 -x262 -x258 -x265 
1.59/1.65	v -x202 -x377 -x273 -x341 -x226 -x241 -x369 -x386 -x347 x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 x191 -x190 -x189 
1.59/1.65	v -x188 -x187 x186 -x185 -x184 x183 x182 -x181 -x180 -x179 -x178 -x177 -x176 x175 -x174 -x173 x172 -x171 -x170 -x169 x168 -x167 
1.59/1.65	v x166 -x165 x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 
1.59/1.65	v -x145 -x144 -x143 x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 x130 -x129 -x128 -x127 -x126 -x125 
1.59/1.65	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.65	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.65	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 -x54 
1.59/1.65	v -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.65	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.65	v -x2 -x1 
1.59/1.65	c SCIP Status        : problem is solved [optimal solution found]
1.59/1.65	c Solving Time       :       1.40
1.59/1.65	c Original Problem   :
1.59/1.65	c   Problem name     : HOME/instance-2663455-1276679464.opb
1.59/1.65	c   Variables        : 2888 (2888 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.65	c   Constraints      : 3090 initial, 3090 maximal
1.59/1.65	c Presolved Problem  :
1.59/1.65	c   Problem name     : t_HOME/instance-2663455-1276679464.opb
1.59/1.65	c   Variables        : 2888 (2888 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.65	c   Constraints      : 3090 initial, 3090 maximal
1.59/1.65	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.59/1.65	c   trivial          :       0.00          0          0          0          0          0          0          0          0
1.59/1.65	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.59/1.65	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.59/1.65	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.59/1.65	c   implics          :       0.00          0          0          0          0          0          0          0          0
1.59/1.65	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.59/1.65	c   knapsack         :       0.01          0          0          0          0          0          0          0          0
1.59/1.65	c   setppc           :       0.00          0          0          0          0          0          0          0          0
1.59/1.65	c   and              :       0.18          0          0          0          0          0          0          0          0
1.59/1.65	c   linear           :       0.02          0          0          0          0          0          0          0          0
1.59/1.65	c   logicor          :       0.00          0          0          0          0          0          0          0          0
1.59/1.65	c   root node        :          -          0          -          -          0          -          -          -          -
1.59/1.65	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.59/1.65	c   integral         :          0          0          0          0          0          0          0          0          0          0
1.59/1.65	c   knapsack         :          1          0       2491          0       1361          3        315          0          0          0
1.59/1.65	c   setppc           :        400          0       2213          0       1226          0          0          0          0          0
1.59/1.65	c   and              :       2488          0       2446          0       1350          0       7224          0          0          0
1.59/1.65	c   linear           :          1          0       2500          0       1361         29         92          0          0          0
1.59/1.65	c   logicor          :        200+         0         53          0       1362          2        122          0          0          0
1.59/1.65	c   countsols        :          0          0          0          0       1362          0          0          0          0          0
1.59/1.65	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.59/1.65	c   integral         :       0.00       0.00       0.00       0.00       0.00
1.59/1.65	c   knapsack         :       0.02       0.00       0.01       0.00       0.01
1.59/1.65	c   setppc           :       0.19       0.00       0.03       0.00       0.16
1.59/1.65	c   and              :       0.32       0.00       0.14       0.00       0.18
1.59/1.65	c   linear           :       0.11       0.00       0.11       0.00       0.00
1.59/1.65	c   logicor          :       0.02       0.00       0.00       0.00       0.02
1.59/1.65	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.59/1.65	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.59/1.65	c   vbounds          :       0.00          1          0          0
1.59/1.65	c   rootredcost      :       0.00          0          0          0
1.59/1.65	c   pseudoobj        :       0.00          0          0          0
1.59/1.65	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.59/1.65	c   propagation      :       0.04         34         33         87      369.8          0        0.0          -
1.59/1.65	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.59/1.65	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.59/1.65	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.59/1.65	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.59/1.65	c   applied globally :          -          -          -          0        0.0          -          -          -
1.59/1.65	c   applied locally  :          -          -          -         33      366.0          -          -          -
1.59/1.65	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.59/1.65	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
1.59/1.65	c   redcost          :       0.00          0          0          0          0          0
1.59/1.65	c   impliedbounds    :       0.00          0          0          0          0          0
1.59/1.65	c   intobj           :       0.00          0          0          0          0          0
1.59/1.65	c   cgmip            :       0.00          0          0          0          0          0
1.59/1.65	c   gomory           :       0.00          0          0          0          0          0
1.59/1.65	c   strongcg         :       0.00          0          0          0          0          0
1.59/1.65	c   cmir             :       0.00          0          0          0          0          0
1.59/1.65	c   flowcover        :       0.00          0          0          0          0          0
1.59/1.65	c   clique           :       0.00          0          0          0          0          0
1.59/1.65	c   zerohalf         :       0.00          0          0          0          0          0
1.59/1.65	c   mcf              :       0.00          0          0          0          0          0
1.59/1.65	c   rapidlearning    :       0.00          0          0          0          0          0
1.59/1.65	c Pricers            :       Time      Calls       Vars
1.59/1.65	c   problem variables:       0.00          0          0
1.59/1.65	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.59/1.65	c   relpscost        :       0.00          0          0          0          0          0          0
1.59/1.65	c   pscost           :       0.00          0          0          0          0          0          0
1.59/1.65	c   inference        :       0.39       1361          0          0          0          0       2722
1.59/1.65	c   mostinf          :       0.00          0          0          0          0          0          0
1.59/1.65	c   leastinf         :       0.00          0          0          0          0          0          0
1.59/1.65	c   fullstrong       :       0.00          0          0          0          0          0          0
1.59/1.65	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.59/1.65	c   random           :       0.00          0          0          0          0          0          0
1.59/1.65	c Primal Heuristics  :       Time      Calls      Found
1.59/1.65	c   LP solutions     :       0.00          -          0
1.59/1.65	c   pseudo solutions :       0.00          -          1
1.59/1.65	c   trivial          :       0.00          1          0
1.59/1.65	c   simplerounding   :       0.00          0          0
1.59/1.65	c   zirounding       :       0.00          0          0
1.59/1.65	c   rounding         :       0.00          0          0
1.59/1.65	c   shifting         :       0.00          0          0
1.59/1.65	c   intshifting      :       0.00          0          0
1.59/1.65	c   oneopt           :       0.00          0          0
1.59/1.65	c   twoopt           :       0.00          0          0
1.59/1.65	c   fixandinfer      :       0.00          0          0
1.59/1.65	c   feaspump         :       0.00          0          0
1.59/1.65	c   coefdiving       :       0.00          0          0
1.59/1.65	c   pscostdiving     :       0.00          0          0
1.59/1.65	c   fracdiving       :       0.00          0          0
1.59/1.65	c   veclendiving     :       0.00          0          0
1.59/1.65	c   intdiving        :       0.00          0          0
1.59/1.65	c   actconsdiving    :       0.00          0          0
1.59/1.65	c   objpscostdiving  :       0.00          0          0
1.59/1.65	c   rootsoldiving    :       0.00          0          0
1.59/1.65	c   linesearchdiving :       0.00          0          0
1.59/1.65	c   guideddiving     :       0.00          0          0
1.59/1.65	c   octane           :       0.00          0          0
1.59/1.65	c   rens             :       0.00          0          0
1.59/1.65	c   rins             :       0.00          0          0
1.59/1.65	c   localbranching   :       0.00          0          0
1.59/1.65	c   mutation         :       0.00          0          0
1.59/1.65	c   crossover        :       0.00          0          0
1.59/1.66	c   dins             :       0.00          0          0
1.59/1.66	c   undercover       :       0.00          0          0
1.59/1.66	c   nlp              :       0.00          0          0
1.59/1.66	c   trysol           :       0.00          0          0
1.59/1.66	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.59/1.66	c   primal LP        :       0.00          0          0       0.00          -
1.59/1.66	c   dual LP          :       0.00          0          0       0.00          -
1.59/1.66	c   lex dual LP      :       0.00          0          0       0.00          -
1.59/1.66	c   barrier LP       :       0.00          0          0       0.00          -
1.59/1.66	c   diving/probing LP:       0.00          0          0       0.00          -
1.59/1.66	c   strong branching :       0.00          0          0       0.00          -
1.59/1.66	c     (at root node) :          -          0          0       0.00          -
1.59/1.66	c   conflict analysis:       0.00          0          0       0.00          -
1.59/1.66	c B&B Tree           :
1.59/1.66	c   number of runs   :          1
1.59/1.66	c   nodes            :       1392
1.59/1.66	c   nodes (total)    :       1392
1.59/1.66	c   nodes left       :          0
1.59/1.66	c   max depth        :        580
1.59/1.66	c   max depth (total):        580
1.59/1.66	c   backtracks       :          4 (0.3%)
1.59/1.66	c   delayed cutoffs  :          4
1.59/1.66	c   repropagations   :        124 (111 domain reductions, 4 cutoffs)
1.59/1.66	c   avg switch length:       3.22
1.59/1.66	c   switching time   :       0.04
1.59/1.66	c Solution           :
1.59/1.66	c   Solutions found  :          1 (1 improvements)
1.59/1.66	c   First Solution   : +0.00000000000000e+00   (in run 1, after 1392 nodes, 1.39 seconds, depth 396, found by <relaxation>)
1.59/1.66	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 1392 nodes, 1.39 seconds, depth 396, found by <relaxation>)
1.59/1.66	c   Dual Bound       : +0.00000000000000e+00
1.59/1.66	c   Gap              :       0.00 %
1.59/1.66	c   Root Dual Bound  : +0.00000000000000e+00
1.59/1.66	c   Root Iterations  :          0
1.59/1.68	c Time complete: 1.67.

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-2663455-1276679464/watcher-2663455-1276679464 -o /tmp/evaluation-result-2663455-1276679464/solver-2663455-1276679464 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2663455-1276679464.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: 1.09 1.02 1.01 3/106 16738
/proc/meminfo: memFree=1754004/2059040 swapFree=4175448/4192956
[pid=16738] ppid=16736 vsize=6584 CPUtime=0
/proc/16738/stat : 16738 (pbscip.linux.x8) R 16736 16738 16046 0 -1 4202496 1069 0 0 0 0 0 0 0 25 0 1 0 9240122 6742016 991 1992294400 4194304 7136930 140736647016640 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/16738/statm: 1646 1001 254 719 0 925 0

[startup+0.02868 s]
/proc/loadavg: 1.09 1.02 1.01 3/106 16738
/proc/meminfo: memFree=1754004/2059040 swapFree=4175448/4192956
[pid=16738] ppid=16736 vsize=11280 CPUtime=0.01
/proc/16738/stat : 16738 (pbscip.linux.x8) R 16736 16738 16046 0 -1 4202496 2290 0 0 0 1 0 0 0 25 0 1 0 9240122 11550720 2212 1992294400 4194304 7136930 140736647016640 18446744073709551615 5654019 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/16738/statm: 2820 2212 269 719 0 2099 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 11280

[startup+0.101688 s]
/proc/loadavg: 1.09 1.02 1.01 3/106 16738
/proc/meminfo: memFree=1754004/2059040 swapFree=4175448/4192956
[pid=16738] ppid=16736 vsize=19876 CPUtime=0.09
/proc/16738/stat : 16738 (pbscip.linux.x8) R 16736 16738 16046 0 -1 4202496 4853 0 0 0 7 2 0 0 18 0 1 0 9240122 20353024 4164 1992294400 4194304 7136930 140736647016640 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16738/statm: 4969 4164 327 719 0 4248 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 19876

[startup+0.300708 s]
/proc/loadavg: 1.09 1.02 1.01 3/106 16738
/proc/meminfo: memFree=1754004/2059040 swapFree=4175448/4192956
[pid=16738] ppid=16736 vsize=21836 CPUtime=0.29
/proc/16738/stat : 16738 (pbscip.linux.x8) R 16736 16738 16046 0 -1 4202496 6644 0 0 0 19 10 0 0 18 0 1 0 9240122 22360064 4670 1992294400 4194304 7136930 140736647016640 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16738/statm: 5459 4670 361 719 0 4738 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 21836

[startup+0.700749 s]
/proc/loadavg: 1.09 1.02 1.01 3/106 16738
/proc/meminfo: memFree=1754004/2059040 swapFree=4175448/4192956
[pid=16738] ppid=16736 vsize=23404 CPUtime=0.69
/proc/16738/stat : 16738 (pbscip.linux.x8) R 16736 16738 16046 0 -1 4202496 7602 0 0 0 50 19 0 0 18 0 1 0 9240122 23965696 5114 1992294400 4194304 7136930 140736647016640 18446744073709551615 4643217 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16738/statm: 5851 5114 389 719 0 5130 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 23404

[startup+1.50083 s]
/proc/loadavg: 1.09 1.02 1.01 2/107 16739
/proc/meminfo: memFree=1734280/2059040 swapFree=4175448/4192956
[pid=16738] ppid=16736 vsize=24584 CPUtime=1.49
/proc/16738/stat : 16738 (pbscip.linux.x8) R 16736 16738 16046 0 -1 4202496 7888 0 0 0 128 21 0 0 19 0 1 0 9240122 25174016 5400 1992294400 4194304 7136930 140736647016640 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16738/statm: 6146 5400 394 719 0 5425 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 24584

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

[startup+1.60184 s]
/proc/loadavg: 1.09 1.02 1.01 2/107 16739
/proc/meminfo: memFree=1734280/2059040 swapFree=4175448/4192956
[pid=16738] ppid=16736 vsize=24584 CPUtime=1.59
/proc/16738/stat : 16738 (pbscip.linux.x8) R 16736 16738 16046 0 -1 4202496 7899 0 0 0 138 21 0 0 19 0 1 0 9240122 25174016 5411 1992294400 4194304 7136930 140736647016640 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16738/statm: 6146 5411 394 719 0 5425 0
Current children cumulated CPU time (s) 1.59
Current children cumulated vsize (KiB) 24584

Child status: 0
Real time (s): 1.68107
CPU time (s): 1.68074
CPU user time (s): 1.45378
CPU system time (s): 0.226965
CPU usage (%): 99.9807
Max. virtual memory (cumulated for all children) (KiB): 24584

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.45378
system time used= 0.226965
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 7937
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= 6
involuntary context switches= 4

runsolver used 0.008998 second user time and 0.013997 second system time

The end

Launcher Data 

Begin job on node083 at 2010-06-16 11:11:04
IDJOB=2663455
IDBENCH=48333
IDSOLVER=1167
FILE ID=node083/2663455-1276679464
PBS_JOBID= 11172557
Free space on /tmp= 62552 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_3_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-2663455-1276679464/watcher-2663455-1276679464 -o /tmp/evaluation-result-2663455-1276679464/solver-2663455-1276679464 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2663455-1276679464.opb -t 1800 -m 1800

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

MD5SUM BENCH= bbe3a085a15e9497809c2511fab038f0
RANDOM SEED=945212642

node083.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.262
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.52
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.262
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	: 5999.40
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1754532 kB
Buffers:         56440 kB
Cached:         115108 kB
SwapCached:      13528 kB
Active:          92376 kB
Inactive:       135000 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1754532 kB
SwapTotal:     4192956 kB
SwapFree:      4175448 kB
Dirty:            3548 kB
Writeback:           0 kB
AnonPages:       42216 kB
Mapped:          14244 kB
Slab:            55400 kB
PageTables:       4076 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   182976 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= 62552 MiB
End job on node083 at 2010-06-16 11:11:06