Trace number 1869300

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.1.0.7 with SoPLEX 1.4.1(24.4.2009)UNSAT 0.229964 0.231699

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/
submitted-PB06/roussel/normalized-pigeon-cardinality-65-60.opb
MD5SUM6f6d5bf9df98767681bd16885050de4b
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.229964
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables3900
Total number of constraints125
Number of constraints which are clauses65
Number of constraints which are cardinality constraints (but not clauses)60
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint60
Maximum length of a constraint65
Number of terms in the objective function 0
Biggest coefficient in the objective function 0
Number of bits for the biggest coefficient in the objective function 0
Sum of the numbers in the objective function 0
Number of bits of the sum of numbers in the objective function 0
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 66
Number of bits of the biggest sum of numbers7
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.03	c SCIP version 1.1.0.7
0.00/0.03	c LP-Solver SoPlex 1.4.1
0.00/0.03	c user parameter file <scip.set> not found - using default parameters
0.00/0.03	c read problem <HOME/instance-1869300-1245169461.opb>
0.00/0.03	c original problem has 3900 variables (3900 bin, 0 int, 0 impl, 0 cont) and 125 constraints
0.00/0.06	c No objective function, only one solution is needed.
0.00/0.06	c start presolving problem
0.00/0.06	c presolving:
0.06/0.07	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 65 upgd conss, 0 impls, 60 clqs
0.06/0.08	c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 125 upgd conss, 0 impls, 60 clqs
0.06/0.09	c presolving (3 rounds):
0.06/0.09	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.06/0.09	c  0 implications, 60 cliques
0.06/0.09	c presolved problem has 3900 variables (3900 bin, 0 int, 0 impl, 0 cont) and 125 constraints
0.06/0.09	c      60 constraints of type <setppc>
0.06/0.09	c      65 constraints of type <logicor>
0.06/0.09	c transformed objective value is always integral (scale: 1)
0.06/0.09	c Presolving Time: 0.04
0.06/0.09	c SATUNSAT-LIN
0.06/0.09	c -----------------------------------------------------------------------------------------------
0.06/0.09	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.06/0.09	c separating/flowcover/freq = c -1
0.06/0.09	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.06/0.09	c separating/cmir/freq = c -1
0.06/0.09	c # additional number of allowed LP iterations
0.06/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.09	c heuristics/veclendiving/maxlpiterofs = c 1500
0.06/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.09	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.06/0.09	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.09	c heuristics/veclendiving/freq = c -1
0.06/0.09	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.06/0.09	c heuristics/simplerounding/freq = c -1
0.06/0.09	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.09	c heuristics/shifting/freq = c -1
0.06/0.09	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.06/0.09	c heuristics/rounding/freq = c -1
0.06/0.09	c # additional number of allowed LP iterations
0.06/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.09	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.06/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.06/0.09	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.06/0.09	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 20]
0.06/0.09	c heuristics/rootsoldiving/freq = c -1
0.06/0.09	c # number of nodes added to the contingent of the total nodes
0.06/0.09	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.06/0.09	c heuristics/rens/nodesofs = c 2000
0.06/0.09	c # minimum percentage of integer variables that have to be fixable 
0.06/0.09	c # [type: real, range: [0,1], default: 0.5]
0.06/0.09	c heuristics/rens/minfixingrate = c 0.3
0.06/0.09	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 0]
0.06/0.09	c heuristics/rens/freq = c -1
0.06/0.09	c # additional number of allowed LP iterations
0.06/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.09	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.06/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.09	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.06/0.09	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.09	c heuristics/pscostdiving/freq = c -1
0.06/0.09	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 1]
0.06/0.09	c heuristics/oneopt/freq = c -1
0.06/0.09	c # additional number of allowed LP iterations
0.06/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.09	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.06/0.09	c # maximal fraction of diving LP iterations compared to total iteration number
0.06/0.09	c # [type: real, range: [0,1], default: 0.01]
0.06/0.09	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.06/0.09	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 20]
0.06/0.09	c heuristics/objpscostdiving/freq = c -1
0.06/0.09	c # additional number of allowed LP iterations
0.06/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.09	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.06/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.09	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.06/0.09	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.09	c heuristics/linesearchdiving/freq = c -1
0.06/0.09	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.09	c heuristics/intshifting/freq = c -1
0.06/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.09	c heuristics/intdiving/maxlpiterquot = c 0.075
0.06/0.09	c # additional number of allowed LP iterations
0.06/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.09	c heuristics/guideddiving/maxlpiterofs = c 1500
0.06/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.09	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.06/0.09	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.09	c heuristics/guideddiving/freq = c -1
0.06/0.09	c # additional number of allowed LP iterations
0.06/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.09	c heuristics/fracdiving/maxlpiterofs = c 1500
0.06/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.09	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.06/0.09	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.09	c heuristics/fracdiving/freq = c -1
0.06/0.09	c # additional number of allowed LP iterations
0.06/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.09	c heuristics/feaspump/maxlpiterofs = c 2000
0.06/0.09	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 20]
0.06/0.09	c heuristics/feaspump/freq = c -1
0.06/0.09	c # minimum percentage of integer variables that have to be fixed 
0.06/0.09	c # [type: real, range: [0,1], default: 0.666]
0.06/0.09	c heuristics/crossover/minfixingrate = c 0.5
0.06/0.09	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.06/0.09	c # [type: real, range: [0,1], default: 0.1]
0.06/0.09	c heuristics/crossover/nodesquot = c 0.15
0.06/0.09	c # number of nodes without incumbent change that heuristic should wait
0.06/0.09	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.06/0.09	c heuristics/crossover/nwaitingnodes = c 100
0.06/0.09	c # number of nodes added to the contingent of the total nodes
0.06/0.09	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.06/0.09	c heuristics/crossover/nodesofs = c 750
0.06/0.09	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 30]
0.06/0.09	c heuristics/crossover/freq = c -1
0.06/0.09	c # additional number of allowed LP iterations
0.06/0.09	c # [type: int, range: [0,2147483647], default: 1000]
0.06/0.09	c heuristics/coefdiving/maxlpiterofs = c 1500
0.06/0.09	c # maximal fraction of diving LP iterations compared to node LP iterations
0.06/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.06/0.09	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.06/0.09	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 10]
0.06/0.09	c heuristics/coefdiving/freq = c -1
0.06/0.09	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.09	c presolving/probing/maxrounds = c 0
0.06/0.09	c # should presolving try to simplify knapsacks
0.06/0.09	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.09	c constraints/knapsack/simplifyinequalities = c TRUE
0.06/0.09	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.06/0.09	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.06/0.09	c constraints/knapsack/disaggregation = c FALSE
0.06/0.09	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.09	c constraints/knapsack/maxnumcardlift = c 0
0.06/0.09	c # should presolving try to simplify inequalities
0.06/0.09	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.09	c constraints/linear/simplifyinequalities = c TRUE
0.06/0.09	c # maximal number of separation rounds in the root node (-1: unlimited)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.09	c separating/maxroundsroot = c 5
0.06/0.09	c # maximal number of separation rounds per node (-1: unlimited)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 5]
0.06/0.09	c separating/maxrounds = c 1
0.06/0.09	c # solving stops, if the given number of solutions were found (-1: no limit)
0.06/0.09	c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.09	c limits/solutions = c 1
0.06/0.09	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.06/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.09	c limits/memory = c 1620
0.06/0.09	c # maximal time in seconds to run
0.06/0.09	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.09	c limits/time = c 1791
0.06/0.09	c # frequency for displaying node information lines
0.06/0.09	c # [type: int, range: [-1,2147483647], default: 100]
0.06/0.09	c display/freq = c 10000
0.06/0.09	c -----------------------------------------------------------------------------------------------
0.06/0.09	c start solving problem
0.06/0.09	c 
0.19/0.20	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.19/0.20	c   0.2s|     1 |     0 |  1432 |8039k|   0 |   - |3900 | 125 | 125 |3900 | 125 |   0 |   0 |   0 |      --      |      --      |   0.00%
0.19/0.20	c   0.2s|     1 |     0 |  1432 |8039k|   0 |   - |3900 | 125 | 125 |3900 | 125 |   0 |   0 |   0 |      --      |      --      |   0.00%
0.19/0.20	c 
0.19/0.20	c SCIP Status        : problem is solved [infeasible]
0.19/0.20	c Solving Time (sec) : 0.16
0.19/0.20	c Solving Nodes      : 1
0.19/0.20	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
0.19/0.20	c Dual Bound         : +1.00000000000000e+20
0.19/0.20	c Gap                : 0.00 %
0.19/0.20	c NODE         1
0.19/0.20	c DUAL BOUND   1e+20
0.19/0.20	c PRIMAL BOUND 1e+20
0.19/0.20	c GAP          0
0.19/0.20	s UNSATISFIABLE
0.19/0.20	c SCIP Status        : problem is solved [infeasible]
0.19/0.20	c Solving Time       :       0.16
0.19/0.20	c Original Problem   :
0.19/0.20	c   Problem name     : HOME/instance-1869300-1245169461.opb
0.19/0.20	c   Variables        : 3900 (3900 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.20	c   Constraints      : 125 initial, 125 maximal
0.19/0.20	c Presolved Problem  :
0.19/0.20	c   Problem name     : t_HOME/instance-1869300-1245169461.opb
0.19/0.20	c   Variables        : 3900 (3900 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.20	c   Constraints      : 125 initial, 125 maximal
0.19/0.20	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.19/0.20	c   trivial          :       0.00          0          0          0          0          0          0          0          0
0.19/0.20	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
0.19/0.20	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.19/0.20	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.19/0.20	c   implics          :       0.00          0          0          0          0          0          0          0          0
0.19/0.20	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.19/0.20	c   setppc           :       0.01          0          0          0          0          0          0          0          0
0.19/0.20	c   logicor          :       0.00          0          0          0          0          0          0          0          0
0.19/0.20	c   root node        :          -          0          -          -          0          -          -          -          -
0.19/0.20	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.19/0.20	c   integral         :          0          0          0          0          0          0          0          0          0          0
0.19/0.20	c   setppc           :         60          0          1          0          0          0          0          0          0          0
0.19/0.20	c   logicor          :         65          0          1          0          0          0          0          0          0          0
0.19/0.20	c   countsols        :          0          0          0          0          0          0          0          0          0          0
0.19/0.20	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.19/0.20	c   integral         :       0.00       0.00       0.00       0.00       0.00
0.19/0.20	c   setppc           :       0.00       0.00       0.00       0.00       0.00
0.19/0.20	c   logicor          :       0.00       0.00       0.00       0.00       0.00
0.19/0.20	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.19/0.20	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.19/0.20	c   rootredcost      :       0.00          0          0          0
0.19/0.20	c   pseudoobj        :       0.00          2          1          0
0.19/0.20	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.19/0.20	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.19/0.20	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.19/0.20	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.19/0.20	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.19/0.20	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.19/0.20	c   applied globally :          -          -          -          0        0.0          -          -          -
0.19/0.20	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.19/0.20	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.19/0.20	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.19/0.20	c   redcost          :       0.00          0          0          0          0          0
0.19/0.20	c   impliedbounds    :       0.00          0          0          0          0          0
0.19/0.20	c   intobj           :       0.00          0          0          0          0          0
0.19/0.20	c   gomory           :       0.00          0          0          0          0          0
0.19/0.20	c   strongcg         :       0.00          0          0          0          0          0
0.19/0.20	c   cmir             :       0.00          0          0          0          0          0
0.19/0.20	c   flowcover        :       0.00          0          0          0          0          0
0.19/0.20	c   clique           :       0.00          0          0          0          0          0
0.19/0.20	c   zerohalf         :       0.00          0          0          0          0          0
0.19/0.20	c   mcf              :       0.00          0          0          0          0          0
0.19/0.20	c Pricers            :       Time      Calls       Vars
0.19/0.20	c   problem variables:       0.00          0          0
0.19/0.20	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.19/0.20	c   pscost           :       0.00          0          0          0          0          0          0
0.19/0.20	c   inference        :       0.00          0          0          0          0          0          0
0.19/0.20	c   mostinf          :       0.00          0          0          0          0          0          0
0.19/0.20	c   leastinf         :       0.00          0          0          0          0          0          0
0.19/0.20	c   fullstrong       :       0.00          0          0          0          0          0          0
0.19/0.20	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.19/0.20	c   random           :       0.00          0          0          0          0          0          0
0.19/0.20	c   relpscost        :       0.00          0          0          0          0          0          0
0.19/0.20	c Primal Heuristics  :       Time      Calls      Found
0.19/0.20	c   LP solutions     :       0.00          -          0
0.19/0.20	c   pseudo solutions :       0.00          -          0
0.19/0.20	c   simplerounding   :       0.00          0          0
0.19/0.20	c   rounding         :       0.00          0          0
0.19/0.20	c   shifting         :       0.00          0          0
0.19/0.20	c   intshifting      :       0.00          0          0
0.19/0.20	c   oneopt           :       0.00          0          0
0.19/0.20	c   fixandinfer      :       0.00          0          0
0.19/0.20	c   feaspump         :       0.00          0          0
0.19/0.20	c   coefdiving       :       0.00          0          0
0.19/0.20	c   pscostdiving     :       0.00          0          0
0.19/0.20	c   fracdiving       :       0.00          0          0
0.19/0.20	c   veclendiving     :       0.00          0          0
0.19/0.20	c   intdiving        :       0.00          0          0
0.19/0.20	c   actconsdiving    :       0.00          0          0
0.19/0.20	c   objpscostdiving  :       0.00          0          0
0.19/0.20	c   rootsoldiving    :       0.00          0          0
0.19/0.20	c   linesearchdiving :       0.00          0          0
0.19/0.20	c   guideddiving     :       0.00          0          0
0.19/0.20	c   octane           :       0.00          0          0
0.19/0.20	c   rens             :       0.00          0          0
0.19/0.20	c   rins             :       0.00          0          0
0.19/0.20	c   localbranching   :       0.00          0          0
0.19/0.20	c   mutation         :       0.00          0          0
0.19/0.20	c   crossover        :       0.00          0          0
0.19/0.20	c   dins             :       0.00          0          0
0.19/0.20	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.19/0.20	c   primal LP        :       0.00          0          0       0.00          -
0.19/0.20	c   dual LP          :       0.10          1       1432    1432.00   14320.00
0.19/0.20	c   barrier LP       :       0.00          0          0       0.00          -
0.19/0.20	c   diving/probing LP:       0.00          0          0       0.00          -
0.19/0.20	c   strong branching :       0.00          0          0       0.00          -
0.19/0.20	c     (at root node) :          -          0          0       0.00          -
0.19/0.20	c   conflict analysis:       0.00          0          0       0.00          -
0.19/0.20	c B&B Tree           :
0.19/0.20	c   number of runs   :          1
0.19/0.20	c   nodes            :          1
0.19/0.20	c   nodes (total)    :          1
0.19/0.20	c   nodes left       :          0
0.19/0.20	c   max depth        :          0
0.19/0.20	c   max depth (total):          0
0.19/0.20	c   backtracks       :          0 (0.0%)
0.19/0.20	c   delayed cutoffs  :          0
0.19/0.20	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.19/0.20	c   avg switch length:       2.00
0.19/0.20	c   switching time   :       0.00
0.19/0.20	c Solution           :
0.19/0.20	c   Solutions found  :          0 (0 improvements)
0.19/0.20	c   Primal Bound     : infeasible
0.19/0.20	c   Dual Bound       :          -
0.19/0.20	c   Gap              :       0.00 %
0.19/0.20	c   Root Dual Bound  :          -
0.19/0.23	c Time complete: 0.22.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-1869300-1245169461/watcher-1869300-1245169461 -o /tmp/evaluation-result-1869300-1245169461/solver-1869300-1245169461 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1869300-1245169461.opb 

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 1.00 1.00 1.00 3/64 5568
/proc/meminfo: memFree=1896816/2055920 swapFree=4192812/4192956
[pid=5568] ppid=5566 vsize=4324 CPUtime=0
/proc/5568/stat : 5568 (pbscip.linux.x8) R 5566 5568 5255 0 -1 4194304 463 0 0 0 0 0 0 0 18 0 1 0 184543089 4427776 448 1992294400 4194304 7823515 548682068736 18446744073709551615 6883856 0 0 4096 0 0 0 0 17 1 0 0
/proc/5568/statm: 1081 448 286 886 0 191 0

[startup+0.0748859 s]
/proc/loadavg: 1.00 1.00 1.00 3/64 5568
/proc/meminfo: memFree=1896816/2055920 swapFree=4192812/4192956
[pid=5568] ppid=5566 vsize=20864 CPUtime=0.06
/proc/5568/stat : 5568 (pbscip.linux.x8) R 5566 5568 5255 0 -1 4194304 4618 0 0 0 5 1 0 0 18 0 1 0 184543089 21364736 4246 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/5568/statm: 5216 4246 420 886 0 4326 0
Current children cumulated CPU time (s) 0.06
Current children cumulated vsize (KiB) 20864

[startup+0.10189 s]
/proc/loadavg: 1.00 1.00 1.00 3/64 5568
/proc/meminfo: memFree=1896816/2055920 swapFree=4192812/4192956
[pid=5568] ppid=5566 vsize=23312 CPUtime=0.09
/proc/5568/stat : 5568 (pbscip.linux.x8) R 5566 5568 5255 0 -1 4194304 5191 0 0 0 8 1 0 0 16 0 1 0 184543089 23871488 4819 1992294400 4194304 7823515 548682068736 18446744073709551615 6049786 0 0 4096 16384 0 0 0 17 1 0 0
/proc/5568/statm: 5828 4823 474 886 0 4938 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 23312

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

[startup+0.201899 s]
/proc/loadavg: 1.00 1.00 1.00 3/64 5568
/proc/meminfo: memFree=1896816/2055920 swapFree=4192812/4192956
[pid=5568] ppid=5566 vsize=23960 CPUtime=0.19
/proc/5568/stat : 5568 (pbscip.linux.x8) R 5566 5568 5255 0 -1 4194304 5551 0 0 0 17 2 0 0 17 0 1 0 184543089 24535040 5161 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/5568/statm: 5990 5161 503 886 0 5100 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 23960

Child status: 0
Real time (s): 0.231699
CPU time (s): 0.229964
CPU user time (s): 0.203968
CPU system time (s): 0.025996
CPU usage (%): 99.2512
Max. virtual memory (cumulated for all children) (KiB): 23960

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.203968
system time used= 0.025996
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 5573
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= 1

runsolver used 0.006998 second user time and 0.005999 second system time

The end

Launcher Data 

Begin job on node45 at 2009-06-16 18:24:21
IDJOB=1869300
IDBENCH=2581
IDSOLVER=683
FILE ID=node45/1869300-1245169461
PBS_JOBID= 9363819
Free space on /tmp= 66172 MiB

SOLVER NAME= SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)
BENCH NAME= PB06/final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/roussel/normalized-pigeon-cardinality-65-60.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t TIMEOUT -m MEMLIMIT -f BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-1869300-1245169461/watcher-1869300-1245169461 -o /tmp/evaluation-result-1869300-1245169461/solver-1869300-1245169461 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1869300-1245169461.opb

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

MD5SUM BENCH= 6f6d5bf9df98767681bd16885050de4b
RANDOM SEED=1572186965

node45.alineos.net Linux 2.6.9-22.EL.rootsmp #1 SMP Mon Oct 3 08:59:52 CEST 2005

/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.240
cache size	: 2048 KB
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 pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5914.62
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.240
cache size	: 2048 KB
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 pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5586.94
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2055920 kB
MemFree:       1897232 kB
Buffers:         28264 kB
Cached:          67816 kB
SwapCached:        140 kB
Active:          64544 kB
Inactive:        45660 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1897232 kB
SwapTotal:     4192956 kB
SwapFree:      4192812 kB
Dirty:            9896 kB
Writeback:           0 kB
Mapped:          23756 kB
Slab:            34484 kB
Committed_AS:   157384 kB
PageTables:       1380 kB
VmallocTotal: 536870911 kB
VmallocUsed:    264952 kB
VmallocChunk: 536605679 kB
HugePages_Total:     0
HugePages_Free:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 66164 MiB
End job on node45 at 2009-06-16 18:24:21