Trace number 2664859

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
SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solverSAT 1.02084 1.02106

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_50_25_4_5.opb
MD5SUMb59e33bacf4f8d5e91915df093d27c73
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.083986
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables100
Total number of constraints152
Number of constraints which are clauses50
Number of constraints which are cardinality constraints (but not clauses)1
Number of constraints which are nor clauses,nor cardinality constraints101
Minimum length of a constraint2
Maximum length of a constraint100
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 5
Number of bits of the biggest number in a constraint 3
Biggest sum of numbers in a constraint 100
Number of bits of the biggest sum of numbers7
Number of products (including duplicates)2932
Sum of products size (including duplicates)5864
Number of different products1466
Sum of products size2932

Solver Data 

0.00/0.00	c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2664859-1276677504.opb>
0.00/0.02	c original problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 constraints
0.00/0.02	c problem read
0.00/0.02	c No objective function, only one solution is needed.
0.00/0.02	c presolving settings loaded
0.03/0.04	c presolving:
0.19/0.22	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11828 impls, 100 clqs
0.29/0.39	c presolving (2 rounds):
0.29/0.39	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.39	c  11828 implications, 100 cliques
0.29/0.39	c presolved problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 constraints
0.29/0.39	c       1 constraints of type <knapsack>
0.29/0.39	c     100 constraints of type <setppc>
0.29/0.39	c    1466 constraints of type <and>
0.29/0.39	c       1 constraints of type <linear>
0.29/0.39	c      50 constraints of type <logicor>
0.29/0.39	c transformed objective value is always integral (scale: 1)
0.29/0.39	c Presolving Time: 0.18
0.29/0.39	c - non default parameters ----------------------------------------------------------------------
0.29/0.39	c # SCIP version 1.2.1.2
0.29/0.39	c 
0.29/0.39	c # frequency for displaying node information lines
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.39	c display/freq = 10000
0.29/0.39	c 
0.29/0.39	c # maximal time in seconds to run
0.29/0.39	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39	c limits/time = 1799.99
0.29/0.39	c 
0.29/0.39	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.39	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39	c limits/memory = 1620
0.29/0.39	c 
0.29/0.39	c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39	c limits/solutions = 1
0.29/0.39	c 
0.29/0.39	c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.39	c separating/maxrounds = 1
0.29/0.39	c 
0.29/0.39	c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39	c separating/maxroundsroot = 5
0.29/0.39	c 
0.29/0.39	c # should presolving try to simplify inequalities
0.29/0.39	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39	c constraints/linear/simplifyinequalities = TRUE
0.29/0.39	c 
0.29/0.39	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.39	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.39	c constraints/knapsack/disaggregation = FALSE
0.29/0.39	c 
0.29/0.39	c # should presolving try to simplify knapsacks
0.29/0.39	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39	c constraints/knapsack/simplifyinequalities = TRUE
0.29/0.39	c 
0.29/0.39	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39	c presolving/probing/maxrounds = 0
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39	c heuristics/coefdiving/freq = -1
0.29/0.39	c 
0.29/0.39	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39	c heuristics/coefdiving/maxlpiterquot = 0.075
0.29/0.39	c 
0.29/0.39	c # additional number of allowed LP iterations
0.29/0.39	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39	c heuristics/coefdiving/maxlpiterofs = 1500
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.39	c heuristics/crossover/freq = -1
0.29/0.39	c 
0.29/0.39	c # number of nodes added to the contingent of the total nodes
0.29/0.39	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39	c heuristics/crossover/nodesofs = 750
0.29/0.39	c 
0.29/0.39	c # number of nodes without incumbent change that heuristic should wait
0.29/0.39	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.39	c heuristics/crossover/nwaitingnodes = 100
0.29/0.39	c 
0.29/0.39	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.39	c # [type: real, range: [0,1], default: 0.1]
0.29/0.39	c heuristics/crossover/nodesquot = 0.15
0.29/0.39	c 
0.29/0.39	c # minimum percentage of integer variables that have to be fixed 
0.29/0.39	c # [type: real, range: [0,1], default: 0.666]
0.29/0.39	c heuristics/crossover/minfixingrate = 0.5
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39	c heuristics/feaspump/freq = -1
0.29/0.39	c 
0.29/0.39	c # additional number of allowed LP iterations
0.29/0.39	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39	c heuristics/feaspump/maxlpiterofs = 2000
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39	c heuristics/fracdiving/freq = -1
0.29/0.39	c 
0.29/0.39	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39	c heuristics/fracdiving/maxlpiterquot = 0.075
0.29/0.39	c 
0.29/0.39	c # additional number of allowed LP iterations
0.29/0.39	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39	c heuristics/fracdiving/maxlpiterofs = 1500
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39	c heuristics/guideddiving/freq = -1
0.29/0.39	c 
0.29/0.39	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39	c heuristics/guideddiving/maxlpiterquot = 0.075
0.29/0.39	c 
0.29/0.39	c # additional number of allowed LP iterations
0.29/0.39	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39	c heuristics/guideddiving/maxlpiterofs = 1500
0.29/0.39	c 
0.29/0.39	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39	c heuristics/intdiving/maxlpiterquot = 0.075
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39	c heuristics/intshifting/freq = -1
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39	c heuristics/linesearchdiving/freq = -1
0.29/0.39	c 
0.29/0.39	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.29/0.39	c 
0.29/0.39	c # additional number of allowed LP iterations
0.29/0.39	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39	c heuristics/nlp/freq = -1
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39	c heuristics/objpscostdiving/freq = -1
0.29/0.39	c 
0.29/0.39	c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.39	c # [type: real, range: [0,1], default: 0.01]
0.29/0.39	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.29/0.39	c 
0.29/0.39	c # additional number of allowed LP iterations
0.29/0.39	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39	c heuristics/oneopt/freq = -1
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39	c heuristics/pscostdiving/freq = -1
0.29/0.39	c 
0.29/0.39	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.29/0.39	c 
0.29/0.39	c # additional number of allowed LP iterations
0.29/0.39	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39	c heuristics/pscostdiving/maxlpiterofs = 1500
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39	c heuristics/rens/freq = -1
0.29/0.39	c 
0.29/0.39	c # minimum percentage of integer variables that have to be fixable 
0.29/0.39	c # [type: real, range: [0,1], default: 0.5]
0.29/0.39	c heuristics/rens/minfixingrate = 0.3
0.29/0.39	c 
0.29/0.39	c # number of nodes added to the contingent of the total nodes
0.29/0.39	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39	c heuristics/rens/nodesofs = 2000
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39	c heuristics/rootsoldiving/freq = -1
0.29/0.39	c 
0.29/0.39	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.39	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.29/0.39	c 
0.29/0.39	c # additional number of allowed LP iterations
0.29/0.39	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39	c heuristics/rounding/freq = -1
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39	c heuristics/shifting/freq = -1
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39	c heuristics/simplerounding/freq = -1
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39	c heuristics/trivial/freq = -1
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39	c heuristics/trysol/freq = -1
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39	c heuristics/veclendiving/freq = -1
0.29/0.39	c 
0.29/0.39	c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39	c heuristics/veclendiving/maxlpiterquot = 0.075
0.29/0.39	c 
0.29/0.39	c # additional number of allowed LP iterations
0.29/0.39	c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39	c heuristics/veclendiving/maxlpiterofs = 1500
0.29/0.39	c 
0.29/0.39	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39	c heuristics/zirounding/freq = -1
0.29/0.39	c 
0.29/0.39	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39	c separating/cmir/freq = -1
0.29/0.39	c 
0.29/0.39	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39	c separating/flowcover/freq = -1
0.29/0.39	c 
0.29/0.39	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.29/0.39	c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39	c separating/rapidlearning/freq = 0
0.29/0.39	c 
0.29/0.39	c -----------------------------------------------------------------------------------------------
0.29/0.39	c start solving
0.29/0.39	c 
0.39/0.43	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.43	c   0.2s|     1 |     0 |    45 |     - |7174k|   0 |  39 |1566 |1618 |1566 |3084 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.89/0.98	c y 0.6s|     1 |     0 |    45 |     - |9058k|   0 |   - |1566 |1618 |1566 |3084 |   0 |   0 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.89/0.99	c   0.6s|     1 |     0 |    45 |     - |7262k|   0 |   - |1566 |1628 |1566 |3084 |   0 |   0 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.89/0.99	c 
0.89/0.99	c SCIP Status        : problem is solved [optimal solution found]
0.89/0.99	c Solving Time (sec) : 0.57
0.89/0.99	c Solving Nodes      : 1
0.89/0.99	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
0.89/0.99	c Dual Bound         : +0.00000000000000e+00
0.89/0.99	c Gap                : 0.00 %
0.89/0.99	s SATISFIABLE
0.89/0.99	v -x59 -x66 x97 -x60 -x58 -x56 -x96 -x87 -x72 x90 x98 -x94 -x93 -x82 -x62 -x70 -x51 -x99 x91 -x89 -x85 -x78 x67 -x63 -x61 -x57 -x81 
0.89/0.99	v -x71 -x83 -x73 -x74 -x80 -x69 -x68 -x100 -x92 -x53 -x54 -x65 -x55 -x95 -x86 -x79 -x76 -x88 -x64 -x77 -x75 -x84 -x52 x50 x49 
0.89/0.99	v -x48 -x47 x46 -x45 -x44 -x43 -x42 -x41 -x40 x39 -x38 x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 
0.89/0.99	v -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1 
0.89/0.99	c SCIP Status        : problem is solved [optimal solution found]
0.89/0.99	c Solving Time       :       0.57
0.89/0.99	c Original Problem   :
0.89/0.99	c   Problem name     : HOME/instance-2664859-1276677504.opb
0.89/0.99	c   Variables        : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.99	c   Constraints      : 1618 initial, 1618 maximal
0.89/0.99	c Presolved Problem  :
0.89/0.99	c   Problem name     : t_HOME/instance-2664859-1276677504.opb
0.89/0.99	c   Variables        : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.99	c   Constraints      : 1618 initial, 1628 maximal
0.89/0.99	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.89/0.99	c   trivial          :       0.00          0          0          0          0          0          0          0          0
0.89/0.99	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
0.89/0.99	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.89/0.99	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.89/0.99	c   implics          :       0.00          0          0          0          0          0          0          0          0
0.89/0.99	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.89/0.99	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
0.89/0.99	c   setppc           :       0.00          0          0          0          0          0          0          0          0
0.89/0.99	c   and              :       0.17          0          0          0          0          0          0          0          0
0.89/0.99	c   linear           :       0.00          0          0          0          0          0          0          0          0
0.89/0.99	c   logicor          :       0.00          0          0          0          0          0          0          0          0
0.89/0.99	c   root node        :          -          0          -          -          0          -          -          -          -
0.89/0.99	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.89/0.99	c   integral         :          0          0          0          0          0          0          0          0          0          0
0.89/0.99	c   knapsack         :          1          1          1          0          0          0          0          0          0          0
0.89/0.99	c   setppc           :        100          1          1          0          0          0          0          0          0          0
0.89/0.99	c   and              :       1466          1          1          0          0          0          0          0          0          0
0.89/0.99	c   linear           :          1+         1          1          0          0          0          0          0          0          0
0.89/0.99	c   logicor          :         50          1          1          0          0          0          0          0          0          0
0.89/0.99	c   countsols        :          0          0          0          0          0          0          0          0          0          0
0.89/0.99	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.89/0.99	c   integral         :       0.00       0.00       0.00       0.00       0.00
0.89/0.99	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
0.89/0.99	c   setppc           :       0.00       0.00       0.00       0.00       0.00
0.89/0.99	c   and              :       0.00       0.00       0.00       0.00       0.00
0.89/0.99	c   linear           :       0.00       0.00       0.00       0.00       0.00
0.89/0.99	c   logicor          :       0.00       0.00       0.00       0.00       0.00
0.89/0.99	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.89/0.99	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.89/0.99	c   vbounds          :       0.00          1          0          0
0.89/0.99	c   rootredcost      :       0.00          0          0          0
0.89/0.99	c   pseudoobj        :       0.00          0          0          0
0.89/0.99	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.89/0.99	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.89/0.99	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.89/0.99	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.89/0.99	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.89/0.99	c   pseudo solution  :       0.00          1          0          0        0.0          0        0.0          -
0.89/0.99	c   applied globally :          -          -          -          0        0.0          -          -          -
0.89/0.99	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.89/0.99	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.89/0.99	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 32)
0.89/0.99	c   redcost          :       0.00          1          0          0          0          0
0.89/0.99	c   impliedbounds    :       0.00          1          0          0          0          0
0.89/0.99	c   intobj           :       0.00          0          0          0          0          0
0.89/0.99	c   cgmip            :       0.00          0          0          0          0          0
0.89/0.99	c   gomory           :       0.05          1          0          0        500          0
0.89/0.99	c   strongcg         :       0.04          1          0          0        500          0
0.89/0.99	c   cmir             :       0.00          0          0          0          0          0
0.89/0.99	c   flowcover        :       0.00          0          0          0          0          0
0.89/0.99	c   clique           :       0.01          1          0          0          6          0
0.89/0.99	c   zerohalf         :       0.00          0          0          0          0          0
0.89/0.99	c   mcf              :       0.01          1          0          0          0          0
0.89/0.99	c   rapidlearning    :       0.24          1          0          0          0         10
0.89/0.99	c Pricers            :       Time      Calls       Vars
0.89/0.99	c   problem variables:       0.00          0          0
0.89/0.99	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.89/0.99	c   pscost           :       0.00          0          0          0          0          0          0
0.89/0.99	c   inference        :       0.00          0          0          0          0          0          0
0.89/0.99	c   mostinf          :       0.00          0          0          0          0          0          0
0.89/0.99	c   leastinf         :       0.00          0          0          0          0          0          0
0.89/0.99	c   fullstrong       :       0.00          0          0          0          0          0          0
0.89/0.99	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.89/0.99	c   random           :       0.00          0          0          0          0          0          0
0.89/0.99	c   relpscost        :       0.00          0          0          0          0          0          0
0.89/0.99	c Primal Heuristics  :       Time      Calls      Found
0.89/0.99	c   LP solutions     :       0.00          -          0
0.89/0.99	c   pseudo solutions :       0.00          -          0
0.89/0.99	c   trivial          :       0.00          1          0
0.89/0.99	c   simplerounding   :       0.00          0          0
0.89/0.99	c   zirounding       :       0.00          0          0
0.89/0.99	c   rounding         :       0.00          0          0
0.89/0.99	c   shifting         :       0.00          0          0
0.89/0.99	c   intshifting      :       0.00          0          0
0.89/0.99	c   oneopt           :       0.00          0          0
0.89/0.99	c   twoopt           :       0.00          0          0
0.89/0.99	c   fixandinfer      :       0.00          0          0
0.89/0.99	c   feaspump         :       0.00          0          0
0.89/0.99	c   coefdiving       :       0.00          0          0
0.89/0.99	c   pscostdiving     :       0.00          0          0
0.89/0.99	c   fracdiving       :       0.00          0          0
0.89/0.99	c   veclendiving     :       0.00          0          0
0.89/0.99	c   intdiving        :       0.00          0          0
0.89/0.99	c   actconsdiving    :       0.00          0          0
0.89/0.99	c   objpscostdiving  :       0.00          0          0
0.89/0.99	c   rootsoldiving    :       0.00          0          0
0.89/0.99	c   linesearchdiving :       0.00          0          0
0.89/0.99	c   guideddiving     :       0.00          0          0
0.89/0.99	c   octane           :       0.00          0          0
0.89/0.99	c   rens             :       0.00          0          0
0.89/0.99	c   rins             :       0.00          0          0
0.89/0.99	c   localbranching   :       0.00          0          0
0.89/0.99	c   mutation         :       0.00          0          0
0.89/0.99	c   crossover        :       0.00          0          0
0.89/0.99	c   dins             :       0.00          0          0
0.89/0.99	c   undercover       :       0.00          0          0
0.89/0.99	c   nlp              :       0.00          0          0
0.89/0.99	c   trysol           :       0.00          0          0
0.89/0.99	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.89/0.99	c   primal LP        :       0.00          0          0       0.00          -
0.89/0.99	c   dual LP          :       0.01          1         45      45.00    4500.00
0.89/0.99	c   lex dual LP      :       0.00          0          0       0.00          -
0.89/0.99	c   barrier LP       :       0.00          0          0       0.00          -
0.89/0.99	c   diving/probing LP:       0.00          0          0       0.00          -
0.89/0.99	c   strong branching :       0.00          0          0       0.00          -
0.89/0.99	c     (at root node) :          -          0          0       0.00          -
0.89/0.99	c   conflict analysis:       0.00          0          0       0.00          -
0.89/0.99	c B&B Tree           :
0.89/0.99	c   number of runs   :          1
0.89/0.99	c   nodes            :          1
0.89/0.99	c   nodes (total)    :          1
0.89/0.99	c   nodes left       :          0
0.89/0.99	c   max depth        :          0
0.89/0.99	c   max depth (total):          0
0.89/0.99	c   backtracks       :          0 (0.0%)
0.89/0.99	c   delayed cutoffs  :          0
0.89/0.99	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.89/0.99	c   avg switch length:       2.00
0.89/0.99	c   switching time   :       0.00
0.89/0.99	c Solution           :
0.89/0.99	c   Solutions found  :          1 (1 improvements)
0.89/0.99	c   First Solution   : +0.00000000000000e+00   (in run 1, after 1 nodes, 0.56 seconds, depth 0, found by <trysol>)
0.89/0.99	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 1 nodes, 0.56 seconds, depth 0, found by <trysol>)
0.89/0.99	c   Dual Bound       : +0.00000000000000e+00
0.89/0.99	c   Gap              :       0.00 %
0.89/0.99	c   Root Dual Bound  : +0.00000000000000e+00
0.89/0.99	c   Root Iterations  :         45
0.99/1.02	c Time complete: 1.

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-2664859-1276677504/watcher-2664859-1276677504 -o /tmp/evaluation-result-2664859-1276677504/solver-2664859-1276677504 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2664859-1276677504.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.00 3/105 18194
/proc/meminfo: memFree=1779740/2059040 swapFree=4148288/4192956
[pid=18194] ppid=18192 vsize=9288 CPUtime=0
/proc/18194/stat : 18194 (pbscip.linux.x8) R 18192 18194 17386 0 -1 4202496 1124 0 0 0 0 0 0 0 25 0 1 0 9043927 9510912 1046 1992294400 4194304 9819077 140733473244512 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/18194/statm: 2322 1056 371 1374 0 943 0

[startup+0.0365521 s]
/proc/loadavg: 1.09 1.02 1.00 3/105 18194
/proc/meminfo: memFree=1779740/2059040 swapFree=4148288/4192956
[pid=18194] ppid=18192 vsize=15536 CPUtime=0.03
/proc/18194/stat : 18194 (pbscip.linux.x8) R 18192 18194 17386 0 -1 4202496 3230 0 0 0 2 1 0 0 25 0 1 0 9043927 15908864 2797 1992294400 4194304 9819077 140733473244512 18446744073709551615 4461481 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/18194/statm: 3884 2797 430 1374 0 2505 0
Current children cumulated CPU time (s) 0.03
Current children cumulated vsize (KiB) 15536

[startup+0.100558 s]
/proc/loadavg: 1.09 1.02 1.00 3/105 18194
/proc/meminfo: memFree=1779740/2059040 swapFree=4148288/4192956
[pid=18194] ppid=18192 vsize=17740 CPUtime=0.09
/proc/18194/stat : 18194 (pbscip.linux.x8) R 18192 18194 17386 0 -1 4202496 3800 0 0 0 6 3 0 0 25 0 1 0 9043927 18165760 3110 1992294400 4194304 9819077 140733473244512 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/18194/statm: 4435 3110 472 1374 0 3056 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 17740

[startup+0.300579 s]
/proc/loadavg: 1.09 1.02 1.00 3/105 18194
/proc/meminfo: memFree=1779740/2059040 swapFree=4148288/4192956
[pid=18194] ppid=18192 vsize=19164 CPUtime=0.29
/proc/18194/stat : 18194 (pbscip.linux.x8) R 18192 18194 17386 0 -1 4202496 5717 0 0 0 16 13 0 0 25 0 1 0 9043927 19623936 3485 1992294400 4194304 9819077 140733473244512 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/18194/statm: 4791 3485 505 1374 0 3412 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 19164

[startup+0.70062 s]
/proc/loadavg: 1.09 1.02 1.00 3/105 18194
/proc/meminfo: memFree=1779740/2059040 swapFree=4148288/4192956
[pid=18194] ppid=18192 vsize=41732 CPUtime=0.69
/proc/18194/stat : 18194 (pbscip.linux.x8) R 18192 18194 17386 0 -1 4202496 11533 0 0 0 41 28 0 0 18 0 1 0 9043927 42733568 8473 1992294400 4194304 9819077 140733473244512 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/18194/statm: 10433 8473 678 1374 0 9054 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 41732

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

[startup+0.900641 s]
/proc/loadavg: 1.09 1.02 1.00 3/105 18194
/proc/meminfo: memFree=1779740/2059040 swapFree=4148288/4192956
[pid=18194] ppid=18192 vsize=43176 CPUtime=0.89
/proc/18194/stat : 18194 (pbscip.linux.x8) R 18192 18194 17386 0 -1 4202496 13425 0 0 0 51 38 0 0 18 0 1 0 9043927 44212224 8823 1992294400 4194304 9819077 140733473244512 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/18194/statm: 10794 8823 678 1374 0 9415 0
Current children cumulated CPU time (s) 0.89
Current children cumulated vsize (KiB) 43176

[startup+1.00065 s]
/proc/loadavg: 1.09 1.02 1.00 2/106 18195
/proc/meminfo: memFree=1753320/2059040 swapFree=4148288/4192956
[pid=18194] ppid=18192 vsize=32868 CPUtime=0.99
/proc/18194/stat : 18194 (pbscip.linux.x8) R 18192 18194 17386 0 -1 4202496 14646 0 0 0 59 40 0 0 18 0 1 0 9043927 33656832 6526 1992294400 4194304 9819077 140733473244512 18446744073709551615 5955538 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/18194/statm: 8217 6526 702 1374 0 6838 0
Current children cumulated CPU time (s) 0.99
Current children cumulated vsize (KiB) 32868

Child status: 0
Real time (s): 1.02106
CPU time (s): 1.02084
CPU user time (s): 0.609907
CPU system time (s): 0.410937
CPU usage (%): 99.9785
Max. virtual memory (cumulated for all children) (KiB): 43176

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

runsolver used 0.007998 second user time and 0.016997 second system time

The end

Launcher Data 

Begin job on node082 at 2010-06-16 10:38:24
IDJOB=2664859
IDBENCH=48307
IDSOLVER=1168
FILE ID=node082/2664859-1276677504
PBS_JOBID= 11172528
Free space on /tmp= 62584 MiB

SOLVER NAME= SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solver
BENCH NAME= PB07/normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/manquinho/dbsg/normalized-dbsg_50_25_4_5.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.clp -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2664859-1276677504/watcher-2664859-1276677504 -o /tmp/evaluation-result-2664859-1276677504/solver-2664859-1276677504 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2664859-1276677504.opb -t 1800 -m 1800

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

MD5SUM BENCH= b59e33bacf4f8d5e91915df093d27c73
RANDOM SEED=1369441776

node082.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.215
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.43
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.215
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.41
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1780268 kB
Buffers:         67196 kB
Cached:         112340 kB
SwapCached:       6844 kB
Active:         106780 kB
Inactive:        94576 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1780268 kB
SwapTotal:     4192956 kB
SwapFree:      4148288 kB
Dirty:            6532 kB
Writeback:           0 kB
AnonPages:       19004 kB
Mapped:          13216 kB
Slab:            55708 kB
PageTables:       3916 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180480 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264964 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62576 MiB
End job on node082 at 2010-06-16 10:38:25