Trace number 3489095

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
SCIP spx E_2 2011-06-10 (fixed)SAT 1.37679 1.37731

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1111223596.opb
MD5SUMeda0156fba6759200dec5fbbafb5b94e
Bench CategoryDEC-SMALLINT-LIN (no optimisation, small integers, 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.527919
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables169
Total number of constraints101
Number of constraints which are clauses30
Number of constraints which are cardinality constraints (but not clauses)70
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint169
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 38
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 1216
Number of bits of the biggest sum of numbers11
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 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00	c Copyright (c) 2002-2011 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-3489095-1307750939.opb>
0.00/0.00	c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00	c problem read
0.00/0.00	c No objective function, only one solution is needed.
0.00/0.00	c presolving settings loaded
0.00/0.00	c presolving:
0.00/0.01	c (round 1) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.01	c (round 2) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.01	c presolving (3 rounds):
0.00/0.01	c  0 deleted vars, 28 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01	c  8 implications, 68 cliques
0.00/0.01	c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01	c       1 constraints of type <knapsack>
0.00/0.01	c      72 constraints of type <setppc>
0.00/0.01	c transformed objective value is always integral (scale: 1)
0.00/0.01	c Presolving Time: 0.01
0.00/0.01	c - non default parameters ----------------------------------------------------------------------
0.00/0.01	c # SCIP version 2.0.1.5
0.00/0.01	c 
0.00/0.01	c # frequency for displaying node information lines
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01	c display/freq = 10000
0.00/0.01	c 
0.00/0.01	c # maximal time in seconds to run
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01	c limits/time = 1797
0.00/0.01	c 
0.00/0.01	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01	c limits/memory = 13950
0.00/0.01	c 
0.00/0.01	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c limits/solutions = 1
0.00/0.01	c 
0.00/0.01	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01	c separating/maxrounds = 1
0.00/0.01	c 
0.00/0.01	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c separating/maxroundsroot = 5
0.00/0.01	c 
0.00/0.01	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01	c # [type: int, range: [1,2], default: 1]
0.00/0.01	c timing/clocktype = 2
0.00/0.01	c 
0.00/0.01	c # belongs reading time to solving time?
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c timing/reading = TRUE
0.00/0.01	c 
0.00/0.01	c # should presolving try to simplify inequalities
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/linear/simplifyinequalities = TRUE
0.00/0.01	c 
0.00/0.01	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/indicator/addCouplingCons = TRUE
0.00/0.01	c 
0.00/0.01	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01	c constraints/knapsack/disaggregation = FALSE
0.00/0.01	c 
0.00/0.01	c # should presolving try to simplify knapsacks
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01	c 
0.00/0.01	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c presolving/probing/maxrounds = 0
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/coefdiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01	c heuristics/crossover/freq = -1
0.00/0.01	c 
0.00/0.01	c # number of nodes added to the contingent of the total nodes
0.00/0.01	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01	c heuristics/crossover/nodesofs = 750
0.00/0.01	c 
0.00/0.01	c # number of nodes without incumbent change that heuristic should wait
0.00/0.01	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01	c heuristics/crossover/nwaitingnodes = 100
0.00/0.01	c 
0.00/0.01	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01	c # [type: real, range: [0,1], default: 0.1]
0.00/0.01	c heuristics/crossover/nodesquot = 0.15
0.00/0.01	c 
0.00/0.01	c # minimum percentage of integer variables that have to be fixed 
0.00/0.01	c # [type: real, range: [0,1], default: 0.666]
0.00/0.01	c heuristics/crossover/minfixingrate = 0.5
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01	c heuristics/feaspump/freq = -1
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/fracdiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/guideddiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/intshifting/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/linesearchdiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01	c heuristics/objpscostdiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01	c # [type: real, range: [0,1], default: 0.01]
0.00/0.01	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/oneopt/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/pscostdiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c heuristics/rens/freq = -1
0.00/0.01	c 
0.00/0.01	c # minimum percentage of integer variables that have to be fixable 
0.00/0.01	c # [type: real, range: [0,1], default: 0.5]
0.00/0.01	c heuristics/rens/minfixingrate = 0.3
0.00/0.01	c 
0.00/0.01	c # number of nodes added to the contingent of the total nodes
0.00/0.01	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01	c heuristics/rens/nodesofs = 2000
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01	c heuristics/rootsoldiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/rounding/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c heuristics/shiftandpropagate/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/shifting/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/simplerounding/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/subnlp/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c heuristics/trivial/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/trysol/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c heuristics/undercover/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/veclendiving/freq = -1
0.00/0.01	c 
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.01	c 
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.01	c 
0.00/0.01	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/zirounding/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c separating/cmir/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c separating/flowcover/freq = -1
0.00/0.01	c 
0.00/0.01	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c separating/rapidlearning/freq = 0
0.00/0.01	c 
0.00/0.01	c -----------------------------------------------------------------------------------------------
0.00/0.01	c start solving
0.00/0.01	c 
0.00/0.01	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.01	c   0.0s|     1 |     0 |   131 |     - | 770k|   0 |  42 | 169 |  73 | 169 |  73 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.00/0.04	c   0.0s|     1 |     0 |   159 |     - |1234k|   0 |  51 | 169 | 113 | 169 |  86 |  13 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.00/0.04	c   0.0s|     1 |     0 |   177 |     - |1241k|   0 |  57 | 169 | 113 | 169 |  94 |  21 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.03/0.05	c   0.1s|     1 |     0 |   180 |     - |1243k|   0 |  57 | 169 | 113 | 169 |  96 |  23 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.03/0.06	c   0.1s|     1 |     0 |   194 |     - |1248k|   0 |  60 | 169 | 113 | 169 |  98 |  25 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.03/0.06	c   0.1s|     1 |     0 |   197 |     - |1250k|   0 |  60 | 169 | 113 | 169 | 101 |  28 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.15	c   0.2s|     1 |     0 |   219 |     - |1246k|   0 |  59 | 169 | 109 | 169 | 101 |  28 |   0 |  13 | 0.000000e+00 |      --      |    Inf 
0.19/0.24	c   0.2s|     1 |     0 |   231 |     - |1219k|   0 |  60 | 169 |  86 | 169 | 101 |  28 |   0 |  24 | 0.000000e+00 |      --      |    Inf 
0.29/0.32	c   0.3s|     1 |     0 |   256 |     - |1219k|   0 |  57 | 169 |  86 | 169 | 101 |  28 |   0 |  35 | 0.000000e+00 |      --      |    Inf 
0.29/0.37	c   0.4s|     1 |     0 |   271 |     - |1219k|   0 |  56 | 169 |  86 | 169 | 101 |  28 |   0 |  42 | 0.000000e+00 |      --      |    Inf 
0.39/0.43	c   0.4s|     1 |     0 |   284 |     - |1219k|   0 |  56 | 169 |  86 | 169 | 101 |  28 |   0 |  48 | 0.000000e+00 |      --      |    Inf 
0.49/0.50	c   0.5s|     1 |     0 |   301 |     - |1219k|   0 |  53 | 169 |  86 | 169 |  97 |  28 |   0 |  58 | 0.000000e+00 |      --      |    Inf 
0.49/0.54	c   0.5s|     1 |     0 |   313 |     - |1219k|   0 |  54 | 169 |  86 | 169 |  97 |  28 |   0 |  64 | 0.000000e+00 |      --      |    Inf 
0.59/0.62	c   0.6s|     1 |     0 |   326 |     - |1219k|   0 |  52 | 169 |  86 | 169 |  97 |  28 |   0 |  76 | 0.000000e+00 |      --      |    Inf 
0.59/0.65	c   0.6s|     1 |     0 |   326 |     - |1219k|   0 |   - | 169 |  86 | 169 |  97 |  28 |   0 |  81 | 0.000000e+00 |      --      |    Inf 
0.59/0.65	c (run 1, node 1) restarting after 37 global fixings of integer variables
0.59/0.65	c 
0.59/0.65	c (restart) converted 24 cuts from the global cut pool into linear constraints
0.59/0.65	c 
0.59/0.65	c presolving:
0.59/0.65	c (round 1) 37 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 80 clqs
0.59/0.65	c (round 2) 37 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 36 upgd conss, 14 impls, 80 clqs
0.59/0.66	c (round 3) 37 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 4 chg coeffs, 36 upgd conss, 14 impls, 80 clqs
0.59/0.66	c (round 4) 37 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 7 chg coeffs, 36 upgd conss, 14 impls, 80 clqs
0.59/0.66	c (round 5) 37 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 9 chg coeffs, 36 upgd conss, 14 impls, 80 clqs
0.59/0.66	c presolving (6 rounds):
0.59/0.66	c  37 deleted vars, 1 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 9 changed coefficients
0.59/0.66	c  14 implications, 80 cliques
0.59/0.66	c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 109 constraints
0.59/0.66	c      10 constraints of type <knapsack>
0.59/0.66	c      86 constraints of type <setppc>
0.59/0.66	c      13 constraints of type <logicor>
0.59/0.66	c transformed objective value is always integral (scale: 1)
0.59/0.66	c Presolving Time: 0.01
0.59/0.66	c 
0.59/0.66	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.59/0.66	c   0.7s|     1 |     0 |   426 |     - | 898k|   0 |  43 | 132 | 109 | 132 |  96 |   0 |   0 |  81 | 0.000000e+00 |      --      |    Inf 
0.59/0.67	c   0.7s|     1 |     0 |   455 |     - |1176k|   0 |  53 | 132 | 109 | 132 | 111 |  15 |   0 |  81 | 0.000000e+00 |      --      |    Inf 
0.69/0.77	c   0.8s|     1 |     0 |   469 |     - |1176k|   0 |  55 | 132 | 108 | 132 | 111 |  15 |   0 | 101 | 0.000000e+00 |      --      |    Inf 
0.79/0.86	c   0.9s|     1 |     0 |   483 |     - |1175k|   0 |  56 | 132 | 106 | 132 | 111 |  15 |   0 | 118 | 0.000000e+00 |      --      |    Inf 
0.89/0.95	c   1.0s|     1 |     0 |   495 |     - |1175k|   0 |  53 | 132 | 106 | 132 | 111 |  15 |   0 | 139 | 0.000000e+00 |      --      |    Inf 
0.89/0.98	c   1.0s|     1 |     0 |   510 |     - |1174k|   0 |  51 | 132 | 104 | 132 | 111 |  15 |   0 | 144 | 0.000000e+00 |      --      |    Inf 
0.99/1.04	c   1.0s|     1 |     0 |   524 |     - |1174k|   0 |  51 | 132 | 103 | 132 | 111 |  15 |   0 | 156 | 0.000000e+00 |      --      |    Inf 
0.99/1.06	c   1.1s|     1 |     0 |   524 |     - |1173k|   0 |   - | 132 | 103 | 132 | 111 |  15 |   0 | 162 | 0.000000e+00 |      --      |    Inf 
0.99/1.06	c (run 2, node 1) restarting after 30 global fixings of integer variables
0.99/1.06	c 
0.99/1.06	c (restart) converted 15 cuts from the global cut pool into linear constraints
0.99/1.06	c 
0.99/1.07	c presolving:
0.99/1.07	c (round 1) 30 del vars, 10 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 15 upgd conss, 26 impls, 78 clqs
0.99/1.07	c (round 2) 30 del vars, 14 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 15 upgd conss, 26 impls, 78 clqs
0.99/1.07	c presolving (3 rounds):
0.99/1.07	c  30 deleted vars, 14 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.99/1.07	c  26 implications, 78 cliques
0.99/1.07	c presolved problem has 102 variables (102 bin, 0 int, 0 impl, 0 cont) and 104 constraints
0.99/1.07	c      19 constraints of type <knapsack>
0.99/1.07	c      85 constraints of type <setppc>
0.99/1.07	c transformed objective value is always integral (scale: 1)
0.99/1.07	c Presolving Time: 0.02
0.99/1.07	c 
0.99/1.07	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.99/1.07	c   1.1s|     1 |     0 |   605 |     - | 938k|   0 |  47 | 102 | 104 | 102 | 104 |   0 |   0 | 162 | 0.000000e+00 |      --      |    Inf 
0.99/1.08	c   1.1s|     1 |     0 |   631 |     - |1178k|   0 |  52 | 102 | 104 | 102 | 115 |  11 |   0 | 162 | 0.000000e+00 |      --      |    Inf 
1.10/1.15	c   1.2s|     1 |     0 |   659 |     - |1178k|   0 |  52 | 102 | 104 | 102 | 115 |  11 |   0 | 183 | 0.000000e+00 |      --      |    Inf 
1.19/1.21	c   1.2s|     1 |     0 |   676 |     - |1178k|   0 |  50 | 102 | 104 | 102 | 115 |  11 |   0 | 200 | 0.000000e+00 |      --      |    Inf 
1.19/1.25	c   1.2s|     1 |     0 |   687 |     - |1178k|   0 |  53 | 102 | 103 | 102 | 115 |  11 |   0 | 213 | 0.000000e+00 |      --      |    Inf 
1.19/1.26	c   1.3s|     1 |     0 |   696 |     - |1177k|   0 |  49 | 102 | 101 | 102 | 115 |  11 |   0 | 219 | 0.000000e+00 |      --      |    Inf 
1.19/1.28	c   1.3s|     1 |     0 |   696 |     - |1177k|   0 |   - | 102 | 101 | 102 | 115 |  11 |   0 | 227 | 0.000000e+00 |      --      |    Inf 
1.19/1.28	c (run 3, node 1) restarting after 24 global fixings of integer variables
1.19/1.28	c 
1.19/1.28	c (restart) converted 11 cuts from the global cut pool into linear constraints
1.19/1.28	c 
1.19/1.28	c presolving:
1.19/1.29	c (round 1) 24 del vars, 3 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 11 upgd conss, 40 impls, 76 clqs
1.19/1.29	c (round 2) 24 del vars, 6 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 11 upgd conss, 40 impls, 76 clqs
1.19/1.29	c presolving (3 rounds):
1.19/1.29	c  24 deleted vars, 6 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 3 changed coefficients
1.19/1.29	c  40 implications, 76 cliques
1.19/1.29	c presolved problem has 78 variables (78 bin, 0 int, 0 impl, 0 cont) and 106 constraints
1.19/1.29	c      24 constraints of type <knapsack>
1.19/1.29	c      82 constraints of type <setppc>
1.19/1.29	c transformed objective value is always integral (scale: 1)
1.19/1.29	c Presolving Time: 0.03
1.19/1.29	c 
1.19/1.29	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.19/1.29	c   1.3s|     1 |     0 |   755 |     - | 932k|   0 |  41 |  78 | 106 |  78 | 106 |   0 |   0 | 227 | 0.000000e+00 |      --      |    Inf 
1.29/1.30	c   1.3s|     1 |     0 |   775 |     - |1142k|   0 |  46 |  78 | 106 |  78 | 116 |  10 |   0 | 227 | 0.000000e+00 |      --      |    Inf 
1.29/1.32	c   1.3s|     1 |     0 |   791 |     - |1142k|   0 |  47 |  78 | 106 |  78 | 116 |  10 |   0 | 241 | 0.000000e+00 |      --      |    Inf 
1.29/1.34	c   1.3s|     1 |     0 |   910 |     - |1141k|   0 |  39 |  78 | 105 |  78 | 116 |  10 |   0 | 248 | 0.000000e+00 |      --      |    Inf 
1.29/1.35	c   1.4s|     1 |     0 |   931 |     - |1140k|   0 |  30 |  78 | 101 |  78 | 116 |  10 |   0 | 259 | 0.000000e+00 |      --      |    Inf 
1.29/1.36	c   1.4s|     1 |     0 |   931 |     - |1140k|   0 |   - |  78 | 101 |  78 | 116 |  10 |   0 | 264 | 0.000000e+00 |      --      |    Inf 
1.29/1.36	c (run 4, node 1) restarting after 20 global fixings of integer variables
1.29/1.36	c 
1.29/1.36	c (restart) converted 10 cuts from the global cut pool into linear constraints
1.29/1.36	c 
1.29/1.36	c presolving:
1.29/1.36	c (round 1) 44 del vars, 18 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 10 chg coeffs, 0 upgd conss, 72 impls, 32 clqs
1.29/1.36	c (round 2) 52 del vars, 36 del conss, 0 add conss, 0 chg bounds, 70 chg sides, 116 chg coeffs, 9 upgd conss, 90 impls, 25 clqs
1.29/1.37	c (round 3) 53 del vars, 44 del conss, 0 add conss, 0 chg bounds, 106 chg sides, 216 chg coeffs, 9 upgd conss, 98 impls, 37 clqs
1.29/1.37	c (round 4) 75 del vars, 71 del conss, 0 add conss, 0 chg bounds, 122 chg sides, 299 chg coeffs, 9 upgd conss, 154 impls, 1 clqs
1.29/1.37	c presolving (5 rounds):
1.29/1.37	c  78 deleted vars, 111 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 122 changed sides, 299 changed coefficients
1.29/1.37	c  154 implications, 0 cliques
1.29/1.37	c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
1.29/1.37	c transformed objective value is always integral (scale: 1)
1.29/1.37	c Presolving Time: 0.04
1.29/1.37	c 
1.29/1.37	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.29/1.37	c * 1.4s|     1 |     0 |   931 |     - | 659k|   0 |   - |   0 |   0 |   0 |   0 |   0 |   0 | 264 | 0.000000e+00 | 0.000000e+00 |   0.00%
1.29/1.37	c   1.4s|     1 |     0 |   931 |     - | 659k|   0 |   - |   0 |   0 |   0 |   0 |   0 |   0 | 264 | 0.000000e+00 | 0.000000e+00 |   0.00%
1.29/1.37	c 
1.29/1.37	c SCIP Status        : problem is solved [optimal solution found]
1.29/1.37	c Solving Time (sec) : 1.37
1.29/1.37	c Solving Nodes      : 1 (total of 5 nodes in 5 runs)
1.29/1.37	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
1.29/1.37	c Dual Bound         : +0.00000000000000e+00
1.29/1.37	c Gap                : 0.00 %
1.29/1.37	s SATISFIABLE
1.29/1.37	v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 
1.29/1.37	v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 x128 -x127 
1.29/1.37	v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 x110 -x109 -x108 -x107 -x106 
1.29/1.37	v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 x94 -x93 -x92 -x91 -x90 -x89 x88 -x87 -x86 -x85 -x84 -x83 -x82 
1.29/1.37	v -x81 -x80 -x79 -x78 x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 
1.29/1.37	v -x56 -x55 -x54 x53 -x52 -x51 -x50 -x49 -x48 x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 x31 
1.29/1.37	v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 
1.29/1.37	v -x4 -x3 -x2 -x1 
1.29/1.37	c SCIP Status        : problem is solved [optimal solution found]
1.29/1.37	c Total Time         :       1.37
1.29/1.37	c   solving          :       1.37
1.29/1.37	c   presolving       :       0.04 (included in solving)
1.29/1.37	c   reading          :       0.00 (included in solving)
1.29/1.37	c Original Problem   :
1.29/1.37	c   Problem name     : HOME/instance-3489095-1307750939.opb
1.29/1.37	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.37	c   Constraints      : 101 initial, 101 maximal
1.29/1.37	c Presolved Problem  :
1.29/1.37	c   Problem name     : t_HOME/instance-3489095-1307750939.opb
1.29/1.37	c   Variables        : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.37	c   Constraints      : 0 initial, 0 maximal
1.29/1.37	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
1.29/1.37	c   trivial          :       0.00        114          0          0          0          0          0          0          0          0
1.29/1.37	c   dualfix          :       0.00          0          0          0          0          0          0          0          0          0
1.29/1.37	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
1.29/1.37	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
1.29/1.37	c   pseudoobj        :       0.00          0          0          0          0          0          0          0          0          0
1.29/1.37	c   implics          :       0.00          0          0          0          0          0          0          0          0          0
1.29/1.37	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
1.29/1.37	c   knapsack         :       0.02          5          0          0          0          0         29          0        122        311
1.29/1.37	c   setppc           :       0.00         39         11          0          0          0         92          0          0          0
1.29/1.37	c   linear           :       0.00          0          0          0          0          0         30          0          1          0
1.29/1.37	c   logicor          :       0.00          0          0          0          0          0          9          0          0          0
1.29/1.37	c   root node        :          -        111          -          -        111          -          -          -          -          -
1.29/1.37	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
1.29/1.37	c   integral         :          0          0          0         24          0          7          0          0        111          0          0          0
1.29/1.37	c   countsols        :          0          0          0          0          0          3          0          0          0          0          0          0
1.29/1.37	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
1.29/1.37	c   integral         :       1.22       0.00       0.00       1.22       0.00       0.00       0.00
1.29/1.37	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
1.29/1.37	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
1.29/1.37	c   vbounds          :          0          0          0          0
1.29/1.37	c   rootredcost      :          0          0          0          0
1.29/1.37	c   pseudoobj        :          0          0          0          0
1.29/1.37	c Propagator Timings :  TotalTime  Propagate    Resprop
1.29/1.37	c   vbounds          :       0.00       0.00       0.00
1.29/1.37	c   rootredcost      :       0.00       0.00       0.00
1.29/1.37	c   pseudoobj        :       0.00       0.00       0.00
1.29/1.37	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.29/1.37	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
1.29/1.37	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.29/1.37	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.29/1.37	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.29/1.37	c   pseudo solution  :       0.00          1          0          0        0.0          0        0.0          -
1.29/1.37	c   applied globally :          -          -          -          0        0.0          -          -          -
1.29/1.37	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.29/1.37	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.29/1.37	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
1.29/1.37	c   redcost          :       0.00          8          0          0          0          0
1.29/1.37	c   impliedbounds    :       0.00          8          0          0          0          0
1.29/1.37	c   intobj           :       0.00          0          0          0          0          0
1.29/1.37	c   gomory           :       0.02          8          0          0         55          0
1.29/1.37	c   cgmip            :       0.00          0          0          0          0          0
1.29/1.37	c   closecuts        :       0.00          0          0          0          0          0
1.29/1.37	c   strongcg         :       0.02          8          0          0        308          0
1.29/1.37	c   cmir             :       0.00          0          0          0          0          0
1.29/1.37	c   flowcover        :       0.00          0          0          0          0          0
1.29/1.37	c   clique           :       0.00          8          0          0         37          0
1.29/1.37	c   zerohalf         :       0.00          0          0          0          0          0
1.29/1.37	c   mcf              :       0.00          4          0          0          0          0
1.29/1.37	c   oddcycle         :       0.00          0          0          0          0          0
1.29/1.37	c   rapidlearning    :       0.02          1          0          0          0         40
1.29/1.37	c Pricers            :       Time      Calls       Vars
1.29/1.37	c   problem variables:       0.00          0          0
1.29/1.37	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.29/1.37	c   relpscost        :       1.22         24          0        111          0          0          0
1.29/1.37	c   pscost           :       0.00          0          0          0          0          0          0
1.29/1.37	c   inference        :       0.00          0          0          0          0          0          0
1.29/1.37	c   mostinf          :       0.00          0          0          0          0          0          0
1.29/1.37	c   leastinf         :       0.00          0          0          0          0          0          0
1.29/1.37	c   fullstrong       :       0.00          0          0          0          0          0          0
1.29/1.37	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.29/1.37	c   random           :       0.00          0          0          0          0          0          0
1.29/1.37	c Primal Heuristics  :       Time      Calls      Found
1.29/1.37	c   LP solutions     :       0.00          -          0
1.29/1.37	c   pseudo solutions :       0.00          -          0
1.29/1.37	c   trivial          :       0.00          1          0
1.29/1.37	c   shiftandpropagate:       0.00          0          0
1.29/1.37	c   simplerounding   :       0.00          0          0
1.29/1.37	c   zirounding       :       0.00          0          0
1.29/1.37	c   rounding         :       0.00          0          0
1.29/1.37	c   shifting         :       0.00          0          0
1.29/1.37	c   intshifting      :       0.00          0          0
1.29/1.37	c   oneopt           :       0.00          0          0
1.29/1.37	c   twoopt           :       0.00          0          0
1.29/1.37	c   fixandinfer      :       0.00          0          0
1.29/1.37	c   feaspump         :       0.00          0          0
1.29/1.37	c   clique           :       0.00          0          0
1.29/1.37	c   coefdiving       :       0.00          0          0
1.29/1.37	c   pscostdiving     :       0.00          0          0
1.29/1.37	c   fracdiving       :       0.00          0          0
1.29/1.37	c   veclendiving     :       0.00          0          0
1.29/1.37	c   intdiving        :       0.00          0          0
1.29/1.37	c   actconsdiving    :       0.00          0          0
1.29/1.37	c   objpscostdiving  :       0.00          0          0
1.29/1.37	c   rootsoldiving    :       0.00          0          0
1.29/1.37	c   linesearchdiving :       0.00          0          0
1.29/1.37	c   guideddiving     :       0.00          0          0
1.29/1.37	c   octane           :       0.00          0          0
1.29/1.37	c   rens             :       0.00          0          0
1.29/1.37	c   rins             :       0.00          0          0
1.29/1.37	c   localbranching   :       0.00          0          0
1.29/1.37	c   mutation         :       0.00          0          0
1.29/1.37	c   crossover        :       0.00          0          0
1.29/1.37	c   dins             :       0.00          0          0
1.29/1.37	c   vbounds          :       0.00          0          0
1.29/1.37	c   undercover       :       0.00          0          0
1.29/1.37	c   subnlp           :       0.00          0          0
1.29/1.37	c   trysol           :       0.00          0          0
1.29/1.37	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.29/1.37	c   primal LP        :       0.00          0          0       0.00          -
1.29/1.37	c   dual LP          :       0.03         32        931      29.09   34293.50
1.29/1.37	c   lex dual LP      :       0.00          0          0       0.00          -
1.29/1.37	c   barrier LP       :       0.00          0          0       0.00          -
1.29/1.37	c   diving/probing LP:       0.00          0          0       0.00          -
1.29/1.37	c   strong branching :       1.22        264      41926     158.81   34376.00
1.29/1.37	c     (at root node) :          -        264      41926     158.81          -
1.29/1.37	c   conflict analysis:       0.00          0          0       0.00          -
1.29/1.37	c B&B Tree           :
1.29/1.37	c   number of runs   :          5
1.29/1.37	c   nodes            :          1
1.29/1.37	c   nodes (total)    :          5
1.29/1.37	c   nodes left       :          0
1.29/1.37	c   max depth        :          0
1.29/1.37	c   max depth (total):          0
1.29/1.37	c   backtracks       :          0 (0.0%)
1.29/1.37	c   delayed cutoffs  :          0
1.29/1.37	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
1.29/1.37	c   avg switch length:       2.00
1.29/1.37	c   switching time   :       0.00
1.29/1.37	c Solution           :
1.29/1.37	c   Solutions found  :          1 (1 improvements)
1.29/1.37	c   First Solution   : +0.00000000000000e+00   (in run 5, after 1 nodes, 1.37 seconds, depth 0, found by <relaxation>)
1.29/1.37	c   Primal Bound     : +0.00000000000000e+00   (in run 5, after 1 nodes, 1.37 seconds, depth 0, found by <relaxation>)
1.29/1.37	c   Dual Bound       : +0.00000000000000e+00
1.29/1.37	c   Gap              :       0.00 %
1.29/1.37	c   Root Dual Bound  : +0.00000000000000e+00
1.29/1.37	c   Root Iterations  :        931
1.29/1.37	c Time complete: 1.36.

Verifier Data 

OK	0

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.1 (svn: 988)

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3489095-1307750939/watcher-3489095-1307750939 -o /tmp/evaluation-result-3489095-1307750939/solver-3489095-1307750939 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3489095-1307750939.opb -t 1800 -m 15500 

running on 4 cores: 1,3,5,7

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): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 1.82 1.79 1.08 2/177 3914
/proc/meminfo: memFree=31914448/32951124 swapFree=67050780/67111528
[pid=3914] ppid=3912 vsize=12700 CPUtime=0 cores=1,3,5,7
/proc/3914/stat : 3914 (scip-2.0.1.4b_2) R 3912 3914 1779 0 -1 4202496 2153 0 0 0 0 0 0 0 25 0 1 0 886696645 13004800 2107 33554432000 4194304 9016284 140735976690880 18446744073709551615 7824814 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/3914/statm: 3175 2107 357 1178 0 1993 0

[startup+0.0501631 s]
/proc/loadavg: 1.82 1.79 1.08 2/177 3914
/proc/meminfo: memFree=31914448/32951124 swapFree=67050780/67111528
[pid=3914] ppid=3912 vsize=29132 CPUtime=0.03 cores=1,3,5,7
/proc/3914/stat : 3914 (scip-2.0.1.4b_2) R 3912 3914 1779 0 -1 4202496 6924 0 0 0 3 0 0 0 18 0 1 0 886696645 29831168 5915 33554432000 4194304 9016284 140735976690880 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3914/statm: 7283 5915 680 1178 0 6101 0
Current children cumulated CPU time (s) 0.03
Current children cumulated vsize (KiB) 29132

[startup+0.10116 s]
/proc/loadavg: 1.82 1.79 1.08 2/177 3914
/proc/meminfo: memFree=31914448/32951124 swapFree=67050780/67111528
[pid=3914] ppid=3912 vsize=29132 CPUtime=0.09 cores=1,3,5,7
/proc/3914/stat : 3914 (scip-2.0.1.4b_2) R 3912 3914 1779 0 -1 4202496 6953 0 0 0 8 1 0 0 18 0 1 0 886696645 29831168 5944 33554432000 4194304 9016284 140735976690880 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3914/statm: 7283 5944 681 1178 0 6101 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 29132

[startup+0.300115 s]
/proc/loadavg: 1.82 1.79 1.08 2/177 3914
/proc/meminfo: memFree=31914448/32951124 swapFree=67050780/67111528
[pid=3914] ppid=3912 vsize=29132 CPUtime=0.29 cores=1,3,5,7
/proc/3914/stat : 3914 (scip-2.0.1.4b_2) R 3912 3914 1779 0 -1 4202496 6963 0 0 0 25 4 0 0 18 0 1 0 886696645 29831168 5954 33554432000 4194304 9016284 140735976690880 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3914/statm: 7283 5954 681 1178 0 6101 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 29132

[startup+0.701041 s]
/proc/loadavg: 1.82 1.79 1.08 2/177 3914
/proc/meminfo: memFree=31914448/32951124 swapFree=67050780/67111528
[pid=3914] ppid=3912 vsize=28972 CPUtime=0.69 cores=1,3,5,7
/proc/3914/stat : 3914 (scip-2.0.1.4b_2) R 3912 3914 1779 0 -1 4202496 7124 0 0 0 60 9 0 0 18 0 1 0 886696645 29667328 6080 33554432000 4194304 9016284 140735976690880 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3914/statm: 7243 6080 686 1178 0 6061 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 28972

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

[startup+1.10597 s]
/proc/loadavg: 1.82 1.79 1.08 3/178 3915
/proc/meminfo: memFree=31892888/32951124 swapFree=67050780/67111528
[pid=3914] ppid=3912 vsize=28812 CPUtime=1.1 cores=1,3,5,7
/proc/3914/stat : 3914 (scip-2.0.1.4b_2) R 3912 3914 1779 0 -1 4202496 7216 0 0 0 95 15 0 0 18 0 1 0 886696645 29503488 6142 33554432000 4194304 9016284 140735976690880 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3914/statm: 7203 6142 686 1178 0 6021 0
Current children cumulated CPU time (s) 1.1
Current children cumulated vsize (KiB) 28812

[startup+1.30094 s]
/proc/loadavg: 1.82 1.79 1.08 3/178 3915
/proc/meminfo: memFree=31892888/32951124 swapFree=67050780/67111528
[pid=3914] ppid=3912 vsize=28812 CPUtime=1.29 cores=1,3,5,7
/proc/3914/stat : 3914 (scip-2.0.1.4b_2) R 3912 3914 1779 0 -1 4202496 7216 0 0 0 112 17 0 0 18 0 1 0 886696645 29503488 6142 33554432000 4194304 9016284 140735976690880 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3914/statm: 7203 6142 686 1178 0 6021 0
Current children cumulated CPU time (s) 1.29
Current children cumulated vsize (KiB) 28812

Child status: 0
Real time (s): 1.37731
CPU time (s): 1.37679
CPU user time (s): 1.18782
CPU system time (s): 0.188971
CPU usage (%): 99.9621
Max. virtual memory (cumulated for all children) (KiB): 29132

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.18782
system time used= 0.188971
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 7227
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.004999 second user time and 0.008998 second system time

The end

Launcher Data 

Begin job on node101 at 2011-06-11 02:08:59
IDJOB=3489095
IDBENCH=1218
IDSOLVER=1979
FILE ID=node101/3489095-1307750939
RUNJOBID= node101-1307750183-1798
PBS_JOBID= 13550859
Free space on /tmp= 74092 MiB

SOLVER NAME= SCIP spx E_2 2011-06-10 (fixed)
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/wnqueen/normalized-t2001.13queen13.1111223596.opb
COMMAND LINE= HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3489095-1307750939/watcher-3489095-1307750939 -o /tmp/evaluation-result-3489095-1307750939/solver-3489095-1307750939 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3489095-1307750939.opb -t 1800 -m 15500

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 15500 MiB
NBCORE= 4

MD5SUM BENCH= eda0156fba6759200dec5fbbafb5b94e
RANDOM SEED=373919470

node101.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	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.841
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5333.68
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.841
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5226.07
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 2
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.841
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.77
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 3
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.841
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.83
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 4
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.841
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.74
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 5
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.841
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.83
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 6
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.841
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 7
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.841
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.83
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32951124 kB
MemFree:      31914752 kB
Buffers:        171872 kB
Cached:         609328 kB
SwapCached:      27752 kB
Active:         281068 kB
Inactive:       579600 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32951124 kB
LowFree:      31914752 kB
SwapTotal:    67111528 kB
SwapFree:     67050780 kB
Dirty:           17620 kB
Writeback:           0 kB
AnonPages:       73420 kB
Mapped:          11996 kB
Slab:           111012 kB
PageTables:       4760 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83587088 kB
Committed_AS:   257496 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    296008 kB
VmallocChunk: 34359440975 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 74076 MiB
End job on node101 at 2011-06-11 02:09:00