Trace number 2704495

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
SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverUNSAT 0.132979 0.133561

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/
submitted-PB06/roussel/normalized-pigeon-cardinality-55-50.opb
MD5SUM277dd35641d3866b31d8fb041eb7f9fb
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
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.132979
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables2750
Total number of constraints105
Number of constraints which are clauses55
Number of constraints which are cardinality constraints (but not clauses)50
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint50
Maximum length of a constraint55
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 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 56
Number of bits of the biggest sum of numbers6
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

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

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-2704495-1278561057/watcher-2704495-1278561057 -o /tmp/evaluation-result-2704495-1278561057/solver-2704495-1278561057 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704495-1278561057.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.91 0.98 0.99 3/105 31020
/proc/meminfo: memFree=1873684/2059040 swapFree=4135728/4192956
[pid=31020] ppid=31018 vsize=7904 CPUtime=0
/proc/31020/stat : 31020 (pbscip.linux.x8) R 31018 31020 30914 0 -1 4202496 1125 0 0 0 0 0 0 0 25 0 1 0 24314046 8093696 1036 1992294400 4194304 8395647 140737261591264 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/31020/statm: 1976 1042 365 1026 0 946 0

[startup+0.104879 s]
/proc/loadavg: 0.91 0.98 0.99 3/105 31020
/proc/meminfo: memFree=1873684/2059040 swapFree=4135728/4192956
[pid=31020] ppid=31018 vsize=23044 CPUtime=0.1
/proc/31020/stat : 31020 (pbscip.linux.x8) R 31018 31020 30914 0 -1 4202496 5331 0 0 0 9 1 0 0 25 0 1 0 24314046 23597056 4870 1992294400 4194304 8395647 140737261591264 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31020/statm: 5761 4870 550 1026 0 4731 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 23044

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

[startup+0.104879 s]
/proc/loadavg: 0.91 0.98 0.99 3/105 31020
/proc/meminfo: memFree=1873684/2059040 swapFree=4135728/4192956
[pid=31020] ppid=31018 vsize=23044 CPUtime=0.1
/proc/31020/stat : 31020 (pbscip.linux.x8) R 31018 31020 30914 0 -1 4202496 5331 0 0 0 9 1 0 0 25 0 1 0 24314046 23597056 4870 1992294400 4194304 8395647 140737261591264 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31020/statm: 5761 4870 550 1026 0 4731 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 23044

Child status: 0
Real time (s): 0.133561
CPU time (s): 0.132979
CPU user time (s): 0.116982
CPU system time (s): 0.015997
CPU usage (%): 99.5642
Max. virtual memory (cumulated for all children) (KiB): 23044

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

runsolver used 0.001999 second user time and 0.013997 second system time

The end

Launcher Data 

Begin job on node088 at 2010-07-08 05:50:57
IDJOB=2704495
IDBENCH=2573
IDSOLVER=1213
FILE ID=node088/2704495-1278561057
PBS_JOBID= 11239544
Free space on /tmp= 62520 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB06/final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/roussel/normalized-pigeon-cardinality-55-50.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2704495-1278561057/watcher-2704495-1278561057 -o /tmp/evaluation-result-2704495-1278561057/solver-2704495-1278561057 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704495-1278561057.opb -t 1800 -m 1800

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

MD5SUM BENCH= 277dd35641d3866b31d8fb041eb7f9fb
RANDOM SEED=1444666372

node088.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.245
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.49
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.245
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.50
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1874212 kB
Buffers:         10232 kB
Cached:          84652 kB
SwapCached:      10100 kB
Active:          43368 kB
Inactive:        64328 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1874212 kB
SwapTotal:     4192956 kB
SwapFree:      4135728 kB
Dirty:           10520 kB
Writeback:           4 kB
AnonPages:       11260 kB
Mapped:           8280 kB
Slab:            55312 kB
PageTables:       4184 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   178156 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= 62508 MiB
End job on node088 at 2010-07-08 05:50:57