Trace number 2664927

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 solverUNSAT 0.042993 0.0447171

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_10_4_4_8.opb
MD5SUM3d79ba0ee0b91a70716408d98d6e11cd
Bench CategoryDEC-SMALLINT-NLC (no optimisation, small integers, non linear constraints)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.002998
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables20
Total number of constraints32
Number of constraints which are clauses10
Number of constraints which are cardinality constraints (but not clauses)1
Number of constraints which are nor clauses,nor cardinality constraints21
Minimum length of a constraint2
Maximum length of a constraint20
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 8
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 20
Number of bits of the biggest sum of numbers5
Number of products (including duplicates)92
Sum of products size (including duplicates)184
Number of different products46
Sum of products size92

Solver Data 

0.00/0.01	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.01	c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01	c 
0.00/0.01	c user parameter file <scip.set> not found - using default parameters
0.00/0.01	c reading problem <HOME/instance-2664927-1276683781.opb>
0.00/0.01	c original problem has 66 variables (66 bin, 0 int, 0 impl, 0 cont) and 78 constraints
0.00/0.01	c problem read
0.00/0.01	c No objective function, only one solution is needed.
0.00/0.01	c presolving settings loaded
0.00/0.01	c presolving:
0.00/0.02	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 31 upgd conss, 388 impls, 20 clqs
0.00/0.03	c presolving (2 rounds):
0.00/0.03	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03	c  388 implications, 20 cliques
0.00/0.03	c presolved problem has 66 variables (66 bin, 0 int, 0 impl, 0 cont) and 78 constraints
0.00/0.03	c       1 constraints of type <knapsack>
0.00/0.03	c      20 constraints of type <setppc>
0.00/0.03	c      46 constraints of type <and>
0.00/0.03	c       1 constraints of type <linear>
0.00/0.03	c      10 constraints of type <logicor>
0.00/0.03	c transformed objective value is always integral (scale: 1)
0.00/0.03	c Presolving Time: 0.01
0.00/0.03	c - non default parameters ----------------------------------------------------------------------
0.00/0.03	c # SCIP version 1.2.1.2
0.00/0.03	c 
0.00/0.03	c # frequency for displaying node information lines
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03	c display/freq = 10000
0.00/0.03	c 
0.00/0.03	c # maximal time in seconds to run
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/time = 1800
0.00/0.03	c 
0.00/0.03	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/memory = 1620
0.00/0.03	c 
0.00/0.03	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c limits/solutions = 1
0.00/0.03	c 
0.00/0.03	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03	c separating/maxrounds = 1
0.00/0.03	c 
0.00/0.03	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/maxroundsroot = 5
0.00/0.03	c 
0.00/0.03	c # should presolving try to simplify inequalities
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/linear/simplifyinequalities = TRUE
0.00/0.03	c 
0.00/0.03	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03	c constraints/knapsack/disaggregation = FALSE
0.00/0.03	c 
0.00/0.03	c # should presolving try to simplify knapsacks
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03	c 
0.00/0.03	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c presolving/probing/maxrounds = 0
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/coefdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03	c heuristics/crossover/freq = -1
0.00/0.03	c 
0.00/0.03	c # number of nodes added to the contingent of the total nodes
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03	c heuristics/crossover/nodesofs = 750
0.00/0.03	c 
0.00/0.03	c # number of nodes without incumbent change that heuristic should wait
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03	c heuristics/crossover/nwaitingnodes = 100
0.00/0.03	c 
0.00/0.03	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03	c # [type: real, range: [0,1], default: 0.1]
0.00/0.03	c heuristics/crossover/nodesquot = 0.15
0.00/0.03	c 
0.00/0.03	c # minimum percentage of integer variables that have to be fixed 
0.00/0.03	c # [type: real, range: [0,1], default: 0.666]
0.00/0.03	c heuristics/crossover/minfixingrate = 0.5
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/feaspump/freq = -1
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/fracdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/guideddiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/intshifting/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/linesearchdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/nlp/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/objpscostdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03	c # [type: real, range: [0,1], default: 0.01]
0.00/0.03	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/oneopt/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/pscostdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c heuristics/rens/freq = -1
0.00/0.03	c 
0.00/0.03	c # minimum percentage of integer variables that have to be fixable 
0.00/0.03	c # [type: real, range: [0,1], default: 0.5]
0.00/0.03	c heuristics/rens/minfixingrate = 0.3
0.00/0.03	c 
0.00/0.03	c # number of nodes added to the contingent of the total nodes
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03	c heuristics/rens/nodesofs = 2000
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/rootsoldiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/rounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/shifting/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/simplerounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c heuristics/trivial/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/trysol/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/veclendiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/zirounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c separating/cmir/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c separating/flowcover/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/rapidlearning/freq = 0
0.00/0.03	c 
0.00/0.03	c -----------------------------------------------------------------------------------------------
0.00/0.03	c start solving
0.00/0.03	c 
0.00/0.03	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.03	c   0.0s|     1 |     0 |    65 |     - | 393k|   0 |   - |  66 |  78 |  66 | 124 |   0 |   0 |   0 |      --      |      --      |   0.00%
0.00/0.03	c   0.0s|     1 |     0 |    65 |     - | 393k|   0 |   - |  66 |  78 |  66 | 124 |   0 |   0 |   0 |      --      |      --      |   0.00%
0.00/0.03	c 
0.00/0.03	c SCIP Status        : problem is solved [infeasible]
0.00/0.03	c Solving Time (sec) : 0.01
0.00/0.03	c Solving Nodes      : 1
0.00/0.03	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
0.00/0.03	c Dual Bound         : +1.00000000000000e+20
0.00/0.03	c Gap                : 0.00 %
0.00/0.03	s UNSATISFIABLE
0.00/0.03	c SCIP Status        : problem is solved [infeasible]
0.00/0.03	c Solving Time       :       0.01
0.00/0.03	c Original Problem   :
0.00/0.03	c   Problem name     : HOME/instance-2664927-1276683781.opb
0.00/0.03	c   Variables        : 66 (66 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03	c   Constraints      : 78 initial, 78 maximal
0.00/0.03	c Presolved Problem  :
0.00/0.03	c   Problem name     : t_HOME/instance-2664927-1276683781.opb
0.00/0.03	c   Variables        : 66 (66 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03	c   Constraints      : 78 initial, 78 maximal
0.00/0.03	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.00/0.03	c   trivial          :       0.00          0          0          0          0          0          0          0          0
0.00/0.03	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
0.00/0.03	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.00/0.03	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.00/0.03	c   implics          :       0.00          0          0          0          0          0          0          0          0
0.00/0.03	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.00/0.03	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
0.00/0.03	c   setppc           :       0.00          0          0          0          0          0          0          0          0
0.00/0.03	c   and              :       0.00          0          0          0          0          0          0          0          0
0.00/0.03	c   linear           :       0.01          0          0          0          0          0          0          0          0
0.00/0.03	c   logicor          :       0.00          0          0          0          0          0          0          0          0
0.00/0.03	c   root node        :          -          0          -          -          0          -          -          -          -
0.00/0.03	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.00/0.03	c   integral         :          0          0          0          0          0          0          0          0          0          0
0.00/0.03	c   knapsack         :          1          0          1          0          0          0          0          0          0          0
0.00/0.03	c   setppc           :         20          0          1          0          0          0          0          0          0          0
0.00/0.03	c   and              :         46          0          1          0          0          0          0          0          0          0
0.00/0.03	c   linear           :          1          0          1          0          0          0          0          0          0          0
0.00/0.03	c   logicor          :         10          0          1          0          0          0          0          0          0          0
0.00/0.03	c   countsols        :          0          0          0          0          0          0          0          0          0          0
0.00/0.03	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.00/0.03	c   integral         :       0.00       0.00       0.00       0.00       0.00
0.00/0.03	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
0.00/0.03	c   setppc           :       0.00       0.00       0.00       0.00       0.00
0.00/0.03	c   and              :       0.00       0.00       0.00       0.00       0.00
0.00/0.03	c   linear           :       0.00       0.00       0.00       0.00       0.00
0.00/0.03	c   logicor          :       0.00       0.00       0.00       0.00       0.00
0.00/0.03	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.00/0.03	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.00/0.03	c   vbounds          :       0.00          1          0          0
0.00/0.03	c   rootredcost      :       0.00          0          0          0
0.00/0.03	c   pseudoobj        :       0.00          0          0          0
0.00/0.03	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.00/0.03	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.00/0.03	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.03	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.03	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.03	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.00/0.03	c   applied globally :          -          -          -          0        0.0          -          -          -
0.00/0.03	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.00/0.03	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.00/0.03	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.00/0.03	c   redcost          :       0.00          0          0          0          0          0
0.00/0.03	c   impliedbounds    :       0.00          0          0          0          0          0
0.00/0.03	c   intobj           :       0.00          0          0          0          0          0
0.00/0.03	c   cgmip            :       0.00          0          0          0          0          0
0.00/0.03	c   gomory           :       0.00          0          0          0          0          0
0.00/0.03	c   strongcg         :       0.00          0          0          0          0          0
0.00/0.03	c   cmir             :       0.00          0          0          0          0          0
0.00/0.03	c   flowcover        :       0.00          0          0          0          0          0
0.00/0.03	c   clique           :       0.00          0          0          0          0          0
0.00/0.03	c   zerohalf         :       0.00          0          0          0          0          0
0.00/0.03	c   mcf              :       0.00          0          0          0          0          0
0.00/0.03	c   rapidlearning    :       0.00          0          0          0          0          0
0.00/0.03	c Pricers            :       Time      Calls       Vars
0.00/0.03	c   problem variables:       0.00          0          0
0.00/0.03	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.00/0.03	c   pscost           :       0.00          0          0          0          0          0          0
0.00/0.03	c   inference        :       0.00          0          0          0          0          0          0
0.00/0.03	c   mostinf          :       0.00          0          0          0          0          0          0
0.00/0.03	c   leastinf         :       0.00          0          0          0          0          0          0
0.00/0.03	c   fullstrong       :       0.00          0          0          0          0          0          0
0.00/0.03	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.00/0.03	c   random           :       0.00          0          0          0          0          0          0
0.00/0.03	c   relpscost        :       0.00          0          0          0          0          0          0
0.00/0.03	c Primal Heuristics  :       Time      Calls      Found
0.00/0.03	c   LP solutions     :       0.00          -          0
0.00/0.03	c   pseudo solutions :       0.00          -          0
0.00/0.03	c   trivial          :       0.00          1          0
0.00/0.03	c   simplerounding   :       0.00          0          0
0.00/0.03	c   zirounding       :       0.00          0          0
0.00/0.03	c   rounding         :       0.00          0          0
0.00/0.03	c   shifting         :       0.00          0          0
0.00/0.03	c   intshifting      :       0.00          0          0
0.00/0.03	c   oneopt           :       0.00          0          0
0.00/0.03	c   twoopt           :       0.00          0          0
0.00/0.03	c   fixandinfer      :       0.00          0          0
0.00/0.03	c   feaspump         :       0.00          0          0
0.00/0.03	c   coefdiving       :       0.00          0          0
0.00/0.03	c   pscostdiving     :       0.00          0          0
0.00/0.03	c   fracdiving       :       0.00          0          0
0.00/0.03	c   veclendiving     :       0.00          0          0
0.00/0.03	c   intdiving        :       0.00          0          0
0.00/0.03	c   actconsdiving    :       0.00          0          0
0.00/0.03	c   objpscostdiving  :       0.00          0          0
0.00/0.03	c   rootsoldiving    :       0.00          0          0
0.00/0.03	c   linesearchdiving :       0.00          0          0
0.00/0.03	c   guideddiving     :       0.00          0          0
0.00/0.03	c   octane           :       0.00          0          0
0.00/0.03	c   rens             :       0.00          0          0
0.00/0.03	c   rins             :       0.00          0          0
0.00/0.03	c   localbranching   :       0.00          0          0
0.00/0.03	c   mutation         :       0.00          0          0
0.00/0.03	c   crossover        :       0.00          0          0
0.00/0.03	c   dins             :       0.00          0          0
0.00/0.03	c   undercover       :       0.00          0          0
0.00/0.03	c   nlp              :       0.00          0          0
0.00/0.03	c   trysol           :       0.00          0          0
0.00/0.03	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.00/0.03	c   primal LP        :       0.00          0          0       0.00          -
0.00/0.03	c   dual LP          :       0.00          1         65      65.00          -
0.00/0.03	c   lex dual LP      :       0.00          0          0       0.00          -
0.00/0.03	c   barrier LP       :       0.00          0          0       0.00          -
0.00/0.03	c   diving/probing LP:       0.00          0          0       0.00          -
0.00/0.03	c   strong branching :       0.00          0          0       0.00          -
0.00/0.03	c     (at root node) :          -          0          0       0.00          -
0.00/0.03	c   conflict analysis:       0.00          0          0       0.00          -
0.00/0.03	c B&B Tree           :
0.00/0.03	c   number of runs   :          1
0.00/0.03	c   nodes            :          1
0.00/0.03	c   nodes (total)    :          1
0.00/0.03	c   nodes left       :          0
0.00/0.03	c   max depth        :          0
0.00/0.03	c   max depth (total):          0
0.00/0.03	c   backtracks       :          0 (0.0%)
0.00/0.03	c   delayed cutoffs  :          0
0.00/0.03	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.00/0.03	c   avg switch length:       2.00
0.00/0.03	c   switching time   :       0.00
0.00/0.03	c Solution           :
0.00/0.03	c   Solutions found  :          0 (0 improvements)
0.00/0.03	c   Primal Bound     : infeasible
0.00/0.03	c   Dual Bound       :          -
0.00/0.03	c   Gap              :       0.00 %
0.00/0.03	c   Root Dual Bound  :          -
0.00/0.03	c   Root Iterations  :         65
0.00/0.04	c Time complete: 0.03.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2664927-1276683781/watcher-2664927-1276683781 -o /tmp/evaluation-result-2664927-1276683781/solver-2664927-1276683781 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2664927-1276683781.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.23 1.05 1.02 2/106 9955
/proc/meminfo: memFree=1710972/2059040 swapFree=4134608/4192956
[pid=9955] ppid=9953 vsize=6356 CPUtime=0
/proc/9955/stat : 9955 (pbscip.linux.x8) R 9953 9955 8798 0 -1 4202496 587 0 0 0 0 0 0 0 19 0 1 0 43964530 6508544 508 1992294400 4194304 9819077 140734780078128 18446744073709551615 8656455 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/9955/statm: 1589 509 338 1374 0 210 0

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

Child status: 0
Real time (s): 0.0447171
CPU time (s): 0.042993
CPU user time (s): 0.024996
CPU system time (s): 0.017997
CPU usage (%): 96.1445
Max. virtual memory (cumulated for all children) (KiB): 0

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.024996
system time used= 0.017997
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4601
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= 1
involuntary context switches= 2

runsolver used 0.003999 second user time and 0.010998 second system time

The end

Launcher Data 

Begin job on node017 at 2010-06-16 12:23:01
IDJOB=2664927
IDBENCH=48375
IDSOLVER=1168
FILE ID=node017/2664927-1276683781
PBS_JOBID= 11172538
Free space on /tmp= 62540 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_10_4_4_8.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-2664927-1276683781/watcher-2664927-1276683781 -o /tmp/evaluation-result-2664927-1276683781/solver-2664927-1276683781 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2664927-1276683781.opb -t 1800 -m 1800

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

MD5SUM BENCH= 3d79ba0ee0b91a70716408d98d6e11cd
RANDOM SEED=1783341105

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

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

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1711376 kB
Buffers:        109724 kB
Cached:         141760 kB
SwapCached:      11780 kB
Active:         107628 kB
Inactive:       158552 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1711376 kB
SwapTotal:     4192956 kB
SwapFree:      4134608 kB
Dirty:            6532 kB
Writeback:          16 kB
AnonPages:       13112 kB
Mapped:           9372 kB
Slab:            59748 kB
PageTables:       3960 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   183024 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= 62532 MiB
End job on node017 at 2010-06-16 12:23:01