Trace number 2663460

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.21281 1.21316

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_200_10_1_15.opb
MD5SUM6ed49b7079c02e2b7da24a0934bd3691
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.037993
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)4964
Sum of products size (including duplicates)9928
Number of different products2482
Sum of products size4964

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-2663460-1276679858.opb>
0.02/0.04	c original problem has 2882 variables (2882 bin, 0 int, 0 impl, 0 cont) and 3084 constraints
0.02/0.04	c problem read
0.02/0.04	c No objective function, only one solution is needed.
0.02/0.04	c presolving settings loaded
0.02/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.02/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, 20256 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  20256 implications, 400 cliques
0.39/0.47	c presolved problem has 2882 variables (2882 bin, 0 int, 0 impl, 0 cont) and 3084 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    2482 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.23
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.48	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.48	c   0.2s|     1 |     2 |     0 |     - |7915k|   0 |   - |2882 |3084 |   0 |   0 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.09/1.17	c * 0.9s|   932 |     0 |     0 |   0.0 |8915k| 543 |   - |2882 |3084 |   0 |   0 |   0 |   8 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
1.09/1.18	c 
1.09/1.18	c SCIP Status        : problem is solved [optimal solution found]
1.09/1.18	c Solving Time (sec) : 0.93
1.09/1.18	c Solving Nodes      : 932
1.09/1.18	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
1.09/1.18	c Dual Bound         : +0.00000000000000e+00
1.09/1.18	c Gap                : 0.00 %
1.09/1.19	s SATISFIABLE
1.09/1.19	v -x313 -x342 -x248 -x392 x390 -x358 -x297 x348 -x254 -x386 -x286 x345 -x376 -x231 -x294 -x280 -x360 -x382 -x332 -x255 -x323 -x321 
1.09/1.19	v -x359 -x343 -x224 x353 -x256 -x391 -x239 -x237 -x300 -x370 -x349 -x335 -x305 -x317 -x377 -x395 -x361 -x367 -x299 -x267 -x238 
1.09/1.19	v -x352 -x233 -x218 -x283 -x269 -x344 -x388 -x217 -x289 -x380 -x356 -x322 -x216 -x339 -x319 -x312 -x246 -x350 -x347 -x249 -x271 
1.09/1.19	v -x272 -x329 x308 -x284 -x307 -x366 -x354 -x334 -x275 -x310 -x372 -x232 x362 -x315 -x236 -x241 -x220 -x290 -x281 x375 -x262 
1.09/1.19	v -x302 -x253 -x318 -x303 -x298 -x210 -x234 -x295 -x213 -x340 -x245 -x261 -x400 -x355 -x252 -x389 -x379 -x277 -x208 -x276 -x266 
1.09/1.19	v -x219 -x351 -x244 -x365 -x215 x346 -x207 -x301 -x264 -x235 -x314 -x247 -x328 -x285 -x326 -x306 -x206 -x398 -x288 -x279 -x278 
1.09/1.19	v -x265 -x258 -x242 -x226 -x282 -x397 -x357 -x381 -x292 -x214 -x205 x393 -x311 -x296 -x274 -x240 -x225 -x221 x371 -x325 -x338 
1.09/1.19	v x385 -x320 -x374 -x399 -x309 -x209 -x257 -x270 -x259 -x223 -x330 -x203 -x396 -x273 -x251 -x243 -x204 -x268 -x324 -x263 -x331 
1.09/1.19	v -x383 -x230 x368 -x369 -x212 -x202 -x211 -x337 x373 -x227 -x341 -x327 -x364 -x260 -x291 -x228 -x363 -x201 -x333 -x304 -x229 
1.09/1.19	v -x222 -x250 -x293 -x387 -x336 -x394 -x316 x378 -x287 x384 x200 x199 -x198 x197 x196 x195 -x194 -x193 -x192 -x191 -x190 -x189 
1.09/1.19	v -x188 -x187 -x186 -x185 -x184 x183 -x182 -x181 -x180 -x179 -x178 -x177 x176 -x175 -x174 -x173 x172 -x171 -x170 x169 -x168 -x167 
1.09/1.19	v -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 x147 -x146 
1.09/1.19	v -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 x131 -x130 -x129 -x128 -x127 -x126 -x125 
1.09/1.19	v -x124 -x123 x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104 
1.09/1.19	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.09/1.19	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.09/1.19	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 
1.09/1.19	v -x29 -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.09/1.19	v -x2 -x1 
1.09/1.19	c SCIP Status        : problem is solved [optimal solution found]
1.09/1.19	c Solving Time       :       0.93
1.09/1.19	c Original Problem   :
1.09/1.19	c   Problem name     : HOME/instance-2663460-1276679858.opb
1.09/1.19	c   Variables        : 2882 (2882 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.19	c   Constraints      : 3084 initial, 3084 maximal
1.09/1.19	c Presolved Problem  :
1.09/1.19	c   Problem name     : t_HOME/instance-2663460-1276679858.opb
1.09/1.19	c   Variables        : 2882 (2882 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.19	c   Constraints      : 3084 initial, 3084 maximal
1.09/1.19	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.09/1.19	c   trivial          :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   implics          :       0.01          0          0          0          0          0          0          0          0
1.09/1.19	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   setppc           :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   and              :       0.17          0          0          0          0          0          0          0          0
1.09/1.19	c   linear           :       0.03          0          0          0          0          0          0          0          0
1.09/1.19	c   logicor          :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   root node        :          -          0          -          -          0          -          -          -          -
1.09/1.19	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.09/1.19	c   integral         :          0          0          0          0          0          0          0          0          0          0
1.09/1.19	c   knapsack         :          1          0       1565          0        914          0        106          0          0          0
1.09/1.19	c   setppc           :        400          0       1440          0        829          0          0          0          0          0
1.09/1.19	c   and              :       2482          0       1565          0        914          0       4785          0          0          0
1.09/1.19	c   linear           :          1          0       1575          0        923          9         15          0          0          0
1.09/1.19	c   logicor          :        200+         0         12          0        924          0         20          0          0          0
1.09/1.19	c   countsols        :          0          0          0          0        924          0          0          0          0          0
1.09/1.19	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.09/1.19	c   integral         :       0.00       0.00       0.00       0.00       0.00
1.09/1.19	c   knapsack         :       0.08       0.00       0.03       0.00       0.05
1.09/1.19	c   setppc           :       0.13       0.00       0.02       0.00       0.11
1.09/1.19	c   and              :       0.13       0.00       0.05       0.00       0.08
1.09/1.19	c   linear           :       0.02       0.00       0.02       0.00       0.00
1.09/1.19	c   logicor          :       0.02       0.00       0.00       0.00       0.02
1.09/1.19	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.09/1.19	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.09/1.19	c   vbounds          :       0.02          1          0          0
1.09/1.19	c   rootredcost      :       0.00          0          0          0
1.09/1.19	c   pseudoobj        :       0.00          0          0          0
1.09/1.19	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.09/1.19	c   propagation      :       0.01          9          8         15      372.9          0        0.0          -
1.09/1.19	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.09/1.19	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.09/1.19	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.09/1.19	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.09/1.19	c   applied globally :          -          -          -          0        0.0          -          -          -
1.09/1.19	c   applied locally  :          -          -          -          8      371.0          -          -          -
1.09/1.19	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.09/1.19	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
1.09/1.19	c   redcost          :       0.00          0          0          0          0          0
1.09/1.19	c   impliedbounds    :       0.00          0          0          0          0          0
1.09/1.19	c   intobj           :       0.00          0          0          0          0          0
1.09/1.19	c   cgmip            :       0.00          0          0          0          0          0
1.09/1.19	c   gomory           :       0.00          0          0          0          0          0
1.09/1.19	c   strongcg         :       0.00          0          0          0          0          0
1.09/1.19	c   cmir             :       0.00          0          0          0          0          0
1.09/1.19	c   flowcover        :       0.00          0          0          0          0          0
1.09/1.19	c   clique           :       0.00          0          0          0          0          0
1.09/1.19	c   zerohalf         :       0.00          0          0          0          0          0
1.09/1.19	c   mcf              :       0.00          0          0          0          0          0
1.09/1.19	c   rapidlearning    :       0.00          0          0          0          0          0
1.09/1.19	c Pricers            :       Time      Calls       Vars
1.09/1.19	c   problem variables:       0.00          0          0
1.09/1.19	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.09/1.19	c   relpscost        :       0.00          0          0          0          0          0          0
1.09/1.19	c   pscost           :       0.00          0          0          0          0          0          0
1.09/1.19	c   inference        :       0.24        923          0          0          0          0       1846
1.09/1.19	c   mostinf          :       0.00          0          0          0          0          0          0
1.09/1.19	c   leastinf         :       0.00          0          0          0          0          0          0
1.09/1.19	c   fullstrong       :       0.00          0          0          0          0          0          0
1.09/1.19	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.09/1.19	c   random           :       0.00          0          0          0          0          0          0
1.09/1.19	c Primal Heuristics  :       Time      Calls      Found
1.09/1.19	c   LP solutions     :       0.00          -          0
1.09/1.19	c   pseudo solutions :       0.00          -          1
1.09/1.19	c   trivial          :       0.00          1          0
1.09/1.19	c   simplerounding   :       0.00          0          0
1.09/1.19	c   zirounding       :       0.00          0          0
1.09/1.19	c   rounding         :       0.00          0          0
1.09/1.19	c   shifting         :       0.00          0          0
1.09/1.19	c   intshifting      :       0.00          0          0
1.09/1.19	c   oneopt           :       0.00          0          0
1.09/1.19	c   twoopt           :       0.00          0          0
1.09/1.19	c   fixandinfer      :       0.00          0          0
1.09/1.19	c   feaspump         :       0.00          0          0
1.09/1.19	c   coefdiving       :       0.00          0          0
1.09/1.19	c   pscostdiving     :       0.00          0          0
1.09/1.19	c   fracdiving       :       0.00          0          0
1.09/1.19	c   veclendiving     :       0.00          0          0
1.09/1.19	c   intdiving        :       0.00          0          0
1.09/1.19	c   actconsdiving    :       0.00          0          0
1.09/1.19	c   objpscostdiving  :       0.00          0          0
1.09/1.19	c   rootsoldiving    :       0.00          0          0
1.09/1.19	c   linesearchdiving :       0.00          0          0
1.09/1.19	c   guideddiving     :       0.00          0          0
1.09/1.19	c   octane           :       0.00          0          0
1.09/1.19	c   rens             :       0.00          0          0
1.09/1.19	c   rins             :       0.00          0          0
1.09/1.19	c   localbranching   :       0.00          0          0
1.09/1.19	c   mutation         :       0.00          0          0
1.09/1.19	c   crossover        :       0.00          0          0
1.09/1.19	c   dins             :       0.00          0          0
1.09/1.19	c   undercover       :       0.00          0          0
1.09/1.19	c   nlp              :       0.00          0          0
1.09/1.19	c   trysol           :       0.00          0          0
1.09/1.19	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.09/1.19	c   primal LP        :       0.00          0          0       0.00          -
1.09/1.19	c   dual LP          :       0.00          0          0       0.00          -
1.09/1.19	c   lex dual LP      :       0.00          0          0       0.00          -
1.09/1.19	c   barrier LP       :       0.00          0          0       0.00          -
1.09/1.19	c   diving/probing LP:       0.00          0          0       0.00          -
1.09/1.19	c   strong branching :       0.00          0          0       0.00          -
1.09/1.19	c     (at root node) :          -          0          0       0.00          -
1.09/1.19	c   conflict analysis:       0.00          0          0       0.00          -
1.09/1.19	c B&B Tree           :
1.09/1.19	c   number of runs   :          1
1.09/1.19	c   nodes            :        932
1.09/1.19	c   nodes (total)    :        932
1.09/1.19	c   nodes left       :          0
1.09/1.19	c   max depth        :        543
1.09/1.19	c   max depth (total):        543
1.09/1.19	c   backtracks       :          1 (0.1%)
1.09/1.19	c   delayed cutoffs  :          1
1.09/1.19	c   repropagations   :         29 (14 domain reductions, 1 cutoffs)
1.09/1.19	c   avg switch length:       2.05
1.09/1.19	c   switching time   :       0.02
1.09/1.19	c Solution           :
1.09/1.19	c   Solutions found  :          1 (1 improvements)
1.09/1.19	c   First Solution   : +0.00000000000000e+00   (in run 1, after 932 nodes, 0.92 seconds, depth 543, found by <relaxation>)
1.09/1.19	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 932 nodes, 0.92 seconds, depth 543, found by <relaxation>)
1.09/1.19	c   Dual Bound       : +0.00000000000000e+00
1.09/1.19	c   Gap              :       0.00 %
1.09/1.19	c   Root Dual Bound  : +0.00000000000000e+00
1.09/1.19	c   Root Iterations  :          0
1.19/1.21	c Time complete: 1.2.

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-2663460-1276679858/watcher-2663460-1276679858 -o /tmp/evaluation-result-2663460-1276679858/solver-2663460-1276679858 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2663460-1276679858.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.93 0.98 0.99 3/105 17232
/proc/meminfo: memFree=1738612/2059040 swapFree=4192956/4192956
[pid=17232] ppid=17230 vsize=6584 CPUtime=0
/proc/17232/stat : 17232 (pbscip.linux.x8) R 17230 17232 16409 0 -1 4202496 1082 0 0 0 0 0 0 0 25 0 1 0 9279621 6742016 1004 1992294400 4194304 7136930 140734674227520 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/17232/statm: 1646 1015 254 719 0 925 0

[startup+0.0285991 s]
/proc/loadavg: 0.93 0.98 0.99 3/105 17232
/proc/meminfo: memFree=1738612/2059040 swapFree=4192956/4192956
[pid=17232] ppid=17230 vsize=11284 CPUtime=0.02
/proc/17232/stat : 17232 (pbscip.linux.x8) R 17230 17232 16409 0 -1 4202496 2291 0 0 0 1 1 0 0 25 0 1 0 9279621 11554816 2213 1992294400 4194304 7136930 140734674227520 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/17232/statm: 2821 2213 269 719 0 2100 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 11284

[startup+0.101608 s]
/proc/loadavg: 0.93 0.98 0.99 3/105 17232
/proc/meminfo: memFree=1738612/2059040 swapFree=4192956/4192956
[pid=17232] ppid=17230 vsize=19896 CPUtime=0.09
/proc/17232/stat : 17232 (pbscip.linux.x8) R 17230 17232 16409 0 -1 4202496 4858 0 0 0 7 2 0 0 25 0 1 0 9279621 20373504 4169 1992294400 4194304 7136930 140734674227520 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/17232/statm: 4974 4169 327 719 0 4253 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 19896

[startup+0.301629 s]
/proc/loadavg: 0.93 0.98 0.99 3/105 17232
/proc/meminfo: memFree=1738612/2059040 swapFree=4192956/4192956
[pid=17232] ppid=17230 vsize=22832 CPUtime=0.29
/proc/17232/stat : 17232 (pbscip.linux.x8) R 17230 17232 16409 0 -1 4202496 6649 0 0 0 17 12 0 0 25 0 1 0 9279621 23379968 4932 1992294400 4194304 7136930 140734674227520 18446744073709551615 6166368 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/17232/statm: 5708 4932 361 719 0 4987 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 22832

[startup+0.701676 s]
/proc/loadavg: 0.93 0.98 0.99 3/105 17232
/proc/meminfo: memFree=1738612/2059040 swapFree=4192956/4192956
[pid=17232] ppid=17230 vsize=23488 CPUtime=0.69
/proc/17232/stat : 17232 (pbscip.linux.x8) R 17230 17232 16409 0 -1 4202496 7609 0 0 0 49 20 0 0 18 0 1 0 9279621 24051712 5121 1992294400 4194304 7136930 140734674227520 18446744073709551615 5121908 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/17232/statm: 5872 5121 389 719 0 5151 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 23488

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

[startup+1.10872 s]
/proc/loadavg: 0.93 0.98 0.99 2/106 17233
/proc/meminfo: memFree=1718764/2059040 swapFree=4192956/4192956
[pid=17232] ppid=17230 vsize=24432 CPUtime=1.09
/proc/17232/stat : 17232 (pbscip.linux.x8) R 17230 17232 16409 0 -1 4202496 7839 0 0 0 88 21 0 0 18 0 1 0 9279621 25018368 5351 1992294400 4194304 7136930 140734674227520 18446744073709551615 4697599 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/17232/statm: 6108 5351 394 719 0 5387 0
Current children cumulated CPU time (s) 1.09
Current children cumulated vsize (KiB) 24432

[startup+1.20173 s]
/proc/loadavg: 0.93 0.98 0.99 2/106 17233
/proc/meminfo: memFree=1718764/2059040 swapFree=4192956/4192956
[pid=17232] ppid=17230 vsize=23404 CPUtime=1.19
/proc/17232/stat : 17232 (pbscip.linux.x8) R 17230 17232 16409 0 -1 4202496 7848 0 0 0 97 22 0 0 18 0 1 0 9279621 23965696 5103 1992294400 4194304 7136930 140734674227520 18446744073709551615 4671972 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/17232/statm: 5851 5103 399 719 0 5130 0
Current children cumulated CPU time (s) 1.19
Current children cumulated vsize (KiB) 23404

Child status: 0
Real time (s): 1.21316
CPU time (s): 1.21281
CPU user time (s): 0.98585
CPU system time (s): 0.226965
CPU usage (%): 99.9718
Max. virtual memory (cumulated for all children) (KiB): 24432

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.98585
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= 7854
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= 5
involuntary context switches= 3

runsolver used 0.003999 second user time and 0.020996 second system time

The end

Launcher Data 

Begin job on node085 at 2010-06-16 11:17:38
IDJOB=2663460
IDBENCH=48338
IDSOLVER=1167
FILE ID=node085/2663460-1276679858
PBS_JOBID= 11172523
Free space on /tmp= 121872 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_1_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-2663460-1276679858/watcher-2663460-1276679858 -o /tmp/evaluation-result-2663460-1276679858/solver-2663460-1276679858 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2663460-1276679858.opb -t 1800 -m 1800

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

MD5SUM BENCH= 6ed49b7079c02e2b7da24a0934bd3691
RANDOM SEED=1127195232

node085.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.221
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.44
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.221
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.51
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1739140 kB
Buffers:         61628 kB
Cached:         121652 kB
SwapCached:          0 kB
Active:         127732 kB
Inactive:       115048 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1739140 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            3528 kB
Writeback:           0 kB
AnonPages:       59396 kB
Mapped:          15328 kB
Slab:            55580 kB
PageTables:       4000 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   182284 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= 121868 MiB
End job on node085 at 2010-06-16 11:17:39