Trace number 1868533

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPclp SCIP 1.1.0.7 with CLP 1.8.2UNSAT 0.198969 0.199344

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/
aloul/FPGA_SAT05/normalized-chnl40_50_pb.cnf.cr.opb
MD5SUMfe9566a2c8ff9ee542e29a30eb3c6e16
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.198969
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables4000
Total number of constraints180
Number of constraints which are clauses100
Number of constraints which are cardinality constraints (but not clauses)80
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint40
Maximum length of a constraint50
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 51
Number of bits of the biggest sum of numbers6
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

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

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-1868533-1245127311/watcher-1868533-1245127311 -o /tmp/evaluation-result-1868533-1245127311/solver-1868533-1245127311 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1868533-1245127311.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: 0.94 0.99 0.99 3/64 1975
/proc/meminfo: memFree=899240/2055920 swapFree=4192812/4192956
[pid=1975] ppid=1973 vsize=5812 CPUtime=0
/proc/1975/stat : 1975 (pbscip.linux.x8) R 1973 1975 428 0 -1 4194304 517 0 0 0 0 0 0 0 18 0 1 0 180331725 5951488 501 1992294400 4194304 9342243 548682068736 18446744073709551615 8223232 0 0 4096 0 0 0 0 17 1 0 0
/proc/1975/statm: 1453 502 332 1256 0 192 0

[startup+0.011651 s]
/proc/loadavg: 0.94 0.99 0.99 3/64 1975
/proc/meminfo: memFree=899240/2055920 swapFree=4192812/4192956
[pid=1975] ppid=1973 vsize=10652 CPUtime=0
/proc/1975/stat : 1975 (pbscip.linux.x8) R 1973 1975 428 0 -1 4194304 1629 0 0 0 0 0 0 0 18 0 1 0 180331725 10907648 1613 1992294400 4194304 9342243 548682068736 18446744073709551615 8223232 0 0 4096 0 0 0 0 17 1 0 0
/proc/1975/statm: 2663 1614 376 1256 0 1402 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 10652

[startup+0.10166 s]
/proc/loadavg: 0.94 0.99 0.99 3/64 1975
/proc/meminfo: memFree=899240/2055920 swapFree=4192812/4192956
[pid=1975] ppid=1973 vsize=23352 CPUtime=0.09
/proc/1975/stat : 1975 (pbscip.linux.x8) R 1973 1975 428 0 -1 4194304 5021 0 0 0 8 1 0 0 16 0 1 0 180331725 23912448 4651 1992294400 4194304 9342243 548682068736 18446744073709551615 4702624 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1975/statm: 5838 4651 497 1256 0 4577 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 23352

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

Child status: 0
Real time (s): 0.199344
CPU time (s): 0.198969
CPU user time (s): 0.170974
CPU system time (s): 0.027995
CPU usage (%): 99.8119
Max. virtual memory (cumulated for all children) (KiB): 23352

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

runsolver used 0.002999 second user time and 0.007998 second system time

The end

Launcher Data 

Begin job on node11 at 2009-06-16 06:41:51
IDJOB=1868533
IDBENCH=1433
IDSOLVER=684
FILE ID=node11/1868533-1245127311
PBS_JOBID= 9363661
Free space on /tmp= 66196 MiB

SOLVER NAME= SCIPclp SCIP 1.1.0.7 with CLP 1.8.2
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/FPGA_SAT05/normalized-chnl40_50_pb.cnf.cr.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t TIMEOUT -m MEMLIMIT -f BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-1868533-1245127311/watcher-1868533-1245127311 -o /tmp/evaluation-result-1868533-1245127311/solver-1868533-1245127311 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1868533-1245127311.opb

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

MD5SUM BENCH= fe9566a2c8ff9ee542e29a30eb3c6e16
RANDOM SEED=830964427

node11.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.234
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.234
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:        899784 kB
Buffers:         59868 kB
Cached:        1014124 kB
SwapCached:          0 kB
Active:          97144 kB
Inactive:       990300 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:        899784 kB
SwapTotal:     4192956 kB
SwapFree:      4192812 kB
Dirty:           11800 kB
Writeback:           0 kB
Mapped:          23244 kB
Slab:            54656 kB
Committed_AS:   170604 kB
PageTables:       1452 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= 66184 MiB
End job on node11 at 2009-06-16 06:41:51