Trace number 2704012

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 solverSAT 2.12268 2.12197

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1110969933.opb
MD5SUMbc1af809c45d4fb609c4a61db7aef018
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
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.070988
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 1252
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 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-2704012-1278548320.opb>
0.00/0.01	c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01	c problem read
0.00/0.01	c No objective function, only one solution is needed.
0.00/0.01	c presolving settings loaded
0.00/0.02	c presolving:
0.00/0.02	c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.01/0.03	c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.01/0.03	c presolving (3 rounds):
0.01/0.03	c  0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03	c  8 implications, 68 cliques
0.01/0.03	c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.01/0.03	c       1 constraints of type <knapsack>
0.01/0.03	c      72 constraints of type <setppc>
0.01/0.03	c transformed objective value is always integral (scale: 1)
0.01/0.03	c Presolving Time: 0.01
0.01/0.03	c - non default parameters ----------------------------------------------------------------------
0.01/0.03	c # SCIP version 1.2.1.3
0.01/0.03	c 
0.01/0.03	c # frequency for displaying node information lines
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03	c display/freq = 10000
0.01/0.03	c 
0.01/0.03	c # maximal time in seconds to run
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03	c limits/time = 1789.99
0.01/0.03	c 
0.01/0.03	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03	c limits/memory = 1620
0.01/0.03	c 
0.01/0.03	c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03	c limits/solutions = 1
0.01/0.03	c 
0.01/0.03	c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.03	c separating/maxrounds = 1
0.01/0.03	c 
0.01/0.03	c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03	c separating/maxroundsroot = 5
0.01/0.03	c 
0.01/0.03	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.03	c # [type: int, range: [1,2], default: 1]
0.01/0.03	c timing/clocktype = 2
0.01/0.03	c 
0.01/0.03	c # should presolving try to simplify inequalities
0.01/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03	c constraints/linear/simplifyinequalities = TRUE
0.01/0.03	c 
0.01/0.03	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03	c constraints/indicator/addCouplingCons = TRUE
0.01/0.03	c 
0.01/0.03	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.03	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.03	c constraints/knapsack/disaggregation = FALSE
0.01/0.03	c 
0.01/0.03	c # should presolving try to simplify knapsacks
0.01/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03	c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03	c 
0.01/0.03	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03	c presolving/probing/maxrounds = 0
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/coefdiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.03	c heuristics/crossover/freq = -1
0.01/0.03	c 
0.01/0.03	c # number of nodes added to the contingent of the total nodes
0.01/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03	c heuristics/crossover/nodesofs = 750
0.01/0.03	c 
0.01/0.03	c # number of nodes without incumbent change that heuristic should wait
0.01/0.03	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.03	c heuristics/crossover/nwaitingnodes = 100
0.01/0.03	c 
0.01/0.03	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.03	c # [type: real, range: [0,1], default: 0.1]
0.01/0.03	c heuristics/crossover/nodesquot = 0.15
0.01/0.03	c 
0.01/0.03	c # minimum percentage of integer variables that have to be fixed 
0.01/0.03	c # [type: real, range: [0,1], default: 0.666]
0.01/0.03	c heuristics/crossover/minfixingrate = 0.5
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03	c heuristics/feaspump/freq = -1
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/fracdiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/guideddiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/intshifting/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/linesearchdiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/nlp/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03	c heuristics/objpscostdiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.03	c # [type: real, range: [0,1], default: 0.01]
0.01/0.03	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/oneopt/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/pscostdiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03	c heuristics/rens/freq = -1
0.01/0.03	c 
0.01/0.03	c # minimum percentage of integer variables that have to be fixable 
0.01/0.03	c # [type: real, range: [0,1], default: 0.5]
0.01/0.03	c heuristics/rens/minfixingrate = 0.3
0.01/0.03	c 
0.01/0.03	c # number of nodes added to the contingent of the total nodes
0.01/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03	c heuristics/rens/nodesofs = 2000
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03	c heuristics/rootsoldiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.03	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/rounding/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/shifting/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/simplerounding/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03	c heuristics/trivial/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/trysol/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/veclendiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/zirounding/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03	c separating/cmir/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03	c separating/flowcover/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03	c separating/rapidlearning/freq = 0
0.01/0.03	c 
0.01/0.03	c -----------------------------------------------------------------------------------------------
0.01/0.03	c start solving
0.01/0.03	c 
0.01/0.03	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.01/0.03	c   0.0s|     1 |     0 |    82 |     - | 743k|   0 |  42 | 169 |  73 | 169 |  73 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.22	c   0.2s|     1 |     0 |   112 |     - |1152k|   0 |  49 | 169 | 205 | 169 |  88 |  15 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.24	c   0.2s|     1 |     0 |   159 |     - |1389k|   0 |  59 | 169 | 205 | 169 |  95 |  22 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.26	c   0.2s|     1 |     0 |   206 |     - |1489k|   0 |  54 | 169 | 205 | 169 |  99 |  26 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.29	c   0.3s|     1 |     0 |   282 |     - |1535k|   0 |  52 | 169 | 205 | 169 | 103 |  30 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.31	c   0.3s|     1 |     0 |   352 |     - |1588k|   0 |  55 | 169 | 205 | 169 | 107 |  34 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.49/0.59	c   0.6s|     1 |     0 |   389 |     - |1553k|   0 |  53 | 169 | 171 | 169 | 107 |  34 |   0 |  14 | 0.000000e+00 |      --      |    Inf 
0.79/0.82	c   0.8s|     1 |     0 |   535 |     - |1544k|   0 |  44 | 169 | 164 | 169 | 107 |  34 |   0 |  26 | 0.000000e+00 |      --      |    Inf 
0.89/0.91	c   0.9s|     1 |     0 |   554 |     - |1543k|   0 |  40 | 169 | 163 | 169 | 107 |  34 |   0 |  36 | 0.000000e+00 |      --      |    Inf 
0.89/0.99	c   1.0s|     1 |     0 |   577 |     - |1498k|   0 |  44 | 169 | 119 | 169 | 107 |  34 |   0 |  44 | 0.000000e+00 |      --      |    Inf 
1.00/1.03	c   1.0s|     1 |     0 |   588 |     - |1498k|   0 |  48 | 169 | 118 | 169 | 107 |  34 |   0 |  52 | 0.000000e+00 |      --      |    Inf 
1.00/1.06	c   1.0s|     1 |     0 |   595 |     - |1498k|   0 |  48 | 169 | 118 | 169 |  94 |  34 |   0 |  57 | 0.000000e+00 |      --      |    Inf 
1.00/1.09	c   1.1s|     1 |     0 |   595 |     - |1498k|   0 |   - | 169 | 118 | 169 |  94 |  34 |   0 |  62 | 0.000000e+00 |      --      |    Inf 
1.00/1.09	c (run 1, node 1) restarting after 34 global fixings of integer variables
1.00/1.09	c 
1.00/1.09	c (restart) converted 21 cuts from the global cut pool into linear constraints
1.00/1.09	c 
1.00/1.09	c presolving:
1.00/1.10	c (round 1) 34 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 79 clqs
1.00/1.10	c (round 2) 34 del vars, 7 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 79 clqs
1.00/1.10	c (round 3) 34 del vars, 7 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 61 upgd conss, 16 impls, 79 clqs
1.10/1.11	c (round 4) 34 del vars, 9 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 61 upgd conss, 16 impls, 79 clqs
1.10/1.11	c presolving (5 rounds):
1.10/1.11	c  34 deleted vars, 9 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 0 changed coefficients
1.10/1.11	c  16 implications, 79 cliques
1.10/1.11	c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 130 constraints
1.10/1.11	c       6 constraints of type <knapsack>
1.10/1.11	c      80 constraints of type <setppc>
1.10/1.11	c      44 constraints of type <logicor>
1.10/1.11	c transformed objective value is always integral (scale: 1)
1.10/1.11	c Presolving Time: 0.03
1.10/1.11	c 
1.10/1.12	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.10/1.12	c   1.1s|     1 |     0 |   663 |     - | 868k|   0 |  38 | 135 | 130 | 135 |  86 |   0 |   0 |  62 | 0.000000e+00 |      --      |    Inf 
1.10/1.14	c   1.1s|     1 |     0 |   693 |     - |1220k|   0 |  51 | 135 | 130 | 135 |  94 |   8 |   0 |  62 | 0.000000e+00 |      --      |    Inf 
1.19/1.27	c   1.3s|     1 |     0 |   732 |     - |1214k|   0 |  41 | 135 | 109 | 135 |  94 |   8 |   0 |  79 | 0.000000e+00 |      --      |    Inf 
1.30/1.33	c   1.3s|     1 |     0 |   732 |     - |1214k|   0 |   - | 135 | 109 | 135 |  94 |   8 |   0 |  87 | 0.000000e+00 |      --      |    Inf 
1.30/1.33	c (run 2, node 1) restarting after 38 global fixings of integer variables
1.30/1.33	c 
1.30/1.33	c (restart) converted 8 cuts from the global cut pool into linear constraints
1.30/1.33	c 
1.30/1.33	c presolving:
1.30/1.34	c (round 1) 38 del vars, 26 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 26 impls, 71 clqs
1.30/1.34	c (round 2) 38 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 26 impls, 71 clqs
1.30/1.35	c presolving (3 rounds):
1.30/1.35	c  38 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.30/1.35	c  26 implications, 71 cliques
1.30/1.35	c presolved problem has 97 variables (97 bin, 0 int, 0 impl, 0 cont) and 89 constraints
1.30/1.35	c      11 constraints of type <knapsack>
1.30/1.35	c      74 constraints of type <setppc>
1.30/1.35	c       4 constraints of type <logicor>
1.30/1.35	c transformed objective value is always integral (scale: 1)
1.30/1.35	c Presolving Time: 0.05
1.30/1.35	c 
1.30/1.35	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.30/1.35	c   1.3s|     1 |     0 |   807 |     - | 857k|   0 |  37 |  97 |  89 |  97 |  85 |   0 |   0 |  87 | 0.000000e+00 |      --      |    Inf 
1.30/1.37	c   1.4s|     1 |     0 |   826 |     - |1116k|   0 |  44 |  97 |  89 |  97 |  96 |  11 |   0 |  87 | 0.000000e+00 |      --      |    Inf 
1.49/1.50	c   1.5s|     1 |     0 |   849 |     - |1116k|   0 |  46 |  97 |  88 |  97 |  96 |  11 |   0 | 103 | 0.000000e+00 |      --      |    Inf 
1.49/1.59	c   1.6s|     1 |     0 |   871 |     - |1115k|   0 |  46 |  97 |  87 |  97 |  96 |  11 |   0 | 115 | 0.000000e+00 |      --      |    Inf 
1.59/1.63	c   1.6s|     1 |     0 |   886 |     - |1115k|   0 |  47 |  97 |  87 |  97 |  96 |  11 |   0 | 120 | 0.000000e+00 |      --      |    Inf 
1.59/1.68	c   1.7s|     1 |     0 |   886 |     - |1115k|   0 |   - |  97 |  87 |  97 |  96 |  11 |   0 | 126 | 0.000000e+00 |      --      |    Inf 
1.59/1.68	c (run 3, node 1) restarting after 20 global fixings of integer variables
1.59/1.68	c 
1.59/1.68	c (restart) converted 11 cuts from the global cut pool into linear constraints
1.59/1.68	c 
1.59/1.68	c presolving:
1.59/1.69	c (round 1) 20 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 42 impls, 67 clqs
1.59/1.70	c (round 2) 20 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 42 impls, 67 clqs
1.59/1.70	c presolving (3 rounds):
1.59/1.70	c  20 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.59/1.70	c  42 implications, 67 cliques
1.59/1.70	c presolved problem has 77 variables (77 bin, 0 int, 0 impl, 0 cont) and 92 constraints
1.59/1.70	c      18 constraints of type <knapsack>
1.59/1.70	c      72 constraints of type <setppc>
1.59/1.70	c       2 constraints of type <logicor>
1.59/1.70	c transformed objective value is always integral (scale: 1)
1.59/1.70	c Presolving Time: 0.07
1.69/1.70	c 
1.69/1.70	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.69/1.70	c   1.7s|     1 |     0 |   945 |     - | 880k|   0 |  42 |  77 |  92 |  77 |  90 |   0 |   0 | 126 | 0.000000e+00 |      --      |    Inf 
1.69/1.72	c   1.7s|     1 |     0 |   988 |     - | 976k|   0 |  44 |  77 |  92 |  77 |  99 |   9 |   0 | 126 | 0.000000e+00 |      --      |    Inf 
1.79/1.84	c   1.8s|     1 |     0 |  1047 |     - | 975k|   0 |  37 |  77 |  90 |  77 |  99 |   9 |   0 | 141 | 0.000000e+00 |      --      |    Inf 
1.90/1.90	c   1.9s|     1 |     0 |  1065 |     - | 974k|   0 |  40 |  77 |  89 |  77 |  99 |   9 |   0 | 153 | 0.000000e+00 |      --      |    Inf 
1.90/1.93	c   1.9s|     1 |     0 |  1110 |     - | 973k|   0 |  26 |  77 |  88 |  77 |  99 |   9 |   0 | 158 | 0.000000e+00 |      --      |    Inf 
1.90/1.96	c   1.9s|     1 |     0 |  1110 |     - | 973k|   0 |   - |  77 |  88 |  77 |  99 |   9 |   0 | 168 | 0.000000e+00 |      --      |    Inf 
1.90/1.96	c (run 4, node 1) restarting after 19 global fixings of integer variables
1.90/1.96	c 
1.90/1.96	c (restart) converted 9 cuts from the global cut pool into linear constraints
1.90/1.96	c 
1.90/1.96	c presolving:
1.90/1.97	c (round 1) 21 del vars, 4 del conss, 0 chg bounds, 1 chg sides, 3 chg coeffs, 9 upgd conss, 68 impls, 55 clqs
1.90/1.97	c (round 2) 21 del vars, 11 del conss, 0 chg bounds, 2 chg sides, 7 chg coeffs, 9 upgd conss, 68 impls, 55 clqs
1.90/1.98	c (round 3) 21 del vars, 11 del conss, 0 chg bounds, 3 chg sides, 11 chg coeffs, 9 upgd conss, 68 impls, 55 clqs
1.90/1.98	c (round 4) 21 del vars, 11 del conss, 0 chg bounds, 4 chg sides, 14 chg coeffs, 9 upgd conss, 68 impls, 55 clqs
1.90/1.98	c (round 5) 21 del vars, 11 del conss, 0 chg bounds, 4 chg sides, 16 chg coeffs, 9 upgd conss, 68 impls, 55 clqs
1.90/1.98	c (round 6) 21 del vars, 11 del conss, 0 chg bounds, 4 chg sides, 17 chg coeffs, 9 upgd conss, 68 impls, 55 clqs
1.90/1.98	c (round 7) 21 del vars, 11 del conss, 0 chg bounds, 4 chg sides, 18 chg coeffs, 9 upgd conss, 68 impls, 55 clqs
1.90/1.98	c (round 8) 21 del vars, 11 del conss, 0 chg bounds, 4 chg sides, 19 chg coeffs, 9 upgd conss, 68 impls, 55 clqs
1.90/1.98	c presolving (9 rounds):
1.90/1.98	c  21 deleted vars, 11 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 19 changed coefficients
1.90/1.98	c  68 implications, 55 cliques
1.90/1.98	c presolved problem has 56 variables (56 bin, 0 int, 0 impl, 0 cont) and 86 constraints
1.90/1.98	c      21 constraints of type <knapsack>
1.90/1.98	c      63 constraints of type <setppc>
1.90/1.98	c       2 constraints of type <logicor>
1.90/1.98	c transformed objective value is always integral (scale: 1)
1.90/1.98	c Presolving Time: 0.09
1.90/1.98	c 
1.90/1.99	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.90/1.99	c   2.0s|     1 |     0 |  1200 |     - | 861k|   0 |  36 |  56 |  86 |  56 |  84 |   0 |   0 | 168 | 0.000000e+00 |      --      |    Inf 
1.99/2.00	c   2.0s|     1 |     0 |  1237 |     - | 989k|   0 |  29 |  56 |  86 |  56 |  89 |   5 |   0 | 168 | 0.000000e+00 |      --      |    Inf 
1.99/2.06	c   2.0s|     1 |     0 |  1252 |     - | 985k|   0 |  31 |  56 |  75 |  56 |  89 |   5 |   0 | 187 | 0.000000e+00 |      --      |    Inf 
1.99/2.08	c   2.1s|     1 |     0 |  1252 |     - | 985k|   0 |   - |  56 |  75 |  56 |  89 |   5 |   0 | 198 | 0.000000e+00 |      --      |    Inf 
1.99/2.08	c (run 5, node 1) restarting after 22 global fixings of integer variables
1.99/2.08	c 
1.99/2.08	c (restart) converted 4 cuts from the global cut pool into linear constraints
1.99/2.08	c 
1.99/2.08	c presolving:
1.99/2.08	c (round 1) 28 del vars, 9 del conss, 0 chg bounds, 5 chg sides, 12 chg coeffs, 0 upgd conss, 83 impls, 30 clqs
1.99/2.09	c (round 2) 30 del vars, 15 del conss, 0 chg bounds, 11 chg sides, 42 chg coeffs, 2 upgd conss, 93 impls, 31 clqs
1.99/2.09	c (round 3) 30 del vars, 19 del conss, 0 chg bounds, 18 chg sides, 93 chg coeffs, 2 upgd conss, 93 impls, 35 clqs
1.99/2.10	c (round 4) 30 del vars, 19 del conss, 0 chg bounds, 18 chg sides, 112 chg coeffs, 2 upgd conss, 93 impls, 35 clqs
2.09/2.10	c (round 5) 30 del vars, 19 del conss, 0 chg bounds, 18 chg sides, 129 chg coeffs, 2 upgd conss, 93 impls, 35 clqs
2.09/2.10	c (round 6) 30 del vars, 19 del conss, 0 chg bounds, 18 chg sides, 136 chg coeffs, 2 upgd conss, 93 impls, 35 clqs
2.09/2.10	c (round 7) 30 del vars, 19 del conss, 0 chg bounds, 18 chg sides, 141 chg coeffs, 2 upgd conss, 103 impls, 35 clqs
2.09/2.10	c (round 8) 30 del vars, 19 del conss, 0 chg bounds, 18 chg sides, 142 chg coeffs, 2 upgd conss, 103 impls, 35 clqs
2.09/2.11	c (round 9) 30 del vars, 19 del conss, 0 chg bounds, 18 chg sides, 143 chg coeffs, 2 upgd conss, 103 impls, 35 clqs
2.09/2.11	c presolving (10 rounds):
2.09/2.11	c  30 deleted vars, 19 deleted constraints, 0 tightened bounds, 0 added holes, 18 changed sides, 143 changed coefficients
2.09/2.11	c  103 implications, 35 cliques
2.09/2.11	c presolved problem has 26 variables (26 bin, 0 int, 0 impl, 0 cont) and 60 constraints
2.09/2.11	c      22 constraints of type <knapsack>
2.09/2.11	c      37 constraints of type <setppc>
2.09/2.11	c       1 constraints of type <logicor>
2.09/2.11	c transformed objective value is always integral (scale: 1)
2.09/2.11	c Presolving Time: 0.12
2.09/2.11	c 
2.09/2.11	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
2.09/2.11	c * 2.1s|     1 |     0 |  1284 |     - | 795k|   0 |   - |  26 |  60 |  26 |  59 |   0 |   0 | 198 | 0.000000e+00 | 0.000000e+00 |   0.00%
2.09/2.11	c   2.1s|     1 |     0 |  1284 |     - | 795k|   0 |   - |  26 |  60 |  26 |  59 |   0 |   0 | 198 | 0.000000e+00 | 0.000000e+00 |   0.00%
2.09/2.11	c 
2.09/2.11	c SCIP Status        : problem is solved [optimal solution found]
2.09/2.11	c Solving Time (sec) : 2.10
2.09/2.11	c Solving Nodes      : 1 (total of 6 nodes in 6 runs)
2.09/2.11	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
2.09/2.11	c Dual Bound         : +0.00000000000000e+00
2.09/2.11	c Gap                : 0.00 %
2.09/2.11	s SATISFIABLE
2.09/2.11	v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 
2.09/2.11	v -x147 x146 -x145 -x144 x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 
2.09/2.11	v x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108 -x107 -x106 
2.09/2.11	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 
2.09/2.11	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 
2.09/2.11	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 
2.09/2.11	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 
2.09/2.11	v -x4 -x3 -x2 -x1 
2.09/2.11	c SCIP Status        : problem is solved [optimal solution found]
2.09/2.11	c Solving Time       :       2.10
2.09/2.11	c Original Problem   :
2.09/2.11	c   Problem name     : HOME/instance-2704012-1278548320.opb
2.09/2.11	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.09/2.11	c   Constraints      : 101 initial, 101 maximal
2.09/2.11	c Presolved Problem  :
2.09/2.11	c   Problem name     : t_HOME/instance-2704012-1278548320.opb
2.09/2.11	c   Variables        : 26 (26 binary, 0 integer, 0 implicit integer, 0 continuous)
2.09/2.11	c   Constraints      : 60 initial, 60 maximal
2.09/2.11	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
2.09/2.11	c   trivial          :       0.00        134          0          0          0          0          0          0          0
2.09/2.11	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
2.09/2.11	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
2.09/2.11	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
2.09/2.11	c   implics          :       0.00          0          0          0          0          0          0          0          0
2.09/2.11	c   probing          :       0.00          0          0          0          0          0          0          0          0
2.09/2.11	c   knapsack         :       0.07          0          0          0          0          0          0         22        162
2.09/2.11	c   setppc           :       0.01          0          8          0          0          0         36          0          0
2.09/2.11	c   linear           :       0.01          1          0          0          0          0         37          4          0
2.09/2.11	c   logicor          :       0.00          0          0          0          0          0         28          0          0
2.09/2.11	c   root node        :          -        133          -          -        133          -          -          -          -
2.09/2.11	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
2.09/2.11	c   integral         :          0          0          0         19          0          0         93          0          0          0
2.09/2.11	c   knapsack         :         22          9         22          0          0          0          0          1          0          0
2.09/2.11	c   setppc           :         37          9         22          0          0          0         40          0          0          0
2.09/2.11	c   logicor          :          1          4          7          0          0          0          0          0          0          0
2.09/2.11	c   countsols        :          0          0          0          0          0          0          0          0          0          0
2.09/2.11	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
2.09/2.11	c   integral         :       1.56       0.00       0.00       1.56       0.00
2.09/2.11	c   knapsack         :       0.01       0.01       0.00       0.00       0.00
2.09/2.11	c   setppc           :       0.00       0.00       0.00       0.00       0.00
2.09/2.11	c   logicor          :       0.00       0.00       0.00       0.00       0.00
2.09/2.11	c   countsols        :       0.00       0.00       0.00       0.00       0.00
2.09/2.11	c Propagators        :       Time      Calls    Cutoffs    DomReds
2.09/2.11	c   vbounds          :       0.00          6          0          0
2.09/2.11	c   rootredcost      :       0.00          0          0          0
2.09/2.11	c   pseudoobj        :       0.00          0          0          0
2.09/2.11	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
2.09/2.11	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
2.09/2.11	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
2.09/2.11	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
2.09/2.11	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
2.09/2.11	c   pseudo solution  :       0.00          1          0          0        0.0          0        0.0          -
2.09/2.11	c   applied globally :          -          -          -          0        0.0          -          -          -
2.09/2.11	c   applied locally  :          -          -          -          0        0.0          -          -          -
2.09/2.11	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
2.09/2.11	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
2.09/2.11	c   redcost          :       0.00          9          0          0          0          0
2.09/2.11	c   impliedbounds    :       0.00          9          0          0          0          0
2.09/2.11	c   intobj           :       0.00          0          0          0          0          0
2.09/2.11	c   cgmip            :       0.00          0          0          0          0          0
2.09/2.11	c   gomory           :       0.06          9          0          0        121          0
2.09/2.11	c   strongcg         :       0.06          9          0          0        382          0
2.09/2.11	c   cmir             :       0.00          0          0          0          0          0
2.09/2.11	c   flowcover        :       0.00          0          0          0          0          0
2.09/2.11	c   clique           :       0.01          9          0          0         41          0
2.09/2.11	c   zerohalf         :       0.00          0          0          0          0          0
2.09/2.11	c   mcf              :       0.00          5          0          0          0          0
2.09/2.11	c   rapidlearning    :       0.16          1          0          0          0        132
2.09/2.11	c Pricers            :       Time      Calls       Vars
2.09/2.11	c   problem variables:       0.00          0          0
2.09/2.11	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
2.09/2.11	c   relpscost        :       1.56         19          0         93          0          0          0
2.09/2.11	c   pscost           :       0.00          0          0          0          0          0          0
2.09/2.11	c   inference        :       0.00          0          0          0          0          0          0
2.09/2.11	c   mostinf          :       0.00          0          0          0          0          0          0
2.09/2.11	c   leastinf         :       0.00          0          0          0          0          0          0
2.09/2.11	c   fullstrong       :       0.00          0          0          0          0          0          0
2.09/2.11	c   allfullstrong    :       0.00          0          0          0          0          0          0
2.09/2.11	c   random           :       0.00          0          0          0          0          0          0
2.09/2.11	c Primal Heuristics  :       Time      Calls      Found
2.09/2.11	c   LP solutions     :       0.00          -          0
2.09/2.11	c   pseudo solutions :       0.00          -          0
2.09/2.11	c   trivial          :       0.00          1          0
2.09/2.11	c   simplerounding   :       0.00          0          0
2.09/2.11	c   zirounding       :       0.00          0          0
2.09/2.11	c   rounding         :       0.00          0          0
2.09/2.11	c   shifting         :       0.00          0          0
2.09/2.11	c   intshifting      :       0.00          0          0
2.09/2.11	c   oneopt           :       0.00          0          0
2.09/2.11	c   twoopt           :       0.00          0          0
2.09/2.11	c   fixandinfer      :       0.00          0          0
2.09/2.11	c   feaspump         :       0.00          0          0
2.09/2.11	c   coefdiving       :       0.00          0          0
2.09/2.11	c   pscostdiving     :       0.00          0          0
2.09/2.11	c   fracdiving       :       0.00          0          0
2.09/2.11	c   veclendiving     :       0.00          0          0
2.09/2.11	c   intdiving        :       0.00          0          0
2.09/2.11	c   actconsdiving    :       0.00          0          0
2.09/2.11	c   objpscostdiving  :       0.00          0          0
2.09/2.11	c   rootsoldiving    :       0.00          0          0
2.09/2.11	c   linesearchdiving :       0.00          0          0
2.09/2.11	c   guideddiving     :       0.00          0          0
2.09/2.11	c   octane           :       0.00          0          0
2.09/2.11	c   rens             :       0.00          0          0
2.09/2.11	c   rins             :       0.00          0          0
2.09/2.11	c   localbranching   :       0.00          0          0
2.09/2.11	c   mutation         :       0.00          0          0
2.09/2.11	c   crossover        :       0.00          0          0
2.09/2.11	c   dins             :       0.00          0          0
2.09/2.11	c   undercover       :       0.00          0          0
2.09/2.11	c   nlp              :       0.00          0          0
2.09/2.11	c   trysol           :       0.00          0          0
2.09/2.11	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
2.09/2.11	c   primal LP        :       0.00          0          0       0.00          -
2.09/2.11	c   dual LP          :       0.08         29       1284      44.28   15286.08
2.09/2.11	c   lex dual LP      :       0.00          0          0       0.00          -
2.09/2.11	c   barrier LP       :       0.00          0          0       0.00          -
2.09/2.11	c   diving/probing LP:       0.00          0          0       0.00          -
2.09/2.11	c   strong branching :       1.56        198      19233      97.14   12345.14
2.09/2.11	c     (at root node) :          -        198      19233      97.14          -
2.09/2.11	c   conflict analysis:       0.00          0          0       0.00          -
2.09/2.11	c B&B Tree           :
2.09/2.11	c   number of runs   :          6
2.09/2.11	c   nodes            :          1
2.09/2.11	c   nodes (total)    :          6
2.09/2.11	c   nodes left       :          0
2.09/2.11	c   max depth        :          0
2.09/2.11	c   max depth (total):          0
2.09/2.11	c   backtracks       :          0 (0.0%)
2.09/2.11	c   delayed cutoffs  :          0
2.09/2.11	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
2.09/2.11	c   avg switch length:       2.00
2.09/2.11	c   switching time   :       0.00
2.09/2.11	c Solution           :
2.09/2.11	c   Solutions found  :          1 (1 improvements)
2.09/2.11	c   First Solution   : +0.00000000000000e+00   (in run 6, after 1 nodes, 2.10 seconds, depth 0, found by <relaxation>)
2.09/2.11	c   Primal Bound     : +0.00000000000000e+00   (in run 6, after 1 nodes, 2.10 seconds, depth 0, found by <relaxation>)
2.09/2.11	c   Dual Bound       : +0.00000000000000e+00
2.09/2.11	c   Gap              :       0.00 %
2.09/2.11	c   Root Dual Bound  : +0.00000000000000e+00
2.09/2.11	c   Root Iterations  :       1284
2.09/2.12	c Time complete: 2.11.

Verifier Data 

OK	0

Watcher Data 

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2704012-1278548320/watcher-2704012-1278548320 -o /tmp/evaluation-result-2704012-1278548320/solver-2704012-1278548320 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704012-1278548320.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.85 0.98 0.85 3/107 31959
/proc/meminfo: memFree=1602380/2059040 swapFree=4139464/4192956
[pid=31959] ppid=31957 vsize=7904 CPUtime=0
/proc/31959/stat : 31959 (pbscip.linux.x8) R 31957 31959 30740 0 -1 4202496 1100 0 0 0 0 0 0 0 20 0 1 0 23043780 8093696 1011 1992294400 4194304 8395647 140734393257104 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/31959/statm: 1976 1020 365 1026 0 946 0

[startup+0.029474 s]
/proc/loadavg: 0.85 0.98 0.85 3/107 31959
/proc/meminfo: memFree=1602380/2059040 swapFree=4139464/4192956
[pid=31959] ppid=31957 vsize=15084 CPUtime=0.01
/proc/31959/stat : 31959 (pbscip.linux.x8) R 31957 31959 30740 0 -1 4202496 3178 0 0 0 1 0 0 0 20 0 1 0 23043780 15446016 2736 1992294400 4194304 8395647 140734393257104 18446744073709551615 4288187 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31959/statm: 3771 2736 482 1026 0 2741 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 15084

[startup+0.101479 s]
/proc/loadavg: 0.85 0.98 0.85 3/107 31959
/proc/meminfo: memFree=1602380/2059040 swapFree=4139464/4192956
[pid=31959] ppid=31957 vsize=24596 CPUtime=0.09
/proc/31959/stat : 31959 (pbscip.linux.x8) R 31957 31959 30740 0 -1 4202496 5365 0 0 0 7 2 0 0 20 0 1 0 23043780 25186304 4923 1992294400 4194304 8395647 140734393257104 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31959/statm: 6149 4923 612 1026 0 5119 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 24596

[startup+0.301495 s]
/proc/loadavg: 0.85 0.98 0.85 3/107 31959
/proc/meminfo: memFree=1602380/2059040 swapFree=4139464/4192956
[pid=31959] ppid=31957 vsize=24596 CPUtime=0.29
/proc/31959/stat : 31959 (pbscip.linux.x8) R 31957 31959 30740 0 -1 4202496 5455 0 0 0 26 3 0 0 20 0 1 0 23043780 25186304 5013 1992294400 4194304 8395647 140734393257104 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31959/statm: 6149 5013 622 1026 0 5119 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 24596

[startup+0.701526 s]
/proc/loadavg: 0.85 0.98 0.85 3/107 31959
/proc/meminfo: memFree=1602380/2059040 swapFree=4139464/4192956
[pid=31959] ppid=31957 vsize=24596 CPUtime=0.69
/proc/31959/stat : 31959 (pbscip.linux.x8) R 31957 31959 30740 0 -1 4202496 5519 0 0 0 65 4 0 0 21 0 1 0 23043780 25186304 5077 1992294400 4194304 8395647 140734393257104 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31959/statm: 6149 5077 624 1026 0 5119 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 24596

[startup+1.50159 s]
/proc/loadavg: 0.85 0.98 0.85 2/108 31960
/proc/meminfo: memFree=1584392/2059040 swapFree=4139464/4192956
[pid=31959] ppid=31957 vsize=24596 CPUtime=1.49
/proc/31959/stat : 31959 (pbscip.linux.x8) R 31957 31959 30740 0 -1 4202496 5723 0 0 0 142 7 0 0 23 0 1 0 23043780 25186304 5262 1992294400 4194304 8395647 140734393257104 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31959/statm: 6149 5262 627 1026 0 5119 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 24596

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

[startup+1.90162 s]
/proc/loadavg: 0.85 0.98 0.85 2/108 31960
/proc/meminfo: memFree=1584392/2059040 swapFree=4139464/4192956
[pid=31959] ppid=31957 vsize=24596 CPUtime=1.9
/proc/31959/stat : 31959 (pbscip.linux.x8) R 31957 31959 30740 0 -1 4202496 5723 0 0 0 181 9 0 0 25 0 1 0 23043780 25186304 5262 1992294400 4194304 8395647 140734393257104 18446744073709551615 7428202 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31959/statm: 6149 5262 627 1026 0 5119 0
Current children cumulated CPU time (s) 1.9
Current children cumulated vsize (KiB) 24596

[startup+2.10164 s]
/proc/loadavg: 0.85 0.98 0.85 2/108 31960
/proc/meminfo: memFree=1583524/2059040 swapFree=4139464/4192956
[pid=31959] ppid=31957 vsize=24596 CPUtime=2.09
/proc/31959/stat : 31959 (pbscip.linux.x8) R 31957 31959 30740 0 -1 4202496 5726 0 0 0 200 9 0 0 25 0 1 0 23043780 25186304 5265 1992294400 4194304 8395647 140734393257104 18446744073709551615 7430400 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/31959/statm: 6149 5265 630 1026 0 5119 0
Current children cumulated CPU time (s) 2.09
Current children cumulated vsize (KiB) 24596

Child status: 0
Real time (s): 2.12197
CPU time (s): 2.12268
CPU user time (s): 2.02169
CPU system time (s): 0.100984
CPU usage (%): 100.033
Max. virtual memory (cumulated for all children) (KiB): 24596

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.02169
system time used= 0.100984
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 5732
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 5
involuntary context switches= 4

runsolver used 0.008998 second user time and 0.022996 second system time

The end

Launcher Data 

Begin job on node026 at 2010-07-08 02:18:40
IDJOB=2704012
IDBENCH=1205
IDSOLVER=1213
FILE ID=node026/2704012-1278548320
PBS_JOBID= 11239511
Free space on /tmp= 62472 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/namasivayam/wnqueen/normalized-t2001.13queen13.1110969933.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-2704012-1278548320/watcher-2704012-1278548320 -o /tmp/evaluation-result-2704012-1278548320/solver-2704012-1278548320 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704012-1278548320.opb -t 1800 -m 1800

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

MD5SUM BENCH= bc1af809c45d4fb609c4a61db7aef018
RANDOM SEED=396316198

node026.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.244
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.48
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.244
cache size	: 2048 KB
physical id	: 3
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5599.46
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1602908 kB
Buffers:         54576 kB
Cached:         294864 kB
SwapCached:      10232 kB
Active:         128452 kB
Inactive:       238072 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1602908 kB
SwapTotal:     4192956 kB
SwapFree:      4139464 kB
Dirty:           10508 kB
Writeback:           0 kB
AnonPages:       11476 kB
Mapped:          11892 kB
Slab:            67648 kB
PageTables:       4272 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180140 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= 62460 MiB
End job on node026 at 2010-07-08 02:18:43